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         Element *element = new ElementFunction(function,array,numArrays,overflowstatus);
 268         Element *e = elemMap.get(element);
 269         if (e == NULL) {
 270                 element->updateParents();
 271                 allElements.push(element);
 272                 elemMap.put(element, element);
 273                 return element;
 274         } else {
 275                 delete element;
 276                 return e;
 277         }
 278 }
 279
 280 Function *CSolver::createFunctionOperator(ArithOp op, Set *range, OverFlowBehavior overflowbehavior) {
 281         Function *function = new FunctionOperator(op, range, overflowbehavior);
 282         allFunctions.push(function);
 283         return function;
 284 }
 285
 286 Predicate *CSolver::createPredicateOperator(CompOp op) {
 287         Predicate *predicate = new PredicateOperator(op);
 288         allPredicates.push(predicate);
 289         return predicate;
 290 }
 291
 292 Predicate *CSolver::createPredicateTable(Table *table, UndefinedBehavior behavior) {
 293         Predicate *predicate = new PredicateTable(table, behavior);
 294         allPredicates.push(predicate);
 295         return predicate;
 296 }
 297
 298 Table *CSolver::createTable(Set *range) {
 299         Table *table = new Table(range);
 300         allTables.push(table);
 301         return table;
 302 }
 303
 304 Table *CSolver::createTableForPredicate() {
 305         return createTable(NULL);
 306 }
 307
 308 void CSolver::addTableEntry(Table *table, uint64_t *inputs, uint inputSize, uint64_t result) {
 309         table->addNewTableEntry(inputs, inputSize, result);
 310 }
 311
 312 Function *CSolver::completeTable(Table *table, UndefinedBehavior behavior) {
 313         Function *function = new FunctionTable(table, behavior);
 314         allFunctions.push(function);
 315         return function;
 316 }
 317
 318 BooleanEdge CSolver::getBooleanVar(VarType type) {
 319         Boolean *boolean = new BooleanVar(type);
 320         allBooleans.push(boolean);
 321         if (!booleanVarUsed)
 322                 booleanVarUsed = true;
 323         return BooleanEdge(boolean);
 324 }
 325
 326 BooleanEdge CSolver::getBooleanTrue() {
 327         return boolTrue;
 328 }
 329
 330 BooleanEdge CSolver::getBooleanFalse() {
 331         return boolFalse;
 332 }
 333
 334 BooleanEdge CSolver::applyPredicate(Predicate *predicate, Element **inputs, uint numInputs) {
 335         return applyPredicateTable(predicate, inputs, numInputs, BooleanEdge(NULL));
 336 }
 337
 338 BooleanEdge CSolver::applyPredicateTable(Predicate *predicate, Element **inputs, uint numInputs, BooleanEdge undefinedStatus) {
 339         BooleanPredicate *boolean = new BooleanPredicate(predicate, inputs, numInputs, undefinedStatus);
 340         Boolean *b = boolMap.get(boolean);
 341         if (b == NULL) {
 342                 boolean->updateParents();
 343                 boolMap.put(boolean, boolean);
 344                 allBooleans.push(boolean);
 345                 return BooleanEdge(boolean);
 346         } else {
 347                 delete boolean;
 348                 return BooleanEdge(b);
 349         }
 350 }
 351
 352 bool CSolver::isTrue(BooleanEdge b) {
 353         return b.isNegated() ? b->isFalse() : b->isTrue();
 354 }
 355
 356 bool CSolver::isFalse(BooleanEdge b) {
 357         return b.isNegated() ? b->isTrue() : b->isFalse();
 358 }
 359
 360 BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge arg1, BooleanEdge arg2) {
 361         BooleanEdge array[] = {arg1, arg2};
 362         return applyLogicalOperation(op, array, 2);
 363 }
 364
 365 BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge arg) {
 366         BooleanEdge array[] = {arg};
 367         return applyLogicalOperation(op, array, 1);
 368 }
 369
 370 static int booleanEdgeCompares(const void *p1, const void *p2) {
 371         BooleanEdge be1 = *(BooleanEdge const *) p1;
 372         BooleanEdge be2 = *(BooleanEdge const *) p2;
 373         uint64_t b1 = be1->id;
 374         uint64_t b2 = be2->id;
 375         if (b1 < b2)
 376                 return -1;
 377         else if (b1 == b2)
 378                 return 0;
 379         else
 380                 return 1;
 381 }
 382
 383 BooleanEdge CSolver::rewriteLogicalOperation(LogicOp op, BooleanEdge *array, uint asize) {
 384         BooleanEdge newarray[asize];
 385         memcpy(newarray, array, asize * sizeof(BooleanEdge));
 386         for (uint i = 0; i < asize; i++) {
 387                 BooleanEdge b = newarray[i];
 388                 if (b->type == LOGICOP) {
 389                         if (((BooleanLogic *) b.getBoolean())->replaced) {
 390                                 newarray[i] = doRewrite(newarray[i]);
 391                                 i--;//Check again
 392                         }
 393                 }
 394         }
 395         return applyLogicalOperation(op, newarray, asize);
 396 }
 397
 398 BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge *array, uint asize) {
 399         if (!useInterpreter()) {
 400                 BooleanEdge newarray[asize];
 401                 switch (op) {
 402                 case SATC_NOT: {
 403                         return array[0].negate();
 404                 }
 405                 case SATC_IFF: {
 406                         for (uint i = 0; i < 2; i++) {
 407                                 if (isTrue(array[i])) { // It can be undefined
 408                                         return array[1 - i];
 409                                 } else if (isFalse(array[i])) {
 410                                         newarray[0] = array[1 - i];
 411                                         return applyLogicalOperation(SATC_NOT, newarray, 1);
 412                                 } else if (array[i]->type == LOGICOP) {
 413                                         BooleanLogic *b = (BooleanLogic *)array[i].getBoolean();
 414                                         if (b->replaced) {
 415                                                 return rewriteLogicalOperation(op, array, asize);
 416                                         }
 417                                 }
 418                         }
 419                         break;
 420                 }
 421                 case SATC_OR: {
 422                         for (uint i = 0; i < asize; i++) {
 423                                 newarray[i] = applyLogicalOperation(SATC_NOT, array[i]);
 424                         }
 425                         return applyLogicalOperation(SATC_NOT, applyLogicalOperation(SATC_AND, newarray, asize));
 426                 }
 427                 case SATC_AND: {
 428                         uint newindex = 0;
 429                         for (uint i = 0; i < asize; i++) {
 430                                 BooleanEdge b = array[i];
 431                                 if (b->type == LOGICOP) {
 432                                         if (((BooleanLogic *)b.getBoolean())->replaced)
 433                                                 return rewriteLogicalOperation(op, array, asize);
 434                                 }
 435                                 if (isTrue(b))
 436                                         continue;
 437                                 else if (isFalse(b)) {
 438                                         return boolFalse;
 439                                 } else
 440                                         newarray[newindex++] = b;
 441                         }
 442                         if (newindex == 0) {
 443                                 return boolTrue;
 444                         } else if (newindex == 1) {
 445                                 return newarray[0];
 446                         } else {
 447                                 bsdqsort(newarray, newindex, sizeof(BooleanEdge), booleanEdgeCompares);
 448                                 array = newarray;
 449                                 asize = newindex;
 450                         }
 451                         break;
 452                 }
 453                 case SATC_XOR: {
 454                         //handle by translation
 455                         return applyLogicalOperation(SATC_NOT, applyLogicalOperation(SATC_IFF, array, asize));
 456                 }
 457                 case SATC_IMPLIES: {
 458                         //handle by translation
 459                         return applyLogicalOperation(SATC_OR, applyLogicalOperation(SATC_NOT, array[0]), array[1]);
 460                 }
 461                 }
 462
 463                 ASSERT(asize != 0);
 464                 Boolean *boolean = new BooleanLogic(this, op, array, asize);
 465                 Boolean *b = boolMap.get(boolean);
 466                 if (b == NULL) {
 467                         boolean->updateParents();
 468                         boolMap.put(boolean, boolean);
 469                         allBooleans.push(boolean);
 470                         return BooleanEdge(boolean);
 471                 } else {
 472                         delete boolean;
 473                         return BooleanEdge(b);
 474                 }
 475         } else {
 476                 ASSERT(asize != 0);
 477                 Boolean *boolean = new BooleanLogic(this, op, array, asize);
 478                 allBooleans.push(boolean);
 479                 return BooleanEdge(boolean);
 480
 481         }
 482 }
 483
 484 BooleanEdge CSolver::orderConstraint(Order *order, uint64_t first, uint64_t second) {
 485         //      ASSERT(first != second);
 486         if (first == second)
 487                 return getBooleanFalse();
 488
 489         bool negate = false;
 490         if (order->type == SATC_TOTAL) {
 491                 if (first > second) {
 492                         uint64_t tmp = first;
 493                         first = second;
 494                         second = tmp;
 495                         negate = true;
 496                 }
 497         }
 498         Boolean *constraint = new BooleanOrder(order, first, second);
 499         if (!useInterpreter() ) {
 500                 Boolean *b = boolMap.get(constraint);
 501
 502                 if (b == NULL) {
 503                         allBooleans.push(constraint);
 504                         boolMap.put(constraint, constraint);
 505                         constraint->updateParents();
 506                         if ( order->graph != NULL) {
 507                                 OrderGraph *graph = order->graph;
 508                                 OrderNode *from = graph->lookupOrderNodeFromOrderGraph(first);
 509                                 if (from != NULL) {
 510                                         OrderNode *to = graph->lookupOrderNodeFromOrderGraph(second);
 511                                         if (to != NULL) {
 512                                                 OrderEdge *edge = graph->lookupOrderEdgeFromOrderGraph(from, to);
 513                                                 OrderEdge *invedge;
 514
 515                                                 if (edge != NULL && edge->mustPos) {
 516                                                         replaceBooleanWithTrueNoRemove(constraint);
 517                                                 } else if (edge != NULL && edge->mustNeg) {
 518                                                         replaceBooleanWithFalseNoRemove(constraint);
 519                                                 } else if ((invedge = graph->lookupOrderEdgeFromOrderGraph(to, from)) != NULL
 520                                                                                          && invedge->mustPos) {
 521                                                         replaceBooleanWithFalseNoRemove(constraint);
 522                                                 }
 523                                         }
 524                                 }
 525                         }
 526                 } else {
 527                         delete constraint;
 528                         constraint = b;
 529                 }
 530         }
 531         BooleanEdge be = BooleanEdge(constraint);
 532         return negate ? be.negate() : be;
 533 }
 534
 535 void CSolver::addConstraint(BooleanEdge constraint) {
 536         if (!useInterpreter()) {
 537                 if (isTrue(constraint))
 538                         return;
 539                 else if (isFalse(constraint)) {
 540                         setUnSAT();
 541                 }
 542                 else {
 543                         if (constraint->type == LOGICOP) {
 544                                 BooleanLogic *b = (BooleanLogic *) constraint.getBoolean();
 545                                 if (!constraint.isNegated()) {
 546                                         if (b->op == SATC_AND) {
 547                                                 uint size = b->inputs.getSize();
 548                                                 //Handle potential concurrent modification
 549                                                 BooleanEdge array[size];
 550                                                 for (uint i = 0; i < size; i++) {
 551                                                         array[i] = b->inputs.get(i);
 552                                                 }
 553                                                 for (uint i = 0; i < size; i++) {
 554                                                         addConstraint(array[i]);
 555                                                 }
 556                                                 return;
 557                                         }
 558                                 }
 559                                 if (b->replaced) {
 560                                         addConstraint(doRewrite(constraint));
 561                                         return;
 562                                 }
 563                         }
 564                         constraints.add(constraint);
 565                         Boolean *ptr = constraint.getBoolean();
 566
 567                         if (ptr->boolVal == BV_UNSAT) {
 568                                 setUnSAT();
 569                         }
 570
 571                         replaceBooleanWithTrueNoRemove(constraint);
 572                         constraint->parents.clear();
 573                 }
 574         } else {
 575                 constraints.add(constraint);
 576                 constraint->parents.clear();
 577         }
 578 }
 579
 580 Order *CSolver::createOrder(OrderType type, Set *set) {
 581         Order *order = new Order(type, set);
 582         allOrders.push(order);
 583         activeOrders.add(order);
 584         return order;
 585 }
 586
 587 /** Computes static ordering information to allow isTrue/isFalse
 588     queries on newly created orders to work. */
 589
 590 void CSolver::inferFixedOrder(Order *order) {
 591         if (order->graph != NULL) {
 592                 delete order->graph;
 593         }
 594         order->graph = buildMustOrderGraph(order);
 595         reachMustAnalysis(this, order->graph, true);
 596 }
 597
 598 void CSolver::inferFixedOrders() {
 599         SetIteratorOrder *orderit = activeOrders.iterator();
 600         while (orderit->hasNext()) {
 601                 Order *order = orderit->next();
 602                 inferFixedOrder(order);
 603         }
 604 }
 605
 606 int CSolver::solve() {
 607         if (isUnSAT()) {
 608                 return IS_UNSAT;
 609         }
 610         long long startTime = getTimeNano();
 611         bool deleteTuner = false;
 612         if (tuner == NULL) {
 613                 tuner = new DefaultTuner();
 614                 deleteTuner = true;
 615         }
 616         int result = IS_INDETER;
 617         if (useInterpreter()) {
 618                 interpreter->encode();
 619                 model_print("Problem encoded in Interpreter\n");
 620                 result = interpreter->solve();
 621                 model_print("Problem solved by Interpreter\n");
 622         } else {
 623
 624                 {
 625                         SetIteratorOrder *orderit = activeOrders.iterator();
 626                         while (orderit->hasNext()) {
 627                                 Order *order = orderit->next();
 628                                 if (order->graph != NULL) {
 629                                         delete order->graph;
 630                                         order->graph = NULL;
 631                                 }
 632                         }
 633                         delete orderit;
 634                 }
 635                 computePolarities(this);
 636                 long long time1 = getTimeNano();
 637                 model_print("Polarity time: %f\n", (time1 - startTime) / NANOSEC);
 638                 Preprocess pp(this);
 639                 pp.doTransform();
 640                 long long time2 = getTimeNano();
 641                 model_print("Preprocess time: %f\n", (time2 - time1) / NANOSEC);
 642
 643                 DecomposeOrderTransform dot(this);
 644                 dot.doTransform();
 645                 time1 = getTimeNano();
 646                 model_print("Decompose Order: %f\n", (time1 - time2) / NANOSEC);
 647
 648                 IntegerEncodingTransform iet(this);
 649                 iet.doTransform();
 650
 651                 ElementOpt eop(this);
 652                 eop.doTransform();
 653
 654                 EncodingGraph eg(this);
 655                 eg.encode();
 656
 657                 naiveEncodingDecision(this);
 658                 //      eg.validate();
 659
 660                 VarOrderingOpt bor(this, satEncoder);
 661                 bor.doTransform();
 662
 663                 time2 = getTimeNano();
 664                 model_print("Encoding Graph Time: %f\n", (time2 - time1) / NANOSEC);
 665
 666                 satEncoder->encodeAllSATEncoder(this);
 667                 time1 = getTimeNano();
 668
 669                 model_print("Elapse Encode time: %f\n", (time1 - startTime) / NANOSEC);
 670
 671                 model_print("Is problem UNSAT after encoding: %d\n", unsat);
 672
 673
 674                 result = unsat ? IS_UNSAT : satEncoder->solve(satsolverTimeout);
 675                 model_print("Result Computed in SAT solver:\t%s\n", result == IS_SAT ? "SAT" : result == IS_INDETER ? "INDETERMINATE" : " UNSAT");
 676                 time2 = getTimeNano();
 677                 elapsedTime = time2 - startTime;
 678                 model_print("CSOLVER solve time: %f\n", elapsedTime / NANOSEC);
 679         }
 680         if (deleteTuner) {
 681                 delete tuner;
 682                 tuner = NULL;
 683         }
 684         return result;
 685 }
 686
 687 void CSolver::setInterpreter(InterpreterType type) {
 688         if (interpreter == NULL) {
 689                 switch (type) {
 690                 case SATUNE:
 691                         break;
 692                 case ALLOY: {
 693                         interpreter = new AlloyInterpreter(this);
 694                         break;
 695                 } case Z3: {
 696                         interpreter = new SMTInterpreter(this);
 697                         break;
 698                 }
 699                 case MATHSAT: {
 700                         interpreter = new MathSATInterpreter(this);
 701                         break;
 702                 }
 703                 case SMTRAT: {
 704                         interpreter = new SMTRatInterpreter(this);
 705                         break;
 706                 }
 707                 default:
 708                         ASSERT(0);
 709                 }
 710         }
 711 }
 712
 713 void CSolver::printConstraints() {
 714         SetIteratorBooleanEdge *it = getConstraints();
 715         while (it->hasNext()) {
 716                 BooleanEdge b = it->next();
 717                 b.print();
 718         }
 719         delete it;
 720 }
 721
 722 void CSolver::printConstraint(BooleanEdge b) {
 723         b.print();
 724 }
 725
 726 uint64_t CSolver::getElementValue(Element *element) {
 727         switch (element->type) {
 728         case ELEMSET:
 729         case ELEMCONST:
 730         case ELEMFUNCRETURN:
 731                 return useInterpreter() ? interpreter->getValue(element) :
 732                                          getElementValueSATTranslator(this, element);
 733         default:
 734                 ASSERT(0);
 735         }
 736         exit(-1);
 737 }
 738
 739 bool CSolver::getBooleanValue(BooleanEdge bedge) {
 740         Boolean *boolean = bedge.getBoolean();
 741         switch (boolean->type) {
 742         case BOOLEANVAR:
 743                 return useInterpreter() ? interpreter->getBooleanValue(boolean) :
 744                                          getBooleanVariableValueSATTranslator(this, boolean);
 745         default:
 746                 ASSERT(0);
 747         }
 748         exit(-1);
 749 }
 750
 751 bool CSolver::getOrderConstraintValue(Order *order, uint64_t first, uint64_t second) {
 752         return order->encoding.resolver->resolveOrder(first, second);
 753 }
 754
 755 long long CSolver::getEncodeTime() { return satEncoder->getEncodeTime(); }
 756
 757 long long CSolver::getSolveTime() { return satEncoder->getSolveTime(); }
 758
 759 void CSolver::autoTune(uint budget) {
 760         AutoTuner *autotuner = new AutoTuner(budget);
 761         autotuner->addProblem(this);
 762         autotuner->tune();
 763         delete autotuner;
 764 }
 765
 766