1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
|
/********************* */
/*! \file sets_translate.cpp
** \verbatim
** Original author: Kshitij Bansal
** Major contributors: none
** Minor contributors (to current version): none
** This file is part of the CVC4 project.
** Copyright (c) 2009-2014 New York University and The University of Iowa
** See the file COPYING in the top-level source directory for licensing
** information.\endverbatim
**
** \brief [[ Add one-line brief description here ]]
**
** [[ Add lengthier description here ]]
** \todo document this file
**/
#include <boost/algorithm/string.hpp> // include Boost, a C++ library
#include <cassert>
#include <iostream>
#include <string>
#include <typeinfo>
#include <vector>
#include "expr/expr.h"
#include "options/options.h"
#include "parser/parser.h"
#include "parser/parser_builder.h"
#include "smt_util/command.h"
#include "theory/logic_info.h"
using namespace std;
using namespace CVC4;
using namespace CVC4::parser;
using namespace CVC4::options;
bool nonsense(char c) { return !isalnum(c); }
#ifdef ENABLE_AXIOMS
const bool enableAxioms = true;
#else
const bool enableAxioms = false;
#endif
string setaxioms[] = {
"(declare-fun memberHOLDA (HOLDB (Set HOLDB)) Bool)",
"",
"(declare-fun unionHOLDA ((Set HOLDB) (Set HOLDB)) (Set HOLDB))",
"(assert (forall ((?X (Set HOLDB)) (?Y (Set HOLDB)) (?x HOLDB))",
" (= (memberHOLDA ?x (unionHOLDA ?X ?Y))",
" (or (memberHOLDA ?x ?X) (memberHOLDA ?x ?Y))",
" ) ) )",
"",
"",
"(declare-fun intersectionHOLDA ((Set HOLDB) (Set HOLDB)) (Set HOLDB))",
"(assert (forall ((?X (Set HOLDB)) (?Y (Set HOLDB)) (?x HOLDB))",
" (= (memberHOLDA ?x (intersectionHOLDA ?X ?Y))",
" (and (memberHOLDA ?x ?X) (memberHOLDA ?x ?Y))",
" ) ) )",
"",
"(declare-fun setminusHOLDA ((Set HOLDB) (Set HOLDB)) (Set HOLDB))",
"(assert (forall ((?X (Set HOLDB)) (?Y (Set HOLDB)) (?x HOLDB))",
" (= (memberHOLDA ?x (setminusHOLDA ?X ?Y))",
" (and (memberHOLDA ?x ?X) (not (memberHOLDA ?x ?Y)))",
" ) ) )",
"",
"(declare-fun singletonHOLDA (HOLDB) (Set HOLDB))",
"(assert (forall ((?x HOLDB) (?y HOLDB))",
" (= (memberHOLDA ?x (singletonHOLDA ?y))",
" (= ?x ?y)",
" ) ) )",
"",
"(declare-fun emptysetHOLDA () (Set HOLDB))",
"(assert (forall ((?x HOLDB)) (not (memberHOLDA ?x emptysetHOLDA)) ) )",
"",
"(define-fun subsetHOLDA ((X (Set HOLDB)) (Y (Set HOLDB))) Bool (= (unionHOLDA X Y) Y))",
""
};
class Mapper {
set< Type > setTypes;
map< Type, Type > mapTypes;
map< pair<Type, Kind>, Expr > setoperators;
hash_map< Expr, Expr, ExprHashFunction > substitutions;
ostringstream sout;
ExprManager* em;
int depth;
Expr add(SetType t, Expr e) {
if(setTypes.find(t) == setTypes.end() ) {
// mark as processed
setTypes.insert(t);
Type elementType = t.getElementType();
ostringstream oss_type;
oss_type << Expr::setlanguage(language::output::LANG_SMTLIB_V2)
<< elementType;
string elementTypeAsString = oss_type.str();
elementTypeAsString.erase(
remove_if(elementTypeAsString.begin(), elementTypeAsString.end(), nonsense),
elementTypeAsString.end());
// define-sort
ostringstream oss_name;
oss_name << Expr::setlanguage(language::output::LANG_SMTLIB_V2)
<< "(Set " << elementType << ")";
string name = oss_name.str();
Type newt = em->mkArrayType(t.getElementType(), em->booleanType());
mapTypes[t] = newt;
// diffent types
vector<Type> t_t;
t_t.push_back(t);
t_t.push_back(t);
vector<Type> elet_t;
elet_t.push_back(elementType);
elet_t.push_back(t);
if(!enableAxioms)
sout << "(define-fun emptyset" << elementTypeAsString << " "
<< " ()"
<< " " << name
<< " ( (as const " << name << ") false ) )" << endl;
setoperators[ make_pair(t, kind::EMPTYSET) ] =
em->mkVar( std::string("emptyset") + elementTypeAsString,
t);
if(!enableAxioms)
sout << "(define-fun singleton" << elementTypeAsString << " "
<< " ( (x " << elementType << ") )"
<< " " << name << ""
<< " (store emptyset" << elementTypeAsString << " x true) )" << endl;
setoperators[ make_pair(t, kind::SINGLETON) ] =
em->mkVar( std::string("singleton") + elementTypeAsString,
em->mkFunctionType( elementType, t ) );
if(!enableAxioms)
sout << "(define-fun union" << elementTypeAsString << " "
<< " ( (s1 " << name << ") (s2 " << name << ") )"
<< " " << name << ""
<< " ((_ map or) s1 s2))" << endl;
setoperators[ make_pair(t, kind::UNION) ] =
em->mkVar( std::string("union") + elementTypeAsString,
em->mkFunctionType( t_t, t ) );
if(!enableAxioms)
sout << "(define-fun intersection" << elementTypeAsString << ""
<< " ( (s1 " << name << ") (s2 " << name << ") )"
<< " " << name << ""
<< " ((_ map and) s1 s2))" << endl;
setoperators[ make_pair(t, kind::INTERSECTION) ] =
em->mkVar( std::string("intersection") + elementTypeAsString,
em->mkFunctionType( t_t, t ) );
if(!enableAxioms)
sout << "(define-fun setminus" << elementTypeAsString << " "
<< " ( (s1 " << name << ") (s2 " << name << ") )"
<< " " << name << ""
<< " (intersection" << elementTypeAsString << " s1 ((_ map not) s2)))" << endl;
setoperators[ make_pair(t, kind::SETMINUS) ] =
em->mkVar( std::string("setminus") + elementTypeAsString,
em->mkFunctionType( t_t, t ) );
if(!enableAxioms)
sout << "(define-fun member" << elementTypeAsString << " "
<< " ( (x " << elementType << ")" << " (s " << name << "))"
<< " Bool"
<< " (select s x) )" << endl;
setoperators[ make_pair(t, kind::MEMBER) ] =
em->mkVar( std::string("member") + elementTypeAsString,
em->mkPredicateType( elet_t ) );
if(!enableAxioms)
sout << "(define-fun subset" << elementTypeAsString << " "
<< " ( (s1 " << name << ") (s2 " << name << ") )"
<< " Bool"
<<" (= emptyset" << elementTypeAsString << " (setminus" << elementTypeAsString << " s1 s2)) )" << endl;
setoperators[ make_pair(t, kind::SUBSET) ] =
em->mkVar( std::string("subset") + elementTypeAsString,
em->mkPredicateType( t_t ) );
if(enableAxioms) {
int N = sizeof(setaxioms) / sizeof(setaxioms[0]);
for(int i = 0; i < N; ++i) {
string s = setaxioms[i];
ostringstream oss; oss << Expr::setlanguage(language::output::LANG_SMTLIB_V2) << elementType;
boost::replace_all(s, "HOLDA", elementTypeAsString);
boost::replace_all(s, "HOLDB", oss.str());
if( s == "" ) continue;
sout << s << endl;
}
}
}
Expr ret;
if(e.getKind() == kind::EMPTYSET) {
ret = setoperators[ make_pair(t, e.getKind()) ];
} else {
vector<Expr> children = e.getChildren();
children.insert(children.begin(), setoperators[ make_pair(t, e.getKind()) ]);
ret = em->mkExpr(kind::APPLY, children);
}
// cout << "returning " << ret << endl;
return ret;
}
public:
Mapper(ExprManager* e) : em(e),depth(0) {
sout << Expr::setlanguage(language::output::LANG_SMTLIB_V2);
}
void defineSetSort() {
if(setTypes.empty()) {
cout << "(define-sort Set (X) (Array X Bool) )" << endl;
}
}
Expr collectSortsExpr(Expr e)
{
if(substitutions.find(e) != substitutions.end()) {
return substitutions[e];
}
++depth;
Expr old_e = e;
for(unsigned i = 0; i < e.getNumChildren(); ++i) {
collectSortsExpr(e[i]);
}
e = e.substitute(substitutions);
// cout << "[debug] " << e << " " << e.getKind() << " " << theory::kindToTheoryId(e.getKind()) << endl;
if(theory::kindToTheoryId(e.getKind()) == theory::THEORY_SETS) {
SetType t = SetType(e.getType().isBoolean() ? e[1].getType() : e.getType());
substitutions[e] = add(t, e);
e = e.substitute(substitutions);
}
substitutions[old_e] = e;
// cout << ";"; for(int i = 0; i < depth; ++i) cout << " "; cout << old_e << " => " << e << endl;
--depth;
return e;
}
void dump() {
cout << sout.str();
}
};
int main(int argc, char* argv[])
{
try {
// Get the filename
string input;
if(argc > 1) input = string(argv[1]);
else input = "<stdin>";
// Create the expression manager
Options options;
options.set(inputLanguage, language::input::LANG_SMTLIB_V2);
cout << Expr::setlanguage(language::output::LANG_SMTLIB_V2);
// cout << Expr::dag(0);
ExprManager exprManager(options);
Mapper m(&exprManager);
// Create the parser
ParserBuilder parserBuilder(&exprManager, input, options);
if(input == "<stdin>") parserBuilder.withStreamInput(cin);
Parser* parser = parserBuilder.build();
// Variables and assertions
vector<string> variables;
vector<string> info_tags;
vector<string> info_data;
vector<Expr> assertions;
Command* cmd = NULL;
CommandSequence commandsSequence;
bool logicisset = false;
while ((cmd = parser->nextCommand())) {
// till logic is set, don't do any modifications
if(!parser->logicIsSet()) {
cout << (*cmd) << endl;
delete cmd;
continue;
}
// transform set-logic command, if there is one
SetBenchmarkLogicCommand* setlogic = dynamic_cast<SetBenchmarkLogicCommand*>(cmd);
if(setlogic) {
LogicInfo logicinfo(setlogic->getLogic());
if(!logicinfo.isTheoryEnabled(theory::THEORY_SETS)) {
cerr << "Sets theory not enabled. Stopping translation." << endl;
return 0;
}
logicinfo = logicinfo.getUnlockedCopy();
if(enableAxioms) {
logicinfo.enableQuantifiers();
logicinfo.lock();
if(!logicinfo.hasEverything()) {
(logicinfo = logicinfo.getUnlockedCopy()).disableTheory(theory::THEORY_SETS);
logicinfo.lock();
cout << SetBenchmarkLogicCommand(logicinfo.getLogicString()) << endl;
}
} else {
logicinfo.enableTheory(theory::THEORY_ARRAY);
// we print logic string only for Quantifiers, for Z3 stuff
// we don't set the logic
}
delete cmd;
continue;
}
// if we reach here, logic is set by now, so can define our sort
if( !logicisset ) {
logicisset = true;
m.defineSetSort();
}
// declare/define-sort commands are printed immediately
DeclareTypeCommand* declaresort = dynamic_cast<DeclareTypeCommand*>(cmd);
DefineTypeCommand* definesort = dynamic_cast<DefineTypeCommand*>(cmd);
if(declaresort || definesort) {
cout << *cmd << endl;
delete cmd;
continue;
}
// other commands are queued up, while replacing with new function symbols
AssertCommand* assert = dynamic_cast<AssertCommand*>(cmd);
DeclareFunctionCommand* declarefun = dynamic_cast<DeclareFunctionCommand*>(cmd);
DefineFunctionCommand* definefun = dynamic_cast<DefineFunctionCommand*>(cmd);
Command* new_cmd = NULL;
if(assert) {
Expr newexpr = m.collectSortsExpr(assert->getExpr());
new_cmd = new AssertCommand(newexpr);
} else if(declarefun) {
Expr newfunc = m.collectSortsExpr(declarefun->getFunction());
new_cmd = new DeclareFunctionCommand(declarefun->getSymbol(), newfunc, declarefun->getType());
} else if(definefun) {
Expr newfunc = m.collectSortsExpr(definefun->getFunction());
Expr newformula = m.collectSortsExpr(definefun->getFormula());
new_cmd = new DefineFunctionCommand(definefun->getSymbol(), newfunc, definefun->getFormals(), newformula);
}
if(new_cmd == NULL) {
commandsSequence.addCommand(cmd);
} else {
commandsSequence.addCommand(new_cmd);
delete cmd;
}
}
m.dump();
cout << commandsSequence;
// Get rid of the parser
//delete parser;
} catch (Exception& e) {
cerr << e << endl;
}
}
|