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
|
/********************* */
/*! \file bv_subtheory.h
** \verbatim
** Original author: lianah
** Major contributors: dejan
** 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 Algebraic solver.
**
** Algebraic solver.
**/
#include "cvc4_private.h"
#ifndef __CVC4__THEORY__BV__BV_SUBTHEORY_H
#define __CVC4__THEORY__BV__BV_SUBTHEORY_H
#include "context/context.h"
#include "context/cdqueue.h"
#include "theory/uf/equality_engine.h"
#include "theory/theory.h"
namespace CVC4 {
namespace theory {
namespace bv {
const bool d_useEqualityEngine = true;
const bool d_useSatPropagation = true;
// forward declaration
class TheoryBV;
class Bitblaster;
/**
* Abstract base class for bit-vector subtheory solvers
*
*/
class SubtheorySolver {
protected:
/** The context we are using */
context::Context* d_context;
/** The bit-vector theory */
TheoryBV* d_bv;
public:
SubtheorySolver(context::Context* c, TheoryBV* bv) :
d_context(c),
d_bv(bv)
{}
virtual ~SubtheorySolver() {}
virtual bool addAssertions(const std::vector<TNode>& assertions, Theory::Effort e) = 0;
virtual void explain(TNode literal, std::vector<TNode>& assumptions) = 0;
virtual void preRegister(TNode node) {}
};
/**
* BitblastSolver
*/
class BitblastSolver : public SubtheorySolver {
/** Bitblaster */
Bitblaster* d_bitblaster;
/** Nodes that still need to be bit-blasted */
context::CDQueue<TNode> d_bitblastQueue;
public:
BitblastSolver(context::Context* c, TheoryBV* bv);
~BitblastSolver();
void preRegister(TNode node);
bool addAssertions(const std::vector<TNode>& assertions, Theory::Effort e);
void explain(TNode literal, std::vector<TNode>& assumptions);
EqualityStatus getEqualityStatus(TNode a, TNode b);
};
/**
* EqualitySolver
*/
class EqualitySolver : public SubtheorySolver {
// NotifyClass: handles call-back from congruence closure module
class NotifyClass : public eq::EqualityEngineNotify {
TheoryBV* d_bv;
public:
NotifyClass(TheoryBV* bv): d_bv(bv) {}
bool eqNotifyTriggerEquality(TNode equality, bool value);
bool eqNotifyTriggerPredicate(TNode predicate, bool value);
bool eqNotifyTriggerTermEquality(TheoryId tag, TNode t1, TNode t2, bool value);
bool eqNotifyConstantTermMerge(TNode t1, TNode t2);
};
/** The notify class for d_equalityEngine */
NotifyClass d_notify;
/** Equality engine */
eq::EqualityEngine d_equalityEngine;
public:
EqualitySolver(context::Context* c, TheoryBV* bv);
void preRegister(TNode node);
bool addAssertions(const std::vector<TNode>& assertions, Theory::Effort e);
void explain(TNode literal, std::vector<TNode>& assumptions);
void addSharedTerm(TNode t) {
d_equalityEngine.addTriggerTerm(t, THEORY_BV);
}
EqualityStatus getEqualityStatus(TNode a, TNode b) {
if (d_equalityEngine.areEqual(a, b)) {
// The terms are implied to be equal
return EQUALITY_TRUE;
}
if (d_equalityEngine.areDisequal(a, b)) {
// The terms are implied to be dis-equal
return EQUALITY_FALSE;
}
return EQUALITY_UNKNOWN;
}
};
}
}
}
#endif /* __CVC4__THEORY__BV__BV_SUBTHEORY_H */
|
