tla-ts 0.0.10-dev.8aec06f77 → 0.0.10-dev.94c3dd828
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/deciders.cjs +37 -36
- package/dist/deciders.js +55 -54
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +3 -0
- package/dist/index.d.ts +3 -0
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove.cjs +146 -58
- package/dist/prove.js +142 -54
- package/dist/run.cjs +45 -43
- package/dist/run.js +47 -45
- package/dist/transfer.cjs +39 -36
- package/dist/transfer.js +23 -20
- package/dist/worker.cjs +1 -1
- package/dist/worker.js +1 -1
- package/package.json +1 -1
- package/src/ast.ts +3 -3
- package/src/check.ts +203 -33
- package/src/cli/tlapm.ts +261 -68
- package/src/dependencies.ts +23 -2
- package/src/errors.ts +1 -1
- package/src/exit-codes.ts +1 -0
- package/src/liveness-checker.ts +530 -201
- package/src/liveness.ts +47 -32
- package/src/obligations/anonymize.ts +2 -4
- package/src/obligations/index.ts +5 -3
- package/src/obligations/pragma.ts +2 -2
- package/src/parallel.ts +2 -2
- package/src/parser.ts +151 -42
- package/src/prover/deciders.ts +1 -8
- package/src/prover/isabelle/isar/attrib.ts +86 -45
- package/src/prover/isabelle/isar/context.ts +25 -22
- package/src/prover/isabelle/isar/induct.ts +2 -5
- package/src/prover/isabelle/isar/method.ts +5 -7
- package/src/prover/isabelle/isar/proof.ts +33 -16
- package/src/prover/isabelle/isar/rule-cases.ts +6 -14
- package/src/prover/isabelle/isar/theory.ts +16 -17
- package/src/prover/isabelle/isar/toplevel.ts +46 -52
- package/src/prover/isabelle/provers/classical.ts +1 -1
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +1 -0
- package/src/prover/prep/methods.ts +50 -3
- package/src/prover/prep/normalize.ts +4 -1
- package/src/prover/prove.ts +58 -32
- package/src/prover/ptl/decide.ts +43 -63
- package/src/prover/smt/data.ts +51 -45
- package/src/prover/smt/encode.ts +1 -2
- package/src/prover/smt/rewrite.ts +1 -0
- package/src/prover/smt/solver/aig-tactic.ts +25 -15
- package/src/prover/smt/solver/arith-rewriter.ts +3 -5
- package/src/prover/smt/solver/asserted-formulas.ts +1 -1
- package/src/prover/smt/solver/ast-util.ts +3 -1
- package/src/prover/smt/solver/ast.ts +110 -152
- package/src/prover/smt/solver/bound-manager.ts +39 -28
- package/src/prover/smt/solver/bv-bound-chk.ts +2 -8
- package/src/prover/smt/solver/bv-rewriter.ts +14 -16
- package/src/prover/smt/solver/bv1-blast.ts +1 -9
- package/src/prover/smt/solver/cg-table.ts +19 -14
- package/src/prover/smt/solver/check-logic.ts +6 -1
- package/src/prover/smt/solver/context.ts +20 -10
- package/src/prover/smt/solver/demodulator.ts +2 -2
- package/src/prover/smt/solver/dependent-expr-state.ts +16 -0
- package/src/prover/smt/solver/distribute-forall.ts +1 -10
- package/src/prover/smt/solver/dom-simplify.ts +1 -1
- package/src/prover/smt/solver/dt2bv-tactic.ts +2 -7
- package/src/prover/smt/solver/e-matching.ts +6 -6
- package/src/prover/smt/solver/elim-uncnstr.ts +3 -14
- package/src/prover/smt/solver/enode.ts +15 -1
- package/src/prover/smt/solver/euf/array-internalize.ts +19 -8
- package/src/prover/smt/solver/euf/dt-solver.ts +19 -19
- package/src/prover/smt/solver/euf/egraph.ts +65 -32
- package/src/prover/smt/solver/euf/euf-solver.ts +35 -18
- package/src/prover/smt/solver/euf/fpa-solver.ts +37 -51
- package/src/prover/smt/solver/euf/mam.ts +6 -48
- package/src/prover/smt/solver/euf/q-ematch.ts +21 -94
- package/src/prover/smt/solver/euf/q-mbi.ts +4 -2
- package/src/prover/smt/solver/euf/q-model-fixer.ts +1 -1
- package/src/prover/smt/solver/euf/q-solver.ts +2 -0
- package/src/prover/smt/solver/euf/th-solver.ts +1 -1
- package/src/prover/smt/solver/factor.ts +1 -11
- package/src/prover/smt/solver/fd-solver.ts +1 -2
- package/src/prover/smt/solver/fm-tactic.ts +19 -13
- package/src/prover/smt/solver/fpa-rewriter.ts +3 -1
- package/src/prover/smt/solver/fpa2bv-converter.ts +10 -6
- package/src/prover/smt/solver/internalizer.ts +41 -2
- package/src/prover/smt/solver/lia2pb.ts +18 -4
- package/src/prover/smt/solver/lp/lar-solver.ts +1 -1
- package/src/prover/smt/solver/lp/nla-powers.ts +144 -107
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +50 -17
- package/src/prover/smt/solver/macro-finder.ts +1 -1
- package/src/prover/smt/solver/mam-compiler.ts +13 -13
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +1 -11
- package/src/prover/smt/solver/maxcore.ts +4 -12
- package/src/prover/smt/solver/maxlex.ts +0 -7
- package/src/prover/smt/solver/maxsmt-base.ts +7 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +2 -11
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +9 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +1 -9
- package/src/prover/smt/solver/model-evaluator.ts +9 -5
- package/src/prover/smt/solver/model-macro-solver.ts +3 -3
- package/src/prover/smt/solver/muz/dl-context.ts +57 -3
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +68 -20
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +7 -1
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +39 -10
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +76 -13
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +9 -2
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +0 -2
- package/src/prover/smt/solver/muz/dl-rule.ts +93 -29
- package/src/prover/smt/solver/muz/hnf.ts +6 -5
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +178 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +14 -3
- package/src/prover/smt/solver/muz/rule-properties.ts +194 -36
- package/src/prover/smt/solver/muz/spacer-context.ts +102 -84
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +15 -2
- package/src/prover/smt/solver/muz/spacer-pdr.ts +3 -3
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +2 -7
- package/src/prover/smt/solver/muz/spacer-util.ts +2 -2
- package/src/prover/smt/solver/muz/substitution.ts +88 -37
- package/src/prover/smt/solver/nlqsat.ts +2 -2
- package/src/prover/smt/solver/nlsat/algebraic.ts +1 -2
- package/src/prover/smt/solver/nlsat/explain.ts +5 -0
- package/src/prover/smt/solver/nlsat/solver.ts +36 -25
- package/src/prover/smt/solver/opt-context.ts +9 -8
- package/src/prover/smt/solver/opt-nlsat.ts +68 -58
- package/src/prover/smt/solver/opt-solver.ts +16 -7
- package/src/prover/smt/solver/optsmt.ts +12 -9
- package/src/prover/smt/solver/pattern-inference.ts +2 -2
- package/src/prover/smt/solver/pb-rewriter.ts +13 -13
- package/src/prover/smt/solver/poly-rewriter.ts +2 -2
- package/src/prover/smt/solver/probes.ts +1 -1
- package/src/prover/smt/solver/propagate-values.ts +4 -0
- package/src/prover/smt/solver/proto-model.ts +5 -5
- package/src/prover/smt/solver/purify-arith.ts +50 -15
- package/src/prover/smt/solver/qe-arith-plugin.ts +2 -1
- package/src/prover/smt/solver/qe-mbp.ts +13 -23
- package/src/prover/smt/solver/qe.ts +45 -53
- package/src/prover/smt/solver/qsat.ts +70 -90
- package/src/prover/smt/solver/quantifier-analyzer.ts +9 -9
- package/src/prover/smt/solver/quasi-macros.ts +9 -18
- package/src/prover/smt/solver/rational.ts +17 -0
- package/src/prover/smt/solver/recfun-decl-plugin.ts +33 -19
- package/src/prover/smt/solver/recfun-rewriter.ts +1 -1
- package/src/prover/smt/solver/rewriter-tpl.ts +6 -2
- package/src/prover/smt/solver/rewriter.ts +1 -1
- package/src/prover/smt/solver/sat/asymm-branch.ts +59 -46
- package/src/prover/smt/solver/sat/clause-use-list.ts +0 -6
- package/src/prover/smt/solver/sat/clause.ts +1 -3
- package/src/prover/smt/solver/sat/config.ts +3 -3
- package/src/prover/smt/solver/sat/consequences.ts +1 -1
- package/src/prover/smt/solver/sat/goal2sat.ts +1 -1
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +4 -12
- package/src/prover/smt/solver/sat/model-converter.ts +1 -15
- package/src/prover/smt/solver/sat/pb-solver.ts +49 -23
- package/src/prover/smt/solver/sat/probing.ts +22 -19
- package/src/prover/smt/solver/sat/sat2goal.ts +9 -10
- package/src/prover/smt/solver/sat/simplifier.ts +15 -56
- package/src/prover/smt/solver/sat/solver.ts +20 -19
- package/src/prover/smt/solver/sat/watch-list.ts +7 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +7 -7
- package/src/prover/smt/solver/seq-derive.ts +6 -7
- package/src/prover/smt/solver/seq-eq-solver.ts +7 -7
- package/src/prover/smt/solver/seq-range-predicate.ts +14 -1
- package/src/prover/smt/solver/seq-re-rewriter.ts +1 -10
- package/src/prover/smt/solver/seq-re-util.ts +1 -2
- package/src/prover/smt/solver/seq-regex-bisim.ts +1 -1
- package/src/prover/smt/solver/seq-regex-live.ts +4 -4
- package/src/prover/smt/solver/seq-rewriter.ts +1 -4
- package/src/prover/smt/solver/smt-setup.ts +15 -9
- package/src/prover/smt/solver/smtlib-parser.ts +1174 -579
- package/src/prover/smt/solver/smtlib-script.ts +866 -728
- package/src/prover/smt/solver/tactic.ts +66 -14
- package/src/prover/smt/solver/theory-array.ts +25 -58
- package/src/prover/smt/solver/theory-bv.ts +13 -50
- package/src/prover/smt/solver/theory-fpa.ts +46 -78
- package/src/prover/smt/solver/theory-pb.ts +10 -6
- package/src/prover/smt/solver/theory-recfun.ts +2 -2
- package/src/prover/smt/solver/theory-seq-regex.ts +3 -6
- package/src/prover/smt/solver/theory-seq-solve.ts +5 -5
- package/src/prover/smt/solver/theory-seq-state.ts +6 -3
- package/src/prover/smt/solver/theory-seq.ts +32 -54
- package/src/prover/smt/solver/theory.ts +16 -1
- package/src/prover/smt/solver/tseitin-cnf.ts +3 -3
- package/src/prover/smt/solver/var-subst.ts +2 -2
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/zenon/decide.ts +9 -11
- package/src/prover/zenon/node.ts +12 -11
- package/src/prover/zenon/tla/sets.ts +1 -1
- package/src/search.ts +131 -16
- package/src/successors.ts +1 -1
- package/src/symmetry.ts +2 -2
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/summary.ts +29 -14
- package/src/typed-tier.ts +6535 -0
- package/src/prover/smt/solver/seq-regex-witness.ts +0 -100
|
@@ -1,5 +1,5 @@
|
|
|
1
1
|
// Ported from Z3 (src/muz/base/rule_properties.cpp), MIT license, see z3-license.txt.
|
|
2
|
-
import { SmtTacticError
|
|
2
|
+
import { SmtTacticError } from "../../../../errors";
|
|
3
3
|
import {
|
|
4
4
|
type AstManager,
|
|
5
5
|
FAMILY_USER,
|
|
@@ -11,11 +11,14 @@ import {
|
|
|
11
11
|
OP_DIV,
|
|
12
12
|
OP_DIV0,
|
|
13
13
|
OP_DT_ACCESSOR,
|
|
14
|
+
OP_DT_IS,
|
|
15
|
+
OP_DT_RECOGNISER,
|
|
14
16
|
OP_FUN_DEFINED,
|
|
15
17
|
OP_EQ,
|
|
16
18
|
OP_IDIV,
|
|
17
19
|
OP_IDIV0,
|
|
18
20
|
OP_IMPLIES,
|
|
21
|
+
OP_ITE,
|
|
19
22
|
OP_MOD,
|
|
20
23
|
OP_MOD0,
|
|
21
24
|
OP_OR,
|
|
@@ -24,22 +27,39 @@ import {
|
|
|
24
27
|
SORT_SIZE_INFINITE,
|
|
25
28
|
QUANTIFIER_EXISTS,
|
|
26
29
|
} from "../ast";
|
|
30
|
+
import {
|
|
31
|
+
getAccessorConstructor,
|
|
32
|
+
getDatatypeConstructors,
|
|
33
|
+
getRecognizerConstructor,
|
|
34
|
+
} from "../datatype-decl-plugin";
|
|
35
|
+
import { ObjMap } from "../hashtable";
|
|
36
|
+
import { Rewriter } from "../rewriter";
|
|
27
37
|
import type { DatalogContext } from "./dl-context";
|
|
28
|
-
import type
|
|
38
|
+
import { mkPp, type Rule } from "./dl-rule";
|
|
29
39
|
import type { RuleSet } from "./dl-rule-set";
|
|
30
40
|
|
|
41
|
+
// quantifier::get_child: the body, then the patterns, then the no-patterns.
|
|
42
|
+
const getQuantifierChildren = (manager: AstManager, expr: number) => {
|
|
43
|
+
const quantifier = manager.getQuantifier(expr);
|
|
44
|
+
return [quantifier.body, ...quantifier.patterns, ...quantifier.noPatterns];
|
|
45
|
+
};
|
|
46
|
+
|
|
31
47
|
const DIVISION_OPS = new Set([OP_DIV, OP_IDIV, OP_MOD, OP_REM]);
|
|
32
48
|
const DIVISION_BY_ZERO_OPS = new Set([OP_DIV0, OP_IDIV0, OP_MOD0, OP_POWER0]);
|
|
33
49
|
|
|
34
50
|
export class RuleProperties {
|
|
35
|
-
private quantifiers
|
|
36
|
-
private uninterpretedFuncs
|
|
51
|
+
private quantifiers: ObjMap<Rule>;
|
|
52
|
+
private uninterpretedFuncs: ObjMap<Rule>;
|
|
37
53
|
private interpretedPredicateRules: Rule[] = [];
|
|
38
54
|
private negativeRules: Rule[] = [];
|
|
39
55
|
private infiniteSortRules: Rule[] = [];
|
|
40
56
|
isMonotone = true;
|
|
41
57
|
|
|
42
|
-
constructor(private context: DatalogContext) {
|
|
58
|
+
constructor(private context: DatalogContext) {
|
|
59
|
+
const manager = context.manager;
|
|
60
|
+
this.quantifiers = new ObjMap((expr) => manager.hashes[expr]);
|
|
61
|
+
this.uninterpretedFuncs = new ObjMap((decl) => manager.getDeclHash(decl));
|
|
62
|
+
}
|
|
43
63
|
|
|
44
64
|
private get manager(): AstManager {
|
|
45
65
|
return this.context.manager;
|
|
@@ -66,21 +86,37 @@ export class RuleProperties {
|
|
|
66
86
|
}
|
|
67
87
|
}
|
|
68
88
|
|
|
89
|
+
// for_each_expr_core, which marks every expression and visits the patterns of a quantifier.
|
|
69
90
|
private visit(rule: Rule, root: number, visited: Set<number>) {
|
|
70
91
|
const manager = this.manager;
|
|
71
|
-
|
|
72
|
-
|
|
73
|
-
|
|
74
|
-
|
|
75
|
-
|
|
76
|
-
|
|
77
|
-
|
|
78
|
-
|
|
79
|
-
|
|
80
|
-
|
|
81
|
-
|
|
82
|
-
|
|
92
|
+
if (visited.has(root)) return;
|
|
93
|
+
visited.add(root);
|
|
94
|
+
const stack = [root];
|
|
95
|
+
const positions = [0];
|
|
96
|
+
while (stack.length > 0) {
|
|
97
|
+
const top = stack.length - 1;
|
|
98
|
+
const current = stack[top];
|
|
99
|
+
const kind = manager.kinds[current];
|
|
100
|
+
const children =
|
|
101
|
+
kind === KIND_VAR
|
|
102
|
+
? []
|
|
103
|
+
: kind === KIND_QUANTIFIER
|
|
104
|
+
? getQuantifierChildren(manager, current)
|
|
105
|
+
: manager.getArgs(current);
|
|
106
|
+
while (positions[top] < children.length && visited.has(children[positions[top]]))
|
|
107
|
+
positions[top]++;
|
|
108
|
+
if (positions[top] < children.length) {
|
|
109
|
+
const child = children[positions[top]++];
|
|
110
|
+
visited.add(child);
|
|
111
|
+
stack.push(child);
|
|
112
|
+
positions.push(0);
|
|
113
|
+
continue;
|
|
83
114
|
}
|
|
115
|
+
stack.pop();
|
|
116
|
+
positions.pop();
|
|
117
|
+
if (kind === KIND_VAR) this.checkSort(rule, manager.sorts[current]);
|
|
118
|
+
else if (kind === KIND_QUANTIFIER) this.quantifiers.set(current, rule);
|
|
119
|
+
else this.visitApp(rule, current);
|
|
84
120
|
}
|
|
85
121
|
}
|
|
86
122
|
|
|
@@ -88,24 +124,139 @@ export class RuleProperties {
|
|
|
88
124
|
const manager = this.manager;
|
|
89
125
|
const decl = manager.decls[expr];
|
|
90
126
|
const op = manager.getOp(expr);
|
|
91
|
-
const addUninterpreted = () => {
|
|
92
|
-
if (!this.uninterpretedFuncs.has(decl)) this.uninterpretedFuncs.set(decl, rule);
|
|
93
|
-
};
|
|
94
127
|
if (this.context.isPredicate(expr)) {
|
|
95
128
|
const rules = this.interpretedPredicateRules;
|
|
96
129
|
if (rules[rules.length - 1] !== rule) rules.push(rule);
|
|
97
|
-
} else if (manager.getFamily(expr) === FAMILY_USER)
|
|
98
|
-
else if (op === OP_DT_ACCESSOR)
|
|
99
|
-
|
|
100
|
-
else if (
|
|
101
|
-
|
|
102
|
-
|
|
103
|
-
|
|
104
|
-
|
|
105
|
-
|
|
130
|
+
} else if (manager.getFamily(expr) === FAMILY_USER) this.uninterpretedFuncs.set(decl, rule);
|
|
131
|
+
else if (op === OP_DT_ACCESSOR) {
|
|
132
|
+
if (!this.checkAccessor(rule, expr)) this.uninterpretedFuncs.set(decl, rule);
|
|
133
|
+
} else if (
|
|
134
|
+
DIVISION_BY_ZERO_OPS.has(op) ||
|
|
135
|
+
op === OP_FUN_DEFINED ||
|
|
136
|
+
(DIVISION_OPS.has(op) && !this.evaluatesToNonZeroNumeral(manager.getArg(expr, 1)))
|
|
137
|
+
)
|
|
138
|
+
this.uninterpretedFuncs.set(decl, rule);
|
|
106
139
|
this.checkSort(rule, manager.sorts[expr]);
|
|
107
140
|
}
|
|
108
141
|
|
|
142
|
+
// Whether a recognizer of the accessor's constructor guards each use of it in the tail.
|
|
143
|
+
private checkAccessor(rule: Rule, accessor: number) {
|
|
144
|
+
const manager = this.manager;
|
|
145
|
+
const subject = manager.getArg(accessor, 0);
|
|
146
|
+
const constructors = getDatatypeConstructors(manager, manager.sorts[subject]);
|
|
147
|
+
if (constructors.length <= 1) return true;
|
|
148
|
+
const constructor = getAccessorConstructor(manager, manager.decls[accessor]);
|
|
149
|
+
const ctors: number[] = [];
|
|
150
|
+
const isSubjectRecognizer = (term: number) =>
|
|
151
|
+
(manager.getOp(term) === OP_DT_RECOGNISER || manager.getOp(term) === OP_DT_IS) &&
|
|
152
|
+
manager.getArg(term, 0) === subject;
|
|
153
|
+
const addRecognizer = (term: number) => {
|
|
154
|
+
if (!isSubjectRecognizer(term)) return;
|
|
155
|
+
const other = getRecognizerConstructor(manager, manager.decls[term]);
|
|
156
|
+
if (other !== constructor) ctors.push(other);
|
|
157
|
+
};
|
|
158
|
+
const addNotRecognizer = (term: number) => {
|
|
159
|
+
if (manager.isNot(term)) addRecognizer(manager.getArg(term, 0));
|
|
160
|
+
};
|
|
161
|
+
const isRecognizerBase = (term: number) =>
|
|
162
|
+
isSubjectRecognizer(term) &&
|
|
163
|
+
getRecognizerConstructor(manager, manager.decls[term]) === constructor;
|
|
164
|
+
const isRecognizer = (term: number) =>
|
|
165
|
+
(manager.getOp(term) === OP_AND && manager.getArgs(term).some(isRecognizerBase)) ||
|
|
166
|
+
isRecognizerBase(term);
|
|
167
|
+
for (let index = rule.uninterpretedSize; index < rule.tail.length; index++) {
|
|
168
|
+
if (isRecognizer(rule.tail[index])) return true;
|
|
169
|
+
addNotRecognizer(rule.tail[index]);
|
|
170
|
+
}
|
|
171
|
+
// The parents of every subterm of the tail, where -1 marks a tail formula itself.
|
|
172
|
+
const useList = new Map<number, number[]>();
|
|
173
|
+
const addUse = (term: number, parent: number) => {
|
|
174
|
+
const parents = useList.get(term);
|
|
175
|
+
if (parents === undefined) useList.set(term, [parent]);
|
|
176
|
+
else parents.push(parent);
|
|
177
|
+
};
|
|
178
|
+
for (let index = rule.uninterpretedSize; index < rule.tail.length; index++) {
|
|
179
|
+
addUse(rule.tail[index], -1);
|
|
180
|
+
const marked = new Set<number>();
|
|
181
|
+
const stack = [rule.tail[index]];
|
|
182
|
+
while (stack.length > 0) {
|
|
183
|
+
const sub = stack[stack.length - 1];
|
|
184
|
+
marked.add(sub);
|
|
185
|
+
if (manager.kinds[sub] === KIND_APP)
|
|
186
|
+
for (const arg of manager.getArgs(sub)) {
|
|
187
|
+
addUse(arg, sub);
|
|
188
|
+
stack.push(arg);
|
|
189
|
+
}
|
|
190
|
+
else if (manager.kinds[sub] === KIND_QUANTIFIER)
|
|
191
|
+
stack.push(manager.getQuantifier(sub).body);
|
|
192
|
+
while (stack.length > 0 && marked.has(stack[stack.length - 1])) stack.pop();
|
|
193
|
+
}
|
|
194
|
+
}
|
|
195
|
+
const exprs = [accessor];
|
|
196
|
+
const ctorSizes = [0];
|
|
197
|
+
const isVisited = [false];
|
|
198
|
+
while (exprs.length > 0) {
|
|
199
|
+
const top = exprs.length - 1;
|
|
200
|
+
const current = exprs[top];
|
|
201
|
+
if (isVisited[top]) {
|
|
202
|
+
ctors.length = Math.min(ctors.length, ctorSizes[top]);
|
|
203
|
+
exprs.pop();
|
|
204
|
+
ctorSizes.pop();
|
|
205
|
+
isVisited.pop();
|
|
206
|
+
continue;
|
|
207
|
+
}
|
|
208
|
+
isVisited[top] = true;
|
|
209
|
+
const parents = useList.get(current);
|
|
210
|
+
if (parents === undefined) return false;
|
|
211
|
+
for (const parent of parents) {
|
|
212
|
+
if (parent === -1) {
|
|
213
|
+
const unguarded = constructors.filter((other) => !ctors.includes(other));
|
|
214
|
+
if (unguarded.length === 1 && unguarded[0] === constructor) continue;
|
|
215
|
+
return false;
|
|
216
|
+
}
|
|
217
|
+
if (isRecognizer(parent)) continue;
|
|
218
|
+
const op = manager.getOp(parent);
|
|
219
|
+
if (op === OP_ITE) {
|
|
220
|
+
const condition = manager.getArg(parent, 0);
|
|
221
|
+
if (
|
|
222
|
+
manager.getArg(parent, 1) === current &&
|
|
223
|
+
isRecognizer(condition) &&
|
|
224
|
+
manager.getArg(parent, 2) !== current
|
|
225
|
+
)
|
|
226
|
+
continue;
|
|
227
|
+
addRecognizer(condition);
|
|
228
|
+
}
|
|
229
|
+
if (op === OP_AND) for (const arg of manager.getArgs(parent)) addNotRecognizer(arg);
|
|
230
|
+
let isGuarded = false;
|
|
231
|
+
if (op === OP_OR)
|
|
232
|
+
for (const arg of manager.getArgs(parent)) {
|
|
233
|
+
addRecognizer(arg);
|
|
234
|
+
if (manager.isNot(arg) && isRecognizer(manager.getArg(arg, 0))) {
|
|
235
|
+
isGuarded = true;
|
|
236
|
+
break;
|
|
237
|
+
}
|
|
238
|
+
}
|
|
239
|
+
if (isGuarded) continue;
|
|
240
|
+
exprs.push(parent);
|
|
241
|
+
ctorSizes.push(ctors.length);
|
|
242
|
+
isVisited.push(false);
|
|
243
|
+
}
|
|
244
|
+
}
|
|
245
|
+
return true;
|
|
246
|
+
}
|
|
247
|
+
|
|
248
|
+
// evaluates_to_numeral, with the zero test of its caller.
|
|
249
|
+
private evaluatesToNonZeroNumeral(expr: number) {
|
|
250
|
+
const manager = this.manager;
|
|
251
|
+
if (manager.isNumeral(expr)) return !manager.getRationalValue(expr).isZero();
|
|
252
|
+
const rewriter = new Rewriter(manager, this.context.rewriterOptions);
|
|
253
|
+
const value = rewriter.rewrite(expr);
|
|
254
|
+
const isNonZeroNumeral = manager.isNumeral(value) && !manager.getRationalValue(value).isZero();
|
|
255
|
+
manager.decRef(value);
|
|
256
|
+
rewriter.release();
|
|
257
|
+
return isNonZeroNumeral;
|
|
258
|
+
}
|
|
259
|
+
|
|
109
260
|
private checkSort(rule: Rule, sort: number) {
|
|
110
261
|
const manager = this.manager;
|
|
111
262
|
if (manager.isArraySort(sort) || manager.getSortSize(sort) === SORT_SIZE_INFINITE)
|
|
@@ -113,21 +264,26 @@ export class RuleProperties {
|
|
|
113
264
|
}
|
|
114
265
|
|
|
115
266
|
checkForNegatedPredicates() {
|
|
116
|
-
if (this.negativeRules.length > 0)
|
|
267
|
+
if (this.negativeRules.length > 0)
|
|
268
|
+
throw new SmtTacticError(
|
|
269
|
+
`Rule contains negative predicate ${this.negativeRules[0].display(this.context)}`,
|
|
270
|
+
);
|
|
117
271
|
}
|
|
118
272
|
|
|
119
273
|
checkUninterpretedFree() {
|
|
120
|
-
const first = this.uninterpretedFuncs.
|
|
274
|
+
const first = this.uninterpretedFuncs.entries().next();
|
|
121
275
|
if (first.done !== true)
|
|
122
276
|
throw new SmtTacticError(
|
|
123
|
-
`Uninterpreted '${getSymbolName(this.manager.funcDecls[first.value].name)}' in
|
|
277
|
+
`Uninterpreted '${getSymbolName(this.manager.funcDecls[first.value[0]].name)}' in ${first.value[1].display(this.context)}`,
|
|
124
278
|
);
|
|
125
279
|
}
|
|
126
280
|
|
|
127
281
|
checkExistsFree() {
|
|
128
|
-
for (const
|
|
129
|
-
if (this.manager.getQuantifier(
|
|
130
|
-
throw new SmtTacticError(
|
|
282
|
+
for (const entry of this.quantifiers)
|
|
283
|
+
if (this.manager.getQuantifier(entry[0]).kind === QUANTIFIER_EXISTS)
|
|
284
|
+
throw new SmtTacticError(
|
|
285
|
+
`cannot process EXISTS quantifier in rule ${entry[1].display(this.context)}`,
|
|
286
|
+
);
|
|
131
287
|
}
|
|
132
288
|
|
|
133
289
|
checkBackgroundFree() {
|
|
@@ -161,7 +317,9 @@ export class RuleProperties {
|
|
|
161
317
|
}
|
|
162
318
|
for (const expr of toCheck)
|
|
163
319
|
if (this.containsPredicate(expr))
|
|
164
|
-
throw new SmtTacticError(
|
|
320
|
+
throw new SmtTacticError(
|
|
321
|
+
`recursive predicate ${mkPp(manager, expr)} occurs nested in the body of a rule`,
|
|
322
|
+
);
|
|
165
323
|
}
|
|
166
324
|
|
|
167
325
|
private containsPredicate(root: number) {
|