src/csolver.cc

   1 #include "csolver.h"
   2 #include "set.h"
   3 #include "mutableset.h"
   4 #include "element.h"
   5 #include "boolean.h"
   6 #include "predicate.h"
   7 #include "order.h"
   8 #include "table.h"
   9 #include "function.h"
  10 #include "satencoder.h"
  11 #include "sattranslator.h"
  12 #include "tunable.h"
  13 #include "polarityassignment.h"
  14 #include "decomposeordertransform.h"
  15 #include "autotuner.h"
  16 #include "astops.h"
  17 #include "structs.h"
  18 #include "orderresolver.h"
  19 #include "integerencoding.h"
  20 #include "qsort.h"
  21 #include "preprocess.h"
  22 #include "serializer.h"
  23 #include "deserializer.h"
  24 #include "encodinggraph.h"
  25 #include "ordergraph.h"
  26 #include "orderedge.h"
  27 #include "orderanalysis.h"
  28 #include "elementopt.h"
  29 #include "varorderingopt.h"
  30 #include <time.h>
  31 #include <stdarg.h>
  32 #include "alloyinterpreter.h"
  33 #include "smtinterpreter.h"
  34 #include "mathsatinterpreter.h"
  35 #include "smtratinterpreter.h"
  36
  37 CSolver::CSolver() :
  38         boolTrue(BooleanEdge(new BooleanConst(true))),
  39         boolFalse(boolTrue.negate()),
  40         unsat(false),
  41         booleanVarUsed(false),
  42         tuner(NULL),
  43         elapsedTime(0),
  44         satsolverTimeout(NOTIMEOUT),
  45         interpreter(NULL)
  46 {
  47         satEncoder = new SATEncoder(this);
  48 }
  49
  50 /** This function tears down the solver and the entire AST */
  51
  52 CSolver::~CSolver() {
  53         //serialize();
  54         uint size = allBooleans.getSize();
  55         for (uint i = 0; i < size; i++) {
  56                 delete allBooleans.get(i);
  57         }
  58
  59         size = allSets.getSize();
  60         for (uint i = 0; i < size; i++) {
  61                 delete allSets.get(i);
  62         }
  63
  64         size = allElements.getSize();
  65         for (uint i = 0; i < size; i++) {
  66                 Element *el = allElements.get(i);
  67                 delete el;
  68         }
  69
  70         size = allTables.getSize();
  71         for (uint i = 0; i < size; i++) {
  72                 delete allTables.get(i);
  73         }
  74
  75         size = allPredicates.getSize();
  76         for (uint i = 0; i < size; i++) {
  77                 delete allPredicates.get(i);
  78         }
  79
  80         size = allOrders.getSize();
  81         for (uint i = 0; i < size; i++) {
  82                 delete allOrders.get(i);
  83         }
  84         size = allFunctions.getSize();
  85         for (uint i = 0; i < size; i++) {
  86                 delete allFunctions.get(i);
  87         }
  88
  89         if (interpreter != NULL) {
  90                 delete interpreter;
  91         }
  92
  93         delete boolTrue.getBoolean();
  94         delete satEncoder;
  95 }
  96
  97 void CSolver::resetSolver() {
  98         //serialize();
  99         uint size = allBooleans.getSize();
 100         for (uint i = 0; i < size; i++) {
 101                 delete allBooleans.get(i);
 102         }
 103
 104         size = allSets.getSize();
 105         for (uint i = 0; i < size; i++) {
 106                 delete allSets.get(i);
 107         }
 108
 109         size = allElements.getSize();
 110         for (uint i = 0; i < size; i++) {
 111                 Element *el = allElements.get(i);
 112                 delete el;
 113         }
 114
 115         size = allTables.getSize();
 116         for (uint i = 0; i < size; i++) {
 117                 delete allTables.get(i);
 118         }
 119
 120         size = allPredicates.getSize();
 121         for (uint i = 0; i < size; i++) {
 122                 delete allPredicates.get(i);
 123         }
 124
 125         size = allOrders.getSize();
 126         for (uint i = 0; i < size; i++) {
 127                 delete allOrders.get(i);
 128         }
 129         size = allFunctions.getSize();
 130         for (uint i = 0; i < size; i++) {
 131                 delete allFunctions.get(i);
 132         }
 133         delete boolTrue.getBoolean();
 134         allBooleans.clear();
 135         allSets.clear();
 136         allElements.clear();
 137         allTables.clear();
 138         allPredicates.clear();
 139         allOrders.clear();
 140         allFunctions.clear();
 141         constraints.reset();
 142         activeOrders.reset();
 143         boolMap.reset();
 144         elemMap.reset();
 145
 146         boolTrue = BooleanEdge(new BooleanConst(true));
 147         boolFalse = boolTrue.negate();
 148         unsat = false;
 149         booleanVarUsed = false;
 150         elapsedTime = 0;
 151         tuner = NULL;
 152         satEncoder->resetSATEncoder();
 153
 154 }
 155
 156 CSolver *CSolver::clone() {
 157         CSolver *copy = new CSolver();
 158         CloneMap map;
 159         SetIteratorBooleanEdge *it = getConstraints();
 160         while (it->hasNext()) {
 161                 BooleanEdge b = it->next();
 162                 copy->addConstraint(cloneEdge(copy, &map, b));
 163         }
 164         delete it;
 165         return copy;
 166 }
 167
 168 CSolver *CSolver::deserialize(const char *file, InterpreterType itype) {
 169         model_print("deserializing %s ...\n", file);
 170         Deserializer deserializer(file, itype);
 171         return deserializer.deserialize();
 172 }
 173
 174 void CSolver::serialize() {
 175         model_print("serializing ...\n");
 176         char buffer[255];
 177         long long nanotime = getTimeNano();
 178         int numchars = sprintf(buffer, "DUMP%llu", nanotime);
 179         Serializer serializer(buffer);
 180         SetIteratorBooleanEdge *it = getConstraints();
 181         while (it->hasNext()) {
 182                 BooleanEdge b = it->next();
 183                 serializeBooleanEdge(&serializer, b, true);
 184         }
 185         delete it;
 186 }
 187
 188 Set *CSolver::createSet(VarType type, uint64_t *elements, uint numelements) {
 189         Set *set = new Set(type, elements, numelements);
 190         allSets.push(set);
 191         return set;
 192 }
 193
 194 Set *CSolver::createRangeSet(VarType type, uint64_t lowrange, uint64_t highrange) {
 195         Set *set = new Set(type, lowrange, highrange);
 196         allSets.push(set);
 197         return set;
 198 }
 199
 200 bool CSolver::itemExistInSet(Set *set, uint64_t item) {
 201         return set->exists(item);
 202 }
 203
 204 VarType CSolver::getSetVarType(Set *set) {
 205         return set->getType();
 206 }
 207
 208 Element *CSolver::createRangeVar(VarType type, uint64_t lowrange, uint64_t highrange) {
 209         Set *s = createRangeSet(type, lowrange, highrange);
 210         return getElementVar(s);
 211 }
 212
 213 MutableSet *CSolver::createMutableSet(VarType type) {
 214         MutableSet *set = new MutableSet(type);
 215         allSets.push(set);
 216         return set;
 217 }
 218
 219 void CSolver::addItem(MutableSet *set, uint64_t element) {
 220         set->addElementMSet(element);
 221 }
 222
 223 uint64_t CSolver::createUniqueItem(MutableSet *set) {
 224         uint64_t element = set->getNewUniqueItem();
 225         set->addElementMSet(element);
 226         return element;
 227 }
 228
 229 void CSolver::finalizeMutableSet(MutableSet *set) {
 230         set->finalize();
 231 }
 232
 233 Element *CSolver::getElementVar(Set *set) {
 234         Element *element = new ElementSet(set);
 235         allElements.push(element);
 236         return element;
 237 }
 238
 239 void CSolver::mustHaveValue(Element *element) {
 240         element->anyValue = true;
 241 }
 242
 243 Set *CSolver::getElementRange (Element *element) {
 244         return element->getRange();
 245 }
 246
 247
 248 Element *CSolver::getElementConst(VarType type, uint64_t value) {
 249         uint64_t array[] = {value};
 250         Set *set = new Set(type, array, 1);
 251         Element *element = new ElementConst(value, set);
 252         Element *e = elemMap.get(element);
 253         if (e == NULL) {
 254                 allSets.push(set);
 255                 allElements.push(element);
 256                 elemMap.put(element, element);
 257                 return element;
 258         } else {
 259                 delete set;
 260                 delete element;
 261                 return e;
 262         }
 263 }
 264
 265
 266 Element *CSolver::applyFunction(Function *function, Element **array, uint numArrays, BooleanEdge overflowstatus) {
 267         ASSERT(numArrays == 2);
 268         Element *element = new ElementFunction(function,array,numArrays,overflowstatus);
 269         Element *e = elemMap.get(element);
 270         if (e == NULL) {
 271                 element->updateParents();
 272                 allElements.push(element);
 273                 elemMap.put(element, element);
 274                 return element;
 275         } else {
 276                 delete element;
 277                 return e;
 278         }
 279 }
 280
 281 Function *CSolver::createFunctionOperator(ArithOp op, Set *range, OverFlowBehavior overflowbehavior) {
 282         Function *function = new FunctionOperator(op, range, overflowbehavior);
 283         allFunctions.push(function);
 284         return function;
 285 }
 286
 287 Predicate *CSolver::createPredicateOperator(CompOp op) {
 288         Predicate *predicate = new PredicateOperator(op);
 289         allPredicates.push(predicate);
 290         return predicate;
 291 }
 292
 293 Predicate *CSolver::createPredicateTable(Table *table, UndefinedBehavior behavior) {
 294         Predicate *predicate = new PredicateTable(table, behavior);
 295         allPredicates.push(predicate);
 296         return predicate;
 297 }
 298
 299 Table *CSolver::createTable(Set *range) {
 300         Table *table = new Table(range);
 301         allTables.push(table);
 302         return table;
 303 }
 304
 305 Table *CSolver::createTableForPredicate() {
 306         return createTable(NULL);
 307 }
 308
 309 void CSolver::addTableEntry(Table *table, uint64_t *inputs, uint inputSize, uint64_t result) {
 310         table->addNewTableEntry(inputs, inputSize, result);
 311 }
 312
 313 Function *CSolver::completeTable(Table *table, UndefinedBehavior behavior) {
 314         Function *function = new FunctionTable(table, behavior);
 315         allFunctions.push(function);
 316         return function;
 317 }
 318
 319 BooleanEdge CSolver::getBooleanVar(VarType type) {
 320         Boolean *boolean = new BooleanVar(type);
 321         allBooleans.push(boolean);
 322         if (!booleanVarUsed)
 323                 booleanVarUsed = true;
 324         return BooleanEdge(boolean);
 325 }
 326
 327 BooleanEdge CSolver::getBooleanTrue() {
 328         return boolTrue;
 329 }
 330
 331 BooleanEdge CSolver::getBooleanFalse() {
 332         return boolFalse;
 333 }
 334
 335 BooleanEdge CSolver::applyPredicate(Predicate *predicate, Element **inputs, uint numInputs) {
 336         return applyPredicateTable(predicate, inputs, numInputs, BooleanEdge(NULL));
 337 }
 338
 339 BooleanEdge CSolver::applyPredicateTable(Predicate *predicate, Element **inputs, uint numInputs, BooleanEdge undefinedStatus) {
 340         BooleanPredicate *boolean = new BooleanPredicate(predicate, inputs, numInputs, undefinedStatus);
 341         Boolean *b = boolMap.get(boolean);
 342         if (b == NULL) {
 343                 boolean->updateParents();
 344                 boolMap.put(boolean, boolean);
 345                 allBooleans.push(boolean);
 346                 return BooleanEdge(boolean);
 347         } else {
 348                 delete boolean;
 349                 return BooleanEdge(b);
 350         }
 351 }
 352
 353 bool CSolver::isTrue(BooleanEdge b) {
 354         return b.isNegated() ? b->isFalse() : b->isTrue();
 355 }
 356
 357 bool CSolver::isFalse(BooleanEdge b) {
 358         return b.isNegated() ? b->isTrue() : b->isFalse();
 359 }
 360
 361 BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge arg1, BooleanEdge arg2) {
 362         BooleanEdge array[] = {arg1, arg2};
 363         return applyLogicalOperation(op, array, 2);
 364 }
 365
 366 BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge arg) {
 367         BooleanEdge array[] = {arg};
 368         return applyLogicalOperation(op, array, 1);
 369 }
 370
 371 static int booleanEdgeCompares(const void *p1, const void *p2) {
 372         BooleanEdge be1 = *(BooleanEdge const *) p1;
 373         BooleanEdge be2 = *(BooleanEdge const *) p2;
 374         uint64_t b1 = be1->id;
 375         uint64_t b2 = be2->id;
 376         if (b1 < b2)
 377                 return -1;
 378         else if (b1 == b2)
 379                 return 0;
 380         else
 381                 return 1;
 382 }
 383
 384 BooleanEdge CSolver::rewriteLogicalOperation(LogicOp op, BooleanEdge *array, uint asize) {
 385         BooleanEdge newarray[asize];
 386         memcpy(newarray, array, asize * sizeof(BooleanEdge));
 387         for (uint i = 0; i < asize; i++) {
 388                 BooleanEdge b = newarray[i];
 389                 if (b->type == LOGICOP) {
 390                         if (((BooleanLogic *) b.getBoolean())->replaced) {
 391                                 newarray[i] = doRewrite(newarray[i]);
 392                                 i--;//Check again
 393                         }
 394                 }
 395         }
 396         return applyLogicalOperation(op, newarray, asize);
 397 }
 398
 399 BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge *array, uint asize) {
 400         if (!useInterpreter()) {
 401                 BooleanEdge newarray[asize];
 402                 switch (op) {
 403                 case SATC_NOT: {
 404                         return array[0].negate();
 405                 }
 406                 case SATC_IFF: {
 407                         for (uint i = 0; i < 2; i++) {
 408                                 if (isTrue(array[i])) { // It can be undefined
 409                                         return array[1 - i];
 410                                 } else if (isFalse(array[i])) {
 411                                         newarray[0] = array[1 - i];
 412                                         return applyLogicalOperation(SATC_NOT, newarray, 1);
 413                                 } else if (array[i]->type == LOGICOP) {
 414                                         BooleanLogic *b = (BooleanLogic *)array[i].getBoolean();
 415                                         if (b->replaced) {
 416                                                 return rewriteLogicalOperation(op, array, asize);
 417                                         }
 418                                 }
 419                         }
 420                         break;
 421                 }
 422                 case SATC_OR: {
 423                         for (uint i = 0; i < asize; i++) {
 424                                 newarray[i] = applyLogicalOperation(SATC_NOT, array[i]);
 425                         }
 426                         return applyLogicalOperation(SATC_NOT, applyLogicalOperation(SATC_AND, newarray, asize));
 427                 }
 428                 case SATC_AND: {
 429                         uint newindex = 0;
 430                         for (uint i = 0; i < asize; i++) {
 431                                 BooleanEdge b = array[i];
 432                                 if (b->type == LOGICOP) {
 433                                         if (((BooleanLogic *)b.getBoolean())->replaced)
 434                                                 return rewriteLogicalOperation(op, array, asize);
 435                                 }
 436                                 if (isTrue(b))
 437                                         continue;
 438                                 else if (isFalse(b)) {
 439                                         return boolFalse;
 440                                 } else
 441                                         newarray[newindex++] = b;
 442                         }
 443                         if (newindex == 0) {
 444                                 return boolTrue;
 445                         } else if (newindex == 1) {
 446                                 return newarray[0];
 447                         } else {
 448                                 bsdqsort(newarray, newindex, sizeof(BooleanEdge), booleanEdgeCompares);
 449                                 array = newarray;
 450                                 asize = newindex;
 451                         }
 452                         break;
 453                 }
 454                 case SATC_XOR: {
 455                         //handle by translation
 456                         return applyLogicalOperation(SATC_NOT, applyLogicalOperation(SATC_IFF, array, asize));
 457                 }
 458                 case SATC_IMPLIES: {
 459                         //handle by translation
 460                         return applyLogicalOperation(SATC_OR, applyLogicalOperation(SATC_NOT, array[0]), array[1]);
 461                 }
 462                 }
 463
 464                 ASSERT(asize != 0);
 465                 Boolean *boolean = new BooleanLogic(this, op, array, asize);
 466                 Boolean *b = boolMap.get(boolean);
 467                 if (b == NULL) {
 468                         boolean->updateParents();
 469                         boolMap.put(boolean, boolean);
 470                         allBooleans.push(boolean);
 471                         return BooleanEdge(boolean);
 472                 } else {
 473                         delete boolean;
 474                         return BooleanEdge(b);
 475                 }
 476         } else {
 477                 ASSERT(asize != 0);
 478                 Boolean *boolean = new BooleanLogic(this, op, array, asize);
 479                 allBooleans.push(boolean);
 480                 return BooleanEdge(boolean);
 481
 482         }
 483 }
 484
 485 BooleanEdge CSolver::orderConstraint(Order *order, uint64_t first, uint64_t second) {
 486         //      ASSERT(first != second);
 487         if (first == second)
 488                 return getBooleanFalse();
 489
 490         bool negate = false;
 491         if (order->type == SATC_TOTAL) {
 492                 if (first > second) {
 493                         uint64_t tmp = first;
 494                         first = second;
 495                         second = tmp;
 496                         negate = true;
 497                 }
 498         }
 499         Boolean *constraint = new BooleanOrder(order, first, second);
 500         if (!useInterpreter() ) {
 501                 Boolean *b = boolMap.get(constraint);
 502
 503                 if (b == NULL) {
 504                         allBooleans.push(constraint);
 505                         boolMap.put(constraint, constraint);
 506                         constraint->updateParents();
 507                         if ( order->graph != NULL) {
 508                                 OrderGraph *graph = order->graph;
 509                                 OrderNode *from = graph->lookupOrderNodeFromOrderGraph(first);
 510                                 if (from != NULL) {
 511                                         OrderNode *to = graph->lookupOrderNodeFromOrderGraph(second);
 512                                         if (to != NULL) {
 513                                                 OrderEdge *edge = graph->lookupOrderEdgeFromOrderGraph(from, to);
 514                                                 OrderEdge *invedge;
 515
 516                                                 if (edge != NULL && edge->mustPos) {
 517                                                         replaceBooleanWithTrueNoRemove(constraint);
 518                                                 } else if (edge != NULL && edge->mustNeg) {
 519                                                         replaceBooleanWithFalseNoRemove(constraint);
 520                                                 } else if ((invedge = graph->lookupOrderEdgeFromOrderGraph(to, from)) != NULL
 521                                                                                          && invedge->mustPos) {
 522                                                         replaceBooleanWithFalseNoRemove(constraint);
 523                                                 }
 524                                         }
 525                                 }
 526                         }
 527                 } else {
 528                         delete constraint;
 529                         constraint = b;
 530                 }
 531         }
 532         BooleanEdge be = BooleanEdge(constraint);
 533         return negate ? be.negate() : be;
 534 }
 535
 536 void CSolver::addConstraint(BooleanEdge constraint) {
 537         if (!useInterpreter()) {
 538                 if (isTrue(constraint))
 539                         return;
 540                 else if (isFalse(constraint)) {
 541                         setUnSAT();
 542                 }
 543                 else {
 544                         if (constraint->type == LOGICOP) {
 545                                 BooleanLogic *b = (BooleanLogic *) constraint.getBoolean();
 546                                 if (!constraint.isNegated()) {
 547                                         if (b->op == SATC_AND) {
 548                                                 uint size = b->inputs.getSize();
 549                                                 //Handle potential concurrent modification
 550                                                 BooleanEdge array[size];
 551                                                 for (uint i = 0; i < size; i++) {
 552                                                         array[i] = b->inputs.get(i);
 553                                                 }
 554                                                 for (uint i = 0; i < size; i++) {
 555                                                         addConstraint(array[i]);
 556                                                 }
 557                                                 return;
 558                                         }
 559                                 }
 560                                 if (b->replaced) {
 561                                         addConstraint(doRewrite(constraint));
 562                                         return;
 563                                 }
 564                         }
 565                         constraints.add(constraint);
 566                         Boolean *ptr = constraint.getBoolean();
 567
 568                         if (ptr->boolVal == BV_UNSAT) {
 569                                 setUnSAT();
 570                         }
 571
 572                         replaceBooleanWithTrueNoRemove(constraint);
 573                         constraint->parents.clear();
 574                 }
 575         } else {
 576                 constraints.add(constraint);
 577                 constraint->parents.clear();
 578         }
 579 }
 580
 581 Order *CSolver::createOrder(OrderType type, Set *set) {
 582         Order *order = new Order(type, set);
 583         allOrders.push(order);
 584         activeOrders.add(order);
 585         return order;
 586 }
 587
 588 /** Computes static ordering information to allow isTrue/isFalse
 589     queries on newly created orders to work. */
 590
 591 void CSolver::inferFixedOrder(Order *order) {
 592         if (order->graph != NULL) {
 593                 delete order->graph;
 594         }
 595         order->graph = buildMustOrderGraph(order);
 596         reachMustAnalysis(this, order->graph, true);
 597 }
 598
 599 void CSolver::inferFixedOrders() {
 600         SetIteratorOrder *orderit = activeOrders.iterator();
 601         while (orderit->hasNext()) {
 602                 Order *order = orderit->next();
 603                 inferFixedOrder(order);
 604         }
 605 }
 606
 607 int CSolver::solve() {
 608         if (isUnSAT()) {
 609                 return IS_UNSAT;
 610         }
 611         long long startTime = getTimeNano();
 612         bool deleteTuner = false;
 613         if (tuner == NULL) {
 614                 tuner = new DefaultTuner();
 615                 deleteTuner = true;
 616         }
 617         int result = IS_INDETER;
 618         if (useInterpreter()) {
 619                 interpreter->encode();
 620                 model_print("Problem encoded in Interpreter\n");
 621                 result = interpreter->solve();
 622                 model_print("Problem solved by Interpreter\n");
 623         } else {
 624
 625                 {
 626                         SetIteratorOrder *orderit = activeOrders.iterator();
 627                         while (orderit->hasNext()) {
 628                                 Order *order = orderit->next();
 629                                 if (order->graph != NULL) {
 630                                         delete order->graph;
 631                                         order->graph = NULL;
 632                                 }
 633                         }
 634                         delete orderit;
 635                 }
 636                 computePolarities(this);
 637                 long long time1 = getTimeNano();
 638                 model_print("Polarity time: %f\n", (time1 - startTime) / NANOSEC);
 639                 Preprocess pp(this);
 640                 pp.doTransform();
 641                 long long time2 = getTimeNano();
 642                 model_print("Preprocess time: %f\n", (time2 - time1) / NANOSEC);
 643
 644                 DecomposeOrderTransform dot(this);
 645                 dot.doTransform();
 646                 time1 = getTimeNano();
 647                 model_print("Decompose Order: %f\n", (time1 - time2) / NANOSEC);
 648
 649                 IntegerEncodingTransform iet(this);
 650                 iet.doTransform();
 651
 652                 ElementOpt eop(this);
 653                 eop.doTransform();
 654
 655                 EncodingGraph eg(this);
 656                 eg.encode();
 657
 658                 naiveEncodingDecision(this);
 659                 //      eg.validate();
 660
 661                 VarOrderingOpt bor(this, satEncoder);
 662                 bor.doTransform();
 663
 664                 time2 = getTimeNano();
 665                 model_print("Encoding Graph Time: %f\n", (time2 - time1) / NANOSEC);
 666
 667                 satEncoder->encodeAllSATEncoder(this);
 668                 time1 = getTimeNano();
 669
 670                 model_print("Elapse Encode time: %f\n", (time1 - startTime) / NANOSEC);
 671
 672                 model_print("Is problem UNSAT after encoding: %d\n", unsat);
 673
 674
 675                 result = unsat ? IS_UNSAT : satEncoder->solve(satsolverTimeout);
 676                 model_print("Result Computed in SAT solver:\t%s\n", result == IS_SAT ? "SAT" : result == IS_INDETER ? "INDETERMINATE" : " UNSAT");
 677                 time2 = getTimeNano();
 678                 elapsedTime = time2 - startTime;
 679                 model_print("CSOLVER solve time: %f\n", elapsedTime / NANOSEC);
 680         }
 681         if (deleteTuner) {
 682                 delete tuner;
 683                 tuner = NULL;
 684         }
 685         return result;
 686 }
 687
 688 void CSolver::setInterpreter(InterpreterType type) {
 689         if (interpreter == NULL) {
 690                 switch (type) {
 691                 case SATUNE:
 692                         break;
 693                 case ALLOY: {
 694                         interpreter = new AlloyInterpreter(this);
 695                         break;
 696                 } case Z3: {
 697                         interpreter = new SMTInterpreter(this);
 698                         break;
 699                 }
 700                 case MATHSAT: {
 701                         interpreter = new MathSATInterpreter(this);
 702                         break;
 703                 }
 704                 case SMTRAT: {
 705                         interpreter = new SMTRatInterpreter(this);
 706                         break;
 707                 }
 708                 default:
 709                         ASSERT(0);
 710                 }
 711         }
 712 }
 713
 714 void CSolver::printConstraints() {
 715         SetIteratorBooleanEdge *it = getConstraints();
 716         while (it->hasNext()) {
 717                 BooleanEdge b = it->next();
 718                 b.print();
 719         }
 720         delete it;
 721 }
 722
 723 void CSolver::printConstraint(BooleanEdge b) {
 724         b.print();
 725 }
 726
 727 uint64_t CSolver::getElementValue(Element *element) {
 728         switch (element->type) {
 729         case ELEMSET:
 730         case ELEMCONST:
 731         case ELEMFUNCRETURN:
 732                 return useInterpreter() ? interpreter->getValue(element) :
 733                                          getElementValueSATTranslator(this, element);
 734         default:
 735                 ASSERT(0);
 736         }
 737         exit(-1);
 738 }
 739
 740 bool CSolver::getBooleanValue(BooleanEdge bedge) {
 741         Boolean *boolean = bedge.getBoolean();
 742         switch (boolean->type) {
 743         case BOOLEANVAR:
 744                 return useInterpreter() ? interpreter->getBooleanValue(boolean) :
 745                                          getBooleanVariableValueSATTranslator(this, boolean);
 746         default:
 747                 ASSERT(0);
 748         }
 749         exit(-1);
 750 }
 751
 752 bool CSolver::getOrderConstraintValue(Order *order, uint64_t first, uint64_t second) {
 753         return order->encoding.resolver->resolveOrder(first, second);
 754 }
 755
 756 long long CSolver::getEncodeTime() { return satEncoder->getEncodeTime(); }
 757
 758 long long CSolver::getSolveTime() { return satEncoder->getSolveTime(); }
 759
 760 void CSolver::autoTune(uint budget) {
 761         AutoTuner *autotuner = new AutoTuner(budget);
 762         autotuner->addProblem(this);
 763         autotuner->tune();
 764         delete autotuner;
 765 }
 766
 767