1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
|
/********************* */
/*! \file theory_bv.cpp
** \verbatim
** Original author: dejan
** Major contributors: mdeters
** Minor contributors (to current version): none
** This file is part of the CVC4 prototype.
** Copyright (c) 2009, 2010, 2011 The Analysis of Computer Systems Group (ACSys)
** Courant Institute of Mathematical Sciences
** New York University
** See the file COPYING in the top-level source directory for licensing
** information.\endverbatim
**
** \brief [[ Add one-line brief description here ]]
**
** [[ Add lengthier description here ]]
** \todo document this file
**/
#include "theory/bv/theory_bv.h"
#include "theory/bv/theory_bv_utils.h"
#include "theory/valuation.h"
#include "theory/bv/bv_sat.h"
using namespace CVC4;
using namespace CVC4::theory;
using namespace CVC4::theory::bv;
using namespace CVC4::context;
using namespace std;
using namespace CVC4::theory::bv::utils;
TheoryBV::TheoryBV(context::Context* c, context::UserContext* u, OutputChannel& out, Valuation valuation)
: Theory(THEORY_BV, c, u, out, valuation),
d_context(c),
d_assertions(c),
d_bitblaster(new Bitblaster(c) ),
d_statistics()
{
d_true = utils::mkTrue();
}
TheoryBV::~TheoryBV() {
delete d_bitblaster;
}
TheoryBV::Statistics::Statistics():
d_avgConflictSize("theory::bv::AvgBVConflictSize"),
d_solveSubstitutions("theory::bv::NumberOfSolveSubstitutions", 0),
d_solveTimer("theory::bv::solveTimer")
{
StatisticsRegistry::registerStat(&d_avgConflictSize);
StatisticsRegistry::registerStat(&d_solveSubstitutions);
StatisticsRegistry::registerStat(&d_solveTimer);
}
TheoryBV::Statistics::~Statistics() {
StatisticsRegistry::unregisterStat(&d_avgConflictSize);
StatisticsRegistry::unregisterStat(&d_solveSubstitutions);
StatisticsRegistry::unregisterStat(&d_solveTimer);
}
void TheoryBV::preRegisterTerm(TNode node) {
BVDebug("bitvector-preregister") << "TheoryBV::preRegister(" << node << ")" << std::endl;
//marker literal: bitblast all terms before we start
//d_bitblaster->bitblast(node);
}
void TheoryBV::check(Effort e) {
if (fullEffort(e) && !done()) {
Trace("bitvector")<< "TheoryBV::check(" << e << ")" << std::endl;
std::vector<TNode> assertions;
while (!done()) {
TNode assertion = get();
Trace("bitvector-assertions") << "TheoryBV::check assertion " << assertion << "\n";
d_bitblaster->bitblast(assertion);
d_bitblaster->assertToSat(assertion);
}
TimerStat::CodeTimer codeTimer(d_statistics.d_solveTimer);
bool res = d_bitblaster->solve();
if (res == false) {
std::vector<TNode> conflictAtoms;
d_bitblaster->getConflict(conflictAtoms);
d_statistics.d_avgConflictSize.addEntry(conflictAtoms.size());
Node conflict = mkConjunction(conflictAtoms);
d_out->conflict(conflict);
Trace("bitvector") << "TheoryBV::check returns conflict. \n ";
return;
}
}
}
Node TheoryBV::getValue(TNode n) {
//NodeManager* nodeManager = NodeManager::currentNM();
switch(n.getKind()) {
case kind::VARIABLE:
Unhandled(kind::VARIABLE);
case kind::EQUAL: // 2 args
Unhandled(kind::VARIABLE);
default:
Unhandled(n.getKind());
}
}
Node TheoryBV::explain(TNode node) {
BVDebug("bitvector") << "TheoryBV::explain(" << node << ")" << std::endl;
TNode equality = node.getKind() == kind::NOT ? node[0] : node;
Assert(equality.getKind() == kind::EQUAL);
Assert(0);
return node;
}
// Node TheoryBV::preprocessTerm(TNode term) {
// return term; //d_staticEqManager.find(term);
// }
Theory::PPAssertStatus TheoryBV::ppAssert(TNode in, SubstitutionMap& outSubstitutions) {
switch(in.getKind()) {
case kind::EQUAL:
if (in[0].getMetaKind() == kind::metakind::VARIABLE && !in[1].hasSubterm(in[0])) {
++(d_statistics.d_solveSubstitutions);
outSubstitutions.addSubstitution(in[0], in[1]);
return PP_ASSERT_STATUS_SOLVED;
}
if (in[1].getMetaKind() == kind::metakind::VARIABLE && !in[0].hasSubterm(in[1])) {
++(d_statistics.d_solveSubstitutions);
outSubstitutions.addSubstitution(in[1], in[0]);
return PP_ASSERT_STATUS_SOLVED;
}
// to do constant propagations
break;
case kind::NOT:
break;
default:
// TODO other predicates
break;
}
return PP_ASSERT_STATUS_UNSOLVED;
}
|
