#include "serializer.h"
#include "deserializer.h"
#include "encodinggraph.h"
+#include "ordergraph.h"
+#include "orderedge.h"
+#include "orderanalysis.h"
+#include "elementopt.h"
+#include "varorderingopt.h"
#include <time.h>
+#include <stdarg.h>
CSolver::CSolver() :
boolTrue(BooleanEdge(new BooleanConst(true))),
boolFalse(boolTrue.negate()),
unsat(false),
+ booleanVarUsed(false),
tuner(NULL),
- elapsedTime(0)
+ elapsedTime(0),
+ satsolverTimeout(NOTIMEOUT)
{
satEncoder = new SATEncoder(this);
}
/** 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);
size = allElements.getSize();
for (uint i = 0; i < size; i++) {
- Element* el = allElements.get(i);
+ Element *el = allElements.get(i);
delete el;
}
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;
+ booleanVarUsed = false;
+ elapsedTime = 0;
+ tuner = NULL;
+ satEncoder->resetSATEncoder();
+
+}
+
CSolver *CSolver::clone() {
CSolver *copy = new CSolver();
CloneMap map;
return copy;
}
-CSolver* CSolver::deserialize(const char * file){
- model_print("deserializing ...\n");
+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");
char buffer[255];
- struct timespec t;
- clock_gettime(CLOCK_REALTIME, &t);
-
- unsigned long long nanotime=t.tv_sec*1000000000+t.tv_nsec;
- int numchars=sprintf(buffer, "DUMP%llu", nanotime);
+ long long nanotime = getTimeNano();
+ int numchars = sprintf(buffer, "DUMP%llu", nanotime);
Serializer serializer(buffer);
SetIteratorBooleanEdge *it = getConstraints();
while (it->hasNext()) {
return set;
}
+bool CSolver::itemExistInSet(Set *set, uint64_t item) {
+ return set->exists(item);
+}
+
VarType CSolver::getSetVarType(Set *set) {
return set->getType();
}
return element;
}
+void CSolver::mustHaveValue(Element *element) {
+ element->anyValue = true;
+}
+
Set *CSolver::getElementRange (Element *element) {
return element->getRange();
}
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) {
}
}
-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;
}
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) {
BooleanEdge CSolver::getBooleanVar(VarType type) {
Boolean *boolean = new BooleanVar(type);
allBooleans.push(boolean);
+ if(!booleanVarUsed)
+ booleanVarUsed = true;
return BooleanEdge(boolean);
}
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)
} else if (newindex == 1) {
return newarray[0];
} else {
- bsdqsort(newarray, newindex, sizeof(BooleanEdge), ptrcompares);
+ bsdqsort(newarray, newindex, sizeof(BooleanEdge), booleanEdgeCompares);
array = newarray;
asize = newindex;
}
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;
if (isTrue(constraint))
return;
else if (isFalse(constraint)) {
- int t = 0;
setUnSAT();
}
else {
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;
}
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);
+ }
+}
+
int CSolver::solve() {
+ long long startTime = getTimeNano();
bool deleteTuner = false;
if (tuner == NULL) {
tuner = new DefaultTuner();
deleteTuner = true;
}
- serialize();
-
- 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();
+
+ VarOrderingOpt bor(this, satEncoder);
+ bor.doTransform();
+
+ 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;
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) {
- if (b.isNegated())
- model_print("!");
- b->print();
- model_print("\n");
+ b.print();
}
uint64_t CSolver::getElementValue(Element *element) {
autotuner->tune();
delete autotuner;
}
+
+
projects / satune.git / blobdiff