.PHONY: all
all:
$(MAKE) -C $(SRC)/AST
+ $(MAKE) -C $(SRC)/abstraction-refinement
+ $(MAKE) -C $(SRC)/to-sat
$(MAKE) -C $(SRC)/sat core
# $(MAKE) -C $(SRC)/sat simp
# $(MAKE) -C $(SRC)/sat unsound
$(MAKE) -C $(SRC)/constantbv
$(MAKE) -C $(SRC)/parser
$(MAKE) -C $(SRC)/main
- $(AR) rc libstp.a $(SRC)/AST/*.o $(SRC)/AST/printer/*.o $(SRC)/sat/*.or $(SRC)/simplifier/*.o $(SRC)/bitvec/*.o $(SRC)/constantbv/*.o \
- $(SRC)/c_interface/*.o $(SRC)/parser/let-funcs.o $(SRC)/parser/parseCVC.o $(SRC)/parser/lexCVC.o $(SRC)/main/*.o
+ $(AR) rc libstp.a $(SRC)/AST/*.o $(SRC)/AST/printer/*.o $(SRC)/abstraction-refinement/*.o $(SRC)/to-sat/*.o \
+ $(SRC)/sat/*.or $(SRC)/simplifier/*.o $(SRC)/bitvec/*.o $(SRC)/constantbv/*.o $(SRC)/c_interface/*.o \
+ $(SRC)/parser/let-funcs.o $(SRC)/parser/parseCVC.o $(SRC)/parser/lexCVC.o $(SRC)/main/*.o
$(RANLIB) libstp.a
@mkdir -p lib
@mv libstp.a lib/
rm -rf *.log
rm -f TAGS
$(MAKE) clean -C $(SRC)/AST
+ $(MAKE) clean -C $(SRC)/abstraction-refinement
+ $(MAKE) clean -C $(SRC)/to-sat
$(MAKE) clean -C $(SRC)/sat
$(MAKE) clean -C $(SRC)/simplifier
$(MAKE) clean -C $(SRC)/bitvec
.PHONY: all
all:
$(MAKE) -C $(SRC)/AST
+ $(MAKE) -C $(SRC)/abstraction-refinement
+ $(MAKE) -C $(SRC)/to-sat
$(MAKE) -C $(SRC)/sat core
# $(MAKE) -C $(SRC)/sat simp
# $(MAKE) -C $(SRC)/sat unsound
$(MAKE) -C $(SRC)/constantbv
$(MAKE) -C $(SRC)/parser
$(MAKE) -C $(SRC)/main
- $(AR) rc libstp.a $(SRC)/AST/*.o $(SRC)/AST/printer/*.o $(SRC)/sat/*.or $(SRC)/simplifier/*.o $(SRC)/bitvec/*.o $(SRC)/constantbv/*.o \
- $(SRC)/c_interface/*.o $(SRC)/parser/let-funcs.o $(SRC)/parser/parseCVC.o $(SRC)/parser/lexCVC.o $(SRC)/main/*.o
+ $(AR) rc libstp.a $(SRC)/AST/*.o $(SRC)/AST/printer/*.o $(SRC)/abstraction-refinement/*.o $(SRC)/to-sat/*.o \
+ $(SRC)/sat/*.or $(SRC)/simplifier/*.o $(SRC)/bitvec/*.o $(SRC)/constantbv/*.o $(SRC)/c_interface/*.o \
+ $(SRC)/parser/let-funcs.o $(SRC)/parser/parseCVC.o $(SRC)/parser/lexCVC.o $(SRC)/main/*.o
$(RANLIB) libstp.a
@mkdir -p lib
@mv libstp.a lib/
rm -rf *.log
rm -f TAGS
$(MAKE) clean -C $(SRC)/AST
+ $(MAKE) clean -C $(SRC)/abstraction-refinement
+ $(MAKE) clean -C $(SRC)/to-sat
$(MAKE) clean -C $(SRC)/sat
$(MAKE) clean -C $(SRC)/simplifier
$(MAKE) clean -C $(SRC)/bitvec
friend class BeevMgr;
friend class CNFMgr;
friend class ASTInterior;
- friend class vector<ASTNode> ;
+ friend class vector<ASTNode>;
//Print the arguments in lisp format.
friend ostream &LispPrintVec(ostream &os,
const ASTVec &v,
* LICENSE: Please view LICENSE file in the home dir of this Program
********************************************************************/
// -*- c++ -*-
-#include "AST.h"
-#include "ASTUtil.h"
-#include "../simplifier/bvsolver.h"
+#include "../AST/AST.h"
+#include "../AST/ASTUtil.h"
+//#include "../simplifier/bvsolver.h"
#include <math.h>
namespace BEEV
/******************************************************************
* ARRAY READ ABSTRACTION REFINEMENT
*
+ * SATBased_ArrayReadRefinement()
+ *
* What it really does is, for each array, loop over each index i.
* inside that loop, it finds all the true and false axioms with i
* as first index. When it's got them all, it adds the false axioms
--- /dev/null
+include ../../scripts/Makefile.common
+
+SRCS = AbstractionRefinement.cpp
+OBJS = $(SRCS:.cpp=.o)
+CFLAGS += -I../sat/mtl -I../sat/simp -I../sat/core
+
+libabstractionrefinement.a: $(OBJS)
+ $(AR) rc $@ $^
+ $(RANLIB) $@
+
+clean:
+ rm -rf *.o *~ *.a .#*
SRCS = Globals.cpp main.cpp
OBJS = $(SRCS:.cpp=.o)
-LIBS = -L../AST -last -L../sat -lminisat -L../simplifier -lsimplifier -L../bitvec -lconsteval -L../constantbv -lconstantbv -L../parser -lparser
+LIBS = -L../to-sat -ltosat -L../AST -last -L../abstraction-refinement -labstractionrefinement \
+ -L../sat -lminisat \
+ -L../simplifier -lsimplifier \
+ -L../bitvec -lconsteval \
+ -L../constantbv -lconstantbv \
+ -L../parser -lparser
CFLAGS += -I../sat/mtl -I../sat/core -I../sat/simp -I../sat/unsound
parser: Globals.o main.o
// A bitblasted term is a vector of ASTNodes for formulas.
// The 0th element of the vector corresponds to bit 0 -- the low-order bit.
-#include "AST.h"
+#include "../AST/AST.h"
namespace BEEV
{
// extern void lpvec(ASTVec &vec);
--- /dev/null
+include ../../scripts/Makefile.common
+
+SRCS = BitBlast.cpp SimpBool.cpp ToCNF.cpp ToSAT.cpp
+OBJS = $(SRCS:.cpp=.o)
+CFLAGS += -I../sat/mtl -I../sat/simp -I../sat/core
+
+libtosat.a: $(OBJS)
+ $(AR) rc $@ $^
+ $(RANLIB) $@
+
+clean:
+ rm -rf *.o *~ *.a .#*
static bool _trace_simpbool = 0;
static bool _disable_simpbool = 0;
-#include "AST.h"
+#include "../AST/AST.h"
// SMTLIB experimental hack. Try allocating a single stack here for
// children to reduce growing of vectors.
********************************************************************/
// -*- c++ -*-
-#include "AST.h"
+#include "../AST/AST.h"
#include "../simplifier/bvsolver.h"
#include "../sat/sat.h"
* LICENSE: Please view LICENSE file in the home dir of this Program
********************************************************************/
// -*- c++ -*-
-#include "AST.h"
-#include "ASTUtil.h"
-#include "../simplifier/bvsolver.h"
#include <cmath>
+#include "../AST/AST.h"
+#include "../simplifier/bvsolver.h"
#include "../sat/sat.h"
namespace BEEV