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
151
|
/********************* */
/*! \file eager_solver.cpp
** \verbatim
** Top contributors (to current version):
** Andrew Reynolds, Tianyi Liang, Andres Noetzli
** This file is part of the CVC4 project.
** Copyright (c) 2009-2021 by the authors listed in the file AUTHORS
** in the top-level source directory and their institutional affiliations.
** All rights reserved. See the file COPYING in the top-level source
** directory for licensing information.\endverbatim
**
** \brief The eager solver
**/
#include "theory/strings/eager_solver.h"
#include "theory/strings/theory_strings_utils.h"
using namespace CVC5::kind;
namespace CVC5 {
namespace theory {
namespace strings {
EagerSolver::EagerSolver(SolverState& state) : d_state(state) {}
EagerSolver::~EagerSolver() {}
void EagerSolver::eqNotifyNewClass(TNode t)
{
Kind k = t.getKind();
if (k == STRING_LENGTH || k == STRING_TO_CODE)
{
eq::EqualityEngine* ee = d_state.getEqualityEngine();
Node r = ee->getRepresentative(t[0]);
EqcInfo* ei = d_state.getOrMakeEqcInfo(r);
if (k == STRING_LENGTH)
{
ei->d_lengthTerm = t[0];
}
else
{
ei->d_codeTerm = t[0];
}
}
else if (t.isConst())
{
if (t.getType().isStringLike())
{
EqcInfo* ei = d_state.getOrMakeEqcInfo(t);
ei->d_prefixC = t;
ei->d_suffixC = t;
}
}
else if (k == STRING_CONCAT)
{
addEndpointsToEqcInfo(t, t, t);
}
}
void EagerSolver::eqNotifyMerge(TNode t1, TNode t2)
{
EqcInfo* e2 = d_state.getOrMakeEqcInfo(t2, false);
if (e2 == nullptr)
{
return;
}
Assert(t1.getType().isStringLike());
EqcInfo* e1 = d_state.getOrMakeEqcInfo(t1);
// add information from e2 to e1
if (!e2->d_lengthTerm.get().isNull())
{
e1->d_lengthTerm.set(e2->d_lengthTerm);
}
if (!e2->d_codeTerm.get().isNull())
{
e1->d_codeTerm.set(e2->d_codeTerm);
}
if (!e2->d_prefixC.get().isNull())
{
d_state.setPendingPrefixConflictWhen(
e1->addEndpointConst(e2->d_prefixC, Node::null(), false));
}
if (!e2->d_suffixC.get().isNull())
{
d_state.setPendingPrefixConflictWhen(
e1->addEndpointConst(e2->d_suffixC, Node::null(), true));
}
if (e2->d_cardinalityLemK.get() > e1->d_cardinalityLemK.get())
{
e1->d_cardinalityLemK.set(e2->d_cardinalityLemK);
}
if (!e2->d_normalizedLength.get().isNull())
{
e1->d_normalizedLength.set(e2->d_normalizedLength);
}
}
void EagerSolver::eqNotifyDisequal(TNode t1, TNode t2, TNode reason)
{
if (t1.getType().isStringLike())
{
// store disequalities between strings, may need to check if their lengths
// are equal/disequal
d_state.addDisequality(t1, t2);
}
}
void EagerSolver::addEndpointsToEqcInfo(Node t, Node concat, Node eqc)
{
Assert(concat.getKind() == STRING_CONCAT
|| concat.getKind() == REGEXP_CONCAT);
EqcInfo* ei = nullptr;
// check each side
for (unsigned r = 0; r < 2; r++)
{
unsigned index = r == 0 ? 0 : concat.getNumChildren() - 1;
Node c = utils::getConstantComponent(concat[index]);
if (!c.isNull())
{
if (ei == nullptr)
{
ei = d_state.getOrMakeEqcInfo(eqc);
}
Trace("strings-eager-pconf-debug")
<< "New term: " << concat << " for " << t << " with prefix " << c
<< " (" << (r == 1) << ")" << std::endl;
d_state.setPendingPrefixConflictWhen(ei->addEndpointConst(t, c, r == 1));
}
}
}
void EagerSolver::notifyFact(TNode atom,
bool polarity,
TNode fact,
bool isInternal)
{
if (atom.getKind() == STRING_IN_REGEXP)
{
if (polarity && atom[1].getKind() == REGEXP_CONCAT)
{
eq::EqualityEngine* ee = d_state.getEqualityEngine();
Node eqc = ee->getRepresentative(atom[0]);
addEndpointsToEqcInfo(atom, atom[1], eqc);
}
}
}
} // namespace strings
} // namespace theory
} // namespace CVC5
|
