X-Git-Url: http://plrg.eecs.uci.edu/git/?p=satune.git;a=blobdiff_plain;f=src%2Fcsolver.cc;h=9f374cc00df78fc08ac6c7097f0e78aaa4b12b2d;hp=756798b6297b510884c5fc6d2e6a93c40aa57c23;hb=9eb16333c26996a97567f88d0f2e62e72eb9a9e6;hpb=52bb7ec21876cab449bbe9f14e0d28f623d46af5 diff --git a/src/csolver.cc b/src/csolver.cc index 756798b..9f374cc 100644 --- a/src/csolver.cc +++ b/src/csolver.cc @@ -22,13 +22,20 @@ #include "serializer.h" #include "deserializer.h" #include "encodinggraph.h" +#include "ordergraph.h" +#include "orderedge.h" +#include "orderanalysis.h" +#include "elementopt.h" +#include +#include CSolver::CSolver() : boolTrue(BooleanEdge(new BooleanConst(true))), boolFalse(boolTrue.negate()), unsat(false), tuner(NULL), - elapsedTime(0) + elapsedTime(0), + satsolverTimeout(NOTIMEOUT) { satEncoder = new SATEncoder(this); } @@ -36,6 +43,7 @@ CSolver::CSolver() : /** This function tears down the solver and the entire AST */ CSolver::~CSolver() { + //serialize(); uint size = allBooleans.getSize(); for (uint i = 0; i < size; i++) { delete allBooleans.get(i); @@ -48,7 +56,8 @@ CSolver::~CSolver() { size = allElements.getSize(); for (uint i = 0; i < size; i++) { - delete allElements.get(i); + Element *el = allElements.get(i); + delete el; } size = allTables.getSize(); @@ -65,7 +74,6 @@ CSolver::~CSolver() { for (uint i = 0; i < size; i++) { delete allOrders.get(i); } - size = allFunctions.getSize(); for (uint i = 0; i < size; i++) { delete allFunctions.get(i); @@ -75,6 +83,64 @@ CSolver::~CSolver() { delete satEncoder; } +void CSolver::resetSolver() { + //serialize(); + uint size = allBooleans.getSize(); + for (uint i = 0; i < size; i++) { + delete allBooleans.get(i); + } + + size = allSets.getSize(); + for (uint i = 0; i < size; i++) { + delete allSets.get(i); + } + + size = allElements.getSize(); + for (uint i = 0; i < size; i++) { + Element *el = allElements.get(i); + delete el; + } + + size = allTables.getSize(); + for (uint i = 0; i < size; i++) { + delete allTables.get(i); + } + + size = allPredicates.getSize(); + for (uint i = 0; i < size; i++) { + delete allPredicates.get(i); + } + + size = allOrders.getSize(); + for (uint i = 0; i < size; i++) { + delete allOrders.get(i); + } + size = allFunctions.getSize(); + for (uint i = 0; i < size; i++) { + delete allFunctions.get(i); + } + delete boolTrue.getBoolean(); + allBooleans.clear(); + allSets.clear(); + allElements.clear(); + allTables.clear(); + allPredicates.clear(); + allOrders.clear(); + allFunctions.clear(); + constraints.reset(); + activeOrders.reset(); + boolMap.reset(); + elemMap.reset(); + + boolTrue = BooleanEdge(new BooleanConst(true)); + boolFalse = boolTrue.negate(); + unsat = false; + elapsedTime = 0; + tuner = NULL; + satEncoder->resetSATEncoder(); + +} + CSolver *CSolver::clone() { CSolver *copy = new CSolver(); CloneMap map; @@ -87,23 +153,24 @@ CSolver *CSolver::clone() { return copy; } +CSolver *CSolver::deserialize(const char *file) { + model_print("deserializing %s ...\n", file); + Deserializer deserializer(file); + return deserializer.deserialize(); +} + void CSolver::serialize() { model_print("serializing ...\n"); - { - Serializer serializer("dump"); - SetIteratorBooleanEdge *it = getConstraints(); - while (it->hasNext()) { - BooleanEdge b = it->next(); - serializeBooleanEdge(&serializer, b); - } - delete it; - } - model_print("deserializing ...\n"); - { - Deserializer deserializer("dump"); - deserializer.deserialize(); + char buffer[255]; + long long nanotime = getTimeNano(); + int numchars = sprintf(buffer, "DUMP%llu", nanotime); + Serializer serializer(buffer); + SetIteratorBooleanEdge *it = getConstraints(); + while (it->hasNext()) { + BooleanEdge b = it->next(); + serializeBooleanEdge(&serializer, b, true); } - + delete it; } Set *CSolver::createSet(VarType type, uint64_t *elements, uint numelements) { @@ -118,6 +185,10 @@ Set *CSolver::createRangeSet(VarType type, uint64_t lowrange, uint64_t highrange return set; } +bool CSolver::itemExistInSet(Set *set, uint64_t item) { + return set->exists(item); +} + VarType CSolver::getSetVarType(Set *set) { return set->getType(); } @@ -153,6 +224,10 @@ Element *CSolver::getElementVar(Set *set) { return element; } +void CSolver::mustHaveValue(Element *element) { + element->anyValue = true; +} + Set *CSolver::getElementRange (Element *element) { return element->getRange(); } @@ -175,7 +250,9 @@ Element *CSolver::getElementConst(VarType type, uint64_t value) { } } + Element *CSolver::applyFunction(Function *function, Element **array, uint numArrays, BooleanEdge overflowstatus) { + ASSERT(numArrays == 2); Element *element = new ElementFunction(function,array,numArrays,overflowstatus); Element *e = elemMap.get(element); if (e == NULL) { @@ -189,14 +266,14 @@ Element *CSolver::applyFunction(Function *function, Element **array, uint numArr } } -Function *CSolver::createFunctionOperator(ArithOp op, Set **domain, uint numDomain, Set *range,OverFlowBehavior overflowbehavior) { - Function *function = new FunctionOperator(op, domain, numDomain, range, overflowbehavior); +Function *CSolver::createFunctionOperator(ArithOp op, Set *range, OverFlowBehavior overflowbehavior) { + Function *function = new FunctionOperator(op, range, overflowbehavior); allFunctions.push(function); return function; } -Predicate *CSolver::createPredicateOperator(CompOp op, Set **domain, uint numDomain) { - Predicate *predicate = new PredicateOperator(op, domain,numDomain); +Predicate *CSolver::createPredicateOperator(CompOp op) { + Predicate *predicate = new PredicateOperator(op); allPredicates.push(predicate); return predicate; } @@ -207,14 +284,14 @@ Predicate *CSolver::createPredicateTable(Table *table, UndefinedBehavior behavio return predicate; } -Table *CSolver::createTable(Set **domains, uint numDomain, Set *range) { - Table *table = new Table(domains,numDomain,range); +Table *CSolver::createTable(Set *range) { + Table *table = new Table(range); allTables.push(table); return table; } -Table *CSolver::createTableForPredicate(Set **domains, uint numDomain) { - return createTable(domains, numDomain, NULL); +Table *CSolver::createTableForPredicate() { + return createTable(NULL); } void CSolver::addTableEntry(Table *table, uint64_t *inputs, uint inputSize, uint64_t result) { @@ -277,9 +354,11 @@ BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge arg) { return applyLogicalOperation(op, array, 1); } -static int ptrcompares(const void *p1, const void *p2) { - uintptr_t b1 = *(uintptr_t const *) p1; - uintptr_t b2 = *(uintptr_t const *) p2; +static int booleanEdgeCompares(const void *p1, const void *p2) { + BooleanEdge be1 = *(BooleanEdge const *) p1; + BooleanEdge be2 = *(BooleanEdge const *) p2; + uint64_t b1 = be1->id; + uint64_t b2 = be2->id; if (b1 < b2) return -1; else if (b1 == b2) @@ -311,13 +390,11 @@ BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge *array, uint } case SATC_IFF: { for (uint i = 0; i < 2; i++) { - if (array[i]->type == BOOLCONST) { - if (isTrue(array[i])) { // It can be undefined - return array[1 - i]; - } else if (isFalse(array[i])) { - newarray[0] = array[1 - i]; - return applyLogicalOperation(SATC_NOT, newarray, 1); - } + if (isTrue(array[i])) { // It can be undefined + return array[1 - i]; + } else if (isFalse(array[i])) { + newarray[0] = array[1 - i]; + return applyLogicalOperation(SATC_NOT, newarray, 1); } else if (array[i]->type == LOGICOP) { BooleanLogic *b = (BooleanLogic *)array[i].getBoolean(); if (b->replaced) { @@ -341,12 +418,10 @@ BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge *array, uint if (((BooleanLogic *)b.getBoolean())->replaced) return rewriteLogicalOperation(op, array, asize); } - if (b->type == BOOLCONST) { - if (isTrue(b)) - continue; - else { - return boolFalse; - } + if (isTrue(b)) + continue; + else if (isFalse(b)) { + return boolFalse; } else newarray[newindex++] = b; } @@ -355,7 +430,7 @@ BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge *array, uint } else if (newindex == 1) { return newarray[0]; } else { - bsdqsort(newarray, newindex, sizeof(BooleanEdge), ptrcompares); + bsdqsort(newarray, newindex, sizeof(BooleanEdge), booleanEdgeCompares); array = newarray; asize = newindex; } @@ -386,7 +461,10 @@ BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge *array, uint } BooleanEdge CSolver::orderConstraint(Order *order, uint64_t first, uint64_t second) { - ASSERT(first != second); + // ASSERT(first != second); + if (first == second) + return getBooleanFalse(); + bool negate = false; if (order->type == SATC_TOTAL) { if (first > second) { @@ -403,6 +481,26 @@ BooleanEdge CSolver::orderConstraint(Order *order, uint64_t first, uint64_t seco allBooleans.push(constraint); boolMap.put(constraint, constraint); constraint->updateParents(); + if (order->graph != NULL) { + OrderGraph *graph = order->graph; + OrderNode *from = graph->lookupOrderNodeFromOrderGraph(first); + if (from != NULL) { + OrderNode *to = graph->lookupOrderNodeFromOrderGraph(second); + if (to != NULL) { + OrderEdge *edge = graph->lookupOrderEdgeFromOrderGraph(from, to); + OrderEdge *invedge; + + if (edge != NULL && edge->mustPos) { + replaceBooleanWithTrueNoRemove(constraint); + } else if (edge != NULL && edge->mustNeg) { + replaceBooleanWithFalseNoRemove(constraint); + } else if ((invedge = graph->lookupOrderEdgeFromOrderGraph(to, from)) != NULL + && invedge->mustPos) { + replaceBooleanWithFalseNoRemove(constraint); + } + } + } + } } else { delete constraint; constraint = b; @@ -416,7 +514,6 @@ void CSolver::addConstraint(BooleanEdge constraint) { if (isTrue(constraint)) return; else if (isFalse(constraint)) { - int t = 0; setUnSAT(); } else { @@ -424,8 +521,14 @@ void CSolver::addConstraint(BooleanEdge constraint) { BooleanLogic *b = (BooleanLogic *) constraint.getBoolean(); if (!constraint.isNegated()) { if (b->op == SATC_AND) { - for (uint i = 0; i < b->inputs.getSize(); i++) { - addConstraint(b->inputs.get(i)); + uint size = b->inputs.getSize(); + //Handle potential concurrent modification + BooleanEdge array[size]; + for (uint i = 0; i < size; i++) { + array[i] = b->inputs.get(i); + } + for (uint i = 0; i < size; i++) { + addConstraint(array[i]); } return; } @@ -454,36 +557,85 @@ Order *CSolver::createOrder(OrderType type, Set *set) { return order; } +/** Computes static ordering information to allow isTrue/isFalse + queries on newly created orders to work. */ + +void CSolver::inferFixedOrder(Order *order) { + if (order->graph != NULL) { + delete order->graph; + } + order->graph = buildMustOrderGraph(order); + reachMustAnalysis(this, order->graph, true); +} + +void CSolver::inferFixedOrders() { + SetIteratorOrder *orderit = activeOrders.iterator(); + while (orderit->hasNext()) { + Order *order = orderit->next(); + inferFixedOrder(order); + } +} + +#define NANOSEC 1000000000.0 int CSolver::solve() { + long long startTime = getTimeNano(); bool deleteTuner = false; if (tuner == NULL) { tuner = new DefaultTuner(); deleteTuner = true; } - long long startTime = getTimeNano(); - computePolarities(this); + { + SetIteratorOrder *orderit = activeOrders.iterator(); + while (orderit->hasNext()) { + Order *order = orderit->next(); + if (order->graph != NULL) { + delete order->graph; + order->graph = NULL; + } + } + delete orderit; + } + computePolarities(this); + long long time1 = getTimeNano(); + model_print("Polarity time: %f\n", (time1 - startTime) / NANOSEC); Preprocess pp(this); pp.doTransform(); + long long time2 = getTimeNano(); + model_print("Preprocess time: %f\n", (time2 - time1) / NANOSEC); DecomposeOrderTransform dot(this); dot.doTransform(); + time1 = getTimeNano(); + model_print("Decompose Order: %f\n", (time1 - time2) / NANOSEC); IntegerEncodingTransform iet(this); iet.doTransform(); + ElementOpt eop(this); + eop.doTransform(); + EncodingGraph eg(this); - eg.buildGraph(); eg.encode(); - printConstraints(); + naiveEncodingDecision(this); +// eg.validate(); + + time2 = getTimeNano(); + model_print("Encoding Graph Time: %f\n", (time2 - time1) / NANOSEC); + satEncoder->encodeAllSATEncoder(this); + time1 = getTimeNano(); + + model_print("Elapse Encode time: %f\n", (time1 - startTime) / NANOSEC); + model_print("Is problem UNSAT after encoding: %d\n", unsat); - int result = unsat ? IS_UNSAT : satEncoder->solve(); - model_print("Result Computed in CSolver: %d\n", result); - long long finishTime = getTimeNano(); - elapsedTime = finishTime - startTime; + int result = unsat ? IS_UNSAT : satEncoder->solve(satsolverTimeout); + model_print("Result Computed in SAT solver:\t%s\n", result == IS_SAT? "SAT" : result == IS_INDETER? "INDETERMINATE" : " UNSAT"); + time2 = getTimeNano(); + elapsedTime = time2 - startTime; + model_print("CSOLVER solve time: %f\n", elapsedTime / NANOSEC); if (deleteTuner) { delete tuner; tuner = NULL; @@ -495,13 +647,13 @@ void CSolver::printConstraints() { SetIteratorBooleanEdge *it = getConstraints(); while (it->hasNext()) { BooleanEdge b = it->next(); - if (b.isNegated()) - model_print("!"); - b->print(); - model_print("\n"); + b.print(); } delete it; +} +void CSolver::printConstraint(BooleanEdge b) { + b.print(); } uint64_t CSolver::getElementValue(Element *element) { @@ -541,3 +693,5 @@ void CSolver::autoTune(uint budget) { autotuner->tune(); delete autotuner; } + +