tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.68b2c4968
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 +2 -1
- package/dist/compile.cjs +3 -3
- package/dist/compile.js +1 -1
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +45 -41
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +4 -1
- package/dist/index.d.ts +4 -1
- 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 +2682 -426
- package/dist/prove.js +2679 -423
- package/dist/run.cjs +43 -42
- package/dist/run.js +44 -43
- package/dist/tlapm.cjs +1 -1
- package/dist/tlapm.js +1 -1
- package/dist/transfer.cjs +44 -41
- package/dist/transfer.js +43 -40
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +3 -3
- package/src/bags.ts +46 -28
- package/src/check-trace.ts +2 -16
- package/src/check.ts +349 -91
- package/src/cli/runtime-invariants.ts +20 -56
- package/src/cli/tlapm.ts +424 -62
- package/src/cli/tlc-arguments.ts +2 -2
- package/src/cli/tlc-output.ts +4 -5
- package/src/cli/tlc-usage.ts +0 -1
- package/src/cli/tlc.ts +26 -7
- package/src/codegen.ts +6 -2
- package/src/dependencies.ts +72 -11
- package/src/dfid.ts +9 -2
- package/src/environment.ts +27 -5
- package/src/errors.ts +38 -3
- package/src/evaluate.ts +92 -32
- package/src/exit-codes.ts +5 -2
- package/src/instances.ts +1 -1
- package/src/levels.ts +134 -86
- package/src/lexer.ts +5 -3
- package/src/liveness-checker.ts +572 -204
- package/src/liveness.ts +47 -32
- package/src/obligations/action.ts +10 -6
- package/src/obligations/anonymize.ts +33 -14
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +18 -6
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +22 -17
- package/src/obligations/index.ts +36 -6
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +1 -3
- package/src/obligations/normalize.ts +24 -13
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +43 -13
- package/src/obligations/proof.ts +3 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +17 -7
- package/src/obligations/source.ts +71 -17
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +0 -2
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +8 -2
- package/src/parallel.ts +7 -2
- package/src/parser.ts +634 -186
- package/src/pretty-print.ts +1 -1
- package/src/prover/deciders.ts +11 -8
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +71 -41
- 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 +149 -3
- package/src/prover/isabelle/isar/method.ts +506 -198
- package/src/prover/isabelle/isar/proof.ts +570 -14
- package/src/prover/isabelle/isar/rule-cases.ts +226 -0
- package/src/prover/isabelle/isar/theory.ts +479 -69
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +83 -8
- package/src/prover/isabelle/provers/blast/blast.ts +0 -2
- package/src/prover/isabelle/provers/blast/branch.ts +0 -2
- package/src/prover/isabelle/provers/blast/prove.ts +0 -2
- package/src/prover/isabelle/provers/blast/rules.ts +0 -2
- package/src/prover/isabelle/provers/blast/state.ts +0 -2
- package/src/prover/isabelle/provers/blast/term.ts +0 -2
- package/src/prover/isabelle/provers/clasimp.ts +1 -3
- package/src/prover/isabelle/provers/classical.ts +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +2 -4
- package/src/prover/isabelle/pure/bicompose.ts +0 -2
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +0 -2
- package/src/prover/isabelle/pure/drule.ts +63 -4
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +1 -3
- package/src/prover/isabelle/pure/logic.ts +0 -2
- package/src/prover/isabelle/pure/name.ts +0 -2
- package/src/prover/isabelle/pure/net.ts +0 -2
- package/src/prover/isabelle/pure/object-logic.ts +13 -7
- package/src/prover/isabelle/pure/pattern.ts +0 -2
- package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
- package/src/prover/isabelle/pure/rewriter.ts +1 -8
- package/src/prover/isabelle/pure/search.ts +0 -2
- package/src/prover/isabelle/pure/seq.ts +0 -2
- package/src/prover/isabelle/pure/simplifier.ts +26 -7
- package/src/prover/isabelle/pure/table.ts +0 -2
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +0 -2
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +0 -2
- package/src/prover/isabelle/pure/thm.ts +0 -2
- package/src/prover/isabelle/pure/type.ts +0 -2
- package/src/prover/isabelle/pure/unify.ts +0 -2
- package/src/prover/isabelle/pure/variable.ts +0 -2
- package/src/prover/isabelle/tla/classical-setup.ts +1 -2
- package/src/prover/isabelle/tla/context.ts +51 -9
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +40 -1
- package/src/prover/isabelle/tla/simpdata.ts +0 -2
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +19 -12
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/methods.ts +159 -50
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +343 -65
- package/src/prover/ptl/decide.ts +95 -50
- package/src/prover/ptl/encode.ts +2 -3
- package/src/prover/ptl/tableau.ts +28 -2
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -8
- package/src/prover/smt/context.ts +42 -6
- package/src/prover/smt/data.ts +191 -84
- package/src/prover/smt/encode.ts +122 -43
- package/src/prover/smt/extensionality.ts +5 -3
- package/src/prover/smt/flatten.ts +4 -6
- package/src/prover/smt/format.ts +28 -4
- package/src/prover/smt/instances.ts +7 -1
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +483 -116
- 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 -1
- 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 +613 -6
- 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/asserted-formulas.ts +93 -15
- package/src/prover/smt/solver/ast-lt.ts +165 -11
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1449 -41
- package/src/prover/smt/solver/auf-solver.ts +0 -1
- 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 +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 +109 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -2
- package/src/prover/smt/solver/cg-table.ts +39 -25
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +533 -114
- package/src/prover/smt/solver/ctx-simplify.ts +21 -12
- 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 +38 -10
- 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 +260 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -1
- package/src/prover/smt/solver/e-matching.ts +6 -7
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
- package/src/prover/smt/solver/enode.ts +100 -3
- 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 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
- 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 +267 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -15
- package/src/prover/smt/solver/fix-dl-var.ts +147 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- 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 +177 -15
- 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 -1
- package/src/prover/smt/solver/hashtable.ts +30 -16
- 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 +109 -36
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -1
- 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 -1
- package/src/prover/smt/solver/logic-tactics.ts +345 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
- package/src/prover/smt/solver/lp/constraints.ts +0 -1
- package/src/prover/smt/solver/lp/containers.ts +7 -2
- package/src/prover/smt/solver/lp/core-solver.ts +18 -3
- package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
- package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
- package/src/prover/smt/solver/lp/dependency.ts +0 -2
- package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
- package/src/prover/smt/solver/lp/explanation.ts +0 -1
- package/src/prover/smt/solver/lp/gomory.ts +0 -1
- package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
- package/src/prover/smt/solver/lp/hnf.ts +0 -3
- package/src/prover/smt/solver/lp/int-cube.ts +3 -4
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
- package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
- package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
- package/src/prover/smt/solver/lp/nex.ts +2 -2
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
- package/src/prover/smt/solver/lp/nla-core.ts +66 -11
- package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
- package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
- package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
- package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
- package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
- package/src/prover/smt/solver/lp/nla-order.ts +0 -2
- package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -2
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
- package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
- package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
- package/src/prover/smt/solver/lp/pdd.ts +725 -290
- package/src/prover/smt/solver/lp/random-updater.ts +0 -2
- package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
- package/src/prover/smt/solver/lp/union-find.ts +7 -2
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +118 -88
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- 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 -6
- 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 +17 -26
- package/src/prover/smt/solver/model-evaluator.ts +188 -12
- package/src/prover/smt/solver/model-finder.ts +0 -1
- package/src/prover/smt/solver/model-generator.ts +59 -30
- package/src/prover/smt/solver/model-macro-solver.ts +38 -27
- 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 +410 -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 +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 +305 -88
- package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +424 -211
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
- package/src/prover/smt/solver/nlsat/solver.ts +282 -69
- 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 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
- package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +105 -23
- 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 +792 -0
- package/src/prover/smt/solver/opt-nlsat.ts +386 -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 +311 -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 +19 -11
- 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 +202 -57
- package/src/prover/smt/solver/probes.ts +511 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +650 -17
- package/src/prover/smt/solver/pull-quant.ts +28 -12
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -3
- package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
- package/src/prover/smt/solver/qe-lite.ts +37 -17
- 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 -1
- 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 +16 -56
- package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
- package/src/prover/smt/solver/quantifier-manager.ts +25 -24
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +45 -1
- 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 -1
- package/src/prover/smt/solver/relevancy.ts +1 -2
- package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
- package/src/prover/smt/solver/rewriter.ts +475 -36
- package/src/prover/smt/solver/rlimit.ts +38 -2
- 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 +44 -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 +2105 -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 +90 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +544 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3228 -327
- package/src/prover/smt/solver/smtlib-script.ts +1843 -0
- package/src/prover/smt/solver/solve-eqs.ts +923 -0
- package/src/prover/smt/solver/solver.ts +113 -22
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +2012 -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 +53 -2
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -5
- package/src/prover/smt/solver/theory-lra-final-check.ts +56 -71
- package/src/prover/smt/solver/theory-lra-internalize.ts +89 -11
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -28
- package/src/prover/smt/solver/theory-lra-state.ts +6 -22
- package/src/prover/smt/solver/theory-lra.ts +188 -2
- package/src/prover/smt/solver/theory-pb.ts +933 -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.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
- package/src/prover/smt/solver/var-subst.ts +36 -14
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +29 -8
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +2 -0
- package/src/prover/zenon/decide.ts +10 -7
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +0 -2
- package/src/prover/zenon/equality-rules.ts +24 -2
- package/src/prover/zenon/expr.ts +21 -2
- package/src/prover/zenon/index-table.ts +7 -4
- package/src/prover/zenon/isar-case.ts +1 -3
- package/src/prover/zenon/isar.ts +2 -4
- package/src/prover/zenon/llproof.ts +0 -2
- package/src/prover/zenon/mltoll.ts +0 -2
- package/src/prover/zenon/node.ts +20 -5
- package/src/prover/zenon/parse.ts +6 -2
- package/src/prover/zenon/phrase.ts +1 -3
- package/src/prover/zenon/proof.ts +0 -2
- package/src/prover/zenon/propositional-rules.ts +0 -2
- package/src/prover/zenon/rules.ts +2 -3
- package/src/prover/zenon/search.ts +7 -5
- package/src/prover/zenon/tla/functions.ts +0 -2
- package/src/prover/zenon/tla/llproof.ts +0 -2
- package/src/prover/zenon/tla/records.ts +0 -2
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +7 -8
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +0 -2
- package/src/resolve.ts +264 -77
- package/src/runtime.ts +6 -0
- package/src/sany/generation.ts +1 -13
- package/src/sany/generator-definitions.ts +2 -1
- package/src/sany/generator-expressions.ts +30 -27
- package/src/sany/generator-proofs.ts +1 -1
- package/src/sany/generator.ts +2 -1
- package/src/sany/levels.ts +0 -2
- package/src/sany/linter.ts +0 -2
- package/src/sany/nodes.ts +1 -1
- package/src/sany/selectors.ts +6 -5
- package/src/search.ts +209 -56
- package/src/simulate.ts +3 -0
- package/src/spec-description.ts +2 -2
- package/src/standard-definitions.ts +4 -0
- package/src/state-graph.ts +0 -2
- package/src/subexpressions.ts +165 -78
- package/src/successors.ts +2 -1
- package/src/symmetry.ts +2 -2
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/jar-data.ts +12 -0
- package/src/tlc/order.ts +14 -3
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlcext-operators.ts +61 -16
- package/src/tlc/trace-spec.ts +2 -3
- package/src/typed-tier.ts +6541 -0
- package/src/typescript/types.ts +2 -2
- package/src/values.ts +42 -23
- package/src/prover/isabelle/isar/statement.ts +0 -52
- 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,441 @@
|
|
|
1
|
+
// encode/n_rewrite.ml: elim_notmem, elim_bounds, apply_ext and simplify_sets, the rewrites of sets
|
|
2
|
+
// that tlapm's --debug flags rwsetext, rw and rw+ turn on.
|
|
3
|
+
|
|
4
|
+
import {
|
|
5
|
+
applyBuiltin,
|
|
6
|
+
at,
|
|
7
|
+
mapChildren,
|
|
8
|
+
mapHyp,
|
|
9
|
+
type Bound,
|
|
10
|
+
type BoundDomain,
|
|
11
|
+
type Builtin,
|
|
12
|
+
type Expr,
|
|
13
|
+
type Hyp,
|
|
14
|
+
type Sequent,
|
|
15
|
+
} from "../../obligations/expression";
|
|
16
|
+
import {
|
|
17
|
+
bumpBy,
|
|
18
|
+
consSubstitution,
|
|
19
|
+
shift,
|
|
20
|
+
shiftExpr,
|
|
21
|
+
substituteExpr,
|
|
22
|
+
substituteHyp,
|
|
23
|
+
type Substitution,
|
|
24
|
+
} from "../../obligations/substitution";
|
|
25
|
+
import type { Polarity } from "./extensionality";
|
|
26
|
+
|
|
27
|
+
const getBuiltin = (expression: Expr) =>
|
|
28
|
+
expression.kind === "Apply" && expression.operator.kind === "Internal"
|
|
29
|
+
? expression.operator.builtin
|
|
30
|
+
: undefined;
|
|
31
|
+
|
|
32
|
+
const builtin = (name: Builtin, args: Expr[]): Expr => applyBuiltin(name, args, {});
|
|
33
|
+
|
|
34
|
+
const variable = (index: number): Expr => ({ kind: "Ix", index });
|
|
35
|
+
|
|
36
|
+
const NO_DOMAIN: BoundDomain = { kind: "NoDomain" };
|
|
37
|
+
|
|
38
|
+
const getUnbounded = (name: string): Bound => ({ name, level: "Constant", domain: NO_DOMAIN });
|
|
39
|
+
|
|
40
|
+
const mapHypExpressions = (hyp: Hyp, map: (expression: Expr) => Expr) => mapHyp(hyp, map, "all");
|
|
41
|
+
|
|
42
|
+
const elimNotmem = (expression: Expr): Expr => {
|
|
43
|
+
const inner = mapChildren(expression, elimNotmem);
|
|
44
|
+
if (inner.kind !== "Apply" || getBuiltin(inner) !== "Notmem") return inner;
|
|
45
|
+
return at(builtin("Neg", [builtin("Mem", inner.args)]), inner);
|
|
46
|
+
};
|
|
47
|
+
|
|
48
|
+
// Each bound's domain becomes a membership after the quantifier, the first bound's the farthest.
|
|
49
|
+
const elimBoundsQuantifier = (expression: Extract<Expr, { kind: "Quant" }>): Expr => {
|
|
50
|
+
const count = expression.bounds.length;
|
|
51
|
+
const domains = expression.bounds.reduce<(Expr | undefined)[]>((found, bound) => {
|
|
52
|
+
if (bound.domain.kind === "Domain")
|
|
53
|
+
return [...found, shiftExpr(count, elimBounds(bound.domain.expression))];
|
|
54
|
+
return [...found, bound.domain.kind === "Ditto" ? found.at(-1) : undefined];
|
|
55
|
+
}, []);
|
|
56
|
+
const memberships = domains.flatMap((domain, index) =>
|
|
57
|
+
domain === undefined ? [] : [builtin("Mem", [variable(count - index), domain])],
|
|
58
|
+
);
|
|
59
|
+
const body = elimBounds(expression.body);
|
|
60
|
+
const bounds = expression.bounds.map((bound) => ({ ...bound, domain: NO_DOMAIN }));
|
|
61
|
+
if (memberships.length === 0) return { ...expression, bounds, body };
|
|
62
|
+
const guarded =
|
|
63
|
+
expression.quantifier === "Exists"
|
|
64
|
+
? ({ kind: "List", bullet: "And", items: [...memberships, body] } satisfies Expr)
|
|
65
|
+
: builtin("Implies", [
|
|
66
|
+
memberships.length === 1
|
|
67
|
+
? memberships[0]
|
|
68
|
+
: { kind: "List", bullet: "And", items: memberships },
|
|
69
|
+
body,
|
|
70
|
+
]);
|
|
71
|
+
return { ...expression, bounds, body: guarded };
|
|
72
|
+
};
|
|
73
|
+
|
|
74
|
+
const elimBoundsSequent = (sequent: Sequent): Sequent => {
|
|
75
|
+
const state = sequent.context.reduce<{ substitution: Substitution; context: Hyp[] }>(
|
|
76
|
+
(current, hyp) => {
|
|
77
|
+
if (hyp.kind !== "Fresh" || hyp.domain === undefined) {
|
|
78
|
+
const mapped = substituteHyp(current.substitution, hyp);
|
|
79
|
+
return {
|
|
80
|
+
substitution: bumpBy(1, current.substitution),
|
|
81
|
+
context: [...current.context, mapHypExpressions(mapped, elimBounds)],
|
|
82
|
+
};
|
|
83
|
+
}
|
|
84
|
+
const domain = elimBounds(substituteExpr(current.substitution, hyp.domain));
|
|
85
|
+
const fact: Hyp = {
|
|
86
|
+
kind: "Fact",
|
|
87
|
+
expression: builtin("Mem", [variable(1), shiftExpr(1, domain)]),
|
|
88
|
+
visibility: hyp.domainVisibility,
|
|
89
|
+
time: "Now",
|
|
90
|
+
};
|
|
91
|
+
return {
|
|
92
|
+
substitution: {
|
|
93
|
+
kind: "Compose",
|
|
94
|
+
outer: shift(1),
|
|
95
|
+
inner: bumpBy(1, current.substitution),
|
|
96
|
+
},
|
|
97
|
+
context: [...current.context, { ...hyp, domain: undefined }, fact],
|
|
98
|
+
};
|
|
99
|
+
},
|
|
100
|
+
{ substitution: shift(0), context: [] },
|
|
101
|
+
);
|
|
102
|
+
return {
|
|
103
|
+
context: state.context,
|
|
104
|
+
active: elimBounds(substituteExpr(state.substitution, sequent.active)),
|
|
105
|
+
};
|
|
106
|
+
};
|
|
107
|
+
|
|
108
|
+
const elimBounds = (expression: Expr): Expr => {
|
|
109
|
+
if (expression.kind === "Quant") return elimBoundsQuantifier(expression);
|
|
110
|
+
if (expression.kind === "Sequent")
|
|
111
|
+
return { ...expression, sequent: elimBoundsSequent(expression.sequent) };
|
|
112
|
+
if (expression.kind === "Choose" && expression.domain !== undefined) {
|
|
113
|
+
const membership = builtin("Mem", [variable(1), shiftExpr(1, elimBounds(expression.domain))]);
|
|
114
|
+
return {
|
|
115
|
+
...expression,
|
|
116
|
+
domain: undefined,
|
|
117
|
+
body: builtin("Conj", [membership, elimBounds(expression.body)]),
|
|
118
|
+
};
|
|
119
|
+
}
|
|
120
|
+
return mapChildren(expression, elimBounds);
|
|
121
|
+
};
|
|
122
|
+
|
|
123
|
+
const isSet = (expression: Expr) => {
|
|
124
|
+
switch (expression.kind) {
|
|
125
|
+
case "SetEnum":
|
|
126
|
+
case "SetSt":
|
|
127
|
+
case "SetOf":
|
|
128
|
+
case "Product":
|
|
129
|
+
case "Arrow":
|
|
130
|
+
case "Rect":
|
|
131
|
+
return true;
|
|
132
|
+
case "Internal":
|
|
133
|
+
return ["STRING", "BOOLEAN", "Nat", "Int"].includes(expression.builtin);
|
|
134
|
+
case "Apply":
|
|
135
|
+
return (
|
|
136
|
+
expression.args.length === 2 &&
|
|
137
|
+
["Cap", "Cup", "Setminus", "Range"].includes(getBuiltin(expression) ?? "")
|
|
138
|
+
);
|
|
139
|
+
default:
|
|
140
|
+
return false;
|
|
141
|
+
}
|
|
142
|
+
};
|
|
143
|
+
|
|
144
|
+
const invert = (polarity: Polarity): Polarity =>
|
|
145
|
+
polarity === "Positive" ? "Negative" : polarity === "Negative" ? "Positive" : "Neither";
|
|
146
|
+
|
|
147
|
+
// Rewrite.rewrite_by_extensionality: \A x : x \in left <=> x \in right, or => for a subset.
|
|
148
|
+
const getExtensional = (connective: Builtin, left: Expr, right: Expr): Expr => ({
|
|
149
|
+
kind: "Quant",
|
|
150
|
+
quantifier: "Forall",
|
|
151
|
+
bounds: [getUnbounded("x")],
|
|
152
|
+
body: builtin(connective, [
|
|
153
|
+
builtin("Mem", [variable(1), shiftExpr(1, left)]),
|
|
154
|
+
builtin("Mem", [variable(1), shiftExpr(1, right)]),
|
|
155
|
+
]),
|
|
156
|
+
});
|
|
157
|
+
|
|
158
|
+
type Visit = (polarity: Polarity, expression: Expr) => Expr;
|
|
159
|
+
|
|
160
|
+
// The visits of Expr.Visit.map that apply_ext and simplify_sets share: a sequent's hypotheses take
|
|
161
|
+
// the opposite polarity, and the arguments of an application take neither.
|
|
162
|
+
const visitLogic = (visit: Visit, polarity: Polarity, expression: Expr): Expr => {
|
|
163
|
+
if (expression.kind === "Sequent") {
|
|
164
|
+
const sequent = expression.sequent;
|
|
165
|
+
const context = sequent.context.map((hyp) =>
|
|
166
|
+
mapHypExpressions(hyp, (inner) => visit(invert(polarity), inner)),
|
|
167
|
+
);
|
|
168
|
+
return { ...expression, sequent: { context, active: visit(polarity, sequent.active) } };
|
|
169
|
+
}
|
|
170
|
+
if (expression.kind !== "Apply")
|
|
171
|
+
return mapChildren(expression, (inner) => visit(polarity, inner));
|
|
172
|
+
const args = expression.args;
|
|
173
|
+
switch (getBuiltin(expression)) {
|
|
174
|
+
case "Implies":
|
|
175
|
+
return { ...expression, args: [visit(invert(polarity), args[0]), visit(polarity, args[1])] };
|
|
176
|
+
case "Equiv":
|
|
177
|
+
return at(
|
|
178
|
+
builtin("Conj", [
|
|
179
|
+
builtin("Implies", [visit(invert(polarity), args[0]), visit(polarity, args[1])]),
|
|
180
|
+
builtin("Implies", [visit(invert(polarity), args[1]), visit(polarity, args[0])]),
|
|
181
|
+
]),
|
|
182
|
+
expression,
|
|
183
|
+
);
|
|
184
|
+
case "Neg":
|
|
185
|
+
return { ...expression, args: [visit(invert(polarity), args[0])] };
|
|
186
|
+
default:
|
|
187
|
+
return { ...expression, args: args.map((arg) => visit("Neither", arg)) };
|
|
188
|
+
}
|
|
189
|
+
};
|
|
190
|
+
|
|
191
|
+
// Rewrite.apply_ext_visitor. Synthesize gives every equality the sort Idv, which apply_ext reads
|
|
192
|
+
// back as its type parameter. It finds none on \subseteq and raises an internal error, so this
|
|
193
|
+
// rewrites \subseteq over Idv.
|
|
194
|
+
const applyExt: Visit = (polarity, expression) => {
|
|
195
|
+
if (expression.kind === "Apply" && expression.args.length === 2) {
|
|
196
|
+
const left = expression.args[0];
|
|
197
|
+
const right = expression.args[1];
|
|
198
|
+
const isSetEquality = isSet(left) || isSet(right);
|
|
199
|
+
const kind = getBuiltin(expression);
|
|
200
|
+
if (kind === "Eq" && polarity === "Positive" && isSetEquality)
|
|
201
|
+
return at(
|
|
202
|
+
getExtensional("Equiv", applyExt(polarity, left), applyExt(polarity, right)),
|
|
203
|
+
expression,
|
|
204
|
+
);
|
|
205
|
+
if (kind === "Neq" && polarity === "Negative" && isSetEquality)
|
|
206
|
+
return at(
|
|
207
|
+
builtin("Neg", [
|
|
208
|
+
getExtensional("Equiv", applyExt(polarity, left), applyExt(polarity, right)),
|
|
209
|
+
]),
|
|
210
|
+
expression,
|
|
211
|
+
);
|
|
212
|
+
if (kind === "Subseteq" && polarity === "Positive")
|
|
213
|
+
return at(
|
|
214
|
+
getExtensional("Implies", applyExt(polarity, left), applyExt(polarity, right)),
|
|
215
|
+
expression,
|
|
216
|
+
);
|
|
217
|
+
if (kind === "Conj" || kind === "Disj")
|
|
218
|
+
return { ...expression, args: [applyExt(polarity, left), applyExt(polarity, right)] };
|
|
219
|
+
}
|
|
220
|
+
return visitLogic(applyExt, polarity, expression);
|
|
221
|
+
};
|
|
222
|
+
|
|
223
|
+
const SET_LIMIT = 10;
|
|
224
|
+
|
|
225
|
+
const getMembership = (polarity: Polarity, element: Expr, set: Expr): Expr | undefined => {
|
|
226
|
+
const visit = (inner: Expr) => simplifySet(polarity, inner);
|
|
227
|
+
const mem = (left: Expr, right: Expr) => builtin("Mem", [left, right]);
|
|
228
|
+
switch (set.kind) {
|
|
229
|
+
case "SetEnum": {
|
|
230
|
+
if (set.elements.length === 0) return { kind: "Internal", builtin: "FALSE" };
|
|
231
|
+
const left = visit(element);
|
|
232
|
+
const equalities = set.elements.map((inner) => builtin("Eq", [left, visit(inner)]));
|
|
233
|
+
return equalities.length === 1
|
|
234
|
+
? equalities[0]
|
|
235
|
+
: { kind: "List", bullet: "Or", items: equalities };
|
|
236
|
+
}
|
|
237
|
+
case "SetSt": {
|
|
238
|
+
const left = visit(element);
|
|
239
|
+
const domain = visit(set.domain);
|
|
240
|
+
const body = visit(set.body);
|
|
241
|
+
return builtin("Conj", [
|
|
242
|
+
mem(left, domain),
|
|
243
|
+
substituteExpr(consSubstitution(left, shift(0)), body),
|
|
244
|
+
]);
|
|
245
|
+
}
|
|
246
|
+
case "SetOf": {
|
|
247
|
+
const left = visit(element);
|
|
248
|
+
const domains = set.bounds
|
|
249
|
+
.map((bound) =>
|
|
250
|
+
bound.domain.kind === "Domain" ? visit(bound.domain.expression) : undefined,
|
|
251
|
+
)
|
|
252
|
+
.reduce<Expr[]>((found, domain) => [...found, domain ?? found[found.length - 1]], []);
|
|
253
|
+
const count = set.bounds.length;
|
|
254
|
+
return {
|
|
255
|
+
kind: "Quant",
|
|
256
|
+
quantifier: "Exists",
|
|
257
|
+
bounds: set.bounds.map((bound) => getUnbounded(bound.name)),
|
|
258
|
+
body: {
|
|
259
|
+
kind: "List",
|
|
260
|
+
bullet: "And",
|
|
261
|
+
items: [
|
|
262
|
+
builtin("Eq", [shiftExpr(count, left), visit(set.element)]),
|
|
263
|
+
// tlapm pairs the first domain with Ix 1, the last bound, so this pairs each with its own.
|
|
264
|
+
...domains.map((domain, index) =>
|
|
265
|
+
mem(variable(count - index), shiftExpr(count, domain)),
|
|
266
|
+
),
|
|
267
|
+
],
|
|
268
|
+
},
|
|
269
|
+
};
|
|
270
|
+
}
|
|
271
|
+
case "Arrow": {
|
|
272
|
+
const left = visit(element);
|
|
273
|
+
const domain = visit(set.domain);
|
|
274
|
+
const range = visit(set.range);
|
|
275
|
+
return {
|
|
276
|
+
kind: "List",
|
|
277
|
+
bullet: "And",
|
|
278
|
+
items: [
|
|
279
|
+
{ kind: "Apply", operator: { kind: "Opaque", name: "IsAFcn" }, args: [left] },
|
|
280
|
+
builtin("Eq", [builtin("DOMAIN", [left]), domain]),
|
|
281
|
+
{
|
|
282
|
+
kind: "Quant",
|
|
283
|
+
quantifier: "Forall",
|
|
284
|
+
bounds: [getUnbounded("x")],
|
|
285
|
+
body: builtin("Implies", [
|
|
286
|
+
mem(variable(1), shiftExpr(1, domain)),
|
|
287
|
+
mem(
|
|
288
|
+
{ kind: "FcnApp", function: shiftExpr(1, left), args: [variable(1)] },
|
|
289
|
+
shiftExpr(1, range),
|
|
290
|
+
),
|
|
291
|
+
]),
|
|
292
|
+
},
|
|
293
|
+
],
|
|
294
|
+
};
|
|
295
|
+
}
|
|
296
|
+
case "Product": {
|
|
297
|
+
const left = visit(element);
|
|
298
|
+
const factors = set.factors.map(visit);
|
|
299
|
+
const component = (index: number): Expr => ({
|
|
300
|
+
kind: "FcnApp",
|
|
301
|
+
function: left,
|
|
302
|
+
args: [{ kind: "Num", integer: String(index + 1), fraction: "" }],
|
|
303
|
+
});
|
|
304
|
+
return {
|
|
305
|
+
kind: "List",
|
|
306
|
+
bullet: "And",
|
|
307
|
+
items: [
|
|
308
|
+
builtin("Eq", [
|
|
309
|
+
left,
|
|
310
|
+
{ kind: "Tuple", elements: factors.map((_value, index) => component(index)) },
|
|
311
|
+
]),
|
|
312
|
+
...factors.map((factor, index) => mem(component(index), factor)),
|
|
313
|
+
],
|
|
314
|
+
};
|
|
315
|
+
}
|
|
316
|
+
case "Rect": {
|
|
317
|
+
const left = visit(element);
|
|
318
|
+
const fields = set.fields.map((field) => ({ name: field.name, value: visit(field.value) }));
|
|
319
|
+
const dot = (field: string): Expr => ({ kind: "Dot", expression: left, field });
|
|
320
|
+
return {
|
|
321
|
+
kind: "List",
|
|
322
|
+
bullet: "And",
|
|
323
|
+
items: [
|
|
324
|
+
builtin("Eq", [
|
|
325
|
+
left,
|
|
326
|
+
{
|
|
327
|
+
kind: "Record",
|
|
328
|
+
fields: fields.map((field) => ({ name: field.name, value: dot(field.name) })),
|
|
329
|
+
},
|
|
330
|
+
]),
|
|
331
|
+
...fields.map((field) => mem(dot(field.name), field.value)),
|
|
332
|
+
],
|
|
333
|
+
};
|
|
334
|
+
}
|
|
335
|
+
case "Internal":
|
|
336
|
+
if (set.builtin !== "Nat") return undefined;
|
|
337
|
+
return builtin("Conj", [
|
|
338
|
+
mem(visit(element), { kind: "Internal", builtin: "Int" }),
|
|
339
|
+
builtin("Lteq", [{ kind: "Num", integer: "0", fraction: "" }, visit(element)]),
|
|
340
|
+
]);
|
|
341
|
+
case "Apply": {
|
|
342
|
+
const args = set.args;
|
|
343
|
+
const kind = getBuiltin(set);
|
|
344
|
+
if (kind === "SUBSET" && args.length === 1)
|
|
345
|
+
return {
|
|
346
|
+
kind: "Quant",
|
|
347
|
+
quantifier: "Forall",
|
|
348
|
+
bounds: [getUnbounded("v")],
|
|
349
|
+
body: builtin("Implies", [
|
|
350
|
+
mem(variable(1), shiftExpr(1, visit(element))),
|
|
351
|
+
mem(variable(1), shiftExpr(1, visit(args[0]))),
|
|
352
|
+
]),
|
|
353
|
+
};
|
|
354
|
+
if (kind === "UNION" && args.length === 1)
|
|
355
|
+
return {
|
|
356
|
+
kind: "Quant",
|
|
357
|
+
quantifier: "Exists",
|
|
358
|
+
bounds: [getUnbounded("v")],
|
|
359
|
+
body: builtin("Conj", [
|
|
360
|
+
mem(variable(1), shiftExpr(1, visit(args[0]))),
|
|
361
|
+
mem(shiftExpr(1, visit(element)), variable(1)),
|
|
362
|
+
]),
|
|
363
|
+
};
|
|
364
|
+
if (args.length !== 2) return undefined;
|
|
365
|
+
const left = visit(element);
|
|
366
|
+
if (kind === "Cup")
|
|
367
|
+
return builtin("Disj", [mem(left, visit(args[0])), mem(left, visit(args[1]))]);
|
|
368
|
+
if (kind === "Cap")
|
|
369
|
+
return builtin("Conj", [mem(left, visit(args[0])), mem(left, visit(args[1]))]);
|
|
370
|
+
if (kind === "Setminus")
|
|
371
|
+
return builtin("Conj", [
|
|
372
|
+
mem(left, visit(args[0])),
|
|
373
|
+
builtin("Neg", [mem(left, visit(args[1]))]),
|
|
374
|
+
]);
|
|
375
|
+
if (kind === "Range")
|
|
376
|
+
return {
|
|
377
|
+
kind: "List",
|
|
378
|
+
bullet: "And",
|
|
379
|
+
items: [
|
|
380
|
+
mem(left, { kind: "Internal", builtin: "Int" }),
|
|
381
|
+
builtin("Lteq", [visit(args[0]), left]),
|
|
382
|
+
builtin("Lteq", [left, visit(args[1])]),
|
|
383
|
+
],
|
|
384
|
+
};
|
|
385
|
+
return undefined;
|
|
386
|
+
}
|
|
387
|
+
default:
|
|
388
|
+
return undefined;
|
|
389
|
+
}
|
|
390
|
+
};
|
|
391
|
+
|
|
392
|
+
// Rewrite.simplify_sets_visitor, which rewrites a set equality where it must be proved by both
|
|
393
|
+
// inclusions. tlapm writes only the first one there, so its rewrite proves equalities that are
|
|
394
|
+
// false.
|
|
395
|
+
const simplifySet: Visit = (polarity, expression) => {
|
|
396
|
+
if (expression.kind === "Apply" && expression.args.length === 2) {
|
|
397
|
+
const left = expression.args[0];
|
|
398
|
+
const right = expression.args[1];
|
|
399
|
+
const kind = getBuiltin(expression);
|
|
400
|
+
const membership = kind === "Mem" ? getMembership(polarity, left, right) : undefined;
|
|
401
|
+
if (membership !== undefined) return at(membership, expression);
|
|
402
|
+
const isSetEquality = isSet(left) || isSet(right);
|
|
403
|
+
if (kind === "Eq" && polarity === "Positive" && isSetEquality)
|
|
404
|
+
return at(
|
|
405
|
+
getExtensional("Equiv", simplifySet(polarity, left), simplifySet(polarity, right)),
|
|
406
|
+
expression,
|
|
407
|
+
);
|
|
408
|
+
if (kind === "Neq" && polarity === "Negative" && isSetEquality)
|
|
409
|
+
return at(
|
|
410
|
+
builtin("Neg", [
|
|
411
|
+
getExtensional("Equiv", simplifySet(polarity, left), simplifySet(polarity, right)),
|
|
412
|
+
]),
|
|
413
|
+
expression,
|
|
414
|
+
);
|
|
415
|
+
if (kind === "Subseteq" && polarity === "Positive")
|
|
416
|
+
return at(
|
|
417
|
+
getExtensional("Implies", simplifySet(polarity, left), simplifySet(polarity, right)),
|
|
418
|
+
expression,
|
|
419
|
+
);
|
|
420
|
+
}
|
|
421
|
+
return visitLogic(simplifySet, polarity, expression);
|
|
422
|
+
};
|
|
423
|
+
|
|
424
|
+
// Smtlib.preprocess runs elim_notmem and elim_bounds always, but they only change the encoding
|
|
425
|
+
// once a rewrite of sets can see the memberships they make.
|
|
426
|
+
export const simplifySets = (sequent: Sequent, rewriteLevel: number): Sequent => {
|
|
427
|
+
if (rewriteLevel === 0) return sequent;
|
|
428
|
+
const bounded = elimBoundsSequent({
|
|
429
|
+
context: sequent.context.map((hyp) => mapHypExpressions(hyp, elimNotmem)),
|
|
430
|
+
active: elimNotmem(sequent.active),
|
|
431
|
+
});
|
|
432
|
+
const root: Expr = { kind: "Sequent", sequent: bounded };
|
|
433
|
+
const simplified =
|
|
434
|
+
rewriteLevel === 1
|
|
435
|
+
? applyExt("Positive", root)
|
|
436
|
+
: Array.from({ length: SET_LIMIT }).reduce<Expr>(
|
|
437
|
+
(current) => simplifySet("Positive", current),
|
|
438
|
+
root,
|
|
439
|
+
);
|
|
440
|
+
return simplified.kind === "Sequent" ? simplified.sequent : bounded;
|
|
441
|
+
};
|
|
@@ -0,0 +1,61 @@
|
|
|
1
|
+
import { SmtTacticError } from "../../../errors";
|
|
2
|
+
import type { AstManager } from "./ast";
|
|
3
|
+
import { convertAckrModel } from "./ackr-model-converter";
|
|
4
|
+
import type { Goal } from "./goal";
|
|
5
|
+
import { type AckrSolver, Lackr } from "./lackr";
|
|
6
|
+
import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
|
|
7
|
+
import type { RewriterOptions } from "./rewriter";
|
|
8
|
+
|
|
9
|
+
const checkGoal = (goal: Goal, name: string) => {
|
|
10
|
+
if (goal.isCoresEnabled)
|
|
11
|
+
throw new SmtTacticError(`${name} does not support unsat core production`);
|
|
12
|
+
if (goal.isProofsEnabled) throw new SmtTacticError(`${name} does not support proof production`);
|
|
13
|
+
};
|
|
14
|
+
|
|
15
|
+
const getEmptyCopy = (goal: Goal) => {
|
|
16
|
+
const copied = goal.copy();
|
|
17
|
+
copied.reset();
|
|
18
|
+
return copied;
|
|
19
|
+
};
|
|
20
|
+
|
|
21
|
+
export const runAckermannizeBv =
|
|
22
|
+
(manager: AstManager, rewriterOptions: RewriterOptions, lemmaLimit: number) => (goal: Goal) => {
|
|
23
|
+
checkGoal(goal, "ackermannize");
|
|
24
|
+
const lackr = new Lackr(manager, [...goal.forms.items], rewriterOptions, true);
|
|
25
|
+
const result = getEmptyCopy(goal);
|
|
26
|
+
if (!lackr.mkAckermann(result, lemmaLimit)) {
|
|
27
|
+
lackr.release(false);
|
|
28
|
+
return [goal];
|
|
29
|
+
}
|
|
30
|
+
const info = lackr.info;
|
|
31
|
+
result.addModelConversion((model) => convertAckrModel(info, undefined, model));
|
|
32
|
+
result.depth++;
|
|
33
|
+
lackr.release(true);
|
|
34
|
+
return [result];
|
|
35
|
+
};
|
|
36
|
+
|
|
37
|
+
export const createQfufbvAckrTactic =
|
|
38
|
+
(
|
|
39
|
+
manager: AstManager,
|
|
40
|
+
rewriterOptions: RewriterOptions,
|
|
41
|
+
isEager: boolean,
|
|
42
|
+
createSolver: () => AckrSolver,
|
|
43
|
+
) =>
|
|
44
|
+
(goal: Goal) => {
|
|
45
|
+
checkGoal(goal, "qfufbv_ackr");
|
|
46
|
+
const solver = createSolver();
|
|
47
|
+
const lackr = new Lackr(manager, [...goal.forms.items], rewriterOptions, isEager, solver);
|
|
48
|
+
const status = lackr.solve();
|
|
49
|
+
const result = getEmptyCopy(goal);
|
|
50
|
+
if (status === L_FALSE) result.assert(manager.falseExpr);
|
|
51
|
+
if (status === L_UNDEF) goal.depth++;
|
|
52
|
+
const model = lackr.model;
|
|
53
|
+
if (status === L_TRUE && model !== undefined) {
|
|
54
|
+
model.incRef();
|
|
55
|
+
const info = lackr.info;
|
|
56
|
+
result.addModelConversion((converted) => convertAckrModel(info, model, converted));
|
|
57
|
+
}
|
|
58
|
+
lackr.release(status === L_TRUE);
|
|
59
|
+
solver.release();
|
|
60
|
+
return [status === L_UNDEF ? goal : result];
|
|
61
|
+
};
|
|
@@ -0,0 +1,179 @@
|
|
|
1
|
+
import {
|
|
2
|
+
type AstManager,
|
|
3
|
+
FAMILY_USER,
|
|
4
|
+
KIND_APP,
|
|
5
|
+
KIND_QUANTIFIER,
|
|
6
|
+
OP_BSDIV0,
|
|
7
|
+
OP_BSMOD0,
|
|
8
|
+
OP_BSREM0,
|
|
9
|
+
OP_BUDIV0,
|
|
10
|
+
OP_BUREM0,
|
|
11
|
+
OP_DIV0,
|
|
12
|
+
OP_IDIV0,
|
|
13
|
+
OP_MOD0,
|
|
14
|
+
OP_POWER0,
|
|
15
|
+
OP_SELECT,
|
|
16
|
+
OP_SEQ_NTH_U,
|
|
17
|
+
} from "./ast";
|
|
18
|
+
import type { Goal } from "./goal";
|
|
19
|
+
import { ObjHashtable, ObjMap } from "./hashtable";
|
|
20
|
+
import { RewriterTpl } from "./rewriter-tpl";
|
|
21
|
+
|
|
22
|
+
export interface AppOcc {
|
|
23
|
+
constArgs: ObjHashtable;
|
|
24
|
+
varArgs: ObjHashtable;
|
|
25
|
+
}
|
|
26
|
+
|
|
27
|
+
const CONSIDERED_UNINTERPRETED_OPS = new Set([
|
|
28
|
+
OP_DIV0,
|
|
29
|
+
OP_IDIV0,
|
|
30
|
+
OP_MOD0,
|
|
31
|
+
OP_POWER0,
|
|
32
|
+
OP_BSDIV0,
|
|
33
|
+
OP_BUDIV0,
|
|
34
|
+
OP_BSREM0,
|
|
35
|
+
OP_BUREM0,
|
|
36
|
+
OP_BSMOD0,
|
|
37
|
+
OP_SEQ_NTH_U,
|
|
38
|
+
]);
|
|
39
|
+
|
|
40
|
+
export const isUninterpFn = (manager: AstManager, app: number) =>
|
|
41
|
+
manager.getFamily(app) === FAMILY_USER || CONSIDERED_UNINTERPRETED_OPS.has(manager.getOp(app));
|
|
42
|
+
|
|
43
|
+
export const isAckrSelect = (manager: AstManager, app: number) =>
|
|
44
|
+
manager.getOp(app) === OP_SELECT && manager.isUninterpretedConst(manager.getArg(app, 0));
|
|
45
|
+
|
|
46
|
+
export const createFun2Terms = (manager: AstManager) =>
|
|
47
|
+
new ObjMap<AppOcc>((decl) => manager.getDeclHash(decl));
|
|
48
|
+
|
|
49
|
+
export const createSel2Terms = (manager: AstManager) =>
|
|
50
|
+
new ObjMap<AppOcc>((expr) => manager.hashes[expr]);
|
|
51
|
+
|
|
52
|
+
export const markNonSelect = (manager: AstManager, app: number, nonSelect: Set<number>) => {
|
|
53
|
+
if (manager.getOp(app) !== OP_SELECT) {
|
|
54
|
+
for (const arg of manager.getArgs(app)) nonSelect.add(arg);
|
|
55
|
+
return;
|
|
56
|
+
}
|
|
57
|
+
const visited = new Set<number>();
|
|
58
|
+
const todo = manager.getArgs(app).slice(1);
|
|
59
|
+
for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
|
|
60
|
+
if (visited.has(expr)) continue;
|
|
61
|
+
visited.add(expr);
|
|
62
|
+
nonSelect.add(expr);
|
|
63
|
+
if (manager.kinds[expr] === KIND_APP) manager.pushArgs(expr, todo);
|
|
64
|
+
}
|
|
65
|
+
};
|
|
66
|
+
|
|
67
|
+
export const pruneNonMarked = (occs: ObjMap<AppOcc>, marked: Set<number>) => {
|
|
68
|
+
const pruned = [...occs.keys()].filter((key) => marked.has(key));
|
|
69
|
+
for (const key of pruned) occs.delete(key);
|
|
70
|
+
};
|
|
71
|
+
|
|
72
|
+
// Z3 tests only bit 16 of the count, so a larger count without that bit overflows there.
|
|
73
|
+
const getPairBound = (count: number) => (count >= 1 << 16 ? Infinity : (count * (count - 1)) / 2);
|
|
74
|
+
|
|
75
|
+
export const calculateLemmaBound = (fun2terms: ObjMap<AppOcc>, sel2terms: ObjMap<AppOcc>) => {
|
|
76
|
+
let total = 0;
|
|
77
|
+
for (const occs of [fun2terms, sel2terms])
|
|
78
|
+
for (const entry of occs) {
|
|
79
|
+
total += getPairBound(entry[1].varArgs.size);
|
|
80
|
+
total += entry[1].constArgs.size * entry[1].varArgs.size;
|
|
81
|
+
}
|
|
82
|
+
return total;
|
|
83
|
+
};
|
|
84
|
+
|
|
85
|
+
export const insertTerm = (
|
|
86
|
+
manager: AstManager,
|
|
87
|
+
fun2terms: ObjMap<AppOcc>,
|
|
88
|
+
sel2terms: ObjMap<AppOcc>,
|
|
89
|
+
app: number,
|
|
90
|
+
) => {
|
|
91
|
+
const numArgs = manager.getNumArgs(app);
|
|
92
|
+
if (numArgs === 0) return;
|
|
93
|
+
const isSelect = isAckrSelect(manager, app);
|
|
94
|
+
if (!isSelect && !isUninterpFn(manager, app)) return;
|
|
95
|
+
const occs = isSelect ? sel2terms : fun2terms;
|
|
96
|
+
const key = isSelect ? manager.getArg(app, 0) : manager.decls[app];
|
|
97
|
+
const existing = occs.get(key);
|
|
98
|
+
const occ = existing ?? {
|
|
99
|
+
constArgs: new ObjHashtable((expr) => manager.hashes[expr]),
|
|
100
|
+
varArgs: new ObjHashtable((expr) => manager.hashes[expr]),
|
|
101
|
+
};
|
|
102
|
+
if (existing === undefined) occs.set(key, occ);
|
|
103
|
+
let isConstArgs = isSelect || manager.isUniqueValue(manager.getArg(app, 0));
|
|
104
|
+
for (let index = 1; isConstArgs && index < numArgs; index++)
|
|
105
|
+
isConstArgs = manager.isUniqueValue(manager.getArg(app, index));
|
|
106
|
+
(isConstArgs ? occ.constArgs : occ.varArgs).add(app);
|
|
107
|
+
};
|
|
108
|
+
|
|
109
|
+
export const getAckrBound = (goal: Goal) => {
|
|
110
|
+
const manager = goal.manager;
|
|
111
|
+
const fun2terms = createFun2Terms(manager);
|
|
112
|
+
const sel2terms = createSel2Terms(manager);
|
|
113
|
+
const nonSelect = new Set<number>();
|
|
114
|
+
const visited = new Set<number>();
|
|
115
|
+
const todo = [...goal.forms.items];
|
|
116
|
+
for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
|
|
117
|
+
if (visited.has(expr)) continue;
|
|
118
|
+
visited.add(expr);
|
|
119
|
+
if (manager.kinds[expr] === KIND_QUANTIFIER) todo.push(manager.getQuantifier(expr).body);
|
|
120
|
+
if (manager.kinds[expr] !== KIND_APP) continue;
|
|
121
|
+
markNonSelect(manager, expr, nonSelect);
|
|
122
|
+
insertTerm(manager, fun2terms, sel2terms, expr);
|
|
123
|
+
manager.pushArgs(expr, todo);
|
|
124
|
+
}
|
|
125
|
+
pruneNonMarked(sel2terms, nonSelect);
|
|
126
|
+
return calculateLemmaBound(fun2terms, sel2terms);
|
|
127
|
+
};
|
|
128
|
+
|
|
129
|
+
class AbstractionReplacer extends RewriterTpl {
|
|
130
|
+
constructor(
|
|
131
|
+
manager: AstManager,
|
|
132
|
+
private termToConst: ObjMap<number>,
|
|
133
|
+
) {
|
|
134
|
+
super(manager);
|
|
135
|
+
}
|
|
136
|
+
|
|
137
|
+
getSubst(expr: number) {
|
|
138
|
+
return this.termToConst.get(expr);
|
|
139
|
+
}
|
|
140
|
+
}
|
|
141
|
+
|
|
142
|
+
export class AckrInfo {
|
|
143
|
+
private termToConst: ObjMap<number>;
|
|
144
|
+
private constToTerm = new Map<number, number>();
|
|
145
|
+
private replacer: AbstractionReplacer;
|
|
146
|
+
|
|
147
|
+
constructor(private manager: AstManager) {
|
|
148
|
+
this.termToConst = new ObjMap((expr) => manager.hashes[expr]);
|
|
149
|
+
this.replacer = new AbstractionReplacer(manager, this.termToConst);
|
|
150
|
+
}
|
|
151
|
+
|
|
152
|
+
setAbstr(term: number, constant: number) {
|
|
153
|
+
this.termToConst.set(term, constant);
|
|
154
|
+
this.constToTerm.set(this.manager.decls[constant], term);
|
|
155
|
+
this.manager.incRef(term);
|
|
156
|
+
this.manager.incRef(constant);
|
|
157
|
+
}
|
|
158
|
+
|
|
159
|
+
// The result comes with a reference.
|
|
160
|
+
abstract(expr: number) {
|
|
161
|
+
return this.replacer.rewrite(expr);
|
|
162
|
+
}
|
|
163
|
+
|
|
164
|
+
findTerm(decl: number) {
|
|
165
|
+
return this.constToTerm.get(decl);
|
|
166
|
+
}
|
|
167
|
+
|
|
168
|
+
getAbstr(term: number) {
|
|
169
|
+
return this.termToConst.get(term) as number;
|
|
170
|
+
}
|
|
171
|
+
|
|
172
|
+
release() {
|
|
173
|
+
for (const entry of this.termToConst) {
|
|
174
|
+
this.manager.decRef(entry[0]);
|
|
175
|
+
this.manager.decRef(entry[1]);
|
|
176
|
+
}
|
|
177
|
+
this.replacer.release();
|
|
178
|
+
}
|
|
179
|
+
}
|