}
-void BvToBoolPreprocessor::liftBoolToBV(const std::vector<TNode>& assertions, std::vector<Node>& new_assertions) {
+void BvToBoolPreprocessor::liftBoolToBV(const std::vector<Node>& assertions, std::vector<Node>& new_assertions) {
TNodeNodeMap candidates;
for (unsigned i = 0; i < assertions.size(); ++i) {
if (matchesBooleanPatern(assertions[i])) {
TNode bv_var = assertion[0][0];
Assert (bv_var.getKind() == kind::VARIABLE &&
bv_var.getType().isBitVector() &&
- bv_bar.getType().getBitVectorSize() == 1);
+ bv_var.getType().getBitVectorSize() == 1);
TNode bool_cond = assertion[1];
Assert (bool_cond.getType().isBoolean());
if (candidates.find(bv_var) == candidates.end()) {
BvToBoolPreprocessor()
{}
~BvToBoolPreprocessor() {}
- void liftBoolToBV(const std::vector<TNode>& assertions, std::vector<Node>& new_assertions);
+ void liftBoolToBV(const std::vector<Node>& assertions, std::vector<Node>& new_assertions);
};
}
}
-void TheoryEngine::ppBvToBool(const std::vector<TNode>& assertions, std::vector<Node> new_assertions) {
+void TheoryEngine::ppBvToBool(const std::vector<Node>& assertions, std::vector<Node> new_assertions) {
d_bvToBoolPreprocessor.liftBoolToBV(assertions, new_assertions);
}
theory::bv::BvToBoolPreprocessor d_bvToBoolPreprocessor;
public:
- void ppBvToBool(const std::vector<TNode>& assertions, std::vector<Node> new_assertions);
+ void ppBvToBool(const std::vector<Node>& assertions, std::vector<Node> new_assertions);
Node ppSimpITE(TNode assertion);
void ppUnconstrainedSimp(std::vector<Node>& assertions);