tla-ts 0.0.9 → 0.0.10-dev.09e53c2a6
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 +57 -53
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +109 -10
- package/dist/index.d.ts +109 -10
- 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 +146 -31
- package/dist/run.js +146 -31
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +132 -104
- package/dist/transfer.js +132 -104
- package/dist/worker.cjs +6 -6
- package/dist/worker.js +6 -6
- package/package.json +3 -1
- package/src/ast.ts +45 -59
- package/src/bags.ts +99 -102
- package/src/builtins.ts +28 -75
- package/src/bundled-modules.ts +1 -8
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +282 -0
- package/src/check.ts +797 -782
- package/src/cli/options.ts +12 -32
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +136 -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 +687 -0
- package/src/cli/tlc-usage.ts +360 -0
- package/src/cli/tlc.ts +323 -658
- 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 +196 -74
- package/src/config.ts +140 -109
- package/src/coverage.ts +830 -0
- package/src/dependencies.ts +36 -54
- package/src/dfid.ts +618 -0
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +178 -339
- package/src/errors.ts +100 -57
- package/src/evaluate.ts +598 -340
- package/src/exit-codes.ts +38 -3
- package/src/fingerprints.ts +75 -11
- package/src/index.ts +3 -0
- package/src/instances.ts +126 -21
- package/src/java-hash.ts +7 -0
- package/src/java-overrides.ts +4 -19
- package/src/json-reader.ts +455 -0
- package/src/json.ts +252 -139
- package/src/levels.ts +46 -58
- package/src/lexer.ts +83 -101
- package/src/liveness-checker.ts +590 -311
- package/src/liveness.ts +180 -124
- 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 +38 -19
- package/src/obligations/levels.ts +27 -18
- package/src/obligations/module.ts +28 -55
- package/src/obligations/normalize.ts +30 -37
- package/src/obligations/operators.ts +0 -3
- package/src/obligations/pragma.ts +52 -24
- package/src/obligations/printer.ts +89 -58
- 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 +119 -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 +30 -60
- package/src/parallel.ts +59 -73
- package/src/parser.ts +1082 -399
- 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 +224 -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 +0 -14
- package/src/prover/isabelle/provers/classical.ts +58 -61
- package/src/prover/isabelle/provers/hypsubst.ts +27 -52
- 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 +31 -74
- 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 +1 -44
- 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 +0 -2
- 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 +1026 -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 +615 -53
- 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 +309 -0
- package/src/prover/smt/solver/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +87 -58
- package/src/prover/smt/solver/ast-lt.ts +166 -22
- package/src/prover/smt/solver/ast-util.ts +160 -7
- package/src/prover/smt/solver/ast.ts +1424 -180
- package/src/prover/smt/solver/auf-solver.ts +7 -44
- package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +600 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +338 -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 +110 -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 +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -11
- package/src/prover/smt/solver/context.ts +519 -175
- package/src/prover/smt/solver/ctx-simplify.ts +33 -50
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -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 +81 -0
- package/src/prover/smt/solver/der.ts +39 -30
- package/src/prover/smt/solver/diff-neq.ts +206 -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 +260 -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-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +545 -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 +907 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1050 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +830 -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 +335 -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 +146 -0
- package/src/prover/smt/solver/factor.ts +141 -0
- package/src/prover/smt/solver/fd-solver.ts +265 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -26
- package/src/prover/smt/solver/fix-dl-var.ts +148 -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 +640 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +176 -28
- package/src/prover/smt/solver/goal2nlsat.ts +189 -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 +26 -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 +112 -132
- 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 +345 -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 +11 -30
- package/src/prover/smt/solver/lp/core-solver.ts +23 -29
- package/src/prover/smt/solver/lp/cross-nested.ts +5 -20
- 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 +69 -82
- package/src/prover/smt/solver/lp/lar-term.ts +0 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -14
- package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
- package/src/prover/smt/solver/lp/nex-creator.ts +4 -28
- package/src/prover/smt/solver/lp/nex.ts +0 -6
- 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 +91 -135
- 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 +22 -72
- 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 +123 -112
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +0 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +1 -14
- package/src/prover/smt/solver/lp/pdd-solver.ts +2 -33
- package/src/prover/smt/solver/lp/pdd.ts +7 -70
- 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 +309 -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 +105 -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 +19 -62
- package/src/prover/smt/solver/model-evaluator.ts +190 -40
- package/src/prover/smt/solver/model-finder.ts +14 -32
- package/src/prover/smt/solver/model-generator.ts +56 -40
- 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 +711 -0
- package/src/prover/smt/solver/mus.ts +51 -0
- package/src/prover/smt/solver/muz/dl-context.ts +404 -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 +496 -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 +201 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1406 -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 +218 -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 +177 -160
- package/src/prover/smt/solver/nlsat/atoms.ts +24 -24
- package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
- package/src/prover/smt/solver/nlsat/explain.ts +65 -69
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
- package/src/prover/smt/solver/nlsat/levelwise.ts +48 -135
- package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +29 -161
- package/src/prover/smt/solver/nlsat/solver.ts +241 -110
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -9
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -47
- package/src/prover/smt/solver/nlsat/upolynomial.ts +10 -93
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +107 -60
- 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 +787 -0
- package/src/prover/smt/solver/opt-nlsat.ts +375 -0
- package/src/prover/smt/solver/opt-pareto.ts +282 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +308 -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 +284 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +204 -79
- package/src/prover/smt/solver/probes.ts +512 -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/qe-arith-plugin.ts +1098 -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 +39 -49
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1498 -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 +814 -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 +8 -23
- 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 +261 -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 +52 -129
- package/src/prover/smt/solver/rewriter.ts +477 -120
- package/src/prover/smt/solver/rlimit.ts +39 -21
- 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 +526 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +165 -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 +2127 -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 +1010 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1301 -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 +728 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -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 +2402 -0
- package/src/prover/smt/solver/seq-skolem.ts +317 -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 +83 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +496 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3140 -365
- package/src/prover/smt/solver/smtlib-script.ts +1631 -0
- package/src/prover/smt/solver/solve-eqs.ts +929 -0
- package/src/prover/smt/solver/solver.ts +119 -39
- 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 +1986 -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 +1200 -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 +59 -91
- package/src/prover/smt/solver/theory-lra-internalize.ts +94 -53
- package/src/prover/smt/solver/theory-lra-model.ts +23 -53
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -40
- package/src/prover/smt/solver/theory-lra-state.ts +6 -27
- package/src/prover/smt/solver/theory-lra.ts +188 -8
- package/src/prover/smt/solver/theory-pb.ts +934 -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 +871 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +485 -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 +67 -41
- 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 +0 -6
- package/src/prover/zenon/expr.ts +8 -28
- package/src/prover/zenon/index-table.ts +26 -59
- package/src/prover/zenon/isar-case.ts +8 -20
- package/src/prover/zenon/isar.ts +35 -65
- 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 +1 -13
- package/src/prover/zenon/proof.ts +0 -11
- package/src/prover/zenon/propositional-rules.ts +0 -7
- package/src/prover/zenon/rules.ts +2 -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 +67 -185
- package/src/runtime.ts +26 -22
- package/src/sany/builtins.ts +2 -5
- package/src/sany/generation.ts +394 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1100 -0
- package/src/sany/generator-proofs.ts +662 -0
- package/src/sany/generator.ts +191 -2764
- package/src/sany/levels.ts +5 -35
- package/src/sany/lexer.ts +58 -77
- package/src/sany/linter.ts +0 -10
- package/src/sany/modules.ts +1 -5
- package/src/sany/nodes.ts +5 -43
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +32 -69
- package/src/sany/selectors.ts +49 -76
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +35 -117
- package/src/search.ts +671 -169
- package/src/simulate.ts +712 -0
- package/src/spec-description.ts +192 -100
- package/src/standard-definitions.ts +4 -4
- package/src/standard-modules.ts +264 -95
- package/src/state-graph.ts +52 -33
- package/src/subexpressions.ts +69 -52
- package/src/substitution-levels.ts +7 -7
- package/src/successors.ts +267 -100
- package/src/symmetry.ts +35 -27
- package/src/tableau.ts +29 -26
- package/src/tlc/fingerprint.ts +267 -79
- package/src/tlc/jar-data.ts +112 -6
- package/src/tlc/messages.ts +125 -54
- package/src/tlc/order.ts +39 -69
- package/src/tlc/random.ts +37 -49
- package/src/tlc/replay.ts +553 -228
- package/src/tlc/summary.ts +64 -60
- package/src/tlc/tlc-operators.ts +78 -44
- package/src/tlc/tlcext-operators.ts +171 -122
- package/src/tlc/trace-spec.ts +249 -0
- package/src/tlc/value-stream.ts +139 -0
- package/src/tlc/version.ts +1 -4
- package/src/transfer.ts +22 -25
- package/src/typed-tier.ts +6535 -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 +832 -484
- 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
|
@@ -0,0 +1,527 @@
|
|
|
1
|
+
import { SmtUnsupportedError } from "../../../../errors";
|
|
2
|
+
import { mkArrayApp } from "../array-decl-plugin";
|
|
3
|
+
import {
|
|
4
|
+
OP_ARRAY_DEFAULT,
|
|
5
|
+
OP_ARRAY_EXT,
|
|
6
|
+
OP_AS_ARRAY,
|
|
7
|
+
OP_CONST_ARRAY,
|
|
8
|
+
OP_SELECT,
|
|
9
|
+
OP_STORE,
|
|
10
|
+
} from "../ast";
|
|
11
|
+
import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
|
|
12
|
+
import { NULL_LITERAL } from "../sat/clause";
|
|
13
|
+
import { hasLargeDomain, hasUnitaryDomain } from "../theory-array";
|
|
14
|
+
import {
|
|
15
|
+
ArrayInternalize,
|
|
16
|
+
type AxiomRecord,
|
|
17
|
+
KIND_CONGRUENCE,
|
|
18
|
+
KIND_DEFAULT,
|
|
19
|
+
KIND_EXTENSIONALITY,
|
|
20
|
+
KIND_SELECT,
|
|
21
|
+
KIND_STORE,
|
|
22
|
+
STATE_DELAYED,
|
|
23
|
+
STATE_NEW,
|
|
24
|
+
} from "./array-internalize";
|
|
25
|
+
import type { Enode } from "./egraph";
|
|
26
|
+
|
|
27
|
+
interface Reach {
|
|
28
|
+
readonly root: Enode;
|
|
29
|
+
readonly parent: Reach | null;
|
|
30
|
+
readonly store: Enode | null;
|
|
31
|
+
}
|
|
32
|
+
|
|
33
|
+
export abstract class ArrayAxioms extends ArrayInternalize {
|
|
34
|
+
private sort2epsilon = new Map<number, number>();
|
|
35
|
+
private sort2diag = new Map<number, number>();
|
|
36
|
+
|
|
37
|
+
protected abstract collectDefaults(): void;
|
|
38
|
+
protected abstract mustHaveDifferentModelValues(first: number, second: number): boolean;
|
|
39
|
+
|
|
40
|
+
protected mkSelect(args: number[]) {
|
|
41
|
+
return mkArrayApp(this.manager, OP_SELECT, args);
|
|
42
|
+
}
|
|
43
|
+
|
|
44
|
+
private mkDefault(array: number) {
|
|
45
|
+
return mkArrayApp(this.manager, OP_ARRAY_DEFAULT, [array]);
|
|
46
|
+
}
|
|
47
|
+
|
|
48
|
+
private withTemporaries<T>(body: () => T) {
|
|
49
|
+
return this.manager.withTemporaries(body, () => []);
|
|
50
|
+
}
|
|
51
|
+
|
|
52
|
+
private rewriteLater(expr: number) {
|
|
53
|
+
const rewritten = this.rewrite(expr);
|
|
54
|
+
this.manager.releaseLater(rewritten);
|
|
55
|
+
return rewritten;
|
|
56
|
+
}
|
|
57
|
+
|
|
58
|
+
private getAppArgs(expr: number) {
|
|
59
|
+
return [...this.manager.getArgs(expr)];
|
|
60
|
+
}
|
|
61
|
+
|
|
62
|
+
protected assertAxiom(index: number) {
|
|
63
|
+
const record = this.axiomTrail[index];
|
|
64
|
+
switch (record.kind) {
|
|
65
|
+
case KIND_STORE:
|
|
66
|
+
return this.assertStoreAxiom(record.node.owner);
|
|
67
|
+
case KIND_SELECT:
|
|
68
|
+
return this.assertSelect(index, record);
|
|
69
|
+
case KIND_DEFAULT:
|
|
70
|
+
return this.assertDefault(record);
|
|
71
|
+
case KIND_EXTENSIONALITY:
|
|
72
|
+
return this.assertExtensionality(record.node.owner, (record.select as Enode).owner);
|
|
73
|
+
case KIND_CONGRUENCE:
|
|
74
|
+
throw new SmtUnsupportedError("sat.euf array lambdas");
|
|
75
|
+
}
|
|
76
|
+
return false;
|
|
77
|
+
}
|
|
78
|
+
|
|
79
|
+
private assertDefault(record: AxiomRecord) {
|
|
80
|
+
const child = record.node.owner;
|
|
81
|
+
if (this.isOp(child, OP_CONST_ARRAY)) return this.assertDefaultConstAxiom(child);
|
|
82
|
+
if (this.isOp(child, OP_STORE)) return this.assertDefaultStoreAxiom(child);
|
|
83
|
+
if (this.isMapCombinator(child)) return this.assertDefaultMapAxiom(child);
|
|
84
|
+
return false;
|
|
85
|
+
}
|
|
86
|
+
|
|
87
|
+
private assertSelect(index: number, record: AxiomRecord) {
|
|
88
|
+
const child = record.node.owner;
|
|
89
|
+
const select = (record.select as Enode).owner;
|
|
90
|
+
const isDelaying =
|
|
91
|
+
(record.select as Enode).getArg(0).root !== record.node.root &&
|
|
92
|
+
record.state !== STATE_DELAYED &&
|
|
93
|
+
this.isDelayEnabled;
|
|
94
|
+
if (isDelaying) {
|
|
95
|
+
this.ctx.trail.push(() => {
|
|
96
|
+
this.axiomTrail[index].state = STATE_NEW;
|
|
97
|
+
});
|
|
98
|
+
record.state = STATE_DELAYED;
|
|
99
|
+
return false;
|
|
100
|
+
}
|
|
101
|
+
if (this.isOp(child, OP_CONST_ARRAY)) return this.assertSelectConstAxiom(select, child);
|
|
102
|
+
if (this.isOp(child, OP_AS_ARRAY)) return this.assertSelectAsArrayAxiom(select, child);
|
|
103
|
+
if (this.isOp(child, OP_STORE)) return this.assertSelectStoreAxiom(select, child);
|
|
104
|
+
if (this.isMapCombinator(child)) return this.assertSelectMapAxiom(select, child);
|
|
105
|
+
return this.assertSelectLambdaAxiom(select, child);
|
|
106
|
+
}
|
|
107
|
+
|
|
108
|
+
private propagateAxiomEq(first: Enode, second: Enode, eqs: readonly (readonly [Enode, Enode])[]) {
|
|
109
|
+
if (first.root === second.root) return false;
|
|
110
|
+
return this.propagateEq([], eqs, first, second);
|
|
111
|
+
}
|
|
112
|
+
|
|
113
|
+
private assertStoreAxiom(store: number) {
|
|
114
|
+
const args = this.getAppArgs(store);
|
|
115
|
+
const select = this.mkSelect([store, ...args.slice(1, -1)]);
|
|
116
|
+
return this.propagateAxiomEq(
|
|
117
|
+
this.eInternalize(select),
|
|
118
|
+
this.expr2enode(args[args.length - 1]) as Enode,
|
|
119
|
+
[],
|
|
120
|
+
);
|
|
121
|
+
}
|
|
122
|
+
|
|
123
|
+
private assertSelectStoreAxiom(select: number, store: number) {
|
|
124
|
+
const manager = this.manager;
|
|
125
|
+
const selectArgs = this.getAppArgs(select);
|
|
126
|
+
const storeArgs = this.getAppArgs(store);
|
|
127
|
+
const numArgs = selectArgs.length;
|
|
128
|
+
let hasDiff = false;
|
|
129
|
+
for (let index = 1; index < numArgs; index++)
|
|
130
|
+
hasDiff ||=
|
|
131
|
+
(this.expr2enode(selectArgs[index]) as Enode).root !==
|
|
132
|
+
(this.expr2enode(storeArgs[index]) as Enode).root;
|
|
133
|
+
if (!hasDiff) return false;
|
|
134
|
+
const indices = selectArgs.slice(1);
|
|
135
|
+
const firstSelect = this.mkSelect([store, ...indices]);
|
|
136
|
+
const secondSelect = this.mkSelect([storeArgs[0], ...indices]);
|
|
137
|
+
const selectEqExpr = manager.mkEq(firstSelect, secondSelect);
|
|
138
|
+
const egraph = this.ctx.egraph;
|
|
139
|
+
let isNew = egraph.find(firstSelect) === undefined || egraph.find(secondSelect) === undefined;
|
|
140
|
+
const firstNode = this.eInternalize(firstSelect);
|
|
141
|
+
const secondNode = this.eInternalize(secondSelect);
|
|
142
|
+
if (firstNode.root === secondNode.root) return isNew;
|
|
143
|
+
let selectEq = NULL_LITERAL;
|
|
144
|
+
const initSelectEq = () => {
|
|
145
|
+
if (selectEq !== NULL_LITERAL) return true;
|
|
146
|
+
selectEq = this.mkLiteral(selectEqExpr);
|
|
147
|
+
return this.s.value(selectEq) !== L_TRUE;
|
|
148
|
+
};
|
|
149
|
+
for (let index = 1; index < numArgs; index++) {
|
|
150
|
+
const storeIndex = storeArgs[index];
|
|
151
|
+
const selectIndex = selectArgs[index];
|
|
152
|
+
if (this.expr2enode(storeIndex) === this.expr2enode(selectIndex)) continue;
|
|
153
|
+
if (manager.areDistinct(storeIndex, selectIndex)) {
|
|
154
|
+
if (initSelectEq() && this.addClause([selectEq])) isNew = true;
|
|
155
|
+
break;
|
|
156
|
+
}
|
|
157
|
+
const indexEq = this.eqInternalize(storeIndex, selectIndex);
|
|
158
|
+
if (this.s.value(indexEq) === L_TRUE) continue;
|
|
159
|
+
if (this.s.value(indexEq) === L_UNDEF) isNew = true;
|
|
160
|
+
if (!initSelectEq()) break;
|
|
161
|
+
if (this.addClause([indexEq, selectEq])) isNew = true;
|
|
162
|
+
}
|
|
163
|
+
return isNew;
|
|
164
|
+
}
|
|
165
|
+
|
|
166
|
+
private assertSelectConstAxiom(select: number, constArray: number) {
|
|
167
|
+
const value = this.manager.getArg(constArray, 0);
|
|
168
|
+
const constSelect = this.mkSelect([constArray, ...this.getAppArgs(select).slice(1)]);
|
|
169
|
+
return this.propagateAxiomEq(
|
|
170
|
+
this.eInternalize(constSelect),
|
|
171
|
+
this.expr2enode(value) as Enode,
|
|
172
|
+
[],
|
|
173
|
+
);
|
|
174
|
+
}
|
|
175
|
+
|
|
176
|
+
private assertExtensionality(first: number, second: number) {
|
|
177
|
+
const manager = this.manager;
|
|
178
|
+
return this.withTemporaries(() => {
|
|
179
|
+
const diffs = this.sort2diff(manager.sorts[first]).map((decl) =>
|
|
180
|
+
this.rewriteLater(manager.mkApp(decl, [first, second], manager.funcDecls[decl].range)),
|
|
181
|
+
);
|
|
182
|
+
const firstSelect = this.mkSelect([first, ...diffs]);
|
|
183
|
+
const secondSelect = this.mkSelect([second, ...diffs]);
|
|
184
|
+
const arrayEq = this.eqInternalize(first, second);
|
|
185
|
+
const selectEq = this.eqInternalize(firstSelect, secondSelect);
|
|
186
|
+
return this.addClause([arrayEq, selectEq ^ 1]);
|
|
187
|
+
});
|
|
188
|
+
}
|
|
189
|
+
|
|
190
|
+
private assertSelectMapAxiom(select: number, map: number) {
|
|
191
|
+
const indices = this.getAppArgs(select).slice(1);
|
|
192
|
+
return this.withTemporaries(() => {
|
|
193
|
+
const selects = this.getAppArgs(map).map((arg) => this.mkSelect([arg, ...indices]));
|
|
194
|
+
const mapSelect = this.mkSelect([map, ...indices]);
|
|
195
|
+
const applied = this.rewriteLater(this.applyMap(map, selects));
|
|
196
|
+
return this.propagateAxiomEq(this.eInternalize(mapSelect), this.eInternalize(applied), []);
|
|
197
|
+
});
|
|
198
|
+
}
|
|
199
|
+
|
|
200
|
+
private assertSelectAsArrayAxiom(select: number, asArray: number) {
|
|
201
|
+
const manager = this.manager;
|
|
202
|
+
const decl = manager.funcDecls[manager.decls[asArray]].parameters[0];
|
|
203
|
+
const indices = this.getAppArgs(select).slice(1);
|
|
204
|
+
const asArraySelect = this.mkSelect([asArray, ...indices]);
|
|
205
|
+
const value = manager.mkApp(decl, indices, manager.funcDecls[decl].range);
|
|
206
|
+
return this.propagateAxiomEq(this.eInternalize(asArraySelect), this.eInternalize(value), []);
|
|
207
|
+
}
|
|
208
|
+
|
|
209
|
+
// Owned by the caller's temporaries.
|
|
210
|
+
private applyMap(map: number, args: number[]) {
|
|
211
|
+
const manager = this.manager;
|
|
212
|
+
const decl = manager.funcDecls[manager.decls[map]].parameters[0];
|
|
213
|
+
return this.rewriteLater(manager.mkApp(decl, args, manager.funcDecls[decl].range));
|
|
214
|
+
}
|
|
215
|
+
|
|
216
|
+
private assertDefaultMapAxiom(map: number) {
|
|
217
|
+
return this.withTemporaries(() => {
|
|
218
|
+
const defaults = this.getAppArgs(map).map((arg) => this.mkDefault(arg));
|
|
219
|
+
const mapDefault = this.mkDefault(map);
|
|
220
|
+
const applied = this.applyMap(map, defaults);
|
|
221
|
+
return this.propagateAxiomEq(this.eInternalize(mapDefault), this.eInternalize(applied), []);
|
|
222
|
+
});
|
|
223
|
+
}
|
|
224
|
+
|
|
225
|
+
private assertDefaultConstAxiom(constArray: number) {
|
|
226
|
+
const value = this.manager.getArg(constArray, 0);
|
|
227
|
+
return this.propagateAxiomEq(
|
|
228
|
+
this.expr2enode(value) as Enode,
|
|
229
|
+
this.eInternalize(this.mkDefault(constArray)),
|
|
230
|
+
[],
|
|
231
|
+
);
|
|
232
|
+
}
|
|
233
|
+
|
|
234
|
+
private assertDefaultStoreAxiom(store: number) {
|
|
235
|
+
const manager = this.manager;
|
|
236
|
+
const args = this.getAppArgs(store);
|
|
237
|
+
const storeDefaultExpr = this.mkDefault(store);
|
|
238
|
+
const arrayDefaultExpr = this.mkDefault(args[0]);
|
|
239
|
+
const isNew =
|
|
240
|
+
this.ctx.getEnode(storeDefaultExpr) === undefined ||
|
|
241
|
+
this.ctx.getEnode(arrayDefaultExpr) === undefined;
|
|
242
|
+
const storeDefault = this.eInternalize(storeDefaultExpr);
|
|
243
|
+
const internalizedArrayDefault = this.eInternalize(arrayDefaultExpr);
|
|
244
|
+
const arrayDefault = hasUnitaryDomain(manager, store)
|
|
245
|
+
? this.eInternalize(args[args.length - 1])
|
|
246
|
+
: internalizedArrayDefault;
|
|
247
|
+
if (!hasUnitaryDomain(manager, store) && !hasLargeDomain(manager, store)) {
|
|
248
|
+
const epsilons: number[] = [];
|
|
249
|
+
const diagonals: number[] = [];
|
|
250
|
+
for (const arg of args.slice(1, -1)) {
|
|
251
|
+
const sort = manager.sorts[arg];
|
|
252
|
+
const epsilon = this.mkEpsilon(sort);
|
|
253
|
+
epsilons.push(epsilon.epsilon);
|
|
254
|
+
diagonals.push(manager.mkApp(epsilon.diag, [arg], sort));
|
|
255
|
+
}
|
|
256
|
+
const isFirst = this.propagateAxiomEq(
|
|
257
|
+
this.eInternalize(this.mkSelect([store, ...epsilons])),
|
|
258
|
+
storeDefault,
|
|
259
|
+
[],
|
|
260
|
+
);
|
|
261
|
+
const isSecond = this.propagateAxiomEq(
|
|
262
|
+
this.eInternalize(this.mkSelect([args[0], ...epsilons])),
|
|
263
|
+
arrayDefault,
|
|
264
|
+
[],
|
|
265
|
+
);
|
|
266
|
+
const isThird = this.propagateAxiomEq(
|
|
267
|
+
this.eInternalize(this.mkSelect([store, ...diagonals])),
|
|
268
|
+
this.eInternalize(this.mkSelect([args[0], ...diagonals])),
|
|
269
|
+
[],
|
|
270
|
+
);
|
|
271
|
+
return isFirst || isSecond || isThird || isNew;
|
|
272
|
+
}
|
|
273
|
+
return this.propagateAxiomEq(storeDefault, arrayDefault, []) || isNew;
|
|
274
|
+
}
|
|
275
|
+
|
|
276
|
+
private assertSelectLambdaAxiom(select: number, lambda: number) {
|
|
277
|
+
return this.withTemporaries(() => {
|
|
278
|
+
const alpha = this.mkSelect([lambda, ...this.getAppArgs(select).slice(1)]);
|
|
279
|
+
const beta = this.rewriteLater(alpha);
|
|
280
|
+
return this.propagateAxiomEq(this.eInternalize(alpha), this.eInternalize(beta), []);
|
|
281
|
+
});
|
|
282
|
+
}
|
|
283
|
+
|
|
284
|
+
private mkEpsilon(sort: number) {
|
|
285
|
+
const manager = this.manager;
|
|
286
|
+
const trail = this.ctx.trail;
|
|
287
|
+
let epsilon = this.sort2epsilon.get(sort);
|
|
288
|
+
if (epsilon === undefined) {
|
|
289
|
+
const created = manager.mkFreshConst("epsilon", sort);
|
|
290
|
+
manager.incRef(created);
|
|
291
|
+
this.sort2epsilon.set(sort, created);
|
|
292
|
+
trail.push(() => {
|
|
293
|
+
this.sort2epsilon.delete(sort);
|
|
294
|
+
manager.decRef(created);
|
|
295
|
+
});
|
|
296
|
+
epsilon = created;
|
|
297
|
+
}
|
|
298
|
+
let diag = this.sort2diag.get(sort);
|
|
299
|
+
if (diag === undefined) {
|
|
300
|
+
const created = manager.mkFreshFuncDecl("diag", [sort], sort);
|
|
301
|
+
this.sort2diag.set(sort, created);
|
|
302
|
+
trail.push(() => this.sort2diag.delete(sort));
|
|
303
|
+
diag = created;
|
|
304
|
+
}
|
|
305
|
+
return { epsilon, diag };
|
|
306
|
+
}
|
|
307
|
+
|
|
308
|
+
protected addDelayedAxioms() {
|
|
309
|
+
let isChanged = false;
|
|
310
|
+
for (let thVar = 0; thVar < this.numVars; thVar++) {
|
|
311
|
+
const data = this.getVarData(thVar);
|
|
312
|
+
if (!data.isPropUpward) continue;
|
|
313
|
+
const node = this.var2enodeOf(thVar);
|
|
314
|
+
for (const lambda of data.parentLambdas) this.propagateSelectAxioms(data, lambda);
|
|
315
|
+
if (this.addAsArrayEqs(node)) isChanged = true;
|
|
316
|
+
if (!node.parents.some((parent) => this.isOp(parent.owner, OP_ARRAY_DEFAULT)))
|
|
317
|
+
this.propagateParentDefault(thVar);
|
|
318
|
+
}
|
|
319
|
+
const size = this.axiomTrail.length;
|
|
320
|
+
for (this.delayQhead = 0; this.delayQhead < size; this.delayQhead++)
|
|
321
|
+
if (
|
|
322
|
+
this.axiomTrail[this.delayQhead].state === STATE_DELAYED &&
|
|
323
|
+
this.assertAxiom(this.delayQhead)
|
|
324
|
+
)
|
|
325
|
+
isChanged = true;
|
|
326
|
+
this.isDelayEnabled = false;
|
|
327
|
+
if (this.unitPropagate()) isChanged = true;
|
|
328
|
+
this.isDelayEnabled = true;
|
|
329
|
+
return isChanged;
|
|
330
|
+
}
|
|
331
|
+
|
|
332
|
+
private addAsArrayEqs(node: Enode) {
|
|
333
|
+
const manager = this.manager;
|
|
334
|
+
if (!this.isOp(node.owner, OP_AS_ARRAY)) return false;
|
|
335
|
+
const decl = manager.funcDecls[manager.decls[node.owner]].parameters[0];
|
|
336
|
+
const nodes = this.ctx.egraph.enodesOf(decl);
|
|
337
|
+
let isChanged = false;
|
|
338
|
+
for (let index = 0; index < nodes.length; index++) {
|
|
339
|
+
const app = nodes[index];
|
|
340
|
+
const select = this.mkSelect([node.owner, ...this.getAppArgs(app.owner)]);
|
|
341
|
+
if (this.eInternalize(select).root !== app.root) {
|
|
342
|
+
this.addUnit(this.eqInternalize(select, app.owner));
|
|
343
|
+
isChanged = true;
|
|
344
|
+
}
|
|
345
|
+
}
|
|
346
|
+
return isChanged;
|
|
347
|
+
}
|
|
348
|
+
|
|
349
|
+
protected addInterfaceEqualities() {
|
|
350
|
+
const manager = this.manager;
|
|
351
|
+
this.collectDefaults();
|
|
352
|
+
const roots = this.collectSharedVars();
|
|
353
|
+
let isPropagated = false;
|
|
354
|
+
for (let first = roots.length; first-- > 0;) {
|
|
355
|
+
const firstVar = roots[first];
|
|
356
|
+
const firstExpr = this.var2expr(firstVar);
|
|
357
|
+
for (let second = first; second-- > 0;) {
|
|
358
|
+
const secondVar = roots[second];
|
|
359
|
+
const secondExpr = this.var2expr(secondVar);
|
|
360
|
+
if (manager.sorts[firstExpr] !== manager.sorts[secondExpr]) continue;
|
|
361
|
+
if (this.mustHaveDifferentModelValues(firstVar, secondVar)) continue;
|
|
362
|
+
if (this.ctx.egraph.areDiseq(this.var2enodeOf(firstVar), this.var2enodeOf(secondVar)))
|
|
363
|
+
continue;
|
|
364
|
+
if (this.s.value(this.eqInternalize(firstExpr, secondExpr)) === L_UNDEF)
|
|
365
|
+
isPropagated = true;
|
|
366
|
+
}
|
|
367
|
+
}
|
|
368
|
+
return isPropagated;
|
|
369
|
+
}
|
|
370
|
+
|
|
371
|
+
private collectSharedVars() {
|
|
372
|
+
const roots: number[] = [];
|
|
373
|
+
const marked = new Set<Enode>();
|
|
374
|
+
for (let thVar = 0; thVar < this.numVars; thVar++) {
|
|
375
|
+
const node = this.var2enodeOf(thVar);
|
|
376
|
+
if (!this.isArray(node.owner)) continue;
|
|
377
|
+
const root = node.root;
|
|
378
|
+
if (marked.has(root)) continue;
|
|
379
|
+
if (this.ctx.isShared(root) || this.isSharedArg(root)) roots.push(root.getThVar(this.id));
|
|
380
|
+
marked.add(root);
|
|
381
|
+
}
|
|
382
|
+
return roots;
|
|
383
|
+
}
|
|
384
|
+
|
|
385
|
+
protected checkLambdas() {
|
|
386
|
+
for (let thVar = 0; thVar < this.numVars; thVar++) {
|
|
387
|
+
const node = this.var2enodeOf(thVar);
|
|
388
|
+
if (!this.isOp(node.owner, OP_AS_ARRAY) && !this.isLambda(node.owner)) continue;
|
|
389
|
+
for (const parent of node.parents) if (!this.ctx.isBetaRedex(parent, node)) return false;
|
|
390
|
+
}
|
|
391
|
+
return true;
|
|
392
|
+
}
|
|
393
|
+
|
|
394
|
+
private isSharedArg(root: Enode) {
|
|
395
|
+
for (const parent of root.parents) {
|
|
396
|
+
const expr = parent.owner;
|
|
397
|
+
if (this.isOp(expr, OP_SELECT))
|
|
398
|
+
for (let index = 1; index < parent.numArgs; index++)
|
|
399
|
+
if (root === parent.getArg(index).root) return true;
|
|
400
|
+
if (this.isOp(expr, OP_CONST_ARRAY)) return true;
|
|
401
|
+
if (this.isOp(expr, OP_ARRAY_EXT)) return true;
|
|
402
|
+
}
|
|
403
|
+
return false;
|
|
404
|
+
}
|
|
405
|
+
|
|
406
|
+
protected checkConstArrays() {
|
|
407
|
+
const manager = this.manager;
|
|
408
|
+
const constArrays: Enode[] = [];
|
|
409
|
+
const seen = new Set<Enode>();
|
|
410
|
+
for (let thVar = 0; thVar < this.numVars; thVar++) {
|
|
411
|
+
const node = this.var2enodeOf(thVar);
|
|
412
|
+
if (!this.isOp(node.owner, OP_CONST_ARRAY) || seen.has(node.root)) continue;
|
|
413
|
+
seen.add(node.root);
|
|
414
|
+
constArrays.push(node);
|
|
415
|
+
}
|
|
416
|
+
if (constArrays.length < 2) return L_TRUE;
|
|
417
|
+
const reachable = (constArray: Enode) => {
|
|
418
|
+
const initial: Reach = { root: constArray.root, parent: null, store: null };
|
|
419
|
+
const result = [initial];
|
|
420
|
+
const visited = new Set([constArray.root]);
|
|
421
|
+
for (let qhead = 0; qhead < result.length; qhead++) {
|
|
422
|
+
const current = result[qhead];
|
|
423
|
+
for (const parent of current.root.parents) {
|
|
424
|
+
if (!this.isOp(parent.owner, OP_STORE) || parent.getArg(0).root !== current.root)
|
|
425
|
+
continue;
|
|
426
|
+
if (visited.has(parent.root)) continue;
|
|
427
|
+
visited.add(parent.root);
|
|
428
|
+
result.push({ root: parent.root, parent: current, store: parent });
|
|
429
|
+
}
|
|
430
|
+
}
|
|
431
|
+
return result;
|
|
432
|
+
};
|
|
433
|
+
const isSameIndex = (first: Enode, second: Enode) => {
|
|
434
|
+
if (first.numArgs !== second.numArgs) return false;
|
|
435
|
+
for (let index = 1; index + 1 < first.numArgs; index++)
|
|
436
|
+
if (first.getArg(index).root !== second.getArg(index).root) return false;
|
|
437
|
+
return true;
|
|
438
|
+
};
|
|
439
|
+
const addEq = (first: Enode, second: Enode, eqs: [Enode, Enode][]) => {
|
|
440
|
+
if (first !== second) eqs.push([first, second]);
|
|
441
|
+
};
|
|
442
|
+
const addIndices = (inputPath: Reach, indices: Enode[], eqs: [Enode, Enode][]) => {
|
|
443
|
+
for (let path = inputPath; path.store !== null; path = path.parent as Reach) {
|
|
444
|
+
const store = path.store;
|
|
445
|
+
const old = indices.find((index) => isSameIndex(store, index));
|
|
446
|
+
if (old === undefined) {
|
|
447
|
+
indices.push(store);
|
|
448
|
+
continue;
|
|
449
|
+
}
|
|
450
|
+
for (let index = 1; index + 1 < store.numArgs; index++)
|
|
451
|
+
addEq(store.getArg(index), old.getArg(index), eqs);
|
|
452
|
+
}
|
|
453
|
+
};
|
|
454
|
+
const addPathEqs = (constArray: Enode, inputPath: Reach, eqs: [Enode, Enode][]) => {
|
|
455
|
+
let initial = inputPath;
|
|
456
|
+
while (initial.parent !== null) initial = initial.parent;
|
|
457
|
+
addEq(constArray, initial.root, eqs);
|
|
458
|
+
for (let path = inputPath; path.store !== null; path = path.parent as Reach) {
|
|
459
|
+
addEq(path.store.getArg(0), (path.parent as Reach).root, eqs);
|
|
460
|
+
addEq(path.store, path.root, eqs);
|
|
461
|
+
}
|
|
462
|
+
};
|
|
463
|
+
const internalizeSelect = (constArray: Enode, indices: number[]) => {
|
|
464
|
+
const select = this.mkSelect([constArray.owner, ...indices]);
|
|
465
|
+
const isNew = this.ctx.egraph.find(select) === undefined;
|
|
466
|
+
this.eInternalize(select);
|
|
467
|
+
return isNew;
|
|
468
|
+
};
|
|
469
|
+
const allReachable = constArrays.map(reachable);
|
|
470
|
+
let hasUninterpreted = false;
|
|
471
|
+
for (let first = 0; first < constArrays.length; first++) {
|
|
472
|
+
const firstValue = constArrays[first].getArg(0);
|
|
473
|
+
for (let second = first + 1; second < constArrays.length; second++) {
|
|
474
|
+
const secondValue = constArrays[second].getArg(0);
|
|
475
|
+
if (firstValue.root === secondValue.root) continue;
|
|
476
|
+
let firstPath: Reach | undefined;
|
|
477
|
+
let secondPath: Reach | undefined;
|
|
478
|
+
for (const firstReach of allReachable[first]) {
|
|
479
|
+
secondPath = allReachable[second].find((reach) => reach.root === firstReach.root);
|
|
480
|
+
if (secondPath !== undefined) {
|
|
481
|
+
firstPath = firstReach;
|
|
482
|
+
break;
|
|
483
|
+
}
|
|
484
|
+
}
|
|
485
|
+
if (firstPath === undefined || secondPath === undefined) continue;
|
|
486
|
+
const indices: Enode[] = [];
|
|
487
|
+
const eqs: [Enode, Enode][] = [];
|
|
488
|
+
addIndices(firstPath, indices, eqs);
|
|
489
|
+
addIndices(secondPath, indices, eqs);
|
|
490
|
+
const sort = manager.sorts[constArrays[first].owner];
|
|
491
|
+
const numIndices = BigInt(indices.length);
|
|
492
|
+
let isDomainExceedingIndices = false;
|
|
493
|
+
let domainSize = 1n;
|
|
494
|
+
let hasUninterp = false;
|
|
495
|
+
for (const domain of manager.getSortParameters(sort).slice(0, -1)) {
|
|
496
|
+
if (manager.isUninterpretedSort(domain)) {
|
|
497
|
+
hasUninterp = true;
|
|
498
|
+
continue;
|
|
499
|
+
}
|
|
500
|
+
const size = manager.getSortSize(domain);
|
|
501
|
+
if (size < 0n || size > numIndices || domainSize > numIndices / size) {
|
|
502
|
+
isDomainExceedingIndices = true;
|
|
503
|
+
break;
|
|
504
|
+
}
|
|
505
|
+
domainSize *= size;
|
|
506
|
+
}
|
|
507
|
+
if (isDomainExceedingIndices || domainSize > numIndices) {
|
|
508
|
+
addPathEqs(constArrays[first], firstPath, eqs);
|
|
509
|
+
addPathEqs(constArrays[second], secondPath, eqs);
|
|
510
|
+
this.propagateAxiomEq(firstValue, secondValue, eqs);
|
|
511
|
+
return L_FALSE;
|
|
512
|
+
}
|
|
513
|
+
let isNew = false;
|
|
514
|
+
for (const store of indices) {
|
|
515
|
+
const storeIndices: number[] = [];
|
|
516
|
+
for (let index = 1; index + 1 < store.numArgs; index++)
|
|
517
|
+
storeIndices.push(store.getArg(index).owner);
|
|
518
|
+
isNew = internalizeSelect(constArrays[first], storeIndices) || isNew;
|
|
519
|
+
isNew = internalizeSelect(constArrays[second], storeIndices) || isNew;
|
|
520
|
+
}
|
|
521
|
+
if (isNew) return L_FALSE;
|
|
522
|
+
if (hasUninterp) hasUninterpreted = true;
|
|
523
|
+
}
|
|
524
|
+
}
|
|
525
|
+
return hasUninterpreted ? L_UNDEF : L_TRUE;
|
|
526
|
+
}
|
|
527
|
+
}
|