tla-ts 0.0.10-dev.f16792fed → 0.0.10-dev.fdc173479
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 +6 -6
- package/dist/compile.js +10 -10
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +41 -37
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +21 -4
- package/dist/index.d.ts +21 -4
- 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 +2681 -425
- package/dist/prove.js +2681 -425
- package/dist/run.cjs +41 -42
- package/dist/run.js +41 -42
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +97 -89
- package/dist/transfer.js +97 -89
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +72 -39
- package/src/bags.ts +50 -29
- package/src/builtins.ts +8 -16
- package/src/check-failure.ts +118 -0
- package/src/check-trace.ts +321 -0
- package/src/check.ts +828 -770
- package/src/cli/options.ts +6 -31
- package/src/cli/runtime-invariants.ts +20 -56
- package/src/cli/shared.ts +1 -1
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +224 -212
- package/src/cli/tlc-output.ts +701 -0
- package/src/cli/tlc-usage.ts +1 -2
- package/src/cli/tlc.ts +65 -712
- package/src/cli/xml-exporter.ts +23 -33
- package/src/codegen.ts +28 -20
- package/src/coverage.ts +255 -20
- package/src/dependencies.ts +96 -27
- package/src/dfid.ts +115 -50
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +175 -373
- package/src/errors.ts +40 -5
- package/src/evaluate.ts +429 -139
- package/src/exit-codes.ts +28 -12
- package/src/fingerprints.ts +65 -1
- package/src/instances.ts +178 -17
- package/src/java-hash.ts +14 -0
- package/src/java-overrides.ts +2 -2
- package/src/json.ts +4 -7
- package/src/levels.ts +708 -272
- package/src/lexer.ts +17 -5
- package/src/liveness-checker.ts +707 -249
- package/src/liveness.ts +148 -95
- package/src/obligations/action.ts +14 -17
- package/src/obligations/anonymize.ts +37 -16
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +36 -8
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +66 -54
- package/src/obligations/index.ts +39 -9
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +28 -41
- package/src/obligations/normalize.ts +27 -18
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +48 -18
- package/src/obligations/proof.ts +3 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +55 -50
- package/src/obligations/source.ts +120 -74
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +5 -7
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +17 -31
- package/src/parallel.ts +29 -47
- package/src/parser.ts +757 -326
- package/src/pretty-print.ts +1 -1
- package/src/prover/decide-pool.ts +3 -3
- package/src/prover/deciders.ts +12 -9
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +72 -42
- 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 +158 -7
- package/src/prover/isabelle/isar/method.ts +509 -212
- 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 +487 -76
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +89 -14
- package/src/prover/isabelle/provers/blast/blast.ts +7 -65
- 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 +19 -30
- package/src/prover/isabelle/pure/bicompose.ts +9 -27
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +2 -10
- package/src/prover/isabelle/pure/drule.ts +72 -6
- 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 +1 -3
- 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 +4 -15
- package/src/prover/isabelle/pure/rewriter.ts +9 -20
- 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 +2 -3
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +42 -37
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +3 -5
- package/src/prover/isabelle/pure/thm.ts +14 -13
- 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 +18 -16
- package/src/prover/isabelle/tla/context.ts +58 -11
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +49 -21
- package/src/prover/isabelle/tla/simpdata.ts +1 -12
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +30 -31
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/fingerprint.ts +2 -5
- package/src/prover/prep/md5.ts +26 -29
- package/src/prover/prep/methods.ts +181 -51
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +395 -94
- 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 +43 -8
- package/src/prover/smt/data.ts +498 -379
- package/src/prover/smt/encode.ts +148 -57
- 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 +1016 -618
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +62 -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 +624 -9
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +319 -0
- package/src/prover/smt/solver/asserted-formulas.ts +240 -56
- 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 +1483 -45
- package/src/prover/smt/solver/auf-solver.ts +25 -18
- package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/blast-term-ite.ts +47 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +598 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +127 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -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 +293 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +598 -128
- package/src/prover/smt/solver/ctx-simplify.ts +29 -14
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
- package/src/prover/smt/solver/der.ts +38 -10
- package/src/prover/smt/solver/diff-neq.ts +207 -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 +298 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -1
- package/src/prover/smt/solver/e-matching.ts +7 -8
- package/src/prover/smt/solver/elim-bounds.ts +89 -0
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +548 -0
- package/src/prover/smt/solver/enode.ts +100 -3
- package/src/prover/smt/solver/eq2bv-tactic.ts +227 -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 +734 -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 +886 -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 +178 -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 +34 -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 +111 -39
- 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 +355 -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 +30 -11
- 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 +1 -10
- 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 +1 -2
- 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 +41 -5
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +6 -3
- 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 +68 -17
- 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 +122 -90
- 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 +310 -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 +106 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +19 -28
- package/src/prover/smt/solver/model-evaluator.ts +190 -12
- package/src/prover/smt/solver/model-finder.ts +12 -18
- package/src/prover/smt/solver/model-generator.ts +104 -35
- package/src/prover/smt/solver/model-macro-solver.ts +49 -46
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +709 -0
- package/src/prover/smt/solver/mus.ts +50 -0
- package/src/prover/smt/solver/muz/dl-context.ts +382 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +485 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +315 -98
- package/src/prover/smt/solver/nlsat/atoms.ts +71 -38
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +427 -229
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +460 -246
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +2376 -684
- package/src/prover/smt/solver/nlsat/solver.ts +293 -92
- 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 +9 -8
- 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 +110 -24
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +801 -0
- package/src/prover/smt/solver/opt-nlsat.ts +386 -0
- package/src/prover/smt/solver/opt-pareto.ts +301 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +312 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +19 -11
- package/src/prover/smt/solver/pb-rewriter.ts +281 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +546 -0
- package/src/prover/smt/solver/poly-rewriter.ts +259 -57
- package/src/prover/smt/solver/probes.ts +577 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +648 -19
- package/src/prover/smt/solver/pull-quant.ts +28 -12
- package/src/prover/smt/solver/purify-arith.ts +634 -0
- package/src/prover/smt/solver/push-app-ite.ts +37 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -3
- package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
- package/src/prover/smt/solver/qe-lite.ts +39 -19
- 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 +829 -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 +19 -20
- package/src/prover/smt/solver/quantifier-manager.ts +22 -25
- 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 +82 -14
- package/src/prover/smt/solver/rewriter.ts +505 -60
- package/src/prover/smt/solver/rlimit.ts +45 -5
- 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 +589 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +480 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +72 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +190 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2107 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +995 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1298 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +730 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
- package/src/prover/smt/solver/seq-skolem.ts +294 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +124 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +589 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3535 -360
- package/src/prover/smt/solver/smtlib-script.ts +2136 -0
- package/src/prover/smt/solver/solve-eqs.ts +928 -0
- package/src/prover/smt/solver/solver.ts +128 -23
- 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 +2176 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1210 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
- package/src/prover/smt/solver/theory-lra-final-check.ts +57 -70
- package/src/prover/smt/solver/theory-lra-internalize.ts +96 -27
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +35 -28
- package/src/prover/smt/solver/theory-lra-state.ts +7 -23
- package/src/prover/smt/solver/theory-lra.ts +189 -2
- package/src/prover/smt/solver/theory-pb.ts +951 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +852 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory-without-terms.ts +24 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +495 -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 +57 -26
- package/src/prover/tlapm/tlapm.ts +15 -9
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -0
- package/src/prover/zenon/check/check.ts +1 -2
- package/src/prover/zenon/check/records.ts +1 -1
- package/src/prover/zenon/check/relations.ts +2 -1
- package/src/prover/zenon/check/rewrites.ts +2 -15
- package/src/prover/zenon/check/sets.ts +40 -58
- package/src/prover/zenon/check/terms.ts +1 -2
- package/src/prover/zenon/decide.ts +10 -7
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +2 -2
- package/src/prover/zenon/equality-rules.ts +24 -2
- package/src/prover/zenon/expr.ts +28 -2
- package/src/prover/zenon/index-table.ts +16 -23
- package/src/prover/zenon/isar-case.ts +1 -3
- package/src/prover/zenon/isar.ts +37 -39
- package/src/prover/zenon/llproof.ts +2 -13
- package/src/prover/zenon/mltoll.ts +12 -30
- package/src/prover/zenon/node.ts +20 -5
- package/src/prover/zenon/parse.ts +9 -8
- 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 +11 -19
- package/src/prover/zenon/tla/functions.ts +2 -4
- package/src/prover/zenon/tla/llproof.ts +9 -13
- package/src/prover/zenon/tla/records.ts +1 -8
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +22 -22
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +7 -8
- package/src/resolve.ts +1327 -328
- package/src/runtime.ts +25 -2
- package/src/sany/builtins.ts +10 -10
- package/src/sany/generation.ts +384 -0
- package/src/sany/generator-def-entries.ts +297 -0
- package/src/sany/generator-definitions.ts +688 -0
- package/src/sany/generator-expressions.ts +1123 -0
- package/src/sany/generator-proofs.ts +668 -0
- package/src/sany/generator.ts +161 -2625
- package/src/sany/levels.ts +0 -2
- package/src/sany/lexer.ts +32 -23
- package/src/sany/linter.ts +0 -2
- package/src/sany/modules.ts +4 -2
- package/src/sany/nodes.ts +3 -4
- package/src/sany/report.ts +3 -6
- package/src/sany/selectors.ts +46 -44
- package/src/sany/xml.ts +25 -58
- package/src/search.ts +513 -165
- package/src/simulate.ts +340 -251
- package/src/spec-description.ts +48 -55
- package/src/standard-definitions.ts +5 -0
- package/src/standard-modules.ts +72 -54
- package/src/state-graph.ts +0 -2
- package/src/subexpressions.ts +564 -138
- package/src/substitution-levels.ts +5 -4
- package/src/successors.ts +56 -28
- package/src/symmetry.ts +4 -3
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/jar-data.ts +10 -0
- package/src/tlc/messages.ts +23 -18
- package/src/tlc/order.ts +14 -3
- package/src/tlc/random.ts +6 -5
- package/src/tlc/replay.ts +152 -58
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlc-operators.ts +12 -11
- package/src/tlc/tlcext-operators.ts +87 -26
- package/src/tlc/trace-spec.ts +27 -60
- package/src/trace-liveness.ts +529 -0
- package/src/typed-tier.ts +6556 -0
- package/src/typescript/actions.ts +2 -4
- package/src/typescript/collections.ts +34 -20
- package/src/typescript/compile.ts +1 -3
- package/src/typescript/formula.ts +5 -3
- package/src/typescript/model.ts +4 -5
- package/src/typescript/steps.ts +20 -18
- package/src/typescript/types.ts +2 -2
- package/src/values.ts +208 -227
- 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,203 @@
|
|
|
1
|
+
import { type AstManager, KIND_APP, KIND_VAR } from "../ast";
|
|
2
|
+
import { VarShifter } from "../rewriter-tpl";
|
|
3
|
+
|
|
4
|
+
interface Binding {
|
|
5
|
+
expr: number;
|
|
6
|
+
offset: number;
|
|
7
|
+
}
|
|
8
|
+
|
|
9
|
+
// A variable index or an expression at one of the two offsets.
|
|
10
|
+
const getKey = (index: number, offset: number) => 2 * index + offset;
|
|
11
|
+
|
|
12
|
+
// Bindings of variables at offsets to expressions at offsets. Applying it renames each unbound
|
|
13
|
+
// variable at offset i by deltas[i].
|
|
14
|
+
export class Substitution {
|
|
15
|
+
private bindings = new Map<number, Binding>();
|
|
16
|
+
|
|
17
|
+
constructor(private manager: AstManager) {}
|
|
18
|
+
|
|
19
|
+
reset() {
|
|
20
|
+
this.bindings.clear();
|
|
21
|
+
}
|
|
22
|
+
|
|
23
|
+
// unifier::operator(): a union-find over the (expression, offset) pairs, seeded with the
|
|
24
|
+
// bindings of variables to variables, where the larger class becomes the root.
|
|
25
|
+
unify(first: number, firstOffset: number, second: number, secondOffset: number) {
|
|
26
|
+
const manager = this.manager;
|
|
27
|
+
const parents = new Map<number, Binding>();
|
|
28
|
+
const sizes = new Map<number, number>();
|
|
29
|
+
const getNodeKey = (node: Binding) => getKey(node.expr, node.offset);
|
|
30
|
+
for (const [key, root] of [...this.bindings].reverse()) {
|
|
31
|
+
if (manager.kinds[root.expr] !== KIND_VAR) continue;
|
|
32
|
+
const child = {
|
|
33
|
+
expr: manager.mkVar(Math.floor(key / 2), manager.sorts[root.expr]),
|
|
34
|
+
offset: key % 2,
|
|
35
|
+
};
|
|
36
|
+
const childSize = sizes.get(getNodeKey(child)) ?? 1;
|
|
37
|
+
const rootSize = sizes.get(getNodeKey(root)) ?? 1;
|
|
38
|
+
parents.set(getNodeKey(child), root);
|
|
39
|
+
sizes.set(getNodeKey(root), childSize + rootSize);
|
|
40
|
+
}
|
|
41
|
+
const find = (start: Binding) => {
|
|
42
|
+
const path: Binding[] = [];
|
|
43
|
+
let node = start;
|
|
44
|
+
for (
|
|
45
|
+
let next = parents.get(getNodeKey(node));
|
|
46
|
+
next !== undefined;
|
|
47
|
+
next = parents.get(getNodeKey(node))
|
|
48
|
+
) {
|
|
49
|
+
path.push(node);
|
|
50
|
+
node = next;
|
|
51
|
+
}
|
|
52
|
+
for (const visited of path) parents.set(getNodeKey(visited), node);
|
|
53
|
+
return node;
|
|
54
|
+
};
|
|
55
|
+
const union = (child: Binding, root: Binding, isBalancing: boolean) => {
|
|
56
|
+
const childSize = sizes.get(getNodeKey(child)) ?? 1;
|
|
57
|
+
const rootSize = sizes.get(getNodeKey(root)) ?? 1;
|
|
58
|
+
if (isBalancing && childSize > rootSize) [child, root] = [root, child];
|
|
59
|
+
parents.set(getNodeKey(child), root);
|
|
60
|
+
sizes.set(getNodeKey(root), childSize + rootSize);
|
|
61
|
+
if (manager.kinds[child.expr] === KIND_VAR)
|
|
62
|
+
this.bindings.set(getKey(manager.values[child.expr], child.offset), root);
|
|
63
|
+
};
|
|
64
|
+
const todo: [Binding, Binding][] = [
|
|
65
|
+
[
|
|
66
|
+
{ expr: first, offset: firstOffset },
|
|
67
|
+
{ expr: second, offset: secondOffset },
|
|
68
|
+
],
|
|
69
|
+
];
|
|
70
|
+
for (let pair = todo.pop(); pair !== undefined; pair = todo.pop()) {
|
|
71
|
+
const left = find(pair[0]);
|
|
72
|
+
const right = find(pair[1]);
|
|
73
|
+
if (left.expr === right.expr && left.offset === right.offset) continue;
|
|
74
|
+
const isLeftVar = manager.kinds[left.expr] === KIND_VAR;
|
|
75
|
+
const isRightVar = manager.kinds[right.expr] === KIND_VAR;
|
|
76
|
+
if (isLeftVar && isRightVar) union(left, right, true);
|
|
77
|
+
else if (isLeftVar) union(left, right, false);
|
|
78
|
+
else if (isRightVar) union(right, left, false);
|
|
79
|
+
else {
|
|
80
|
+
const numArgs = manager.getNumArgs(left.expr);
|
|
81
|
+
if (
|
|
82
|
+
manager.decls[left.expr] !== manager.decls[right.expr] ||
|
|
83
|
+
numArgs !== manager.getNumArgs(right.expr) ||
|
|
84
|
+
(numArgs === 0 && left.expr !== right.expr)
|
|
85
|
+
)
|
|
86
|
+
return false;
|
|
87
|
+
union(left, right, true);
|
|
88
|
+
for (let index = numArgs - 1; index >= 0; index--)
|
|
89
|
+
todo.push([
|
|
90
|
+
{ expr: manager.getArg(left.expr, index), offset: left.offset },
|
|
91
|
+
{ expr: manager.getArg(right.expr, index), offset: right.offset },
|
|
92
|
+
]);
|
|
93
|
+
}
|
|
94
|
+
}
|
|
95
|
+
return this.isAcyclic();
|
|
96
|
+
}
|
|
97
|
+
|
|
98
|
+
private isAcyclic() {
|
|
99
|
+
const manager = this.manager;
|
|
100
|
+
const visiting = new Set<number>();
|
|
101
|
+
const done = new Set<number>();
|
|
102
|
+
const visit = (expr: number, offset: number): boolean => {
|
|
103
|
+
if (manager.isGround(expr)) return true;
|
|
104
|
+
if (manager.kinds[expr] === KIND_VAR) {
|
|
105
|
+
const key = getKey(manager.values[expr], offset);
|
|
106
|
+
const binding = this.bindings.get(key);
|
|
107
|
+
if (binding === undefined || done.has(key)) return true;
|
|
108
|
+
if (visiting.has(key)) return false;
|
|
109
|
+
visiting.add(key);
|
|
110
|
+
const isOk = visit(binding.expr, binding.offset);
|
|
111
|
+
visiting.delete(key);
|
|
112
|
+
done.add(key);
|
|
113
|
+
return isOk;
|
|
114
|
+
}
|
|
115
|
+
if (manager.kinds[expr] !== KIND_APP) return true;
|
|
116
|
+
return manager.getArgs(expr).every((arg) => visit(arg, offset));
|
|
117
|
+
};
|
|
118
|
+
for (const [key, binding] of this.bindings) {
|
|
119
|
+
visiting.clear();
|
|
120
|
+
visiting.add(key);
|
|
121
|
+
if (!visit(binding.expr, binding.offset)) return false;
|
|
122
|
+
}
|
|
123
|
+
return true;
|
|
124
|
+
}
|
|
125
|
+
|
|
126
|
+
apply(expr: number, offset: number, deltas: readonly number[] = [0]) {
|
|
127
|
+
const manager = this.manager;
|
|
128
|
+
const cache = new Map<number, number>();
|
|
129
|
+
const todo = [{ expr, offset }];
|
|
130
|
+
while (todo.length > 0) {
|
|
131
|
+
const node = todo[todo.length - 1];
|
|
132
|
+
const key = getKey(node.expr, node.offset);
|
|
133
|
+
if (cache.has(key)) {
|
|
134
|
+
todo.pop();
|
|
135
|
+
continue;
|
|
136
|
+
}
|
|
137
|
+
const kind = manager.kinds[node.expr];
|
|
138
|
+
if (manager.isGround(node.expr)) cache.set(key, node.expr);
|
|
139
|
+
else if (kind === KIND_VAR) {
|
|
140
|
+
const binding = this.bindings.get(getKey(manager.values[node.expr], node.offset));
|
|
141
|
+
const bound =
|
|
142
|
+
binding === undefined ? undefined : cache.get(getKey(binding.expr, binding.offset));
|
|
143
|
+
if (binding !== undefined && bound === undefined) {
|
|
144
|
+
todo.push(binding);
|
|
145
|
+
continue;
|
|
146
|
+
}
|
|
147
|
+
const delta = deltas[node.offset] ?? 0;
|
|
148
|
+
cache.set(
|
|
149
|
+
key,
|
|
150
|
+
bound ??
|
|
151
|
+
(delta === 0
|
|
152
|
+
? node.expr
|
|
153
|
+
: manager.mkVar(manager.values[node.expr] + delta, manager.sorts[node.expr])),
|
|
154
|
+
);
|
|
155
|
+
} else if (kind === KIND_APP) {
|
|
156
|
+
let isVisited = true;
|
|
157
|
+
for (let index = manager.getNumArgs(node.expr); index > 0; index--) {
|
|
158
|
+
const arg = manager.getArg(node.expr, index - 1);
|
|
159
|
+
if (cache.has(getKey(arg, node.offset))) continue;
|
|
160
|
+
todo.push({ expr: arg, offset: node.offset });
|
|
161
|
+
isVisited = false;
|
|
162
|
+
}
|
|
163
|
+
if (!isVisited) continue;
|
|
164
|
+
const args = manager
|
|
165
|
+
.getArgs(node.expr)
|
|
166
|
+
.map((arg) => cache.get(getKey(arg, node.offset)) ?? arg);
|
|
167
|
+
cache.set(
|
|
168
|
+
key,
|
|
169
|
+
args.every((arg, index) => arg === manager.getArg(node.expr, index))
|
|
170
|
+
? node.expr
|
|
171
|
+
: manager.mkApp(manager.decls[node.expr], args, manager.sorts[node.expr]),
|
|
172
|
+
);
|
|
173
|
+
} else cache.set(key, this.applyQuantifier(node.expr, node.offset, deltas));
|
|
174
|
+
todo.pop();
|
|
175
|
+
}
|
|
176
|
+
return cache.get(getKey(expr, offset)) ?? expr;
|
|
177
|
+
}
|
|
178
|
+
|
|
179
|
+
// The bindings move under the bound variables, by offset and then by variable.
|
|
180
|
+
private applyQuantifier(expr: number, offset: number, deltas: readonly number[]) {
|
|
181
|
+
const manager = this.manager;
|
|
182
|
+
const quantifier = manager.getQuantifier(expr);
|
|
183
|
+
const numVars = quantifier.sorts.length;
|
|
184
|
+
const nested = new Substitution(manager);
|
|
185
|
+
const shifter = new VarShifter(manager);
|
|
186
|
+
const shifted = [...this.bindings]
|
|
187
|
+
.sort((first, second) => (first[0] % 2) - (second[0] % 2) || first[0] - second[0])
|
|
188
|
+
.map((entry) => {
|
|
189
|
+
const moved = shifter.shift(entry[1].expr, 0, numVars, 0);
|
|
190
|
+
nested.bindings.set(entry[0] + 2 * numVars, { expr: moved, offset: entry[1].offset });
|
|
191
|
+
return moved;
|
|
192
|
+
});
|
|
193
|
+
const patterns = quantifier.patterns.map((pattern) => nested.apply(pattern, offset, deltas));
|
|
194
|
+
const noPatterns = quantifier.noPatterns.map((pattern) =>
|
|
195
|
+
nested.apply(pattern, offset, deltas),
|
|
196
|
+
);
|
|
197
|
+
const body = nested.apply(quantifier.body, offset, deltas);
|
|
198
|
+
const result = manager.mkQuantifier({ ...quantifier, patterns, noPatterns, body });
|
|
199
|
+
for (const moved of shifted) manager.decRef(moved);
|
|
200
|
+
shifter.release();
|
|
201
|
+
return result;
|
|
202
|
+
}
|
|
203
|
+
}
|
|
@@ -0,0 +1,285 @@
|
|
|
1
|
+
import { SmtTacticError } from "../../../errors";
|
|
2
|
+
import {
|
|
3
|
+
type AstManager,
|
|
4
|
+
FAMILY_BASIC,
|
|
5
|
+
KIND_APP,
|
|
6
|
+
KIND_VAR,
|
|
7
|
+
OP_ADD,
|
|
8
|
+
OP_BSHL,
|
|
9
|
+
OP_GE,
|
|
10
|
+
OP_GT,
|
|
11
|
+
OP_LE,
|
|
12
|
+
OP_LT,
|
|
13
|
+
OP_MUL,
|
|
14
|
+
OP_NUM,
|
|
15
|
+
OP_SUB,
|
|
16
|
+
OP_UBV2INT,
|
|
17
|
+
OP_UMINUS,
|
|
18
|
+
SORT_BOOL,
|
|
19
|
+
SORT_INT,
|
|
20
|
+
SORT_REAL,
|
|
21
|
+
} from "./ast";
|
|
22
|
+
import { BoundManager } from "./bound-manager";
|
|
23
|
+
import { mkBvApp } from "./bv-decl-plugin";
|
|
24
|
+
import { Bv2IntContext, Bv2IntRewriter } from "./bv2int-rewriter";
|
|
25
|
+
import { Bv2RealRewriter, Bv2RealUtil } from "./bv2real-rewriter";
|
|
26
|
+
import { type Definition, type Goal, UNDER } from "./goal";
|
|
27
|
+
import { ObjMap } from "./hashtable";
|
|
28
|
+
import { Rational } from "./rational";
|
|
29
|
+
import { RefVector } from "./ref-vector";
|
|
30
|
+
import { SubstReplacer } from "./solve-eqs";
|
|
31
|
+
|
|
32
|
+
export interface Nla2BvOptions {
|
|
33
|
+
maxBvSize: number;
|
|
34
|
+
bvSize: number;
|
|
35
|
+
root: number;
|
|
36
|
+
divisor: number;
|
|
37
|
+
}
|
|
38
|
+
|
|
39
|
+
const ARITH_OPS = [OP_MUL, OP_ADD, OP_SUB, OP_LE, OP_LT, OP_GE, OP_GT, OP_NUM, OP_UMINUS];
|
|
40
|
+
|
|
41
|
+
const getLog2 = (value: bigint) => {
|
|
42
|
+
let power = 1n;
|
|
43
|
+
let size = 0;
|
|
44
|
+
while (power < value) {
|
|
45
|
+
size++;
|
|
46
|
+
power *= 2n;
|
|
47
|
+
}
|
|
48
|
+
return size === 0 ? 1 : size;
|
|
49
|
+
};
|
|
50
|
+
|
|
51
|
+
class Nla2Bv {
|
|
52
|
+
private isSatPreserving = true;
|
|
53
|
+
private bounds: BoundManager;
|
|
54
|
+
private bv2int: Bv2IntContext;
|
|
55
|
+
private bv2real: Bv2RealUtil;
|
|
56
|
+
private substitution: ObjMap<number>;
|
|
57
|
+
private trail: RefVector;
|
|
58
|
+
private defs: RefVector;
|
|
59
|
+
private vars: number[] = [];
|
|
60
|
+
private hidden: number[] = [];
|
|
61
|
+
private numBits: number;
|
|
62
|
+
|
|
63
|
+
constructor(
|
|
64
|
+
private manager: AstManager,
|
|
65
|
+
private goal: Goal,
|
|
66
|
+
options: Nla2BvOptions,
|
|
67
|
+
) {
|
|
68
|
+
this.bv2real = new Bv2RealUtil(
|
|
69
|
+
manager,
|
|
70
|
+
BigInt(options.root),
|
|
71
|
+
BigInt(options.divisor),
|
|
72
|
+
options.maxBvSize,
|
|
73
|
+
);
|
|
74
|
+
this.bv2int = new Bv2IntContext(manager, options.maxBvSize);
|
|
75
|
+
this.bounds = new BoundManager(manager);
|
|
76
|
+
this.substitution = new ObjMap((expr) => manager.hashes[expr]);
|
|
77
|
+
this.trail = new RefVector(manager);
|
|
78
|
+
this.defs = new RefVector(manager);
|
|
79
|
+
this.numBits = options.bvSize;
|
|
80
|
+
}
|
|
81
|
+
|
|
82
|
+
run() {
|
|
83
|
+
const manager = this.manager;
|
|
84
|
+
const goal = this.goal;
|
|
85
|
+
for (const form of goal.forms.items) this.bounds.add(form);
|
|
86
|
+
this.collectPower2();
|
|
87
|
+
const collected = this.collectVars();
|
|
88
|
+
if (collected === "not-supported")
|
|
89
|
+
throw new SmtTacticError("goal is not in the fragment supported by nla2bv");
|
|
90
|
+
if (collected === "bool") return;
|
|
91
|
+
this.substituteVars();
|
|
92
|
+
this.reduce(new Bv2IntRewriter(manager, this.bv2int), false);
|
|
93
|
+
this.assertSideConditions(this.bv2int.sideConditions);
|
|
94
|
+
this.reduce(new Bv2RealRewriter(manager, this.bv2real), true);
|
|
95
|
+
this.assertSideConditions(this.bv2real.sideConditions);
|
|
96
|
+
const definitions: Definition[] = [
|
|
97
|
+
...this.hidden.map((decl) => ({ decl, def: -1 })),
|
|
98
|
+
...this.vars.map((decl, index) => ({ decl, def: this.defs.items[index] })),
|
|
99
|
+
...this.bv2real.decls.map((decl) => ({ decl, def: -1 })),
|
|
100
|
+
];
|
|
101
|
+
goal.addDefinitions(definitions);
|
|
102
|
+
goal.depth++;
|
|
103
|
+
if (!this.isSatPreserving) goal.updatePrecision(UNDER);
|
|
104
|
+
}
|
|
105
|
+
|
|
106
|
+
private collectPower2() {
|
|
107
|
+
const manager = this.manager;
|
|
108
|
+
this.bv2int.collectPower2(this.goal);
|
|
109
|
+
const power2 = this.bv2int.power2;
|
|
110
|
+
if (power2.size === 0) return;
|
|
111
|
+
for (const [key, value] of power2) {
|
|
112
|
+
const size = manager.getBvSize(manager.sorts[value]);
|
|
113
|
+
const shifted = mkBvApp(manager, OP_UBV2INT, [
|
|
114
|
+
mkBvApp(manager, OP_BSHL, [manager.mkBvNumeral(1n, size), value]),
|
|
115
|
+
]);
|
|
116
|
+
this.trail.push(shifted);
|
|
117
|
+
this.substitution.set(key, shifted);
|
|
118
|
+
}
|
|
119
|
+
this.substituteVars();
|
|
120
|
+
this.substitution.clear();
|
|
121
|
+
}
|
|
122
|
+
|
|
123
|
+
private reduce(rewriter: Bv2IntRewriter | Bv2RealRewriter, isReal: boolean) {
|
|
124
|
+
const manager = this.manager;
|
|
125
|
+
const goal = this.goal;
|
|
126
|
+
for (let index = 0; index < goal.forms.size; index++) {
|
|
127
|
+
const result = rewriter.rewrite(goal.forms.items[index]);
|
|
128
|
+
if (isReal && this.bv2real.containsBv2Real(result)) {
|
|
129
|
+
manager.decRef(result);
|
|
130
|
+
rewriter.release();
|
|
131
|
+
throw new SmtTacticError("nla2bv could not eliminate reals");
|
|
132
|
+
}
|
|
133
|
+
goal.update(index, result);
|
|
134
|
+
manager.decRef(result);
|
|
135
|
+
}
|
|
136
|
+
rewriter.release();
|
|
137
|
+
}
|
|
138
|
+
|
|
139
|
+
private assertSideConditions(conditions: RefVector) {
|
|
140
|
+
for (const condition of conditions.items) {
|
|
141
|
+
this.goal.assert(condition);
|
|
142
|
+
this.isSatPreserving = false;
|
|
143
|
+
}
|
|
144
|
+
}
|
|
145
|
+
|
|
146
|
+
private substituteVars() {
|
|
147
|
+
const manager = this.manager;
|
|
148
|
+
const goal = this.goal;
|
|
149
|
+
const replacer = new SubstReplacer(manager, this.substitution);
|
|
150
|
+
for (let index = 0; index < goal.forms.size; index++) {
|
|
151
|
+
const result = replacer.rewrite(goal.forms.items[index]);
|
|
152
|
+
goal.update(index, result);
|
|
153
|
+
manager.decRef(result);
|
|
154
|
+
}
|
|
155
|
+
replacer.release();
|
|
156
|
+
}
|
|
157
|
+
|
|
158
|
+
private collectVars() {
|
|
159
|
+
const manager = this.manager;
|
|
160
|
+
const vars: number[] = [];
|
|
161
|
+
let isNoArith = true;
|
|
162
|
+
let isSupported = true;
|
|
163
|
+
const visit = (expr: number) => {
|
|
164
|
+
if (manager.kinds[expr] !== KIND_APP) {
|
|
165
|
+
isSupported = false;
|
|
166
|
+
return;
|
|
167
|
+
}
|
|
168
|
+
const sort = manager.sorts[expr];
|
|
169
|
+
if (manager.isUninterpretedConst(expr)) {
|
|
170
|
+
if (sort === SORT_INT || sort === SORT_REAL) vars.push(expr);
|
|
171
|
+
else if (sort !== SORT_BOOL) isSupported = false;
|
|
172
|
+
} else if (ARITH_OPS.includes(manager.getOp(expr))) isNoArith = false;
|
|
173
|
+
else if (manager.getFamily(expr) !== FAMILY_BASIC) isSupported = false;
|
|
174
|
+
const value = manager.getNumeral(expr);
|
|
175
|
+
if (value === undefined) return;
|
|
176
|
+
const log2 = getLog2(value < 0n ? -value : value);
|
|
177
|
+
if (this.numBits <= log2) this.numBits = log2 + 1;
|
|
178
|
+
};
|
|
179
|
+
const visited = new Set<number>();
|
|
180
|
+
for (const form of this.goal.forms.items) {
|
|
181
|
+
if (visited.has(form)) continue;
|
|
182
|
+
visited.add(form);
|
|
183
|
+
const exprs = [form];
|
|
184
|
+
const children = [this.getChildren(form)];
|
|
185
|
+
const nextChildren = [0];
|
|
186
|
+
while (exprs.length > 0) {
|
|
187
|
+
const top = exprs.length - 1;
|
|
188
|
+
const child = children[top][nextChildren[top]++];
|
|
189
|
+
if (child === undefined) {
|
|
190
|
+
visit(exprs.pop() as number);
|
|
191
|
+
children.pop();
|
|
192
|
+
nextChildren.pop();
|
|
193
|
+
continue;
|
|
194
|
+
}
|
|
195
|
+
if (visited.has(child)) continue;
|
|
196
|
+
visited.add(child);
|
|
197
|
+
exprs.push(child);
|
|
198
|
+
children.push(this.getChildren(child));
|
|
199
|
+
nextChildren.push(0);
|
|
200
|
+
}
|
|
201
|
+
}
|
|
202
|
+
for (const variable of vars) {
|
|
203
|
+
if (manager.sorts[variable] === SORT_INT) this.addIntVar(variable);
|
|
204
|
+
else this.addRealVar(variable);
|
|
205
|
+
}
|
|
206
|
+
if (!isSupported) return "not-supported";
|
|
207
|
+
return vars.length === 0 && isNoArith ? "bool" : "num";
|
|
208
|
+
}
|
|
209
|
+
|
|
210
|
+
private getChildren(expr: number) {
|
|
211
|
+
const manager = this.manager;
|
|
212
|
+
if (manager.kinds[expr] === KIND_APP) return manager.getArgs(expr);
|
|
213
|
+
if (manager.kinds[expr] === KIND_VAR) return [];
|
|
214
|
+
const data = manager.getQuantifier(expr);
|
|
215
|
+
return [data.body, ...data.patterns, ...data.noPatterns];
|
|
216
|
+
}
|
|
217
|
+
|
|
218
|
+
private hide(expr: number) {
|
|
219
|
+
const decl = this.manager.decls[expr];
|
|
220
|
+
this.hidden.push(decl);
|
|
221
|
+
return expr;
|
|
222
|
+
}
|
|
223
|
+
|
|
224
|
+
private addVar(variable: number, def: number, substitute: number) {
|
|
225
|
+
this.trail.push(substitute);
|
|
226
|
+
this.substitution.set(variable, substitute);
|
|
227
|
+
this.vars.push(this.manager.decls[variable]);
|
|
228
|
+
this.defs.push(def);
|
|
229
|
+
}
|
|
230
|
+
|
|
231
|
+
private addIntVar(variable: number) {
|
|
232
|
+
const manager = this.manager;
|
|
233
|
+
const lower = this.bounds.lowers.get(variable)?.value;
|
|
234
|
+
const upper = this.bounds.uppers.get(variable)?.value;
|
|
235
|
+
let numBits = this.numBits;
|
|
236
|
+
if (lower !== undefined && upper !== undefined)
|
|
237
|
+
numBits = getLog2(upper.sub(lower).abs().add(Rational.one).num);
|
|
238
|
+
else this.isSatPreserving = false;
|
|
239
|
+
const fresh = this.hide(
|
|
240
|
+
manager.mkFreshConst(manager.getDeclName(variable), manager.mkBvSort(numBits)),
|
|
241
|
+
);
|
|
242
|
+
const value = mkBvApp(manager, OP_UBV2INT, [fresh]);
|
|
243
|
+
const substitute =
|
|
244
|
+
lower !== undefined
|
|
245
|
+
? lower.isZero()
|
|
246
|
+
? value
|
|
247
|
+
: manager.mkApp(OP_ADD, [value, manager.mkNumeral(lower.num)], SORT_INT)
|
|
248
|
+
: upper !== undefined
|
|
249
|
+
? manager.mkApp(OP_SUB, [manager.mkNumeral(upper.num), value], SORT_INT)
|
|
250
|
+
: manager.mkApp(OP_SUB, [value, manager.mkNumeral(2n ** BigInt(numBits - 1))], SORT_INT);
|
|
251
|
+
this.addVar(variable, substitute, substitute);
|
|
252
|
+
}
|
|
253
|
+
|
|
254
|
+
private addRealVar(variable: number) {
|
|
255
|
+
const manager = this.manager;
|
|
256
|
+
const sort = manager.mkBvSort(this.numBits);
|
|
257
|
+
this.isSatPreserving = false;
|
|
258
|
+
const name = manager.getDeclName(variable);
|
|
259
|
+
const s = this.hide(manager.mkFreshConst(name, sort));
|
|
260
|
+
const t = this.hide(manager.mkFreshConst(`${name}_r`, sort));
|
|
261
|
+
const bv2real = this.bv2real;
|
|
262
|
+
const substitute = bv2real.mkBv2RealC(s, t, bv2real.defaultDivisor, bv2real.defaultRoot);
|
|
263
|
+
const def = bv2real.mkBv2RealReduced(s, t, bv2real.defaultDivisor, bv2real.defaultRoot);
|
|
264
|
+
this.addVar(variable, def, substitute);
|
|
265
|
+
}
|
|
266
|
+
|
|
267
|
+
release() {
|
|
268
|
+
this.trail.reset();
|
|
269
|
+
this.defs.reset();
|
|
270
|
+
this.bv2int.release();
|
|
271
|
+
this.bv2real.release();
|
|
272
|
+
}
|
|
273
|
+
}
|
|
274
|
+
|
|
275
|
+
export const nla2bv = (manager: AstManager, goal: Goal, options: Nla2BvOptions) => {
|
|
276
|
+
if (goal.isProofsEnabled) throw new SmtTacticError("nla2bv does not support proof production");
|
|
277
|
+
if (goal.isCoresEnabled)
|
|
278
|
+
throw new SmtTacticError("nla2bv does not support unsat core production");
|
|
279
|
+
const converter = new Nla2Bv(manager, goal, options);
|
|
280
|
+
try {
|
|
281
|
+
converter.run();
|
|
282
|
+
} finally {
|
|
283
|
+
converter.release();
|
|
284
|
+
}
|
|
285
|
+
};
|