tla-ts 0.0.9 → 0.0.10-dev.06b481ee0
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 +30 -1
- package/dist/compile.cjs +23 -0
- package/dist/compile.js +23 -0
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +48 -44
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +122 -12
- package/dist/index.d.ts +122 -12
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +2746 -410
- package/dist/prove.js +2745 -409
- package/dist/run.cjs +144 -31
- package/dist/run.js +144 -31
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +134 -104
- package/dist/transfer.js +134 -104
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +3 -1
- package/src/ast.ts +56 -60
- package/src/bags.ts +128 -110
- package/src/builtins.ts +31 -77
- package/src/bundled-modules.ts +1 -8
- package/src/check-failure.ts +118 -0
- package/src/check-trace.ts +320 -0
- package/src/check.ts +1156 -888
- package/src/cli/options.ts +12 -32
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +100 -0
- package/src/cli/shared.ts +19 -12
- package/src/cli/tlapm.ts +433 -82
- package/src/cli/tlc-arguments.ts +652 -0
- package/src/cli/tlc-output.ts +701 -0
- package/src/cli/tlc-usage.ts +360 -0
- package/src/cli/tlc.ts +330 -659
- package/src/cli/typescript.ts +23 -0
- package/src/cli/xml-exporter.ts +27 -49
- package/src/cli.ts +0 -1
- package/src/codegen.ts +217 -82
- package/src/config.ts +140 -109
- package/src/coverage.ts +1019 -0
- package/src/dependencies.ts +101 -66
- package/src/dfid.ts +683 -0
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +263 -370
- package/src/errors.ts +107 -57
- package/src/evaluate.ts +898 -369
- package/src/exit-codes.ts +63 -13
- package/src/fingerprints.ts +75 -11
- package/src/index.ts +3 -0
- package/src/instances.ts +137 -22
- package/src/java-hash.ts +21 -0
- package/src/java-overrides.ts +6 -21
- package/src/json-reader.ts +455 -0
- package/src/json.ts +252 -139
- package/src/levels.ts +231 -154
- package/src/lexer.ts +83 -101
- package/src/liveness-checker.ts +743 -322
- package/src/liveness.ts +230 -133
- package/src/obligations/action.ts +17 -44
- package/src/obligations/anonymize.ts +120 -95
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +37 -26
- package/src/obligations/format.ts +0 -10
- package/src/obligations/generate.ts +66 -64
- package/src/obligations/index.ts +39 -20
- package/src/obligations/levels.ts +27 -18
- package/src/obligations/module.ts +28 -55
- package/src/obligations/normalize.ts +31 -41
- package/src/obligations/operators.ts +0 -3
- package/src/obligations/pragma.ts +52 -24
- package/src/obligations/printer.ts +94 -63
- package/src/obligations/proof.ts +3 -6
- package/src/obligations/regroup.ts +0 -5
- package/src/obligations/simplify.ts +57 -63
- package/src/obligations/source.ts +121 -95
- package/src/obligations/subexpression.ts +49 -28
- package/src/obligations/substitution.ts +1 -5
- package/src/obligations/temporal.ts +12 -20
- package/src/obligations/tuples.ts +2 -10
- package/src/parallel-worker.ts +36 -60
- package/src/parallel.ts +64 -73
- package/src/parser.ts +1184 -531
- package/src/pcal/ast.ts +53 -86
- package/src/pcal/parse.ts +144 -219
- package/src/pcal/tokenize.ts +91 -131
- package/src/pcal/translate.ts +83 -130
- package/src/pcal/validate.ts +48 -68
- package/src/pretty-print.ts +7 -8
- package/src/prover/decide-pool.ts +8 -13
- package/src/prover/deciders.ts +12 -13
- package/src/prover/first-order.ts +0 -11
- package/src/prover/isabelle/decide.ts +3 -31
- package/src/prover/isabelle/encode.ts +82 -64
- package/src/prover/isabelle/isar/attrib.ts +250 -0
- package/src/prover/isabelle/isar/context.ts +335 -0
- package/src/prover/isabelle/isar/induct.ts +382 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
- package/src/prover/isabelle/isar/method.ts +510 -226
- package/src/prover/isabelle/isar/proof.ts +570 -23
- package/src/prover/isabelle/isar/rule-cases.ts +226 -0
- package/src/prover/isabelle/isar/theory.ts +488 -88
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +99 -38
- package/src/prover/isabelle/provers/blast/blast.ts +16 -105
- package/src/prover/isabelle/provers/blast/branch.ts +0 -33
- package/src/prover/isabelle/provers/blast/prove.ts +0 -36
- package/src/prover/isabelle/provers/blast/rules.ts +5 -45
- package/src/prover/isabelle/provers/blast/state.ts +1 -29
- package/src/prover/isabelle/provers/blast/term.ts +8 -37
- package/src/prover/isabelle/provers/clasimp.ts +1 -15
- package/src/prover/isabelle/provers/classical.ts +58 -61
- package/src/prover/isabelle/provers/hypsubst.ts +29 -54
- package/src/prover/isabelle/pure/bicompose.ts +24 -39
- package/src/prover/isabelle/pure/consts.ts +0 -8
- package/src/prover/isabelle/pure/conv.ts +2 -18
- package/src/prover/isabelle/pure/drule.ts +95 -45
- package/src/prover/isabelle/pure/envir.ts +2 -53
- package/src/prover/isabelle/pure/goal.ts +1 -9
- package/src/prover/isabelle/pure/interrupt.ts +0 -5
- package/src/prover/isabelle/pure/list.ts +0 -3
- package/src/prover/isabelle/pure/logic.ts +1 -16
- package/src/prover/isabelle/pure/name.ts +1 -10
- package/src/prover/isabelle/pure/net.ts +2 -60
- package/src/prover/isabelle/pure/object-logic.ts +15 -16
- package/src/prover/isabelle/pure/pattern.ts +1 -20
- package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
- package/src/prover/isabelle/pure/rewriter.ts +34 -77
- package/src/prover/isabelle/pure/search.ts +2 -11
- package/src/prover/isabelle/pure/seq.ts +0 -11
- package/src/prover/isabelle/pure/simplifier.ts +27 -16
- package/src/prover/isabelle/pure/table.ts +2 -33
- package/src/prover/isabelle/pure/tactic.ts +11 -23
- package/src/prover/isabelle/pure/tactical.ts +47 -48
- package/src/prover/isabelle/pure/term-ord.ts +1 -7
- package/src/prover/isabelle/pure/term.ts +4 -47
- package/src/prover/isabelle/pure/thm.ts +26 -48
- package/src/prover/isabelle/pure/type.ts +1 -16
- package/src/prover/isabelle/pure/unify.ts +19 -31
- package/src/prover/isabelle/pure/variable.ts +2 -8
- package/src/prover/isabelle/tla/classical-setup.ts +17 -25
- package/src/prover/isabelle/tla/context.ts +65 -26
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +53 -32
- package/src/prover/isabelle/tla/simpdata.ts +45 -44
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
- package/src/prover/ocaml.ts +4 -7
- package/src/prover/prep/action.ts +33 -66
- package/src/prover/prep/enabled-axioms.ts +22 -20
- package/src/prover/prep/fingerprint.ts +2 -21
- package/src/prover/prep/level-comparison.ts +8 -12
- package/src/prover/prep/md5.ts +26 -31
- package/src/prover/prep/methods.ts +189 -86
- package/src/prover/prep/normalize.ts +42 -37
- package/src/prover/prove-worker.ts +0 -2
- package/src/prover/prove.ts +398 -133
- package/src/prover/ptl/decide.ts +96 -56
- package/src/prover/ptl/encode.ts +15 -38
- package/src/prover/ptl/sat.ts +24 -32
- package/src/prover/ptl/tableau.ts +40 -28
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -15
- package/src/prover/smt/context.ts +60 -32
- package/src/prover/smt/data.ts +517 -401
- package/src/prover/smt/encode.ts +155 -85
- package/src/prover/smt/extensionality.ts +5 -13
- package/src/prover/smt/flatten.ts +7 -28
- package/src/prover/smt/format.ts +33 -14
- package/src/prover/smt/instances.ts +7 -11
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1021 -658
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
- package/src/prover/smt/solver/ackr-helper.ts +179 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
- package/src/prover/smt/solver/act-cache.ts +0 -16
- package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
- package/src/prover/smt/solver/aig-tactic.ts +52 -0
- package/src/prover/smt/solver/aig.ts +889 -0
- package/src/prover/smt/solver/arith-rewriter.ts +626 -56
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +319 -0
- package/src/prover/smt/solver/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +241 -99
- package/src/prover/smt/solver/ast-lt.ts +165 -21
- package/src/prover/smt/solver/ast-util.ts +160 -7
- package/src/prover/smt/solver/ast.ts +1480 -184
- package/src/prover/smt/solver/auf-solver.ts +30 -56
- package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/blast-term-ite.ts +47 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +598 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +127 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -10
- package/src/prover/smt/solver/cg-table.ts +39 -42
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -27
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -11
- package/src/prover/smt/solver/context.ts +600 -187
- package/src/prover/smt/solver/ctx-simplify.ts +34 -52
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
- package/src/prover/smt/solver/der.ts +39 -30
- package/src/prover/smt/solver/diff-neq.ts +205 -0
- package/src/prover/smt/solver/distribute-forall.ts +57 -0
- package/src/prover/smt/solver/dom-simplify.ts +511 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +296 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -11
- package/src/prover/smt/solver/e-matching.ts +9 -41
- package/src/prover/smt/solver/elim-bounds.ts +89 -0
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
- package/src/prover/smt/solver/enode.ts +100 -23
- package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +901 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1046 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +328 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -5
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
- package/src/prover/smt/solver/expr2polynomial.ts +271 -0
- package/src/prover/smt/solver/factor.ts +163 -0
- package/src/prover/smt/solver/fd-solver.ts +734 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -26
- package/src/prover/smt/solver/fix-dl-var.ts +147 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -9
- package/src/prover/smt/solver/fm-tactic.ts +884 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +179 -28
- package/src/prover/smt/solver/goal2nlsat.ts +216 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -9
- package/src/prover/smt/solver/hashtable.ts +30 -23
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +113 -133
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -2
- package/src/prover/smt/solver/lia2card.ts +268 -0
- package/src/prover/smt/solver/lia2pb.ts +154 -0
- package/src/prover/smt/solver/literal.ts +0 -4
- package/src/prover/smt/solver/logic-tactics.ts +355 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
- package/src/prover/smt/solver/lp/constraints.ts +1 -8
- package/src/prover/smt/solver/lp/containers.ts +18 -31
- package/src/prover/smt/solver/lp/core-solver.ts +35 -37
- package/src/prover/smt/solver/lp/cross-nested.ts +4 -21
- package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
- package/src/prover/smt/solver/lp/dependency.ts +0 -5
- package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
- package/src/prover/smt/solver/lp/explanation.ts +0 -6
- package/src/prover/smt/solver/lp/gomory.ts +8 -22
- package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
- package/src/prover/smt/solver/lp/hnf.ts +10 -28
- package/src/prover/smt/solver/lp/int-cube.ts +17 -39
- package/src/prover/smt/solver/lp/int-solver.ts +3 -35
- package/src/prover/smt/solver/lp/lar-solver.ts +70 -83
- package/src/prover/smt/solver/lp/lar-term.ts +0 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +6 -16
- package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
- package/src/prover/smt/solver/lp/nex-creator.ts +7 -30
- package/src/prover/smt/solver/lp/nex.ts +2 -7
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
- package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
- package/src/prover/smt/solver/lp/nla-core.ts +92 -136
- package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
- package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
- package/src/prover/smt/solver/lp/nla-grobner.ts +177 -149
- package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
- package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
- package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
- package/src/prover/smt/solver/lp/nla-order.ts +0 -13
- package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -12
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
- package/src/prover/smt/solver/lp/nra-solver.ts +164 -147
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -5
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +61 -34
- package/src/prover/smt/solver/lp/pdd-solver.ts +74 -72
- package/src/prover/smt/solver/lp/pdd.ts +730 -358
- package/src/prover/smt/solver/lp/random-updater.ts +0 -9
- package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
- package/src/prover/smt/solver/lp/union-find.ts +5 -5
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +129 -139
- package/src/prover/smt/solver/mam-interpreter.ts +0 -21
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +310 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +106 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +20 -63
- package/src/prover/smt/solver/model-evaluator.ts +192 -40
- package/src/prover/smt/solver/model-finder.ts +14 -32
- package/src/prover/smt/solver/model-generator.ts +104 -46
- package/src/prover/smt/solver/model-macro-solver.ts +60 -114
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +709 -0
- package/src/prover/smt/solver/mus.ts +50 -0
- package/src/prover/smt/solver/muz/dl-context.ts +382 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +357 -236
- package/src/prover/smt/solver/nlsat/atoms.ts +73 -54
- package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
- package/src/prover/smt/solver/nlsat/explain.ts +429 -275
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
- package/src/prover/smt/solver/nlsat/levelwise.ts +477 -344
- package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +2385 -832
- package/src/prover/smt/solver/nlsat/solver.ts +297 -156
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -9
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -51
- package/src/prover/smt/solver/nlsat/upolynomial.ts +49 -109
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +112 -61
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +801 -0
- package/src/prover/smt/solver/opt-nlsat.ts +386 -0
- package/src/prover/smt/solver/opt-pareto.ts +301 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +312 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +21 -26
- package/src/prover/smt/solver/pb-rewriter.ts +281 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +261 -79
- package/src/prover/smt/solver/probes.ts +577 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -30
- package/src/prover/smt/solver/proto-model.ts +650 -66
- package/src/prover/smt/solver/pull-quant.ts +28 -23
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/push-app-ite.ts +37 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -31
- package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
- package/src/prover/smt/solver/qe-lite.ts +41 -51
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1499 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -16
- package/src/prover/smt/solver/qsat.ts +829 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +17 -74
- package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
- package/src/prover/smt/solver/quantifier-manager.ts +22 -32
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -2
- package/src/prover/smt/solver/rational.ts +45 -8
- package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -6
- package/src/prover/smt/solver/relevancy.ts +2 -16
- package/src/prover/smt/solver/rewriter-tpl.ts +59 -135
- package/src/prover/smt/solver/rewriter.ts +507 -144
- package/src/prover/smt/solver/rlimit.ts +46 -24
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +579 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +464 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +53 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +189 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2107 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +995 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1298 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +730 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
- package/src/prover/smt/solver/seq-skolem.ts +294 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +124 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +589 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3546 -406
- package/src/prover/smt/solver/smtlib-script.ts +2134 -0
- package/src/prover/smt/solver/solve-eqs.ts +928 -0
- package/src/prover/smt/solver/solver.ts +135 -40
- package/src/prover/smt/solver/sort.ts +1 -5
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -6
- package/src/prover/smt/solver/tactic.ts +2141 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1210 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
- package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
- package/src/prover/smt/solver/theory-lra-internalize.ts +96 -53
- package/src/prover/smt/solver/theory-lra-model.ts +23 -53
- package/src/prover/smt/solver/theory-lra-propagate.ts +34 -42
- package/src/prover/smt/solver/theory-lra-state.ts +7 -28
- package/src/prover/smt/solver/theory-lra.ts +189 -9
- package/src/prover/smt/solver/theory-pb.ts +951 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +852 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory-without-terms.ts +24 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +486 -0
- package/src/prover/smt/solver/var-subst.ts +37 -39
- package/src/prover/smt/table.ts +3 -10
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +74 -48
- package/src/prover/tlapm/ocaml-marshal.ts +19 -21
- package/src/prover/tlapm/tlapm.ts +21 -20
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -2
- package/src/prover/zenon/check/check.ts +1 -11
- package/src/prover/zenon/check/definitions.ts +5 -15
- package/src/prover/zenon/check/equality.ts +0 -8
- package/src/prover/zenon/check/functions.ts +0 -4
- package/src/prover/zenon/check/keys.ts +0 -7
- package/src/prover/zenon/check/propositional.ts +0 -3
- package/src/prover/zenon/check/records.ts +1 -6
- package/src/prover/zenon/check/relations.ts +2 -14
- package/src/prover/zenon/check/rewrites.ts +2 -21
- package/src/prover/zenon/check/sets.ts +40 -61
- package/src/prover/zenon/check/terms.ts +1 -19
- package/src/prover/zenon/check/tla.ts +0 -6
- package/src/prover/zenon/decide.ts +10 -19
- package/src/prover/zenon/encode.ts +0 -9
- package/src/prover/zenon/eqrel.ts +2 -15
- package/src/prover/zenon/equality-rules.ts +24 -6
- package/src/prover/zenon/expr.ts +29 -28
- package/src/prover/zenon/index-table.ts +33 -61
- package/src/prover/zenon/isar-case.ts +9 -21
- package/src/prover/zenon/isar.ts +37 -67
- package/src/prover/zenon/limits.ts +0 -4
- package/src/prover/zenon/llproof.ts +2 -22
- package/src/prover/zenon/mltoll.ts +66 -106
- package/src/prover/zenon/node.ts +20 -15
- package/src/prover/zenon/ocaml.ts +1 -17
- package/src/prover/zenon/parse.ts +9 -13
- package/src/prover/zenon/phrase.ts +2 -14
- package/src/prover/zenon/proof.ts +0 -11
- package/src/prover/zenon/propositional-rules.ts +0 -7
- package/src/prover/zenon/rules.ts +3 -8
- package/src/prover/zenon/search.ts +11 -35
- package/src/prover/zenon/tla/functions.ts +59 -33
- package/src/prover/zenon/tla/llproof.ts +67 -78
- package/src/prover/zenon/tla/records.ts +57 -35
- package/src/prover/zenon/tla/rewrites.ts +12 -21
- package/src/prover/zenon/tla/sets.ts +88 -59
- package/src/prover/zenon/tla/terms.ts +0 -8
- package/src/prover/zenon/tla/tla.ts +66 -66
- package/src/randomization.ts +81 -35
- package/src/resolve.ts +1132 -430
- package/src/runtime.ts +33 -23
- package/src/sany/builtins.ts +11 -14
- package/src/sany/generation.ts +383 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +688 -0
- package/src/sany/generator-expressions.ts +1108 -0
- package/src/sany/generator-proofs.ts +665 -0
- package/src/sany/generator.ts +192 -2764
- package/src/sany/levels.ts +5 -35
- package/src/sany/lexer.ts +61 -80
- package/src/sany/linter.ts +0 -10
- package/src/sany/modules.ts +5 -7
- package/src/sany/nodes.ts +6 -44
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +32 -69
- package/src/sany/selectors.ts +60 -82
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +37 -120
- package/src/search.ts +913 -227
- package/src/simulate.ts +765 -0
- package/src/spec-description.ts +198 -104
- package/src/standard-definitions.ts +4 -4
- package/src/standard-modules.ts +302 -99
- package/src/state-graph.ts +52 -33
- package/src/subexpressions.ts +578 -166
- package/src/substitution-levels.ts +7 -7
- package/src/successors.ts +299 -108
- package/src/symmetry.ts +37 -28
- package/src/tableau.ts +29 -26
- package/src/tlc/fingerprint.ts +267 -79
- package/src/tlc/jar-data.ts +122 -6
- package/src/tlc/messages.ts +127 -56
- package/src/tlc/order.ts +53 -72
- package/src/tlc/random.ts +38 -49
- package/src/tlc/replay.ts +579 -230
- package/src/tlc/summary.ts +64 -60
- package/src/tlc/tlc-operators.ts +83 -47
- package/src/tlc/tlcext-operators.ts +205 -127
- package/src/tlc/trace-spec.ts +235 -0
- package/src/tlc/value-stream.ts +139 -0
- package/src/tlc/version.ts +1 -4
- package/src/trace-liveness.ts +529 -0
- package/src/transfer.ts +22 -25
- package/src/typed-tier.ts +6556 -0
- package/src/typescript/actions.ts +479 -0
- package/src/typescript/collections.ts +614 -0
- package/src/typescript/compile.ts +63 -0
- package/src/typescript/context.ts +94 -0
- package/src/typescript/emit.ts +121 -0
- package/src/typescript/expressions.ts +496 -0
- package/src/typescript/formula.ts +154 -0
- package/src/typescript/functions.ts +284 -0
- package/src/typescript/model.ts +162 -0
- package/src/typescript/names.ts +114 -0
- package/src/typescript/program.ts +48 -0
- package/src/typescript/properties.ts +139 -0
- package/src/typescript/scope.ts +112 -0
- package/src/typescript/steps.ts +167 -0
- package/src/typescript/types.ts +171 -0
- package/src/values.ts +945 -526
- package/src/worker.ts +7 -8
- package/src/prover/isabelle/isar/statement.ts +0 -57
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/tlaps-module.ts +0 -510
- package/src/prover/zenon/LICENSE +0 -32
|
@@ -1,8 +1,6 @@
|
|
|
1
|
-
// Ported from Z3 (src/smt/smt_enode.h, src/smt/smt_eq_justification.h, src/smt/smt_justification.h),
|
|
2
|
-
// MIT license, see z3-license.txt. E-graph nodes and the justifications for their equalities.
|
|
3
1
|
import type { Literal } from "./literal";
|
|
4
2
|
|
|
5
|
-
interface Antecedents {
|
|
3
|
+
export interface Antecedents {
|
|
6
4
|
markLiteral(literal: Literal): void;
|
|
7
5
|
markEq(first: Enode, second: Enode): void;
|
|
8
6
|
markJustification(justification: Justification): void;
|
|
@@ -11,10 +9,10 @@ interface Antecedents {
|
|
|
11
9
|
|
|
12
10
|
export abstract class Justification {
|
|
13
11
|
isMarked = false;
|
|
12
|
+
readonly fromTheory: number = -1;
|
|
14
13
|
abstract getAntecedents(antecedents: Antecedents): void;
|
|
15
14
|
}
|
|
16
15
|
|
|
17
|
-
// eq_justification: why two nodes on a transitivity branch are equal.
|
|
18
16
|
export type EqJustification =
|
|
19
17
|
| { kind: "axiom" }
|
|
20
18
|
| { kind: "congruence"; isCommutative: boolean }
|
|
@@ -23,15 +21,11 @@ export type EqJustification =
|
|
|
23
21
|
|
|
24
22
|
export const AXIOM_EQ_JUSTIFICATION: EqJustification = { kind: "axiom" };
|
|
25
23
|
|
|
26
|
-
// The congruence justifications, which carry no data of their own and so are shared.
|
|
27
24
|
export const CONGRUENCE_JUSTIFICATIONS: readonly EqJustification[] = [
|
|
28
25
|
{ kind: "congruence", isCommutative: false },
|
|
29
26
|
{ kind: "congruence", isCommutative: true },
|
|
30
27
|
];
|
|
31
28
|
|
|
32
|
-
// The parents of a node without any, and the arguments past the second of a node with at most two.
|
|
33
|
-
// Nothing adds to it: addParent gives a node its own list, so that a node with one parent holds one
|
|
34
|
-
// entry instead of V8's sixteen.
|
|
35
29
|
export const NO_ENODES: Enode[] = [];
|
|
36
30
|
|
|
37
31
|
const IS_EQ = 1;
|
|
@@ -41,8 +35,17 @@ const IS_CGC_ENABLED = 8;
|
|
|
41
35
|
const IS_MARKED = 16;
|
|
42
36
|
const IS_MARKED2 = 32;
|
|
43
37
|
const IS_INTERPRETED = 64;
|
|
44
|
-
|
|
45
|
-
const
|
|
38
|
+
const IS_COMMUTATIVE = 128;
|
|
39
|
+
const IS_COMMUTATIVE_TABLE = 256;
|
|
40
|
+
const NUM_ARGS_SHIFT = 9;
|
|
41
|
+
|
|
42
|
+
class ThVarCell {
|
|
43
|
+
constructor(
|
|
44
|
+
public thId: number,
|
|
45
|
+
public thVar: number,
|
|
46
|
+
public next: ThVarCell | null,
|
|
47
|
+
) {}
|
|
48
|
+
}
|
|
46
49
|
|
|
47
50
|
export class Enode {
|
|
48
51
|
root: Enode = this;
|
|
@@ -50,26 +53,22 @@ export class Enode {
|
|
|
50
53
|
cg: Enode = this;
|
|
51
54
|
classSize = 1;
|
|
52
55
|
parents: Enode[] = NO_ENODES;
|
|
53
|
-
// m_trans: the next node on the transitivity branch toward the root of the proof tree, and why the
|
|
54
|
-
// two are equal.
|
|
55
56
|
transTarget: Enode | null = null;
|
|
56
57
|
transJustification: EqJustification = AXIOM_EQ_JUSTIFICATION;
|
|
58
|
+
// The first theory variable inline, -1 when there is none, then the rest in the order added.
|
|
57
59
|
thVar = -1;
|
|
58
|
-
|
|
60
|
+
thId = -1;
|
|
61
|
+
thNext: ThVarCell | null = null;
|
|
59
62
|
lbls = 0;
|
|
60
63
|
lblsHigh = 0;
|
|
61
64
|
plbls = 0;
|
|
62
65
|
plblsHigh = 0;
|
|
63
66
|
lblHash = -1;
|
|
64
|
-
// The Boolean fields, one bit each, so a node takes 48 bytes less, and the number of arguments.
|
|
65
67
|
private flags: number;
|
|
66
|
-
// m_args: the first two arguments inline, like Z3's arguments after the node, and the rest in an
|
|
67
|
-
// array. A missing argument is the node itself.
|
|
68
68
|
private readonly arg0: Enode;
|
|
69
69
|
private readonly arg1: Enode;
|
|
70
70
|
private readonly moreArgs: Enode[];
|
|
71
71
|
|
|
72
|
-
// moreArgs are the arguments past the second, and arg0 and arg1 are null when there are fewer.
|
|
73
72
|
constructor(
|
|
74
73
|
readonly owner: number,
|
|
75
74
|
readonly decl: number,
|
|
@@ -79,6 +78,8 @@ export class Enode {
|
|
|
79
78
|
moreArgs: Enode[],
|
|
80
79
|
public generation: number,
|
|
81
80
|
isEq: boolean,
|
|
81
|
+
isCommutative: boolean,
|
|
82
|
+
isCommutativeTable: boolean,
|
|
82
83
|
isBool: boolean,
|
|
83
84
|
isMergeTf: boolean,
|
|
84
85
|
isCgcEnabled: boolean,
|
|
@@ -90,6 +91,8 @@ export class Enode {
|
|
|
90
91
|
this.flags =
|
|
91
92
|
(numArgs << NUM_ARGS_SHIFT) |
|
|
92
93
|
(isEq ? IS_EQ : 0) |
|
|
94
|
+
(isCommutative ? IS_COMMUTATIVE : 0) |
|
|
95
|
+
(isCommutativeTable ? IS_COMMUTATIVE_TABLE : 0) |
|
|
93
96
|
(isBool ? IS_BOOL : 0) |
|
|
94
97
|
(isMergeTf ? IS_MERGE_TF : 0) |
|
|
95
98
|
(isCgcEnabled ? IS_CGC_ENABLED : 0);
|
|
@@ -111,6 +114,14 @@ export class Enode {
|
|
|
111
114
|
return (this.flags & IS_EQ) !== 0;
|
|
112
115
|
}
|
|
113
116
|
|
|
117
|
+
get isCommutative() {
|
|
118
|
+
return (this.flags & IS_COMMUTATIVE) !== 0;
|
|
119
|
+
}
|
|
120
|
+
|
|
121
|
+
get isCommutativeTable() {
|
|
122
|
+
return (this.flags & IS_COMMUTATIVE_TABLE) !== 0;
|
|
123
|
+
}
|
|
124
|
+
|
|
114
125
|
get isBool() {
|
|
115
126
|
return (this.flags & IS_BOOL) !== 0;
|
|
116
127
|
}
|
|
@@ -151,6 +162,77 @@ export class Enode {
|
|
|
151
162
|
this.setFlag(IS_INTERPRETED, value);
|
|
152
163
|
}
|
|
153
164
|
|
|
165
|
+
getThVar(thId: number) {
|
|
166
|
+
if (this.thVar < 0) return -1;
|
|
167
|
+
if (this.thId === thId) return this.thVar;
|
|
168
|
+
for (let cell = this.thNext; cell !== null; cell = cell.next)
|
|
169
|
+
if (cell.thId === thId) return cell.thVar;
|
|
170
|
+
return -1;
|
|
171
|
+
}
|
|
172
|
+
|
|
173
|
+
forEachThVar(visit: (thId: number, thVar: number) => void) {
|
|
174
|
+
if (this.thVar < 0) return;
|
|
175
|
+
visit(this.thId, this.thVar);
|
|
176
|
+
for (let cell = this.thNext; cell !== null; cell = cell.next) visit(cell.thId, cell.thVar);
|
|
177
|
+
}
|
|
178
|
+
|
|
179
|
+
addThVar(thVar: number, thId: number) {
|
|
180
|
+
if (this.thVar < 0) {
|
|
181
|
+
this.thVar = thVar;
|
|
182
|
+
this.thId = thId;
|
|
183
|
+
this.thNext = null;
|
|
184
|
+
return;
|
|
185
|
+
}
|
|
186
|
+
const cell = new ThVarCell(thId, thVar, null);
|
|
187
|
+
if (this.thNext === null) {
|
|
188
|
+
this.thNext = cell;
|
|
189
|
+
return;
|
|
190
|
+
}
|
|
191
|
+
let last = this.thNext;
|
|
192
|
+
while (last.next !== null) last = last.next;
|
|
193
|
+
last.next = cell;
|
|
194
|
+
}
|
|
195
|
+
|
|
196
|
+
replaceThVar(thVar: number, thId: number) {
|
|
197
|
+
if (this.thId === thId) {
|
|
198
|
+
this.thVar = thVar;
|
|
199
|
+
return;
|
|
200
|
+
}
|
|
201
|
+
for (let cell = this.thNext; cell !== null; cell = cell.next)
|
|
202
|
+
if (cell.thId === thId) {
|
|
203
|
+
cell.thVar = thVar;
|
|
204
|
+
return;
|
|
205
|
+
}
|
|
206
|
+
}
|
|
207
|
+
|
|
208
|
+
delThVar(thId: number) {
|
|
209
|
+
if (this.thId === thId) {
|
|
210
|
+
const next = this.thNext;
|
|
211
|
+
this.thVar = next === null ? -1 : next.thVar;
|
|
212
|
+
this.thId = next === null ? -1 : next.thId;
|
|
213
|
+
this.thNext = next === null ? null : next.next;
|
|
214
|
+
return;
|
|
215
|
+
}
|
|
216
|
+
let previous: ThVarCell | null = null;
|
|
217
|
+
for (let cell = this.thNext; cell !== null; previous = cell, cell = cell.next) {
|
|
218
|
+
if (cell.thId !== thId) continue;
|
|
219
|
+
if (previous === null) this.thNext = cell.next;
|
|
220
|
+
else previous.next = cell.next;
|
|
221
|
+
return;
|
|
222
|
+
}
|
|
223
|
+
}
|
|
224
|
+
|
|
225
|
+
restoreThVars(getEnode: (thId: number, thVar: number) => Enode) {
|
|
226
|
+
const kept: [number, number][] = [];
|
|
227
|
+
this.forEachThVar((thId, thVar) => {
|
|
228
|
+
if (getEnode(thId, thVar).root === this) kept.push([thId, thVar]);
|
|
229
|
+
});
|
|
230
|
+
this.thVar = -1;
|
|
231
|
+
this.thId = -1;
|
|
232
|
+
this.thNext = null;
|
|
233
|
+
for (const entry of kept) this.addThVar(entry[1], entry[0]);
|
|
234
|
+
}
|
|
235
|
+
|
|
154
236
|
addParent(parent: Enode) {
|
|
155
237
|
if (this.parents.length === 0) this.parents = [parent];
|
|
156
238
|
else this.parents.push(parent);
|
|
@@ -169,7 +251,6 @@ export class Enode {
|
|
|
169
251
|
}
|
|
170
252
|
}
|
|
171
253
|
|
|
172
|
-
// eq_propagation_justification: the equality atom is true because its sides are in one class.
|
|
173
254
|
export class EqPropagationJustification extends Justification {
|
|
174
255
|
constructor(
|
|
175
256
|
private first: Enode,
|
|
@@ -183,7 +264,6 @@ export class EqPropagationJustification extends Justification {
|
|
|
183
264
|
}
|
|
184
265
|
}
|
|
185
266
|
|
|
186
|
-
// eq_root_propagation_justification: a Boolean node merged with true or false.
|
|
187
267
|
export class EqRootPropagationJustification extends Justification {
|
|
188
268
|
constructor(private node: Enode) {
|
|
189
269
|
super();
|
|
@@ -194,7 +274,6 @@ export class EqRootPropagationJustification extends Justification {
|
|
|
194
274
|
}
|
|
195
275
|
}
|
|
196
276
|
|
|
197
|
-
// eq_conflict_justification: two interpreted roots, such as two numerals, were merged.
|
|
198
277
|
export class EqConflictJustification extends Justification {
|
|
199
278
|
constructor(
|
|
200
279
|
private first: Enode,
|
|
@@ -211,7 +290,6 @@ export class EqConflictJustification extends Justification {
|
|
|
211
290
|
}
|
|
212
291
|
}
|
|
213
292
|
|
|
214
|
-
// mp_iff_justification: a Boolean node takes the value of an equal node.
|
|
215
293
|
export class MpIffJustification extends Justification {
|
|
216
294
|
constructor(
|
|
217
295
|
private first: Enode,
|
|
@@ -227,7 +305,6 @@ export class MpIffJustification extends Justification {
|
|
|
227
305
|
}
|
|
228
306
|
}
|
|
229
307
|
|
|
230
|
-
// unit_resolution_justification: a clause simplified with literals that were false.
|
|
231
308
|
export class UnitResolutionJustification extends Justification {
|
|
232
309
|
constructor(
|
|
233
310
|
private justification: Justification | null,
|
|
@@ -242,9 +319,9 @@ export class UnitResolutionJustification extends Justification {
|
|
|
242
319
|
}
|
|
243
320
|
}
|
|
244
321
|
|
|
245
|
-
// ext_theory_propagation_justification: theory reasoning from literals and equalities.
|
|
246
322
|
export class TheoryJustification extends Justification {
|
|
247
323
|
constructor(
|
|
324
|
+
readonly fromTheory: number,
|
|
248
325
|
private literals: Literal[],
|
|
249
326
|
private eqs: Enode[],
|
|
250
327
|
) {
|
|
@@ -0,0 +1,218 @@
|
|
|
1
|
+
import {
|
|
2
|
+
type AstManager,
|
|
3
|
+
KIND_APP,
|
|
4
|
+
KIND_QUANTIFIER,
|
|
5
|
+
OP_EQ,
|
|
6
|
+
OP_GE,
|
|
7
|
+
OP_LE,
|
|
8
|
+
OP_ULEQ,
|
|
9
|
+
SORT_INT,
|
|
10
|
+
} from "./ast";
|
|
11
|
+
import { BoundManager } from "./bound-manager";
|
|
12
|
+
import { mkBvApp } from "./bv-decl-plugin";
|
|
13
|
+
import type { Goal } from "./goal";
|
|
14
|
+
import { FuncInterp, ProtoModel } from "./proto-model";
|
|
15
|
+
import { Rational } from "./rational";
|
|
16
|
+
import { RefVector } from "./ref-vector";
|
|
17
|
+
import { RewriterTpl } from "./rewriter-tpl";
|
|
18
|
+
|
|
19
|
+
const UNSIGNED_LIMIT = Rational.of(2n ** 32n);
|
|
20
|
+
|
|
21
|
+
const isUnsigned = (value: Rational) =>
|
|
22
|
+
value.isInt() && !value.isNegative() && value.compare(UNSIGNED_LIMIT) < 0;
|
|
23
|
+
|
|
24
|
+
const getNumBits = (value: Rational) => value.num.toString(2).length;
|
|
25
|
+
|
|
26
|
+
class EqRewriter extends RewriterTpl {
|
|
27
|
+
constructor(
|
|
28
|
+
manager: AstManager,
|
|
29
|
+
private fd: Map<number, number>,
|
|
30
|
+
) {
|
|
31
|
+
super(manager);
|
|
32
|
+
}
|
|
33
|
+
|
|
34
|
+
override isRewritingPatterns() {
|
|
35
|
+
return false;
|
|
36
|
+
}
|
|
37
|
+
|
|
38
|
+
private getFd(variable: number, other: number) {
|
|
39
|
+
const manager = this.manager;
|
|
40
|
+
const bv = this.fd.get(variable);
|
|
41
|
+
if (bv === undefined || !manager.isNumeral(other)) return -1;
|
|
42
|
+
const width = manager.getBvSize(manager.sorts[bv]);
|
|
43
|
+
return manager.mkEq(bv, manager.mkBvNumeral(manager.getRationalValue(other).num, width));
|
|
44
|
+
}
|
|
45
|
+
|
|
46
|
+
override reduceApp(decl: number, args: number[]) {
|
|
47
|
+
if (decl !== OP_EQ) return -1;
|
|
48
|
+
const first = this.getFd(args[0], args[1]);
|
|
49
|
+
const result = first === -1 ? this.getFd(args[1], args[0]) : first;
|
|
50
|
+
if (result !== -1) this.manager.incRef(result);
|
|
51
|
+
return result;
|
|
52
|
+
}
|
|
53
|
+
}
|
|
54
|
+
|
|
55
|
+
interface BvModelConverter {
|
|
56
|
+
bvToInt: Map<number, number>;
|
|
57
|
+
vars: number[];
|
|
58
|
+
values: Rational[];
|
|
59
|
+
}
|
|
60
|
+
|
|
61
|
+
const convertModel = (manager: AstManager, converter: BvModelConverter, source: ProtoModel) => {
|
|
62
|
+
const target = new ProtoModel(manager).mkModel();
|
|
63
|
+
for (const entry of source.funcInterps) {
|
|
64
|
+
const copied = new FuncInterp(manager, entry[1].arity);
|
|
65
|
+
for (const funcEntry of entry[1].entries)
|
|
66
|
+
copied.insertNewEntry(funcEntry.args, funcEntry.result);
|
|
67
|
+
if (entry[1].elseExpr !== null) copied.setElse(entry[1].elseExpr);
|
|
68
|
+
target.registerFunc(entry[0], copied);
|
|
69
|
+
}
|
|
70
|
+
for (const sort of source.getUninterpretedSorts())
|
|
71
|
+
for (const value of source.getKnownUniverse(sort)) target.registerValue(value);
|
|
72
|
+
for (const decl of source.getConstDecls()) {
|
|
73
|
+
const value = source.constInterps.get(decl) as number;
|
|
74
|
+
const original = converter.bvToInt.get(decl);
|
|
75
|
+
if (original !== undefined && manager.isBvNumeral(value))
|
|
76
|
+
target.registerConst(original, manager.mkNumeral(manager.getBvNumeralValue(value)));
|
|
77
|
+
else target.registerConst(decl, value);
|
|
78
|
+
}
|
|
79
|
+
for (const [index, decl] of converter.vars.entries())
|
|
80
|
+
target.registerConst(
|
|
81
|
+
decl,
|
|
82
|
+
manager.mkNumeralOfSort(converter.values[index], manager.funcDecls[decl].range),
|
|
83
|
+
);
|
|
84
|
+
return target;
|
|
85
|
+
};
|
|
86
|
+
|
|
87
|
+
export const createEq2BvTactic = (manager: AstManager) => (goal: Goal) => {
|
|
88
|
+
const bounds = new BoundManager(manager);
|
|
89
|
+
const trail = new RefVector(manager);
|
|
90
|
+
const fd = new Map<number, number>();
|
|
91
|
+
const max = new Map<number, Rational>();
|
|
92
|
+
const nonFd = new Set<number>();
|
|
93
|
+
const hasEq = new Set<number>();
|
|
94
|
+
const converter: BvModelConverter = { bvToInt: new Map(), vars: [], values: [] };
|
|
95
|
+
for (const form of goal.forms.items) bounds.add(form);
|
|
96
|
+
if (bounds.isInconsistent() || goal.isProofsEnabled) {
|
|
97
|
+
goal.depth++;
|
|
98
|
+
return [goal];
|
|
99
|
+
}
|
|
100
|
+
const isVarConstPair = (expr: number, constant: number) =>
|
|
101
|
+
manager.isUninterpretedConst(expr) &&
|
|
102
|
+
manager.isNumeral(constant) &&
|
|
103
|
+
isUnsigned(manager.getRationalValue(constant)) &&
|
|
104
|
+
!nonFd.has(expr);
|
|
105
|
+
// is_bound: a lower bound c <= x, then an upper bound x <= c, gives x.
|
|
106
|
+
const getBoundVar = (form: number) => {
|
|
107
|
+
const op = manager.getOp(form);
|
|
108
|
+
if ((op !== OP_LE && op !== OP_GE) || manager.getNumArgs(form) !== 2) return -1;
|
|
109
|
+
const small = manager.getArg(form, op === OP_LE ? 0 : 1);
|
|
110
|
+
const large = manager.getArg(form, op === OP_LE ? 1 : 0);
|
|
111
|
+
if (isVarConstPair(large, small)) return large;
|
|
112
|
+
return isVarConstPair(small, large) ? small : -1;
|
|
113
|
+
};
|
|
114
|
+
const isFd = (variable: number, constant: number) => {
|
|
115
|
+
if (
|
|
116
|
+
!manager.isUninterpretedConst(variable) ||
|
|
117
|
+
!manager.isNumeral(constant) ||
|
|
118
|
+
nonFd.has(variable) ||
|
|
119
|
+
manager.sorts[variable] !== SORT_INT
|
|
120
|
+
)
|
|
121
|
+
return false;
|
|
122
|
+
const value = manager.getRationalValue(constant);
|
|
123
|
+
if (!isUnsigned(value)) return false;
|
|
124
|
+
const previous = max.get(variable);
|
|
125
|
+
if (previous === undefined || previous.compare(value) < 0) max.set(variable, value);
|
|
126
|
+
return true;
|
|
127
|
+
};
|
|
128
|
+
const collectFd = (root: number) => {
|
|
129
|
+
trail.push(root);
|
|
130
|
+
if (getBoundVar(root) !== -1) return;
|
|
131
|
+
const todo = [root];
|
|
132
|
+
for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
|
|
133
|
+
if (nonFd.has(expr)) continue;
|
|
134
|
+
nonFd.add(expr);
|
|
135
|
+
if (manager.kinds[expr] === KIND_QUANTIFIER) {
|
|
136
|
+
todo.push(manager.getQuantifier(expr).body);
|
|
137
|
+
continue;
|
|
138
|
+
}
|
|
139
|
+
if (manager.kinds[expr] !== KIND_APP) continue;
|
|
140
|
+
if (manager.getOp(expr) === OP_EQ) {
|
|
141
|
+
const first = manager.getArg(expr, 0);
|
|
142
|
+
const second = manager.getArg(expr, 1);
|
|
143
|
+
for (const side of [first, second]) if (manager.isUninterpretedConst(side)) hasEq.add(side);
|
|
144
|
+
if (isFd(first, second) || isFd(second, first)) continue;
|
|
145
|
+
}
|
|
146
|
+
manager.pushArgs(expr, todo);
|
|
147
|
+
}
|
|
148
|
+
};
|
|
149
|
+
for (const form of goal.forms.items) collectFd(form);
|
|
150
|
+
for (const variable of max.keys()) if (nonFd.has(variable)) max.delete(variable);
|
|
151
|
+
for (const [variable, maximum] of max) {
|
|
152
|
+
const upper = bounds.uppers.get(variable);
|
|
153
|
+
const lower = bounds.lowers.get(variable);
|
|
154
|
+
const atLeast = (value: Rational, bound: Rational | undefined) =>
|
|
155
|
+
bound !== undefined && bound.compare(value) > 0 ? bound : value;
|
|
156
|
+
const value = atLeast(
|
|
157
|
+
upper === undefined ? maximum.add(Rational.one) : atLeast(maximum, upper.value),
|
|
158
|
+
lower?.value,
|
|
159
|
+
).add(Rational.one);
|
|
160
|
+
const bits = Math.max(getNumBits(value), 2);
|
|
161
|
+
const fresh = manager.mkFreshConst("z", manager.mkBvSort(bits));
|
|
162
|
+
trail.push(fresh);
|
|
163
|
+
fd.set(variable, fresh);
|
|
164
|
+
converter.bvToInt.set(manager.decls[fresh], manager.decls[variable]);
|
|
165
|
+
}
|
|
166
|
+
if (max.size === 0) {
|
|
167
|
+
trail.reset();
|
|
168
|
+
return [goal];
|
|
169
|
+
}
|
|
170
|
+
const rewriter = new EqRewriter(manager, fd);
|
|
171
|
+
for (let index = 0; !goal.isInconsistent && index < goal.forms.size; index++) {
|
|
172
|
+
const form = goal.forms.items[index];
|
|
173
|
+
const variable = getBoundVar(form);
|
|
174
|
+
if (variable !== -1 && !hasEq.has(variable)) {
|
|
175
|
+
const upper = bounds.uppers.get(variable);
|
|
176
|
+
const lower = bounds.lowers.get(variable);
|
|
177
|
+
const value =
|
|
178
|
+
upper !== undefined && !upper.isStrict && isUnsigned(upper.value)
|
|
179
|
+
? upper.value
|
|
180
|
+
: lower !== undefined && !lower.isStrict && isUnsigned(lower.value)
|
|
181
|
+
? lower.value
|
|
182
|
+
: undefined;
|
|
183
|
+
if (value !== undefined) {
|
|
184
|
+
converter.vars.push(manager.decls[variable]);
|
|
185
|
+
converter.values.push(value);
|
|
186
|
+
goal.update(index, manager.trueExpr);
|
|
187
|
+
continue;
|
|
188
|
+
}
|
|
189
|
+
}
|
|
190
|
+
if (variable !== -1 && max.has(variable)) {
|
|
191
|
+
goal.update(index, manager.trueExpr);
|
|
192
|
+
continue;
|
|
193
|
+
}
|
|
194
|
+
const rewritten = rewriter.rewrite(form);
|
|
195
|
+
if (rewritten !== form) goal.update(index, rewritten);
|
|
196
|
+
manager.decRef(rewritten);
|
|
197
|
+
}
|
|
198
|
+
rewriter.release();
|
|
199
|
+
for (const variable of max.keys()) {
|
|
200
|
+
const bv = fd.get(variable) as number;
|
|
201
|
+
const width = manager.getBvSize(manager.sorts[bv]);
|
|
202
|
+
const lower = bounds.lowers.get(variable);
|
|
203
|
+
const upper = bounds.uppers.get(variable);
|
|
204
|
+
if (lower !== undefined && !lower.value.isNegative())
|
|
205
|
+
goal.assert(mkBvApp(manager, OP_ULEQ, [manager.mkBvNumeral(lower.value.num, width), bv]));
|
|
206
|
+
if (upper !== undefined && !upper.value.isNegative())
|
|
207
|
+
goal.assert(mkBvApp(manager, OP_ULEQ, [bv, manager.mkBvNumeral(upper.value.num, width)]));
|
|
208
|
+
}
|
|
209
|
+
for (const decl of converter.vars) manager.incDeclRef(decl);
|
|
210
|
+
for (const entry of converter.bvToInt) {
|
|
211
|
+
manager.incDeclRef(entry[0]);
|
|
212
|
+
manager.incDeclRef(entry[1]);
|
|
213
|
+
}
|
|
214
|
+
trail.reset();
|
|
215
|
+
goal.depth++;
|
|
216
|
+
goal.addModelConversion((model) => convertModel(manager, converter, model));
|
|
217
|
+
return [goal];
|
|
218
|
+
};
|