X-Git-Url: http://plrg.eecs.uci.edu/git/?a=blobdiff_plain;f=src%2Fcsolver.cc;h=a8ffc492c156064cb6fdb693b7084b76c737d478;hb=e0ee8656d201f77504bd239612969ce43636c324;hp=4f26bde7a295d3292482ff4451f5f985414d23ae;hpb=1c230147d56620693852796e1f23ad4c31a55fd5;p=satune.git

diff --git a/src/csolver.cc b/src/csolver.cc
index 4f26bde..a8ffc49 100644
--- a/src/csolver.cc
+++ b/src/csolver.cc
@@ -11,16 +11,40 @@
 #include "sattranslator.h"
 #include "tunable.h"
 #include "polarityassignment.h"
-#include "orderdecompose.h"
-
-CSolver::CSolver() : unsat(false) {
-	tuner = new Tuner();
-	satEncoder = allocSATEncoder(this);
+#include "decomposeordertransform.h"
+#include "autotuner.h"
+#include "astops.h"
+#include "structs.h"
+#include "orderresolver.h"
+#include "integerencoding.h"
+#include "qsort.h"
+#include "preprocess.h"
+#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),
+	tuner(NULL),
+	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);
@@ -33,7 +57,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();
@@ -50,14 +75,103 @@ 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);
+	}
+
+	delete boolTrue.getBoolean();
+	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;
+	SetIteratorBooleanEdge *it = getConstraints();
+	while (it->hasNext()) {
+		BooleanEdge b = it->next();
+		copy->addConstraint(cloneEdge(copy, &map, b));
+	}
+	delete it;
+	return copy;
+}
+
+CSolver *CSolver::deserialize(const char *file) {
+	model_print("deserializing %s ...\n", file);
+	Deserializer deserializer(file);
+	return deserializer.deserialize();
+}
 
-	deleteSATEncoder(satEncoder);
-	delete tuner;
+void CSolver::serialize() {
+	model_print("serializing ...\n");
+	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) {
@@ -72,6 +186,19 @@ 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();
+}
+
+Element *CSolver::createRangeVar(VarType type, uint64_t lowrange, uint64_t highrange) {
+	Set *s = createRangeSet(type, lowrange, highrange);
+	return getElementVar(s);
+}
+
 MutableSet *CSolver::createMutableSet(VarType type) {
 	MutableSet *set = new MutableSet(type);
 	allSets.push(set);
@@ -83,37 +210,71 @@ void CSolver::addItem(MutableSet *set, uint64_t element) {
 }
 
 uint64_t CSolver::createUniqueItem(MutableSet *set) {
-	uint64_t element = set->low++;
+	uint64_t element = set->getNewUniqueItem();
 	set->addElementMSet(element);
 	return element;
 }
 
+void CSolver::finalizeMutableSet(MutableSet *set) {
+	set->finalize();
+}
+
 Element *CSolver::getElementVar(Set *set) {
 	Element *element = new ElementSet(set);
 	allElements.push(element);
 	return element;
 }
 
+void CSolver::mustHaveValue(Element *element) {
+	element->anyValue = true;
+}
+
+Set *CSolver::getElementRange (Element *element) {
+	return element->getRange();
+}
+
+
 Element *CSolver::getElementConst(VarType type, uint64_t value) {
-	Element *element = new ElementConst(value, type);
-	allElements.push(element);
-	return element;
+	uint64_t array[] = {value};
+	Set *set = new Set(type, array, 1);
+	Element *element = new ElementConst(value, set);
+	Element *e = elemMap.get(element);
+	if (e == NULL) {
+		allSets.push(set);
+		allElements.push(element);
+		elemMap.put(element, element);
+		return element;
+	} else {
+		delete set;
+		delete element;
+		return e;
+	}
 }
 
-Boolean *CSolver::getBooleanVar(VarType type) {
-	Boolean *boolean = new BooleanVar(type);
-	allBooleans.push(boolean);
-	return boolean;
+
+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) {
+		element->updateParents();
+		allElements.push(element);
+		elemMap.put(element, element);
+		return element;
+	} else {
+		delete element;
+		return e;
+	}
 }
 
-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;
 }
@@ -124,14 +285,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) {
@@ -144,58 +305,363 @@ Function *CSolver::completeTable(Table *table, UndefinedBehavior behavior) {
 	return function;
 }
 
-Element *CSolver::applyFunction(Function *function, Element **array, uint numArrays, Boolean *overflowstatus) {
-	Element *element = new ElementFunction(function,array,numArrays,overflowstatus);
-	allElements.push(element);
-	return element;
+BooleanEdge CSolver::getBooleanVar(VarType type) {
+	Boolean *boolean = new BooleanVar(type);
+	allBooleans.push(boolean);
+	return BooleanEdge(boolean);
 }
 
-Boolean *CSolver::applyPredicate(Predicate *predicate, Element **inputs, uint numInputs) {
-	return applyPredicateTable(predicate, inputs, numInputs, NULL);
+BooleanEdge CSolver::getBooleanTrue() {
+	return boolTrue;
 }
 
-Boolean *CSolver::applyPredicateTable(Predicate *predicate, Element **inputs, uint numInputs, Boolean *undefinedStatus) {
+BooleanEdge CSolver::getBooleanFalse() {
+	return boolFalse;
+}
+
+BooleanEdge CSolver::applyPredicate(Predicate *predicate, Element **inputs, uint numInputs) {
+	return applyPredicateTable(predicate, inputs, numInputs, BooleanEdge(NULL));
+}
+
+BooleanEdge CSolver::applyPredicateTable(Predicate *predicate, Element **inputs, uint numInputs, BooleanEdge undefinedStatus) {
 	BooleanPredicate *boolean = new BooleanPredicate(predicate, inputs, numInputs, undefinedStatus);
-	allBooleans.push(boolean);
-	return boolean;
+	Boolean *b = boolMap.get(boolean);
+	if (b == NULL) {
+		boolean->updateParents();
+		boolMap.put(boolean, boolean);
+		allBooleans.push(boolean);
+		return BooleanEdge(boolean);
+	} else {
+		delete boolean;
+		return BooleanEdge(b);
+	}
+}
+
+bool CSolver::isTrue(BooleanEdge b) {
+	return b.isNegated() ? b->isFalse() : b->isTrue();
+}
+
+bool CSolver::isFalse(BooleanEdge b) {
+	return b.isNegated() ? b->isTrue() : b->isFalse();
+}
+
+BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge arg1, BooleanEdge arg2) {
+	BooleanEdge array[] = {arg1, arg2};
+	return applyLogicalOperation(op, array, 2);
 }
 
-Boolean *CSolver::applyLogicalOperation(LogicOp op, Boolean **array, uint asize) {
-	return new BooleanLogic(this, op, array, asize);
+BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge arg) {
+	BooleanEdge array[] = {arg};
+	return applyLogicalOperation(op, array, 1);
 }
 
-void CSolver::addConstraint(Boolean *constraint) {
-	constraints.add(constraint);
+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)
+		return 0;
+	else
+		return 1;
+}
+
+BooleanEdge CSolver::rewriteLogicalOperation(LogicOp op, BooleanEdge *array, uint asize) {
+	BooleanEdge newarray[asize];
+	memcpy(newarray, array, asize * sizeof(BooleanEdge));
+	for (uint i = 0; i < asize; i++) {
+		BooleanEdge b = newarray[i];
+		if (b->type == LOGICOP) {
+			if (((BooleanLogic *) b.getBoolean())->replaced) {
+				newarray[i] = doRewrite(newarray[i]);
+				i--;//Check again
+			}
+		}
+	}
+	return applyLogicalOperation(op, newarray, asize);
+}
+
+BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge *array, uint asize) {
+	BooleanEdge newarray[asize];
+	switch (op) {
+	case SATC_NOT: {
+		return array[0].negate();
+	}
+	case SATC_IFF: {
+		for (uint i = 0; i < 2; i++) {
+			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) {
+					return rewriteLogicalOperation(op, array, asize);
+				}
+			}
+		}
+		break;
+	}
+	case SATC_OR: {
+		for (uint i = 0; i < asize; i++) {
+			newarray[i] = applyLogicalOperation(SATC_NOT, array[i]);
+		}
+		return applyLogicalOperation(SATC_NOT, applyLogicalOperation(SATC_AND, newarray, asize));
+	}
+	case SATC_AND: {
+		uint newindex = 0;
+		for (uint i = 0; i < asize; i++) {
+			BooleanEdge b = array[i];
+			if (b->type == LOGICOP) {
+				if (((BooleanLogic *)b.getBoolean())->replaced)
+					return rewriteLogicalOperation(op, array, asize);
+			}
+			if (isTrue(b))
+				continue;
+			else if (isFalse(b)) {
+				return boolFalse;
+			} else
+				newarray[newindex++] = b;
+		}
+		if (newindex == 0) {
+			return boolTrue;
+		} else if (newindex == 1) {
+			return newarray[0];
+		} else {
+			bsdqsort(newarray, newindex, sizeof(BooleanEdge), booleanEdgeCompares);
+			array = newarray;
+			asize = newindex;
+		}
+		break;
+	}
+	case SATC_XOR: {
+		//handle by translation
+		return applyLogicalOperation(SATC_NOT, applyLogicalOperation(SATC_IFF, array, asize));
+	}
+	case SATC_IMPLIES: {
+		//handle by translation
+		return applyLogicalOperation(SATC_OR, applyLogicalOperation(SATC_NOT, array[0]), array[1]);
+	}
+	}
+
+	ASSERT(asize != 0);
+	Boolean *boolean = new BooleanLogic(this, op, array, asize);
+	Boolean *b = boolMap.get(boolean);
+	if (b == NULL) {
+		boolean->updateParents();
+		boolMap.put(boolean, boolean);
+		allBooleans.push(boolean);
+		return BooleanEdge(boolean);
+	} else {
+		delete boolean;
+		return BooleanEdge(b);
+	}
+}
+
+BooleanEdge CSolver::orderConstraint(Order *order, uint64_t first, uint64_t second) {
+	//	ASSERT(first != second);
+	if (first == second)
+		return getBooleanFalse();
+
+	bool negate = false;
+	if (order->type == SATC_TOTAL) {
+		if (first > second) {
+			uint64_t tmp = first;
+			first = second;
+			second = tmp;
+			negate = true;
+		}
+	}
+	Boolean *constraint = new BooleanOrder(order, first, second);
+	Boolean *b = boolMap.get(constraint);
+
+	if (b == NULL) {
+		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;
+	}
+
+	BooleanEdge be = BooleanEdge(constraint);
+	return negate ? be.negate() : be;
+}
+
+void CSolver::addConstraint(BooleanEdge constraint) {
+	if (isTrue(constraint))
+		return;
+	else if (isFalse(constraint)) {
+		setUnSAT();
+	}
+	else {
+		if (constraint->type == LOGICOP) {
+			BooleanLogic *b = (BooleanLogic *) constraint.getBoolean();
+			if (!constraint.isNegated()) {
+				if (b->op == SATC_AND) {
+					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;
+				}
+			}
+			if (b->replaced) {
+				addConstraint(doRewrite(constraint));
+				return;
+			}
+		}
+		constraints.add(constraint);
+		Boolean *ptr = constraint.getBoolean();
+
+		if (ptr->boolVal == BV_UNSAT) {
+			setUnSAT();
+		}
+
+		replaceBooleanWithTrueNoRemove(constraint);
+		constraint->parents.clear();
+	}
 }
 
 Order *CSolver::createOrder(OrderType type, Set *set) {
 	Order *order = new Order(type, set);
 	allOrders.push(order);
+	activeOrders.add(order);
 	return order;
 }
 
-Boolean *CSolver::orderConstraint(Order *order, uint64_t first, uint64_t second) {
-	Boolean *constraint = new BooleanOrder(order, first, second);
-	allBooleans.push(constraint);
-	return constraint;
+/** 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::startEncoding() {
+#define NANOSEC 1000000000.0
+int CSolver::solve() {
+	long long startTime = getTimeNano();
+	bool deleteTuner = false;
+	if (tuner == NULL) {
+		tuner = new DefaultTuner();
+		deleteTuner = true;
+	}
+
+
+	{
+		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);
-	orderAnalysis(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.encode();
+
 	naiveEncodingDecision(this);
-	encodeAllSATEncoder(this, satEncoder);
-	int result = solveCNF(satEncoder->cnf);
-	model_print("sat_solver's result:%d\tsolutionSize=%d\n", result, satEncoder->cnf->solver->solutionsize);
-	for (int i = 1; i <= satEncoder->cnf->solver->solutionsize; i++) {
-		model_print("%d, ", satEncoder->cnf->solver->solution[i]);
+//	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(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;
 	}
-	model_print("\n");
 	return result;
 }
 
+void CSolver::printConstraints() {
+	SetIteratorBooleanEdge *it = getConstraints();
+	while (it->hasNext()) {
+		BooleanEdge b = it->next();
+		b.print();
+	}
+	delete it;
+}
+
+void CSolver::printConstraint(BooleanEdge b) {
+	b.print();
+}
+
 uint64_t CSolver::getElementValue(Element *element) {
-	switch (GETELEMENTTYPE(element)) {
+	switch (element->type) {
 	case ELEMSET:
 	case ELEMCONST:
 	case ELEMFUNCRETURN:
@@ -206,8 +672,9 @@ uint64_t CSolver::getElementValue(Element *element) {
 	exit(-1);
 }
 
-bool CSolver::getBooleanValue(Boolean *boolean) {
-	switch (GETBOOLEANTYPE(boolean)) {
+bool CSolver::getBooleanValue(BooleanEdge bedge) {
+	Boolean *boolean = bedge.getBoolean();
+	switch (boolean->type) {
 	case BOOLEANVAR:
 		return getBooleanVariableValueSATTranslator(this, boolean);
 	default:
@@ -216,7 +683,19 @@ bool CSolver::getBooleanValue(Boolean *boolean) {
 	exit(-1);
 }
 
-HappenedBefore CSolver::getOrderConstraintValue(Order *order, uint64_t first, uint64_t second) {
-	return getOrderConstraintValueSATTranslator(this, order, first, second);
+bool CSolver::getOrderConstraintValue(Order *order, uint64_t first, uint64_t second) {
+	return order->encoding.resolver->resolveOrder(first, second);
+}
+
+long long CSolver::getEncodeTime() { return satEncoder->getEncodeTime(); }
+
+long long CSolver::getSolveTime() { return satEncoder->getSolveTime(); }
+
+void CSolver::autoTune(uint budget) {
+	AutoTuner *autotuner = new AutoTuner(budget);
+	autotuner->addProblem(this);
+	autotuner->tune();
+	delete autotuner;
 }
 
+