class STP : boost::noncopyable
{
- ArrayTransformer * arrayTransformer;
+
ASTNode sizeReducing(ASTNode input, BVSolver* bvSolver, PropagateEqualities *pe);
public:
+ArrayTransformer * arrayTransformer;
+
// calls sizeReducing and the bitblasting simplification.
ASTNode callSizeReducing(ASTNode simplified_solved_InputToSAT, BVSolver* bvSolver, PropagateEqualities *pe, const int initial_difficulty_score);
#include "../to-sat/AIG/ToSATAIG.h"
#include "../sat/MinisatCore.h"
#include "../STPManager/STP.h"
-#include "../simplifier/BigRewriter.h"
+
using namespace std;
using namespace BEEV;
+bool finished = false;
+
extern int
smtparse(void*);
extern FILE *smtin;
mgr->UserFlags.stats_flag = false;
mgr->UserFlags.optimize_flag = true;
- ss = new MinisatCore<Minisat::Solver>();
+ ss = new MinisatCore<Minisat::Solver>(finished);
// Prime the cache with 100..
for (int i = 0; i < 100; i++)
clearSAT()
{
delete ss;
- ss = new MinisatCore<Minisat::Solver>();
+ ss = new MinisatCore<Minisat::Solver>(finished);
}
// Return true if the negation of the query is unsatisfiable.
{
SimplifyingNodeFactory nf(*(mgr->hashingNodeFactory), *mgr);
+#if 0
BEEV::BigRewriter b;
for (int i = 0; i < functions.size(); i++)
}
}
+#endif
removeDuplicates(functions);
+
// There may be a single undefined element now.. remove it.
for (int i = 0; i < functions.size(); i++)
{