tla-ts 0.0.4-dev.0be9567 → 0.0.4-dev.43f28be
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 +27 -141
- 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 +996 -0
- package/dist/prove.js +996 -0
- package/dist/run-cli.cjs +517 -47
- package/dist/run-cli.js +517 -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/check.ts +1 -0
- package/src/errors.ts +86 -0
- package/src/evaluate.ts +54 -19
- 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-format.ts → obligations/format.ts} +6 -5
- package/src/{obligation-generate.ts → obligations/generate.ts} +134 -61
- package/src/{obligations.ts → obligations/index.ts} +28 -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} +9 -63
- 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/ocaml-marshal.ts +166 -0
- 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 +33 -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 +508 -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 +33 -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 +27 -0
- package/src/prove/prove.ts +518 -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 +97 -0
- package/src/prove/tlaps-module.ts +510 -0
- package/src/prove/verdict.ts +18 -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 +338 -62
- package/src/successors.ts +24 -5
- package/src/tlapm-cache.ts +244 -0
- package/src/tlc-random.ts +55 -32
- package/src/tlc-version.ts +8 -7
- package/src/values.ts +47 -4
- package/src/worker.ts +65 -0
- package/dist/parallel.cjs +0 -12
- package/dist/parallel.js +0 -12
|
@@ -0,0 +1,155 @@
|
|
|
1
|
+
// Ported from Z3 (src/smt/smt_model_finder.cpp), MIT license, see z3-license.txt. Completes the
|
|
2
|
+
// model of the ground formulas so that it may satisfy the universal quantifiers, following
|
|
3
|
+
// "Complete instantiation for quantified SMT formulas": the quantifier analyzer collects how the
|
|
4
|
+
// variables occur, and the AUF solver gives each group of argument positions and variables a
|
|
5
|
+
// projection function onto its instantiation set.
|
|
6
|
+
import { OP_OR, SORT_BOOL, type AstManager } from "./ast";
|
|
7
|
+
import type { Context } from "./context";
|
|
8
|
+
import { L_TRUE } from "./lbool";
|
|
9
|
+
import { solveMacros } from "./model-macro-solver";
|
|
10
|
+
import type { ProtoModel } from "./proto-model";
|
|
11
|
+
import { Rewriter, TACTIC_REWRITER_OPTIONS } from "./rewriter";
|
|
12
|
+
import { AufSolver } from "./auf-solver";
|
|
13
|
+
import { MBQI_FORCE_TEMPLATE, QuantifierAnalyzer, QuantifierInfo } from "./quantifier-analyzer";
|
|
14
|
+
import { RefVector } from "./ref-vector";
|
|
15
|
+
import { shrink } from "./array";
|
|
16
|
+
|
|
17
|
+
export class ModelFinder {
|
|
18
|
+
private q2info = new Map<number, QuantifierInfo>();
|
|
19
|
+
private quantifiers: number[] = [];
|
|
20
|
+
private scopes: number[] = [];
|
|
21
|
+
private rewriter: Rewriter;
|
|
22
|
+
// m_mutil of quantifier_analyzer: macro_util's rewriting, kept apart from the rewriter above so that
|
|
23
|
+
// its last result is never released early.
|
|
24
|
+
private macroRewriter: Rewriter;
|
|
25
|
+
readonly aufSolver: AufSolver;
|
|
26
|
+
private newConstraints: number[] = [];
|
|
27
|
+
|
|
28
|
+
constructor(
|
|
29
|
+
private manager: AstManager,
|
|
30
|
+
private context: Context,
|
|
31
|
+
) {
|
|
32
|
+
this.rewriter = new Rewriter(manager, TACTIC_REWRITER_OPTIONS);
|
|
33
|
+
this.macroRewriter = new Rewriter(manager, TACTIC_REWRITER_OPTIONS);
|
|
34
|
+
this.aufSolver = new AufSolver(manager, this.rewriter);
|
|
35
|
+
}
|
|
36
|
+
|
|
37
|
+
getQuantifierInfo(quantifier: number) {
|
|
38
|
+
return this.q2info.get(quantifier) ?? this.registerQuantifier(quantifier);
|
|
39
|
+
}
|
|
40
|
+
|
|
41
|
+
registerQuantifier(quantifier: number) {
|
|
42
|
+
const info = new QuantifierInfo(this.manager, this.context, quantifier, this.macroRewriter);
|
|
43
|
+
this.q2info.set(quantifier, info);
|
|
44
|
+
this.quantifiers.push(quantifier);
|
|
45
|
+
new QuantifierAnalyzer(this.manager, this.rewriter, info).analyze();
|
|
46
|
+
return info;
|
|
47
|
+
}
|
|
48
|
+
|
|
49
|
+
pushScope() {
|
|
50
|
+
this.scopes.push(this.quantifiers.length);
|
|
51
|
+
}
|
|
52
|
+
|
|
53
|
+
popScope(numScopes: number) {
|
|
54
|
+
const limit = this.scopes[this.scopes.length - numScopes];
|
|
55
|
+
for (let index = limit; index < this.quantifiers.length; index++) {
|
|
56
|
+
this.q2info.get(this.quantifiers[index])?.release();
|
|
57
|
+
this.q2info.delete(this.quantifiers[index]);
|
|
58
|
+
}
|
|
59
|
+
shrink(this.quantifiers, limit);
|
|
60
|
+
shrink(this.scopes, this.scopes.length - numScopes);
|
|
61
|
+
}
|
|
62
|
+
|
|
63
|
+
// fix_model: tries to satisfy the relevant quantifiers by changing the model while keeping the
|
|
64
|
+
// ground formulas satisfied.
|
|
65
|
+
fixModel(model: ProtoModel) {
|
|
66
|
+
const context = this.context;
|
|
67
|
+
if (this.quantifiers.length === 0) return;
|
|
68
|
+
const quantifiers = this.quantifiers.filter(
|
|
69
|
+
(quantifier) =>
|
|
70
|
+
context.isRelevant(quantifier) &&
|
|
71
|
+
context.getAssignment(context.getLiteral(quantifier)) === L_TRUE,
|
|
72
|
+
);
|
|
73
|
+
if (quantifiers.length === 0) return;
|
|
74
|
+
for (const quantifier of quantifiers) this.getQuantifierInfo(quantifier).resetTheOne();
|
|
75
|
+
const residue = solveMacros(
|
|
76
|
+
this.manager,
|
|
77
|
+
model,
|
|
78
|
+
quantifiers,
|
|
79
|
+
(quantifier) => this.getQuantifierInfo(quantifier),
|
|
80
|
+
MBQI_FORCE_TEMPLATE,
|
|
81
|
+
);
|
|
82
|
+
const solver = this.aufSolver;
|
|
83
|
+
solver.reset();
|
|
84
|
+
solver.setModel(model);
|
|
85
|
+
for (const quantifier of residue) this.getQuantifierInfo(quantifier).processAuf(solver);
|
|
86
|
+
solver.mkInstantiationSets();
|
|
87
|
+
for (const quantifier of residue) this.getQuantifierInfo(quantifier).populateInstSets(solver);
|
|
88
|
+
solver.fixModel(this.newConstraints);
|
|
89
|
+
}
|
|
90
|
+
|
|
91
|
+
getFlatQuantifier(quantifier: number) {
|
|
92
|
+
return this.getQuantifierInfo(quantifier).flatQ;
|
|
93
|
+
}
|
|
94
|
+
|
|
95
|
+
// get_uvar_inst_set: the set of variable index of the quantifier before flattening.
|
|
96
|
+
getUvarInstSet(quantifier: number, index: number) {
|
|
97
|
+
const manager = this.manager;
|
|
98
|
+
const flatQ = this.getFlatQuantifier(quantifier);
|
|
99
|
+
const offset =
|
|
100
|
+
manager.getQuantifier(flatQ).sorts.length - manager.getQuantifier(quantifier).sorts.length;
|
|
101
|
+
const set = this.aufSolver.getUvarInstSet(flatQ, offset + index);
|
|
102
|
+
if (set !== null) return set;
|
|
103
|
+
return this.getQuantifierInfo(quantifier).getMacroBasedInstSet(index, (expr) =>
|
|
104
|
+
this.aufSolver.eval(expr, true),
|
|
105
|
+
);
|
|
106
|
+
}
|
|
107
|
+
|
|
108
|
+
// get_inv: a term of the instantiation set whose value is value.
|
|
109
|
+
getInv(quantifier: number, index: number, value: number, model: ProtoModel) {
|
|
110
|
+
const set = this.getUvarInstSet(quantifier, index);
|
|
111
|
+
if (set === null) return null;
|
|
112
|
+
const term = set.getInv(value, model);
|
|
113
|
+
if (term !== undefined && this.aufSolver.isDefaultRepresentative(term))
|
|
114
|
+
return { term: value, generation: 0 };
|
|
115
|
+
return term === undefined ? null : { term, generation: set.getGeneration(term) };
|
|
116
|
+
}
|
|
117
|
+
|
|
118
|
+
// restrict_sks_to_inst_set: each Skolem constant must take the value of a term in its set.
|
|
119
|
+
restrictSksToInstSet(quantifier: number, sks: number[], assert: (expr: number) => void) {
|
|
120
|
+
const manager = this.manager;
|
|
121
|
+
const numDecls = manager.getQuantifier(quantifier).sorts.length;
|
|
122
|
+
let isAsserted = false;
|
|
123
|
+
for (let index = 0; index < numDecls; index++) {
|
|
124
|
+
const sk = sks[sks.length - index - 1];
|
|
125
|
+
const set = this.getUvarInstSet(quantifier, index);
|
|
126
|
+
if (set === null || set.inv.size === 0) continue;
|
|
127
|
+
// eqs and new_cnstr hold their terms until the restriction is asserted. ast_manager::mk_or keeps
|
|
128
|
+
// a single disjunct in an or.
|
|
129
|
+
const eqs = new RefVector(manager);
|
|
130
|
+
for (const value of set.inv.keys())
|
|
131
|
+
if (manager.sorts[value] === manager.sorts[sk]) eqs.push(manager.mkEq(sk, value));
|
|
132
|
+
if (eqs.size > 0) {
|
|
133
|
+
const constraint = manager.mkApp(OP_OR, eqs.items, SORT_BOOL);
|
|
134
|
+
manager.incRef(constraint);
|
|
135
|
+
assert(constraint);
|
|
136
|
+
manager.decRef(constraint);
|
|
137
|
+
isAsserted = true;
|
|
138
|
+
}
|
|
139
|
+
eqs.reset();
|
|
140
|
+
}
|
|
141
|
+
return isAsserted;
|
|
142
|
+
}
|
|
143
|
+
|
|
144
|
+
// restart_eh: the constraints of the last model become axioms.
|
|
145
|
+
restartEh() {
|
|
146
|
+
const context = this.context;
|
|
147
|
+
for (const constraint of this.newConstraints) {
|
|
148
|
+
context.internalize(constraint, true);
|
|
149
|
+
const literal = context.getLiteral(constraint);
|
|
150
|
+
context.markLiteralAsRelevant(literal);
|
|
151
|
+
context.assign(literal, "axiom");
|
|
152
|
+
}
|
|
153
|
+
this.newConstraints = [];
|
|
154
|
+
}
|
|
155
|
+
}
|
|
@@ -0,0 +1,97 @@
|
|
|
1
|
+
// Ported from Z3 (src/smt/smt_model_generator.cpp), MIT license, see z3-license.txt. Builds a
|
|
2
|
+
// model from the current assignment: every relevant equivalence class gets a value, Booleans from
|
|
3
|
+
// the assignment, integers from the arithmetic theory and other sorts from fresh model values, and
|
|
4
|
+
// each congruence root of an uninterpreted function becomes an entry of its interpretation.
|
|
5
|
+
import {
|
|
6
|
+
FAMILY_MODEL_VALUE,
|
|
7
|
+
FAMILY_USER,
|
|
8
|
+
type FuncDecl,
|
|
9
|
+
OP_DIV0,
|
|
10
|
+
OP_IDIV0,
|
|
11
|
+
OP_MOD0,
|
|
12
|
+
SORT_BOOL,
|
|
13
|
+
isArithSort,
|
|
14
|
+
} from "./ast";
|
|
15
|
+
import type { Context } from "./context";
|
|
16
|
+
import type { Enode } from "./enode";
|
|
17
|
+
import { FuncInterp, ProtoModel } from "./proto-model";
|
|
18
|
+
|
|
19
|
+
export interface GeneratedModel {
|
|
20
|
+
model: ProtoModel;
|
|
21
|
+
root2value: Map<Enode, number>;
|
|
22
|
+
}
|
|
23
|
+
|
|
24
|
+
// include_func_interp: the model interprets uninterpreted functions, theory_lra's divisions by zero,
|
|
25
|
+
// and the decls of a family without a theory, such as model values, which stand for themselves.
|
|
26
|
+
const isIncludedFuncInterp = (decl: FuncDecl) =>
|
|
27
|
+
decl.family === FAMILY_USER ||
|
|
28
|
+
decl.family === FAMILY_MODEL_VALUE ||
|
|
29
|
+
decl.op === OP_DIV0 ||
|
|
30
|
+
decl.op === OP_IDIV0 ||
|
|
31
|
+
decl.op === OP_MOD0;
|
|
32
|
+
|
|
33
|
+
export const mkModel = (context: Context): GeneratedModel => {
|
|
34
|
+
const manager = context.manager;
|
|
35
|
+
const model = new ProtoModel(manager);
|
|
36
|
+
context.theory?.initModel(model);
|
|
37
|
+
// register_existing_model_values.
|
|
38
|
+
for (const node of context.enodes)
|
|
39
|
+
if (node.root === node && context.isRelevant(node.owner) && manager.isModelValue(node.owner))
|
|
40
|
+
model.registerValue(node.owner);
|
|
41
|
+
// mk_bool_model.
|
|
42
|
+
for (let boolVar = 0; boolVar < context.numBoolVars; boolVar++) {
|
|
43
|
+
const expr = context.boolVar2Expr[boolVar];
|
|
44
|
+
if (manager.isUninterpretedConst(expr) && context.isRelevant(expr))
|
|
45
|
+
model.registerConst(
|
|
46
|
+
manager.decls[expr],
|
|
47
|
+
context.findAssignment(expr) > 0 ? manager.trueExpr : manager.falseExpr,
|
|
48
|
+
);
|
|
49
|
+
}
|
|
50
|
+
// mk_values: the values of the arithmetic classes that the theory does not know are fresh, so
|
|
51
|
+
// they come after all the other values. Like Z3, that includes the class of a numeral without a
|
|
52
|
+
// theory variable, such as a coefficient.
|
|
53
|
+
const root2value = new Map<Enode, number>();
|
|
54
|
+
const freshRoots: Enode[] = [];
|
|
55
|
+
for (const node of context.enodes) {
|
|
56
|
+
if (node.root !== node) continue;
|
|
57
|
+
const expr = node.owner;
|
|
58
|
+
if (!context.isRelevant(expr) && !manager.isUniqueValue(expr)) continue;
|
|
59
|
+
const sort = manager.sorts[expr];
|
|
60
|
+
if (sort === SORT_BOOL)
|
|
61
|
+
root2value.set(node, context.findAssignment(expr) > 0 ? manager.trueExpr : manager.falseExpr);
|
|
62
|
+
else if (manager.isUniqueValue(expr) && !isArithSort(sort)) root2value.set(node, expr);
|
|
63
|
+
else if (isArithSort(sort)) {
|
|
64
|
+
const value = context.theory?.mkValue(node);
|
|
65
|
+
if (value === undefined) freshRoots.push(node);
|
|
66
|
+
else root2value.set(node, value);
|
|
67
|
+
} else root2value.set(node, model.getFreshValue(sort) ?? model.getSomeValue(sort));
|
|
68
|
+
}
|
|
69
|
+
for (const value of root2value.values()) model.registerValue(value);
|
|
70
|
+
for (const node of freshRoots) {
|
|
71
|
+
const sort = manager.sorts[node.owner];
|
|
72
|
+
root2value.set(node, model.getFreshValue(sort) ?? model.getSomeValue(sort));
|
|
73
|
+
}
|
|
74
|
+
const getValue = (node: Enode) =>
|
|
75
|
+
root2value.get(node.root) ?? model.getSomeValue(manager.sorts[node.owner]);
|
|
76
|
+
for (const node of context.enodes)
|
|
77
|
+
if (manager.isUninterpretedConst(node.owner) && context.isRelevant(node.owner))
|
|
78
|
+
model.registerConst(manager.decls[node.owner], getValue(node));
|
|
79
|
+
// mk_func_interps.
|
|
80
|
+
for (const node of context.enodes) {
|
|
81
|
+
const expr = node.owner;
|
|
82
|
+
if (!context.isRelevant(expr) || !isIncludedFuncInterp(manager.funcDecls[node.decl])) continue;
|
|
83
|
+
if (node.numArgs === 0) {
|
|
84
|
+
model.registerConst(node.decl, getValue(node));
|
|
85
|
+
continue;
|
|
86
|
+
}
|
|
87
|
+
if (node.cg !== node) continue;
|
|
88
|
+
let interp = model.funcInterps.get(node.decl);
|
|
89
|
+
if (interp === undefined) {
|
|
90
|
+
interp = new FuncInterp(manager, node.numArgs);
|
|
91
|
+
model.registerFunc(node.decl, interp);
|
|
92
|
+
}
|
|
93
|
+
const args = Array.from({ length: node.numArgs }, (_, index) => getValue(node.getArg(index)));
|
|
94
|
+
if (interp.getEntry(args) === undefined) interp.insertNewEntry(args, getValue(node));
|
|
95
|
+
}
|
|
96
|
+
return { model, root2value };
|
|
97
|
+
};
|