tla-ts 0.0.4-dev.e9adbb1 → 0.0.4-dev.ee344a5
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/README.md +45 -1
- package/dist/deciders.cjs +366 -0
- package/dist/deciders.js +366 -0
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +35 -1
- package/dist/index.d.ts +35 -1
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -4
- package/dist/parallel-worker.js +1 -4
- package/dist/prove-worker.cjs +9 -0
- package/dist/prove-worker.d.cts +9 -0
- package/dist/prove-worker.d.ts +9 -0
- package/dist/prove-worker.js +9 -0
- package/dist/prove.cjs +515 -0
- package/dist/prove.js +515 -0
- package/dist/run-cli.cjs +30 -47
- package/dist/run-cli.js +30 -47
- package/dist/tlapm.cjs +10 -0
- package/dist/tlapm.js +10 -0
- package/dist/transfer.cjs +38 -44
- package/dist/transfer.js +38 -44
- package/dist/worker.cjs +21 -0
- package/dist/worker.js +21 -0
- package/package.json +21 -12
- package/src/errors.ts +86 -0
- package/src/index.ts +10 -0
- package/src/{obligation-action.ts → obligations/action.ts} +258 -37
- package/src/{obligation-anon.ts → obligations/anon.ts} +13 -7
- package/src/obligations/ctx.ts +64 -0
- package/src/{obligation-deref.ts → obligations/deref.ts} +2 -2
- package/src/{obligation-expression.ts → obligations/expression.ts} +54 -8
- package/src/{obligation-generate.ts → obligations/generate.ts} +134 -61
- package/src/{obligations.ts → obligations/index.ts} +26 -12
- package/src/{obligation-levels.ts → obligations/levels.ts} +12 -2
- package/src/{obligation-module.ts → obligations/module.ts} +46 -20
- package/src/obligations/pickle.ts +100 -0
- package/src/obligations/pragma.ts +189 -0
- package/src/{obligation-printer.ts → obligations/printer.ts} +5 -59
- package/src/{obligation-proof.ts → obligations/proof.ts} +7 -1
- package/src/{obligation-source.ts → obligations/source.ts} +91 -35
- package/src/obligations/temporal.ts +319 -0
- package/src/{obligation-tuples.ts → obligations/tuples.ts} +1 -1
- package/src/parallel-worker.ts +2 -18
- package/src/parallel.ts +10 -43
- package/src/prove/decide-pool.ts +100 -0
- package/src/prove/deciders.ts +27 -0
- package/src/prove/isabelle/LICENSE +36 -0
- package/src/prove/isabelle/LICENSE-tlapm +26 -0
- package/src/prove/isabelle/decide.ts +47 -0
- package/src/prove/isabelle/encode.ts +477 -0
- package/src/prove/isabelle/isar/inner-syntax.ts +579 -0
- package/src/prove/isabelle/isar/method.ts +367 -0
- package/src/prove/isabelle/isar/proof.ts +28 -0
- package/src/prove/isabelle/isar/statement.ts +57 -0
- package/src/prove/isabelle/isar/theory.ts +192 -0
- package/src/prove/isabelle/isar/type-check.ts +278 -0
- package/src/prove/isabelle/provers/blast/blast.ts +258 -0
- package/src/prove/isabelle/provers/blast/branch.ts +322 -0
- package/src/prove/isabelle/provers/blast/prove.ts +347 -0
- package/src/prove/isabelle/provers/blast/rules.ts +330 -0
- package/src/prove/isabelle/provers/blast/state.ts +180 -0
- package/src/prove/isabelle/provers/blast/term.ts +547 -0
- package/src/prove/isabelle/provers/clasimp.ts +150 -0
- package/src/prove/isabelle/provers/classical.ts +389 -0
- package/src/prove/isabelle/provers/hypsubst.ts +441 -0
- package/src/prove/isabelle/pure/bicompose.ts +174 -0
- package/src/prove/isabelle/pure/consts.ts +32 -0
- package/src/prove/isabelle/pure/conv.ts +79 -0
- package/src/prove/isabelle/pure/drule.ts +264 -0
- package/src/prove/isabelle/pure/envir.ts +363 -0
- package/src/prove/isabelle/pure/goal.ts +53 -0
- package/src/prove/isabelle/pure/interrupt.ts +16 -0
- package/src/prove/isabelle/pure/list.ts +12 -0
- package/src/prove/isabelle/pure/logic.ts +402 -0
- package/src/prove/isabelle/pure/name.ts +110 -0
- package/src/prove/isabelle/pure/net.ts +262 -0
- package/src/prove/isabelle/pure/object-logic.ts +41 -0
- package/src/prove/isabelle/pure/pattern.ts +650 -0
- package/src/prove/isabelle/pure/raw-simplifier.ts +353 -0
- package/src/prove/isabelle/pure/rewriter.ts +602 -0
- package/src/prove/isabelle/pure/search.ts +68 -0
- package/src/prove/isabelle/pure/seq.ts +156 -0
- package/src/prove/isabelle/pure/simplifier.ts +112 -0
- package/src/prove/isabelle/pure/table.ts +208 -0
- package/src/prove/isabelle/pure/tactic.ts +276 -0
- package/src/prove/isabelle/pure/tactical.ts +347 -0
- package/src/prove/isabelle/pure/term-ord.ts +159 -0
- package/src/prove/isabelle/pure/term.ts +808 -0
- package/src/prove/isabelle/pure/thm.ts +806 -0
- package/src/prove/isabelle/pure/type.ts +133 -0
- package/src/prove/isabelle/pure/unify.ts +753 -0
- package/src/prove/isabelle/pure/variable.ts +25 -0
- package/src/prove/isabelle/tla/classical-setup.ts +101 -0
- package/src/prove/isabelle/tla/context.ts +74 -0
- package/src/prove/isabelle/tla/logic-data.ts +5 -0
- package/src/prove/isabelle/tla/logic.ts +215 -0
- package/src/prove/isabelle/tla/simpdata.ts +241 -0
- package/src/prove/isabelle/tools/intuitionistic.ts +132 -0
- package/src/prove/ocaml.ts +22 -0
- package/src/prove/prep/action.ts +520 -0
- package/src/prove/prep/defs.ts +27 -0
- package/src/prove/prep/elab.ts +156 -0
- package/src/prove/prep/enabled-axioms.ts +189 -0
- package/src/prove/prep/enabled.ts +43 -0
- package/src/prove/prep/fingerprint.ts +388 -0
- package/src/prove/prep/flatten.ts +70 -0
- package/src/prove/prep/level-comparison.ts +552 -0
- package/src/prove/prep/md5.ts +67 -0
- package/src/prove/prep/pragma.ts +221 -0
- package/src/prove/prep/trivial.ts +22 -0
- package/src/prove/prove-worker.ts +29 -0
- package/src/prove/prove.ts +417 -0
- package/src/prove/ptl/decide.ts +68 -0
- package/src/prove/ptl/encode.ts +256 -0
- package/src/prove/ptl/sat.ts +151 -0
- package/src/prove/ptl/tableau.ts +276 -0
- package/src/prove/smt/axiomatize.ts +69 -0
- package/src/prove/smt/axioms.ts +210 -0
- package/src/prove/smt/context.ts +108 -0
- package/src/prove/smt/data.ts +665 -0
- package/src/prove/smt/encode.ts +169 -0
- package/src/prove/smt/extensionality.ts +63 -0
- package/src/prove/smt/flatten.ts +127 -0
- package/src/prove/smt/format.ts +143 -0
- package/src/prove/smt/instances.ts +182 -0
- package/src/prove/smt/rewrite.ts +784 -0
- package/src/prove/smt/simplify.ts +57 -0
- package/src/prove/smt/solver/act-cache.ts +265 -0
- package/src/prove/smt/solver/arith-rewriter.ts +962 -0
- package/src/prove/smt/solver/array.ts +22 -0
- package/src/prove/smt/solver/asserted-formulas.ts +469 -0
- package/src/prove/smt/solver/ast-lt.ts +157 -0
- package/src/prove/smt/solver/ast-util.ts +147 -0
- package/src/prove/smt/solver/ast.ts +1315 -0
- package/src/prove/smt/solver/auf-solver.ts +572 -0
- package/src/prove/smt/solver/case-split-queue.ts +178 -0
- package/src/prove/smt/solver/cg-table.ts +175 -0
- package/src/prove/smt/solver/clause.ts +276 -0
- package/src/prove/smt/solver/conflict-resolution.ts +343 -0
- package/src/prove/smt/solver/context.ts +1292 -0
- package/src/prove/smt/solver/ctx-simplify.ts +334 -0
- package/src/prove/smt/solver/der.ts +224 -0
- package/src/prove/smt/solver/dyn-ack.ts +141 -0
- package/src/prove/smt/solver/e-matching.ts +659 -0
- package/src/prove/smt/solver/enode.ts +259 -0
- package/src/prove/smt/solver/expr-ref.ts +21 -0
- package/src/prove/smt/solver/expr-safe-replace.ts +172 -0
- package/src/prove/smt/solver/fingerprints.ts +92 -0
- package/src/prove/smt/solver/flat-literals.ts +51 -0
- package/src/prove/smt/solver/goal.ts +138 -0
- package/src/prove/smt/solver/hash.ts +173 -0
- package/src/prove/smt/solver/hashtable.ts +166 -0
- package/src/prove/smt/solver/internalizer.ts +1381 -0
- package/src/prove/smt/solver/lbool.ts +5 -0
- package/src/prove/smt/solver/literal.ts +24 -0
- package/src/prove/smt/solver/lp/bound-propagator.ts +391 -0
- package/src/prove/smt/solver/lp/constraints.ts +78 -0
- package/src/prove/smt/solver/lp/containers.ts +296 -0
- package/src/prove/smt/solver/lp/core-solver.ts +504 -0
- package/src/prove/smt/solver/lp/cross-nested.ts +224 -0
- package/src/prove/smt/solver/lp/dep-intervals.ts +656 -0
- package/src/prove/smt/solver/lp/dependency.ts +51 -0
- package/src/prove/smt/solver/lp/dioph-eq.ts +1181 -0
- package/src/prove/smt/solver/lp/explanation.ts +46 -0
- package/src/prove/smt/solver/lp/gomory.ts +255 -0
- package/src/prove/smt/solver/lp/hnf-cutter.ts +125 -0
- package/src/prove/smt/solver/lp/hnf.ts +281 -0
- package/src/prove/smt/solver/lp/int-cube.ts +295 -0
- package/src/prove/smt/solver/lp/int-solver.ts +514 -0
- package/src/prove/smt/solver/lp/lar-solver.ts +816 -0
- package/src/prove/smt/solver/lp/lar-term.ts +62 -0
- package/src/prove/smt/solver/lp/lp-settings.ts +91 -0
- package/src/prove/smt/solver/lp/maximize-term.ts +347 -0
- package/src/prove/smt/solver/lp/nex-creator.ts +381 -0
- package/src/prove/smt/solver/lp/nex.ts +120 -0
- package/src/prove/smt/solver/lp/nla-backoff.ts +43 -0
- package/src/prove/smt/solver/lp/nla-basics.ts +398 -0
- package/src/prove/smt/solver/lp/nla-core.ts +968 -0
- package/src/prove/smt/solver/lp/nla-divisions.ts +332 -0
- package/src/prove/smt/solver/lp/nla-emonics.ts +373 -0
- package/src/prove/smt/solver/lp/nla-factorization.ts +30 -0
- package/src/prove/smt/solver/lp/nla-grobner.ts +904 -0
- package/src/prove/smt/solver/lp/nla-horner.ts +126 -0
- package/src/prove/smt/solver/lp/nla-intervals.ts +265 -0
- package/src/prove/smt/solver/lp/nla-monomial-bounds.ts +715 -0
- package/src/prove/smt/solver/lp/nla-monotone.ts +59 -0
- package/src/prove/smt/solver/lp/nla-order.ts +307 -0
- package/src/prove/smt/solver/lp/nla-patcher.ts +112 -0
- package/src/prove/smt/solver/lp/nla-tangents.ts +251 -0
- package/src/prove/smt/solver/lp/nla-throttle.ts +85 -0
- package/src/prove/smt/solver/lp/nla-types.ts +124 -0
- package/src/prove/smt/solver/lp/nla-var-eqs.ts +141 -0
- package/src/prove/smt/solver/lp/nra-solver.ts +440 -0
- package/src/prove/smt/solver/lp/numeric-pair.ts +65 -0
- package/src/prove/smt/solver/lp/pdd-interval.ts +31 -0
- package/src/prove/smt/solver/lp/pdd-simplifier.ts +184 -0
- package/src/prove/smt/solver/lp/pdd-solver.ts +408 -0
- package/src/prove/smt/solver/lp/pdd.ts +971 -0
- package/src/prove/smt/solver/lp/random-updater.ts +138 -0
- package/src/prove/smt/solver/lp/static-matrix.ts +246 -0
- package/src/prove/smt/solver/lp/union-find.ts +96 -0
- package/src/prove/smt/solver/mam-compiler.ts +847 -0
- package/src/prove/smt/solver/mam-interpreter.ts +400 -0
- package/src/prove/smt/solver/maximize-ac-sharing.ts +118 -0
- package/src/prove/smt/solver/model-checker.ts +347 -0
- package/src/prove/smt/solver/model-evaluator.ts +262 -0
- package/src/prove/smt/solver/model-finder.ts +155 -0
- package/src/prove/smt/solver/model-generator.ts +97 -0
- package/src/prove/smt/solver/model-macro-solver.ts +728 -0
- package/src/prove/smt/solver/nlsat/algebraic.ts +1161 -0
- package/src/prove/smt/solver/nlsat/atoms.ts +238 -0
- package/src/prove/smt/solver/nlsat/evaluator.ts +303 -0
- package/src/prove/smt/solver/nlsat/explain.ts +607 -0
- package/src/prove/smt/solver/nlsat/interval-set.ts +351 -0
- package/src/prove/smt/solver/nlsat/levelwise.ts +740 -0
- package/src/prove/smt/solver/nlsat/mpbq.ts +161 -0
- package/src/prove/smt/solver/nlsat/polynomial.ts +1722 -0
- package/src/prove/smt/solver/nlsat/solver.ts +911 -0
- package/src/prove/smt/solver/nlsat/types.ts +43 -0
- package/src/prove/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
- package/src/prove/smt/solver/nlsat/upolynomial.ts +996 -0
- package/src/prove/smt/solver/nnf.ts +469 -0
- package/src/prove/smt/solver/pattern-inference.ts +351 -0
- package/src/prove/smt/solver/poly-rewriter.ts +477 -0
- package/src/prove/smt/solver/propagate-values.ts +83 -0
- package/src/prove/smt/solver/proto-model.ts +551 -0
- package/src/prove/smt/solver/pull-quant.ts +139 -0
- package/src/prove/smt/solver/qe-lite-der.ts +526 -0
- package/src/prove/smt/solver/qe-lite-fm.ts +576 -0
- package/src/prove/smt/solver/qe-lite.ts +381 -0
- package/src/prove/smt/solver/qi-queue.ts +362 -0
- package/src/prove/smt/solver/quant-tactics.ts +117 -0
- package/src/prove/smt/solver/quantifier-analyzer.ts +562 -0
- package/src/prove/smt/solver/quantifier-manager.ts +186 -0
- package/src/prove/smt/solver/random-gen.ts +10 -0
- package/src/prove/smt/solver/rational.ts +165 -0
- package/src/prove/smt/solver/ref-vector.ts +62 -0
- package/src/prove/smt/solver/relevancy.ts +247 -0
- package/src/prove/smt/solver/rewriter-tpl.ts +1159 -0
- package/src/prove/smt/solver/rewriter.ts +843 -0
- package/src/prove/smt/solver/rlimit.ts +79 -0
- package/src/prove/smt/solver/smtlib-parser.ts +526 -0
- package/src/prove/smt/solver/solver.ts +71 -0
- package/src/prove/smt/solver/sort.ts +35 -0
- package/src/prove/smt/solver/sticky-generations.ts +69 -0
- package/src/prove/smt/solver/theory-lra-axioms.ts +340 -0
- package/src/prove/smt/solver/theory-lra-bounds.ts +226 -0
- package/src/prove/smt/solver/theory-lra-final-check.ts +252 -0
- package/src/prove/smt/solver/theory-lra-internalize.ts +476 -0
- package/src/prove/smt/solver/theory-lra-model.ts +243 -0
- package/src/prove/smt/solver/theory-lra-propagate.ts +405 -0
- package/src/prove/smt/solver/theory-lra-state.ts +43 -0
- package/src/prove/smt/solver/theory-lra.ts +56 -0
- package/src/prove/smt/solver/var-subst.ts +258 -0
- package/src/prove/smt/solver/z3-license.txt +10 -0
- package/src/prove/smt/table.ts +170 -0
- package/src/prove/tlapm/tlapm.ts +96 -0
- package/src/prove/tlaps-module.ts +510 -0
- package/src/prove/verdict.ts +13 -0
- package/src/prove/zenon/LICENSE +32 -0
- package/src/prove/zenon/check/check.ts +105 -0
- package/src/prove/zenon/check/definitions.ts +144 -0
- package/src/prove/zenon/check/equality.ts +182 -0
- package/src/prove/zenon/check/functions.ts +62 -0
- package/src/prove/zenon/check/keys.ts +125 -0
- package/src/prove/zenon/check/propositional.ts +104 -0
- package/src/prove/zenon/check/records.ts +188 -0
- package/src/prove/zenon/check/relations.ts +121 -0
- package/src/prove/zenon/check/rewrites.ts +224 -0
- package/src/prove/zenon/check/sets.ts +302 -0
- package/src/prove/zenon/check/terms.ts +127 -0
- package/src/prove/zenon/check/tla.ts +126 -0
- package/src/prove/zenon/decide.ts +113 -0
- package/src/prove/zenon/encode.ts +444 -0
- package/src/prove/zenon/eqrel.ts +300 -0
- package/src/prove/zenon/equality-rules.ts +435 -0
- package/src/prove/zenon/expr.ts +551 -0
- package/src/prove/zenon/index-table.ts +350 -0
- package/src/prove/zenon/isar-case.ts +513 -0
- package/src/prove/zenon/isar.ts +1249 -0
- package/src/prove/zenon/limits.ts +15 -0
- package/src/prove/zenon/llproof.ts +173 -0
- package/src/prove/zenon/mltoll.ts +1566 -0
- package/src/prove/zenon/node.ts +297 -0
- package/src/prove/zenon/ocaml.ts +169 -0
- package/src/prove/zenon/parse.ts +247 -0
- package/src/prove/zenon/phrase.ts +191 -0
- package/src/prove/zenon/proof.ts +198 -0
- package/src/prove/zenon/propositional-rules.ts +387 -0
- package/src/prove/zenon/rules.ts +94 -0
- package/src/prove/zenon/search.ts +288 -0
- package/src/prove/zenon/tla/functions.ts +151 -0
- package/src/prove/zenon/tla/llproof.ts +480 -0
- package/src/prove/zenon/tla/records.ts +225 -0
- package/src/prove/zenon/tla/rewrites.ts +447 -0
- package/src/prove/zenon/tla/sets.ts +304 -0
- package/src/prove/zenon/tla/terms.ts +181 -0
- package/src/prove/zenon/tla/tla.ts +506 -0
- package/src/run-cli.ts +63 -10
- package/src/worker.ts +65 -0
- package/dist/parallel.cjs +0 -12
- package/dist/parallel.js +0 -12
- /package/src/{obligation-format.ts → obligations/format.ts} +0 -0
|
@@ -0,0 +1,351 @@
|
|
|
1
|
+
// Ported from Z3 (src/ast/pattern/pattern_inference.cpp), MIT license, see z3-license.txt.
|
|
2
|
+
// Infers E-matching patterns for quantifiers that have none, with Z3's default parameters:
|
|
3
|
+
// pi.max_multi_patterns=0, pi.block_loop_patterns=true, pi.decompose_patterns=true,
|
|
4
|
+
// pi.arith=1 (conservative), pi.avoid_skolems=true.
|
|
5
|
+
import {
|
|
6
|
+
AstManager,
|
|
7
|
+
FAMILY_ARITH,
|
|
8
|
+
FAMILY_BASIC,
|
|
9
|
+
KIND_APP,
|
|
10
|
+
KIND_QUANTIFIER,
|
|
11
|
+
KIND_VAR,
|
|
12
|
+
OP_FALSE,
|
|
13
|
+
OP_IDIV,
|
|
14
|
+
OP_MOD,
|
|
15
|
+
OP_MUL,
|
|
16
|
+
OP_TRUE,
|
|
17
|
+
} from "./ast";
|
|
18
|
+
import { RefVector } from "./ref-vector";
|
|
19
|
+
import { InvVarShifter } from "./rewriter-tpl";
|
|
20
|
+
|
|
21
|
+
interface CandidateInfo {
|
|
22
|
+
freeVars: Set<number>;
|
|
23
|
+
boundVars: Set<number>;
|
|
24
|
+
size: number;
|
|
25
|
+
}
|
|
26
|
+
|
|
27
|
+
interface PrePattern {
|
|
28
|
+
exprs: number[];
|
|
29
|
+
freeVars: Set<number>;
|
|
30
|
+
index: number;
|
|
31
|
+
}
|
|
32
|
+
|
|
33
|
+
const PI_ARITH_WEIGHT = 5;
|
|
34
|
+
const PI_NON_NESTED_ARITH_WEIGHT = 10;
|
|
35
|
+
const MAX_SPLITS = 32;
|
|
36
|
+
|
|
37
|
+
const isSameSet = (left: Set<number>, right: Set<number>) =>
|
|
38
|
+
left.size === right.size && [...left].every((element) => right.has(element));
|
|
39
|
+
|
|
40
|
+
const isSubset = (left: Set<number>, right: Set<number>) =>
|
|
41
|
+
[...left].every((element) => right.has(element));
|
|
42
|
+
|
|
43
|
+
// pattern_inference_cfg, which asserted_formulas keeps as long as it lives. m_candidates holds its
|
|
44
|
+
// candidates until the end of mk_patterns.
|
|
45
|
+
export class PatternInference {
|
|
46
|
+
private candidates: RefVector;
|
|
47
|
+
private candidateInfos = new Map<number, CandidateInfo>();
|
|
48
|
+
private numBindings = 0;
|
|
49
|
+
private isArithForbidden = true;
|
|
50
|
+
private isNestedArithOnly = true;
|
|
51
|
+
private isBlockingLoopPatterns = true;
|
|
52
|
+
|
|
53
|
+
constructor(private manager: AstManager) {
|
|
54
|
+
this.candidates = new RefVector(manager);
|
|
55
|
+
}
|
|
56
|
+
|
|
57
|
+
private isForbidden(expr: number) {
|
|
58
|
+
const manager = this.manager;
|
|
59
|
+
if (manager.isGround(expr)) return false;
|
|
60
|
+
const decl = manager.funcDecls[manager.decls[expr]];
|
|
61
|
+
if (decl.isSkolem) return true;
|
|
62
|
+
if (decl.family === FAMILY_BASIC) return decl.op !== OP_TRUE && decl.op !== OP_FALSE;
|
|
63
|
+
return decl.family === FAMILY_ARITH && this.isArithForbidden;
|
|
64
|
+
}
|
|
65
|
+
|
|
66
|
+
private collect(body: number) {
|
|
67
|
+
const manager = this.manager;
|
|
68
|
+
const cache = new Map<string, CandidateInfo | null>();
|
|
69
|
+
const visit = (expr: number, delta: number): CandidateInfo | null => {
|
|
70
|
+
const key = `${expr}:${delta}`;
|
|
71
|
+
if (cache.has(key)) return cache.get(key) ?? null;
|
|
72
|
+
let info: CandidateInfo | null = null;
|
|
73
|
+
const kind = manager.kinds[expr];
|
|
74
|
+
if (kind === KIND_VAR) {
|
|
75
|
+
const index = manager.values[expr];
|
|
76
|
+
const freeVars = new Set<number>();
|
|
77
|
+
const boundVars = new Set<number>();
|
|
78
|
+
if (delta <= index && index < this.numBindings + delta) freeVars.add(index - delta);
|
|
79
|
+
else if (index < delta) boundVars.add(index);
|
|
80
|
+
info = { freeVars, boundVars, size: 1 };
|
|
81
|
+
} else if (kind === KIND_APP) {
|
|
82
|
+
const childInfos = manager.mapArgs(expr, (innerArg) => visit(innerArg, delta));
|
|
83
|
+
if (this.isForbidden(expr)) info = null;
|
|
84
|
+
else if (manager.getNumArgs(expr) === 0)
|
|
85
|
+
info = { freeVars: new Set(), boundVars: new Set(), size: 1 };
|
|
86
|
+
else if (childInfos.every((childInfo) => childInfo !== null)) {
|
|
87
|
+
const freeVars = new Set<number>();
|
|
88
|
+
const boundVars = new Set<number>();
|
|
89
|
+
let size = 1;
|
|
90
|
+
for (const childInfo of childInfos) {
|
|
91
|
+
if (childInfo === null) continue;
|
|
92
|
+
childInfo.freeVars.forEach((element) => freeVars.add(element));
|
|
93
|
+
childInfo.boundVars.forEach((element) => boundVars.add(element));
|
|
94
|
+
size += childInfo.size;
|
|
95
|
+
}
|
|
96
|
+
info = { freeVars, boundVars, size };
|
|
97
|
+
const decl = manager.funcDecls[manager.decls[expr]];
|
|
98
|
+
const isArithCandidate =
|
|
99
|
+
!this.isNestedArithOnly &&
|
|
100
|
+
(decl.op === OP_IDIV || decl.op === OP_MOD || decl.op === OP_MUL);
|
|
101
|
+
if (
|
|
102
|
+
freeVars.size > 0 &&
|
|
103
|
+
boundVars.size === 0 &&
|
|
104
|
+
(decl.family !== FAMILY_ARITH || isArithCandidate)
|
|
105
|
+
) {
|
|
106
|
+
const shifter = new InvVarShifter(manager);
|
|
107
|
+
const candidate = manager.withoutTemporaries(() => shifter.shift(expr, delta));
|
|
108
|
+
this.addCandidate(candidate, freeVars, size);
|
|
109
|
+
manager.decRef(candidate);
|
|
110
|
+
shifter.release();
|
|
111
|
+
}
|
|
112
|
+
}
|
|
113
|
+
} else if (kind === KIND_QUANTIFIER) {
|
|
114
|
+
const data = manager.getQuantifier(expr);
|
|
115
|
+
const count = data.sorts.length;
|
|
116
|
+
const bodyInfo = visit(data.body, delta + count);
|
|
117
|
+
if (bodyInfo !== null) {
|
|
118
|
+
const boundVars = new Set<number>();
|
|
119
|
+
bodyInfo.boundVars.forEach((element) => {
|
|
120
|
+
if (element >= count) boundVars.add(element - count);
|
|
121
|
+
});
|
|
122
|
+
info = { freeVars: bodyInfo.freeVars, boundVars, size: bodyInfo.size + 1 };
|
|
123
|
+
}
|
|
124
|
+
}
|
|
125
|
+
cache.set(key, info);
|
|
126
|
+
return info;
|
|
127
|
+
};
|
|
128
|
+
visit(body, 0);
|
|
129
|
+
}
|
|
130
|
+
|
|
131
|
+
private addCandidate(expr: number, freeVars: Set<number>, size: number) {
|
|
132
|
+
if (this.candidateInfos.has(expr)) return;
|
|
133
|
+
this.candidateInfos.set(expr, { freeVars, boundVars: new Set(), size });
|
|
134
|
+
this.candidates.push(expr);
|
|
135
|
+
}
|
|
136
|
+
|
|
137
|
+
// smaller_pattern: whether second is an instance of first.
|
|
138
|
+
private isSmaller(first: number, second: number) {
|
|
139
|
+
const manager = this.manager;
|
|
140
|
+
const bindings = Array.from({ length: this.numBindings }, () => -1);
|
|
141
|
+
const todo: [number, number][] = [[first, second]];
|
|
142
|
+
while (todo.length > 0) {
|
|
143
|
+
const pair = todo.pop();
|
|
144
|
+
if (pair === undefined) break;
|
|
145
|
+
const left = pair[0];
|
|
146
|
+
const right = pair[1];
|
|
147
|
+
const kind = manager.kinds[left];
|
|
148
|
+
if (kind === KIND_APP) {
|
|
149
|
+
if (
|
|
150
|
+
manager.kinds[right] !== KIND_APP ||
|
|
151
|
+
manager.decls[left] !== manager.decls[right] ||
|
|
152
|
+
manager.getNumArgs(left) !== manager.getNumArgs(right) ||
|
|
153
|
+
manager.values[left] !== manager.values[right]
|
|
154
|
+
)
|
|
155
|
+
return false;
|
|
156
|
+
for (let index = 0; index < manager.getNumArgs(left); index++)
|
|
157
|
+
todo.push([manager.getArg(left, index), manager.getArg(right, index)]);
|
|
158
|
+
} else if (kind === KIND_VAR && manager.values[left] < this.numBindings) {
|
|
159
|
+
const index = manager.values[left];
|
|
160
|
+
if (bindings[index] === -1) bindings[index] = right;
|
|
161
|
+
else if (bindings[index] !== right) return false;
|
|
162
|
+
} else if (left !== right) return false;
|
|
163
|
+
}
|
|
164
|
+
return true;
|
|
165
|
+
}
|
|
166
|
+
|
|
167
|
+
private filterLoopingPatterns() {
|
|
168
|
+
const result: number[] = [];
|
|
169
|
+
for (const first of this.candidates.items) {
|
|
170
|
+
const firstInfo = this.candidateInfos.get(first);
|
|
171
|
+
if (firstInfo === undefined) continue;
|
|
172
|
+
const isLooping =
|
|
173
|
+
this.isBlockingLoopPatterns &&
|
|
174
|
+
this.candidates.items.some((second) => {
|
|
175
|
+
if (second === first) return false;
|
|
176
|
+
const secondInfo = this.candidateInfos.get(second);
|
|
177
|
+
return (
|
|
178
|
+
secondInfo !== undefined &&
|
|
179
|
+
isSameSet(firstInfo.freeVars, secondInfo.freeVars) &&
|
|
180
|
+
this.isSmaller(first, second) &&
|
|
181
|
+
!this.isSmaller(second, first)
|
|
182
|
+
);
|
|
183
|
+
});
|
|
184
|
+
if (isLooping) this.candidateInfos.delete(first);
|
|
185
|
+
else result.push(first);
|
|
186
|
+
}
|
|
187
|
+
return result;
|
|
188
|
+
}
|
|
189
|
+
|
|
190
|
+
private containsSubpattern(expr: number) {
|
|
191
|
+
const manager = this.manager;
|
|
192
|
+
const info = this.candidateInfos.get(expr);
|
|
193
|
+
if (info === undefined) return false;
|
|
194
|
+
const visited = new Set<number>([expr]);
|
|
195
|
+
const todo = [expr];
|
|
196
|
+
while (todo.length > 0) {
|
|
197
|
+
const current = todo.pop();
|
|
198
|
+
if (current === undefined) break;
|
|
199
|
+
if (manager.kinds[current] !== KIND_APP) continue;
|
|
200
|
+
if (current !== expr) {
|
|
201
|
+
const currentInfo = this.candidateInfos.get(current);
|
|
202
|
+
if (currentInfo !== undefined && isSameSet(currentInfo.freeVars, info.freeVars))
|
|
203
|
+
return true;
|
|
204
|
+
}
|
|
205
|
+
for (let index = 0; index < manager.getNumArgs(current); index++) {
|
|
206
|
+
const arg = manager.getArg(current, index);
|
|
207
|
+
if (!visited.has(arg)) {
|
|
208
|
+
visited.add(arg);
|
|
209
|
+
todo.push(arg);
|
|
210
|
+
}
|
|
211
|
+
}
|
|
212
|
+
}
|
|
213
|
+
return false;
|
|
214
|
+
}
|
|
215
|
+
|
|
216
|
+
private mkPattern(candidate: number) {
|
|
217
|
+
const manager = this.manager;
|
|
218
|
+
const hasVarArg = (expr: number) =>
|
|
219
|
+
manager.kinds[expr] === KIND_APP &&
|
|
220
|
+
manager.someArg(expr, (innerArg) => manager.isVar(innerArg));
|
|
221
|
+
if (hasVarArg(candidate)) return manager.mkPattern([candidate]);
|
|
222
|
+
const args: number[] = [];
|
|
223
|
+
for (let index = 0; index < manager.getNumArgs(candidate); index++) {
|
|
224
|
+
const arg = manager.getArg(candidate, index);
|
|
225
|
+
if (manager.kinds[arg] !== KIND_APP) return manager.mkPattern([candidate]);
|
|
226
|
+
args.push(arg);
|
|
227
|
+
}
|
|
228
|
+
for (let index = 0; index < args.length; index++) {
|
|
229
|
+
const arg = args[index];
|
|
230
|
+
if (hasVarArg(arg)) continue;
|
|
231
|
+
args[index] = args[args.length - 1];
|
|
232
|
+
index--;
|
|
233
|
+
args.pop();
|
|
234
|
+
if (manager.isGround(arg)) continue;
|
|
235
|
+
for (let argIndex = 0; argIndex < manager.getNumArgs(arg); argIndex++) {
|
|
236
|
+
const innerArg = manager.getArg(arg, argIndex);
|
|
237
|
+
if (manager.kinds[innerArg] !== KIND_APP) return manager.mkPattern([candidate]);
|
|
238
|
+
args.push(innerArg);
|
|
239
|
+
}
|
|
240
|
+
}
|
|
241
|
+
return manager.mkPattern(args);
|
|
242
|
+
}
|
|
243
|
+
|
|
244
|
+
private candidatesToMultiPatterns(maxPatterns: number, candidates: number[], result: number[]) {
|
|
245
|
+
const prePatterns: (PrePattern | null)[] = [{ exprs: [], freeVars: new Set(), index: 0 }];
|
|
246
|
+
let numSplits = 0;
|
|
247
|
+
for (let index = 0; index < prePatterns.length; index++) {
|
|
248
|
+
const current = prePatterns[index];
|
|
249
|
+
if (current === null) continue;
|
|
250
|
+
if (current.freeVars.size === this.numBindings) {
|
|
251
|
+
result.push(this.manager.mkPattern(current.exprs));
|
|
252
|
+
if (result.length >= maxPatterns) return;
|
|
253
|
+
} else if (current.index < candidates.length) {
|
|
254
|
+
const candidate = candidates[current.index];
|
|
255
|
+
const candidateFreeVars = this.candidateInfos.get(candidate)?.freeVars ?? new Set<number>();
|
|
256
|
+
if (!isSubset(candidateFreeVars, current.freeVars)) {
|
|
257
|
+
prePatterns.push({
|
|
258
|
+
exprs: [...current.exprs, candidate],
|
|
259
|
+
freeVars: new Set([...current.freeVars, ...candidateFreeVars]),
|
|
260
|
+
index: current.index + 1,
|
|
261
|
+
});
|
|
262
|
+
if (numSplits < MAX_SPLITS) {
|
|
263
|
+
prePatterns[index] = null;
|
|
264
|
+
current.index++;
|
|
265
|
+
prePatterns.push(current);
|
|
266
|
+
numSplits++;
|
|
267
|
+
}
|
|
268
|
+
} else {
|
|
269
|
+
prePatterns[index] = null;
|
|
270
|
+
current.index++;
|
|
271
|
+
prePatterns.push(current);
|
|
272
|
+
}
|
|
273
|
+
}
|
|
274
|
+
}
|
|
275
|
+
}
|
|
276
|
+
|
|
277
|
+
private mkPatterns(numBindings: number, body: number) {
|
|
278
|
+
this.numBindings = numBindings;
|
|
279
|
+
this.collect(body);
|
|
280
|
+
const result: number[] = [];
|
|
281
|
+
if (this.candidates.size > 0) {
|
|
282
|
+
const looseCandidates = this.filterLoopingPatterns().filter(
|
|
283
|
+
(candidate) => !this.containsSubpattern(candidate),
|
|
284
|
+
);
|
|
285
|
+
// m_tmp1: the candidates that do not cover every variable, which may form a multi-pattern.
|
|
286
|
+
const partialCandidates: number[] = [];
|
|
287
|
+
for (const candidate of looseCandidates) {
|
|
288
|
+
const info = this.candidateInfos.get(candidate);
|
|
289
|
+
if (info !== undefined && info.freeVars.size === numBindings)
|
|
290
|
+
result.push(this.mkPattern(candidate));
|
|
291
|
+
else partialCandidates.push(candidate);
|
|
292
|
+
}
|
|
293
|
+
const numExtraMultiPatterns = result.length === 0 ? 1 : 0;
|
|
294
|
+
if (numExtraMultiPatterns > 0 && partialCandidates.length > 0) {
|
|
295
|
+
// std::stable_sort with m_pattern_weight_lt.
|
|
296
|
+
const weightOf = (candidate: number) => this.candidateInfos.get(candidate);
|
|
297
|
+
const sorted = partialCandidates
|
|
298
|
+
.map((candidate, index) => ({ candidate, index }))
|
|
299
|
+
.sort((left, right) => {
|
|
300
|
+
const leftInfo = weightOf(left.candidate);
|
|
301
|
+
const rightInfo = weightOf(right.candidate);
|
|
302
|
+
if (leftInfo === undefined || rightInfo === undefined) return left.index - right.index;
|
|
303
|
+
if (leftInfo.freeVars.size !== rightInfo.freeVars.size)
|
|
304
|
+
return rightInfo.freeVars.size - leftInfo.freeVars.size;
|
|
305
|
+
if (leftInfo.size !== rightInfo.size) return leftInfo.size - rightInfo.size;
|
|
306
|
+
return left.index - right.index;
|
|
307
|
+
})
|
|
308
|
+
.map((entry) => entry.candidate);
|
|
309
|
+
this.candidatesToMultiPatterns(numExtraMultiPatterns, sorted, result);
|
|
310
|
+
}
|
|
311
|
+
}
|
|
312
|
+
this.candidateInfos = new Map();
|
|
313
|
+
this.candidates.reset();
|
|
314
|
+
return result;
|
|
315
|
+
}
|
|
316
|
+
|
|
317
|
+
// reduce_quantifier for a quantifier without patterns: arithmetic, then looping and non-nested
|
|
318
|
+
// arithmetic patterns, are allowed when no pattern is found without them.
|
|
319
|
+
infer(numBindings: number, body: number, weight: number): InferredPatterns {
|
|
320
|
+
this.isArithForbidden = true;
|
|
321
|
+
this.isNestedArithOnly = true;
|
|
322
|
+
this.isBlockingLoopPatterns = true;
|
|
323
|
+
const patterns = this.mkPatterns(numBindings, body);
|
|
324
|
+
if (patterns.length > 0) return { patterns, weight };
|
|
325
|
+
this.isArithForbidden = false;
|
|
326
|
+
this.isBlockingLoopPatterns = false;
|
|
327
|
+
const arithPatterns = this.mkPatterns(numBindings, body);
|
|
328
|
+
if (arithPatterns.length > 0)
|
|
329
|
+
return { patterns: arithPatterns, weight: Math.max(weight, PI_ARITH_WEIGHT) };
|
|
330
|
+
this.isNestedArithOnly = false;
|
|
331
|
+
const nonNestedPatterns = this.mkPatterns(numBindings, body);
|
|
332
|
+
return {
|
|
333
|
+
patterns: nonNestedPatterns,
|
|
334
|
+
weight: nonNestedPatterns.length > 0 ? Math.max(weight, PI_NON_NESTED_ARITH_WEIGHT) : weight,
|
|
335
|
+
};
|
|
336
|
+
}
|
|
337
|
+
|
|
338
|
+
// The patterns of a quantifier that pull_quant changed, found once with the settings that infer
|
|
339
|
+
// restores: arithmetic is allowed, but only nested, and looping patterns are blocked.
|
|
340
|
+
inferPulled(numBindings: number, body: number) {
|
|
341
|
+
this.isArithForbidden = false;
|
|
342
|
+
this.isNestedArithOnly = true;
|
|
343
|
+
this.isBlockingLoopPatterns = true;
|
|
344
|
+
return this.mkPatterns(numBindings, body);
|
|
345
|
+
}
|
|
346
|
+
}
|
|
347
|
+
|
|
348
|
+
export interface InferredPatterns {
|
|
349
|
+
patterns: number[];
|
|
350
|
+
weight: number;
|
|
351
|
+
}
|