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
|
#include "theory_bv.h"
#include "theory_bv_utils.h"
#include "theory_bv_rewrite_rules.h"
using namespace CVC4;
using namespace CVC4::theory;
using namespace CVC4::theory::bv;
using namespace CVC4::theory::bv::utils;
void TheoryBV::preRegisterTerm(TNode node) {
Debug("bitvector") << "TheoryBV::preRegister(" << node << ")" << std::endl;
if (node.getKind() == kind::EQUAL) {
d_eqEngine.addTerm(node[0]);
d_eqEngine.addTerm(node[1]);
}
}
RewriteResponse TheoryBV::postRewrite(TNode node, bool topLevel) {
Debug("bitvector") << "TheoryBV::postRewrite(" << node << ", topLevel = " << (topLevel? "true" : "false") << ")" << std::endl;
Node result;
if (node.getKind() == kind::CONST_BITVECTOR /* || isLeaf(n)) */)
result = node;
else {
switch (node.getKind()) {
case kind::BITVECTOR_CONCAT:
result = LinearRewriteStrategy<
// Flatten the top level concatenations
CoreRewriteRules::ConcatFlatten,
// Merge the adjacent extracts on non-constants
CoreRewriteRules::ConcatExtractMerge,
// Merge the adjacent extracts on constants
CoreRewriteRules::ConcatConstantMerge,
// At this point only Extract-Whole could apply, if the result is only one extract
// or at some sub-expression if the result is a concatenation.
ApplyRuleToChildren<kind::BITVECTOR_CONCAT, CoreRewriteRules::ExtractWhole>
>::apply(node);
break;
case kind::BITVECTOR_EXTRACT:
result = LinearRewriteStrategy<
// Extract over a constant gives a constant
CoreRewriteRules::ExtractConstant,
// Extract over an extract is simplified to one extract
CoreRewriteRules::ExtractExtract,
// Extract over a concatenation is distributed to the appropriate concatenations
CoreRewriteRules::ExtractConcat,
// At this point only Extract-Whole could apply
CoreRewriteRules::ExtractWhole
>::apply(node);
break;
case kind::EQUAL:
result = LinearRewriteStrategy<
// Two distinct values rewrite to false
CoreRewriteRules::FailEq,
// If both sides are equal equality is true
CoreRewriteRules::SimplifyEq
>::apply(node);
break;
default:
// TODO: figure out when this is an operator
result = node;
break;
// Unhandled();
}
}
Debug("bitvector") << "TheoryBV::postRewrite(" << node << ", topLevel = " << (topLevel? "true" : "false") << ") => " << result << std::endl;
return RewriteComplete(result);
}
void TheoryBV::check(Effort e) {
Debug("bitvector") << "TheoryBV::check(" << e << ")" << std::endl;
while(!done()) {
// Get the assertion
TNode assertion = get();
Debug("bitvector") << "TheoryBV::check(" << e << "): asserting: " << assertion << std::endl;
// Do the right stuff
switch (assertion.getKind()) {
case kind::EQUAL:
d_eqEngine.addEquality(assertion[0], assertion[1]);
break;
case kind::NOT: {
TNode equality = assertion[0];
if (d_eqEngine.areEqual(equality[0], equality[1])) {
vector<TNode> assertions;
d_eqEngine.getExplanation(equality[0], equality[1], assertions);
// We can assume that the explanation is bigger than one node
assertions.push_back(assertion);
d_out->conflict(mkAnd(assertions));
} else {
d_disequalities.push_back(assertion);
}
break;
}
default:
Unhandled();
}
}
// In full effort go back and check the disequalities
if (true) {
Debug("bitvector") << "TheoryBV::check(" << e << "): checking disequalities" << std::endl;
for (unsigned i = 0; i < d_disequalities.size(); ++ i) {
TNode assertion = d_disequalities[i];
TNode equality = assertion[0];
if (d_eqEngine.areEqual(equality[0], equality[1])) {
vector<TNode> assertions;
d_eqEngine.getExplanation(equality[0], equality[1], assertions);
assertions.push_back(assertion);
// We can assume that the explanation is bigger than one node
d_out->conflict(mkAnd(assertions));
}
}
}
}
|
