tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.6b2a6741a
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 +5 -1
- package/dist/index.d.ts +5 -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 +43 -40
- 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 +4 -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/cli/xml-exporter.ts +1 -1
- package/src/codegen.ts +9 -5
- package/src/dependencies.ts +72 -11
- package/src/dfid.ts +9 -2
- package/src/environment.ts +65 -36
- package/src/errors.ts +38 -3
- package/src/evaluate.ts +92 -32
- package/src/exit-codes.ts +5 -2
- package/src/instances.ts +5 -5
- package/src/java-overrides.ts +2 -2
- package/src/levels.ts +138 -90
- 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 +37 -7
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +1 -3
- package/src/obligations/normalize.ts +25 -17
- 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 +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 +664 -287
- 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 +4 -11
- 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 +3 -5
- 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/md5.ts +26 -29
- 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 +37 -16
- 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 +625 -189
- package/src/runtime.ts +7 -1
- package/src/sany/builtins.ts +10 -10
- package/src/sany/generation.ts +2 -13
- package/src/sany/generator-definitions.ts +3 -1
- package/src/sany/generator-expressions.ts +36 -30
- package/src/sany/generator-proofs.ts +5 -3
- package/src/sany/generator.ts +2 -1
- package/src/sany/levels.ts +0 -2
- package/src/sany/lexer.ts +3 -3
- package/src/sany/linter.ts +0 -2
- package/src/sany/modules.ts +4 -2
- package/src/sany/nodes.ts +1 -1
- package/src/sany/selectors.ts +11 -6
- package/src/sany/xml.ts +2 -3
- 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 +265 -94
- package/src/successors.ts +2 -1
- package/src/symmetry.ts +3 -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 +3 -3
- package/src/tlc/order.ts +14 -3
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlc-operators.ts +3 -1
- package/src/tlc/tlcext-operators.ts +61 -16
- package/src/tlc/trace-spec.ts +5 -5
- package/src/typed-tier.ts +6541 -0
- package/src/typescript/types.ts +2 -2
- package/src/values.ts +46 -27
- 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,121 @@
|
|
|
1
|
+
import {
|
|
2
|
+
type AstManager,
|
|
3
|
+
OP_ADD,
|
|
4
|
+
OP_GE,
|
|
5
|
+
OP_LE,
|
|
6
|
+
OP_MUL,
|
|
7
|
+
OP_TO_REAL,
|
|
8
|
+
SORT_BOOL,
|
|
9
|
+
SORT_INT,
|
|
10
|
+
SORT_REAL,
|
|
11
|
+
} from "./ast";
|
|
12
|
+
import { getIdentityHash, ObjMap } from "./hashtable";
|
|
13
|
+
import type { LarSolver } from "./lp/lar-solver";
|
|
14
|
+
import type { LarTerm } from "./lp/lar-term";
|
|
15
|
+
import { getGcd, getLcm, Rational } from "./rational";
|
|
16
|
+
|
|
17
|
+
// term2coeffs: the term over the theory variables of its columns, with nested terms expanded.
|
|
18
|
+
export const getTermCoeffs = (solver: LarSolver, term: LarTerm) => {
|
|
19
|
+
const coeffs = new ObjMap<Rational>(getIdentityHash);
|
|
20
|
+
const visit = (current: LarTerm, coeff: Rational) => {
|
|
21
|
+
for (const entry of current.coeffs) {
|
|
22
|
+
if (solver.hasTerm(entry[0])) {
|
|
23
|
+
visit(solver.getTerm(entry[0]), coeff.mul(entry[1]));
|
|
24
|
+
continue;
|
|
25
|
+
}
|
|
26
|
+
const thVar = solver.getExternal(entry[0]);
|
|
27
|
+
const sum = (coeffs.get(thVar) ?? Rational.zero).add(entry[1].mul(coeff));
|
|
28
|
+
if (coeffs.has(thVar)) coeffs.replace(thVar, sum);
|
|
29
|
+
else coeffs.set(thVar, sum);
|
|
30
|
+
}
|
|
31
|
+
};
|
|
32
|
+
visit(term, Rational.one);
|
|
33
|
+
return [...coeffs];
|
|
34
|
+
};
|
|
35
|
+
|
|
36
|
+
// coeffs2app: Int expressions of a Real sum are coerced to Real.
|
|
37
|
+
export const coeffsToApp = (
|
|
38
|
+
manager: AstManager,
|
|
39
|
+
coeffs: [number, Rational][],
|
|
40
|
+
isInt: boolean,
|
|
41
|
+
getExpr: (thVar: number) => number,
|
|
42
|
+
) => {
|
|
43
|
+
const sort = isInt ? SORT_INT : SORT_REAL;
|
|
44
|
+
const summands = coeffs
|
|
45
|
+
.filter((entry) => !entry[1].isZero())
|
|
46
|
+
.map((entry) => {
|
|
47
|
+
const original = getExpr(entry[0]);
|
|
48
|
+
const expr =
|
|
49
|
+
!isInt && manager.isInt(original)
|
|
50
|
+
? manager.mkApp(OP_TO_REAL, [original], SORT_REAL)
|
|
51
|
+
: original;
|
|
52
|
+
return entry[1].equals(Rational.one)
|
|
53
|
+
? expr
|
|
54
|
+
: manager.mkApp(OP_MUL, [manager.mkNumeralOfSort(entry[1], sort), expr], sort);
|
|
55
|
+
});
|
|
56
|
+
return summands.length === 0
|
|
57
|
+
? manager.mkNumeralOfSort(Rational.zero, sort)
|
|
58
|
+
: summands.length === 1
|
|
59
|
+
? summands[0]
|
|
60
|
+
: manager.mkApp(OP_ADD, summands, sort);
|
|
61
|
+
};
|
|
62
|
+
|
|
63
|
+
// mk_bound: the atom term >= offset, or term <= offset, with integer coefficients reduced by their
|
|
64
|
+
// gcd when every variable is an integer.
|
|
65
|
+
export const mkBoundAtom = (
|
|
66
|
+
manager: AstManager,
|
|
67
|
+
solver: LarSolver,
|
|
68
|
+
term: LarTerm,
|
|
69
|
+
inputOffset: Rational,
|
|
70
|
+
inputIsLower: boolean,
|
|
71
|
+
getExpr: (thVar: number) => number,
|
|
72
|
+
) => {
|
|
73
|
+
let coeffs = getTermCoeffs(solver, term);
|
|
74
|
+
let offset = inputOffset;
|
|
75
|
+
let isLower = inputIsLower;
|
|
76
|
+
let lcm = offset.den;
|
|
77
|
+
const isInt = coeffs.every((entry) => manager.isInt(getExpr(entry[0])));
|
|
78
|
+
if (isInt) {
|
|
79
|
+
for (const entry of coeffs) lcm = getLcm(lcm, entry[1].den);
|
|
80
|
+
if (lcm !== 1n) {
|
|
81
|
+
const scale = Rational.of(lcm);
|
|
82
|
+
offset = offset.mul(scale);
|
|
83
|
+
coeffs = coeffs.map((entry) => [entry[0], entry[1].mul(scale)]);
|
|
84
|
+
}
|
|
85
|
+
let gcd = 0n;
|
|
86
|
+
for (const entry of coeffs) gcd = getGcd(gcd, entry[1].num);
|
|
87
|
+
if (gcd !== 0n && gcd !== 1n) {
|
|
88
|
+
const divisor = Rational.of(gcd);
|
|
89
|
+
coeffs = coeffs.map((entry) => [entry[0], entry[1].div(divisor)]);
|
|
90
|
+
offset = isLower ? offset.div(divisor).ceil() : offset.div(divisor).floor();
|
|
91
|
+
}
|
|
92
|
+
}
|
|
93
|
+
if (coeffs.length > 0 && coeffs[0][1].isNegative()) {
|
|
94
|
+
offset = offset.neg();
|
|
95
|
+
isLower = !isLower;
|
|
96
|
+
coeffs = coeffs.map((entry) => [entry[0], entry[1].neg()]);
|
|
97
|
+
}
|
|
98
|
+
const sort = isInt ? SORT_INT : SORT_REAL;
|
|
99
|
+
return manager.mkApp(
|
|
100
|
+
isLower ? OP_GE : OP_LE,
|
|
101
|
+
[coeffsToApp(manager, coeffs, isInt, getExpr), manager.mkNumeralOfSort(offset, sort)],
|
|
102
|
+
SORT_BOOL,
|
|
103
|
+
);
|
|
104
|
+
};
|
|
105
|
+
|
|
106
|
+
// The sides of the equality term = offset that mk_eq internalizes.
|
|
107
|
+
export const mkTermEqSides = (
|
|
108
|
+
manager: AstManager,
|
|
109
|
+
solver: LarSolver,
|
|
110
|
+
term: LarTerm,
|
|
111
|
+
offset: Rational,
|
|
112
|
+
getExpr: (thVar: number) => number,
|
|
113
|
+
) => {
|
|
114
|
+
const coeffs = getTermCoeffs(solver, term);
|
|
115
|
+
const isInt =
|
|
116
|
+
offset.isInt() && coeffs.every((entry) => manager.isInt(getExpr(entry[0])) && entry[1].isInt());
|
|
117
|
+
return [
|
|
118
|
+
coeffsToApp(manager, coeffs, isInt, getExpr),
|
|
119
|
+
manager.mkNumeralOfSort(offset, isInt ? SORT_INT : SORT_REAL),
|
|
120
|
+
];
|
|
121
|
+
};
|
|
@@ -0,0 +1,175 @@
|
|
|
1
|
+
import { SmtInvariantError } from "../../../errors";
|
|
2
|
+
import {
|
|
3
|
+
type AstManager,
|
|
4
|
+
isArithSort,
|
|
5
|
+
OP_ARRAY_DEFAULT,
|
|
6
|
+
OP_ARRAY_EXT,
|
|
7
|
+
OP_ARRAY_MAP,
|
|
8
|
+
OP_AS_ARRAY,
|
|
9
|
+
OP_CONST_ARRAY,
|
|
10
|
+
OP_SELECT,
|
|
11
|
+
OP_STORE,
|
|
12
|
+
} from "./ast";
|
|
13
|
+
|
|
14
|
+
interface ArraySignature {
|
|
15
|
+
name: string;
|
|
16
|
+
domain: number[];
|
|
17
|
+
range: number;
|
|
18
|
+
}
|
|
19
|
+
|
|
20
|
+
const isCompatible = (first: number, second: number) =>
|
|
21
|
+
first === second || (isArithSort(first) && isArithSort(second));
|
|
22
|
+
|
|
23
|
+
const getSelectSignature = (manager: AstManager, argSorts: number[]): ArraySignature | string => {
|
|
24
|
+
if (argSorts.length <= 1) return "select takes at least two arguments";
|
|
25
|
+
const sort = argSorts[0];
|
|
26
|
+
if (!manager.isArraySort(sort))
|
|
27
|
+
return `select expects the first argument sort to be an array, but was provided a value of sort ${manager.getSortName(sort)}`;
|
|
28
|
+
const parameters = manager.getSortParameters(sort);
|
|
29
|
+
if (parameters.length !== argSorts.length)
|
|
30
|
+
return `select expects the first argument to be an array taking ${parameters.length - 1}, instead it was passed ${argSorts.length - 1} arguments`;
|
|
31
|
+
for (let index = 0; index + 1 < parameters.length; index++)
|
|
32
|
+
if (!isCompatible(argSorts[index + 1], parameters[index]))
|
|
33
|
+
return `domain sort ${manager.getSortName(argSorts[index + 1])} and parameter ${manager.getSortName(parameters[index])} do not match`;
|
|
34
|
+
return {
|
|
35
|
+
name: "select",
|
|
36
|
+
domain: [sort, ...parameters.slice(0, -1)],
|
|
37
|
+
range: manager.getArrayRange(sort),
|
|
38
|
+
};
|
|
39
|
+
};
|
|
40
|
+
|
|
41
|
+
const getStoreSignature = (manager: AstManager, argSorts: number[]): ArraySignature | string => {
|
|
42
|
+
if (argSorts.length < 3) return "store takes at least 3 arguments";
|
|
43
|
+
const sort = argSorts[0];
|
|
44
|
+
if (!manager.isArraySort(sort)) return "store expects the first argument sort to be an array";
|
|
45
|
+
const parameters = manager.getSortParameters(sort);
|
|
46
|
+
if (argSorts.length !== parameters.length + 1)
|
|
47
|
+
return `store expects the first argument to be an array taking ${parameters.length + 1}, instead it was passed ${argSorts.length - 1} arguments`;
|
|
48
|
+
for (let index = 0; index < parameters.length; index++)
|
|
49
|
+
if (!isCompatible(parameters[index], argSorts[index + 1]))
|
|
50
|
+
return `domain sort ${manager.getSortName(argSorts[index + 1])} and parameter sort ${manager.getSortName(parameters[index])} do not match`;
|
|
51
|
+
return { name: "store", domain: [sort, ...parameters], range: sort };
|
|
52
|
+
};
|
|
53
|
+
|
|
54
|
+
const getConstSignature = (
|
|
55
|
+
manager: AstManager,
|
|
56
|
+
sort: number,
|
|
57
|
+
argSorts: number[],
|
|
58
|
+
): ArraySignature | string => {
|
|
59
|
+
if (argSorts.length !== 1) return "invalid const array definition, expected one argument";
|
|
60
|
+
if (!manager.isArraySort(sort))
|
|
61
|
+
return "invalid const array definition, parameter is not an array sort";
|
|
62
|
+
if (manager.getArrayRange(sort) !== argSorts[0])
|
|
63
|
+
return "invalid const array definition, sort mismatch between array range and argument";
|
|
64
|
+
return { name: "const", domain: argSorts, range: sort };
|
|
65
|
+
};
|
|
66
|
+
|
|
67
|
+
export const getMapSignature = (
|
|
68
|
+
manager: AstManager,
|
|
69
|
+
mapped: { domain: readonly number[]; range: number },
|
|
70
|
+
argSorts: number[],
|
|
71
|
+
): ArraySignature | string => {
|
|
72
|
+
if (argSorts.length !== mapped.domain.length)
|
|
73
|
+
return `map expects to take as many arguments as the function being mapped, it was given ${argSorts.length} but expects ${mapped.domain.length}`;
|
|
74
|
+
if (argSorts.length === 0) return "don't use map on constants";
|
|
75
|
+
const arity = manager.getArrayArity(argSorts[0]);
|
|
76
|
+
for (let index = 0; index < argSorts.length; index++) {
|
|
77
|
+
const sort = argSorts[index];
|
|
78
|
+
if (!manager.isArraySort(sort))
|
|
79
|
+
return `map expects an array sort as argument at position ${index}`;
|
|
80
|
+
if (manager.getArrayArity(sort) !== arity)
|
|
81
|
+
return `map expects all arguments to have the same array domain, this is not the case for argument ${index}`;
|
|
82
|
+
for (let position = 0; position < arity; position++)
|
|
83
|
+
if (
|
|
84
|
+
manager.getSortParameters(sort)[position] !==
|
|
85
|
+
manager.getSortParameters(argSorts[0])[position]
|
|
86
|
+
)
|
|
87
|
+
return `map expects all arguments to have the same array domain, this is not the case for argument ${index}`;
|
|
88
|
+
if (manager.getArrayRange(sort) !== mapped.domain[index])
|
|
89
|
+
return `map expects the argument at position ${index} to have the array range the same as the function`;
|
|
90
|
+
}
|
|
91
|
+
const range = manager.mkArraySort([
|
|
92
|
+
...manager.getSortParameters(argSorts[0]).slice(0, -1),
|
|
93
|
+
mapped.range,
|
|
94
|
+
]);
|
|
95
|
+
return { name: "map", domain: argSorts, range };
|
|
96
|
+
};
|
|
97
|
+
|
|
98
|
+
const getDefaultSignature = (manager: AstManager, argSorts: number[]): ArraySignature | string => {
|
|
99
|
+
if (argSorts.length !== 1) return "invalid default array definition, invalid domain size";
|
|
100
|
+
if (manager.getSortParameters(argSorts[0]).length <= 1)
|
|
101
|
+
return "parameter mismatch. There should be more than one parameter to defaults";
|
|
102
|
+
return { name: "default", domain: argSorts, range: manager.getArrayRange(argSorts[0]) };
|
|
103
|
+
};
|
|
104
|
+
|
|
105
|
+
const getExtSignature = (
|
|
106
|
+
manager: AstManager,
|
|
107
|
+
index: number,
|
|
108
|
+
argSorts: number[],
|
|
109
|
+
): ArraySignature | string => {
|
|
110
|
+
if (argSorts.length !== 2 || argSorts[0] !== argSorts[1])
|
|
111
|
+
return "incorrect arguments passed to array-ext";
|
|
112
|
+
const parameters = manager.getSortParameters(argSorts[0]);
|
|
113
|
+
if (parameters.length === 0 || index >= parameters.length - 1)
|
|
114
|
+
return "incorrect arguments passed to array-ext";
|
|
115
|
+
return { name: "array-ext", domain: argSorts, range: parameters[index] };
|
|
116
|
+
};
|
|
117
|
+
|
|
118
|
+
// The parameter of const is its array sort, of map the declaration it maps, and of array-ext the
|
|
119
|
+
// index of its domain.
|
|
120
|
+
export const getArraySignature = (
|
|
121
|
+
manager: AstManager,
|
|
122
|
+
op: number,
|
|
123
|
+
argSorts: number[],
|
|
124
|
+
parameters: number[],
|
|
125
|
+
): ArraySignature | string => {
|
|
126
|
+
switch (op) {
|
|
127
|
+
case OP_SELECT:
|
|
128
|
+
return getSelectSignature(manager, argSorts);
|
|
129
|
+
case OP_STORE:
|
|
130
|
+
return getStoreSignature(manager, argSorts);
|
|
131
|
+
case OP_CONST_ARRAY:
|
|
132
|
+
return getConstSignature(manager, parameters[0], argSorts);
|
|
133
|
+
case OP_ARRAY_MAP:
|
|
134
|
+
return getMapSignature(manager, manager.funcDecls[parameters[0]], argSorts);
|
|
135
|
+
case OP_ARRAY_DEFAULT:
|
|
136
|
+
return getDefaultSignature(manager, argSorts);
|
|
137
|
+
case OP_ARRAY_EXT:
|
|
138
|
+
return getExtSignature(manager, parameters[0] ?? 0, argSorts);
|
|
139
|
+
default:
|
|
140
|
+
return "invalid array operator";
|
|
141
|
+
}
|
|
142
|
+
};
|
|
143
|
+
|
|
144
|
+
export const mkArrayDecl = (
|
|
145
|
+
manager: AstManager,
|
|
146
|
+
op: number,
|
|
147
|
+
argSorts: number[],
|
|
148
|
+
parameters: number[] = [],
|
|
149
|
+
) => {
|
|
150
|
+
const signature = getArraySignature(manager, op, argSorts, parameters);
|
|
151
|
+
if (typeof signature === "string") throw new SmtInvariantError(signature);
|
|
152
|
+
return manager.mkArrayDecl(op, signature.name, parameters, signature.domain, signature.range);
|
|
153
|
+
};
|
|
154
|
+
|
|
155
|
+
export const mkArrayApp = (
|
|
156
|
+
manager: AstManager,
|
|
157
|
+
op: number,
|
|
158
|
+
args: number[],
|
|
159
|
+
parameters: number[] = [],
|
|
160
|
+
) => {
|
|
161
|
+
const decl = mkArrayDecl(
|
|
162
|
+
manager,
|
|
163
|
+
op,
|
|
164
|
+
args.map((arg) => manager.sorts[arg]),
|
|
165
|
+
parameters,
|
|
166
|
+
);
|
|
167
|
+
return manager.mkApp(decl, args, manager.funcDecls[decl].range);
|
|
168
|
+
};
|
|
169
|
+
|
|
170
|
+
export const mkAsArray = (manager: AstManager, decl: number) => {
|
|
171
|
+
const funcDecl = manager.funcDecls[decl];
|
|
172
|
+
const sort = manager.mkArraySort([...funcDecl.domain, funcDecl.range]);
|
|
173
|
+
const asArray = manager.mkArrayDecl(OP_AS_ARRAY, "as-array", [decl], [], sort);
|
|
174
|
+
return manager.mkApp(asArray, [], sort);
|
|
175
|
+
};
|
|
@@ -0,0 +1,309 @@
|
|
|
1
|
+
import { SmtUnsupportedError } from "../../../errors";
|
|
2
|
+
import { mkArrayApp } from "./array-decl-plugin";
|
|
3
|
+
import {
|
|
4
|
+
type AstManager,
|
|
5
|
+
OP_AND,
|
|
6
|
+
OP_ARRAY_MAP,
|
|
7
|
+
OP_AS_ARRAY,
|
|
8
|
+
OP_CONST_ARRAY,
|
|
9
|
+
OP_ITE,
|
|
10
|
+
OP_SELECT,
|
|
11
|
+
OP_STORE,
|
|
12
|
+
SORT_SIZE_INFINITE,
|
|
13
|
+
SORT_SIZE_VERY_BIG,
|
|
14
|
+
SORT_BOOL,
|
|
15
|
+
} from "./ast";
|
|
16
|
+
import { isAstLess } from "./ast-lt";
|
|
17
|
+
import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
|
|
18
|
+
import { InvVarShifter, type Rewrite, VarShifter } from "./rewriter-tpl";
|
|
19
|
+
import { getFreeVarSorts, VarSubst } from "./var-subst";
|
|
20
|
+
|
|
21
|
+
const MAX_SQUASH_ROUNDS = 10;
|
|
22
|
+
|
|
23
|
+
export class ArrayRewriter {
|
|
24
|
+
constructor(
|
|
25
|
+
private manager: AstManager,
|
|
26
|
+
private isSortingStore = false,
|
|
27
|
+
) {}
|
|
28
|
+
|
|
29
|
+
private isOp(expr: number, op: number) {
|
|
30
|
+
return this.manager.getOp(expr) === op;
|
|
31
|
+
}
|
|
32
|
+
|
|
33
|
+
private mkApp(op: number, args: number[], parameters: number[] = []) {
|
|
34
|
+
return mkArrayApp(this.manager, op, args, parameters);
|
|
35
|
+
}
|
|
36
|
+
|
|
37
|
+
private compareArgs(count: number, first: number, firstStart: number, second: number[]) {
|
|
38
|
+
const manager = this.manager;
|
|
39
|
+
for (let index = 0; index < count; index++) {
|
|
40
|
+
const left = manager.getArg(first, firstStart + index);
|
|
41
|
+
const right = second[index];
|
|
42
|
+
if (left === right) continue;
|
|
43
|
+
return manager.areDistinct(left, right) ? L_FALSE : L_UNDEF;
|
|
44
|
+
}
|
|
45
|
+
return L_TRUE;
|
|
46
|
+
}
|
|
47
|
+
|
|
48
|
+
mkAppCore(op: number, args: number[]): number | Rewrite | undefined {
|
|
49
|
+
if (op === OP_SELECT) return this.mkSelectCore(args);
|
|
50
|
+
if (op === OP_STORE) return this.mkStoreCore(args);
|
|
51
|
+
return undefined;
|
|
52
|
+
}
|
|
53
|
+
|
|
54
|
+
private mkStoreCore(args: number[]): number | Rewrite | undefined {
|
|
55
|
+
const manager = this.manager;
|
|
56
|
+
const array = args[0];
|
|
57
|
+
const indices = args.slice(1, -1);
|
|
58
|
+
if (this.isOp(array, OP_STORE)) {
|
|
59
|
+
const comparison = this.compareArgs(indices.length, array, 1, indices);
|
|
60
|
+
if (comparison === L_TRUE)
|
|
61
|
+
return this.mkApp(OP_STORE, [manager.getArg(array, 0), ...args.slice(1)]);
|
|
62
|
+
if (comparison === L_FALSE) {
|
|
63
|
+
if (this.isSortingStore && this.isLexLess(indices, manager.getArgs(array).slice(1))) {
|
|
64
|
+
const nested = this.mkApp(OP_STORE, [manager.getArg(array, 0), ...args.slice(1)]);
|
|
65
|
+
return {
|
|
66
|
+
expr: this.mkApp(OP_STORE, [nested, ...manager.getArgs(array).slice(1)]),
|
|
67
|
+
depth: 2,
|
|
68
|
+
};
|
|
69
|
+
}
|
|
70
|
+
const squashed = this.squashStore(args);
|
|
71
|
+
if (squashed !== undefined) return { expr: squashed, depth: 2 };
|
|
72
|
+
}
|
|
73
|
+
}
|
|
74
|
+
const value = args[args.length - 1];
|
|
75
|
+
if (this.isOp(array, OP_CONST_ARRAY) && manager.getArg(array, 0) === value) return array;
|
|
76
|
+
if (this.isOp(value, OP_SELECT) && this.compareArgs(args.length - 1, value, 0, args) === L_TRUE)
|
|
77
|
+
return array;
|
|
78
|
+
return undefined;
|
|
79
|
+
}
|
|
80
|
+
|
|
81
|
+
private isLexLess(first: number[], second: number[]) {
|
|
82
|
+
const index = first.findIndex((arg, position) => arg !== second[position]);
|
|
83
|
+
return index !== -1 && isAstLess(this.manager, first[index], second[index]);
|
|
84
|
+
}
|
|
85
|
+
|
|
86
|
+
private squashStore(args: number[]) {
|
|
87
|
+
const manager = this.manager;
|
|
88
|
+
const parents: number[] = [];
|
|
89
|
+
const indices = args.slice(1, -1);
|
|
90
|
+
let array = args[0];
|
|
91
|
+
for (let rounds = 0; this.isOp(array, OP_STORE) && rounds < MAX_SQUASH_ROUNDS; rounds++) {
|
|
92
|
+
const comparison = this.compareArgs(indices.length, array, 1, indices);
|
|
93
|
+
if (comparison === L_UNDEF) return undefined;
|
|
94
|
+
if (comparison === L_FALSE) {
|
|
95
|
+
parents.push(array);
|
|
96
|
+
array = manager.getArg(array, 0);
|
|
97
|
+
continue;
|
|
98
|
+
}
|
|
99
|
+
let result = manager.getArg(array, 0);
|
|
100
|
+
for (let index = parents.length - 1; index >= 0; index--)
|
|
101
|
+
result = this.mkApp(OP_STORE, [result, ...manager.getArgs(parents[index]).slice(1)]);
|
|
102
|
+
return this.mkApp(OP_STORE, [result, ...args.slice(1)]);
|
|
103
|
+
}
|
|
104
|
+
return undefined;
|
|
105
|
+
}
|
|
106
|
+
|
|
107
|
+
private mkSelectSameStore(args: number[]): number | Rewrite | undefined {
|
|
108
|
+
const manager = this.manager;
|
|
109
|
+
const indices = args.slice(1);
|
|
110
|
+
let array = args[0];
|
|
111
|
+
for (;;) {
|
|
112
|
+
if (this.isOp(array, OP_STORE)) {
|
|
113
|
+
const comparison = this.compareArgs(indices.length, array, 1, indices);
|
|
114
|
+
if (comparison === L_TRUE) return manager.getArg(array, indices.length + 1);
|
|
115
|
+
if (comparison === L_UNDEF) return undefined;
|
|
116
|
+
array = manager.getArg(array, 0);
|
|
117
|
+
continue;
|
|
118
|
+
}
|
|
119
|
+
if (this.isOp(array, OP_CONST_ARRAY)) return manager.getArg(array, 0);
|
|
120
|
+
if (manager.isLambda(array))
|
|
121
|
+
return { expr: this.betaReduce(array, indices), depth: Infinity };
|
|
122
|
+
if (this.isOp(array, OP_ARRAY_MAP)) {
|
|
123
|
+
const decl = manager.funcDecls[manager.decls[array]].parameters[0];
|
|
124
|
+
const selects = manager.mapArgs(array, (arg) => this.mkApp(OP_SELECT, [arg, ...indices]));
|
|
125
|
+
const range = manager.getArrayRange(manager.sorts[array]);
|
|
126
|
+
return { expr: manager.mkApp(decl, selects, range), depth: 2 };
|
|
127
|
+
}
|
|
128
|
+
if (this.isOp(array, OP_AS_ARRAY)) {
|
|
129
|
+
const decl = manager.funcDecls[manager.decls[array]].parameters[0];
|
|
130
|
+
return { expr: manager.mkApp(decl, indices, manager.funcDecls[decl].range), depth: 1 };
|
|
131
|
+
}
|
|
132
|
+
return undefined;
|
|
133
|
+
}
|
|
134
|
+
}
|
|
135
|
+
|
|
136
|
+
// select(lambda(X) M, N) -> M[N/X], anywhere rather than to weak head normal form.
|
|
137
|
+
private betaReduce(lambda: number, indices: number[]) {
|
|
138
|
+
const manager = this.manager;
|
|
139
|
+
const count = indices.length;
|
|
140
|
+
const shifter = new VarShifter(manager);
|
|
141
|
+
const shifted = indices.map((index) => shifter.shift(index, 0, count, 0));
|
|
142
|
+
shifter.release();
|
|
143
|
+
const subst = new VarSubst(manager, true);
|
|
144
|
+
const substituted = subst.apply(manager.getQuantifier(lambda).body, shifted);
|
|
145
|
+
subst.release();
|
|
146
|
+
for (const index of shifted) manager.decRef(index);
|
|
147
|
+
const invShifter = new InvVarShifter(manager);
|
|
148
|
+
const result = invShifter.shift(substituted, count);
|
|
149
|
+
invShifter.release();
|
|
150
|
+
manager.decRef(substituted);
|
|
151
|
+
manager.releaseLater(result);
|
|
152
|
+
return result;
|
|
153
|
+
}
|
|
154
|
+
|
|
155
|
+
// Array eta-reduction: (lambda (x_0 ... x_{k-1}) (select a x_0 ... x_{k-1})) -> a, when a does not
|
|
156
|
+
// depend on the bound variables.
|
|
157
|
+
mkLambdaCore(lambda: number, body: number) {
|
|
158
|
+
const manager = this.manager;
|
|
159
|
+
const count = manager.getQuantifier(lambda).sorts.length;
|
|
160
|
+
if (!this.isOp(body, OP_SELECT) || manager.getNumArgs(body) !== count + 1) return -1;
|
|
161
|
+
for (let index = 0; index < count; index++) {
|
|
162
|
+
const arg = manager.getArg(body, index + 1);
|
|
163
|
+
if (!manager.isVar(arg) || manager.values[arg] !== count - 1 - index) return -1;
|
|
164
|
+
}
|
|
165
|
+
const array = manager.getArg(body, 0);
|
|
166
|
+
if (getFreeVarSorts(manager, array, count).some((sort) => sort !== undefined)) return -1;
|
|
167
|
+
const shifter = new InvVarShifter(manager);
|
|
168
|
+
const result = shifter.shift(array, count);
|
|
169
|
+
shifter.release();
|
|
170
|
+
manager.releaseLater(result);
|
|
171
|
+
return result;
|
|
172
|
+
}
|
|
173
|
+
|
|
174
|
+
private mkSelectCore(args: number[]): number | Rewrite | undefined {
|
|
175
|
+
const manager = this.manager;
|
|
176
|
+
const sameStore = this.mkSelectSameStore(args);
|
|
177
|
+
if (sameStore !== undefined) return sameStore;
|
|
178
|
+
const indices = args.slice(1);
|
|
179
|
+
const array = args[0];
|
|
180
|
+
if (this.isOp(array, OP_STORE)) {
|
|
181
|
+
const comparison = this.compareArgs(indices.length, array, 1, indices);
|
|
182
|
+
if (comparison === L_FALSE) {
|
|
183
|
+
let base = manager.getArg(array, 0);
|
|
184
|
+
while (
|
|
185
|
+
this.isOp(base, OP_STORE) &&
|
|
186
|
+
this.compareArgs(indices.length, base, 1, indices) === L_FALSE
|
|
187
|
+
)
|
|
188
|
+
base = manager.getArg(base, 0);
|
|
189
|
+
return { expr: this.mkApp(OP_SELECT, [base, ...indices]), depth: 1 };
|
|
190
|
+
}
|
|
191
|
+
const base = manager.getArg(array, 0);
|
|
192
|
+
const areValues = indices.every(
|
|
193
|
+
(index, position) =>
|
|
194
|
+
manager.isValue(index) && manager.isValue(manager.getArg(array, position + 1)),
|
|
195
|
+
);
|
|
196
|
+
if (!this.isOp(base, OP_CONST_ARRAY) && !areValues) return undefined;
|
|
197
|
+
const selectBase = this.mkApp(OP_SELECT, [base, ...indices]);
|
|
198
|
+
const value = manager.getArg(array, indices.length + 1);
|
|
199
|
+
const eqs = indices.map((index, position) =>
|
|
200
|
+
manager.mkEq(manager.getArg(array, position + 1), index),
|
|
201
|
+
);
|
|
202
|
+
const condition = eqs.length === 1 ? eqs[0] : manager.mkApp(OP_AND, eqs, SORT_BOOL);
|
|
203
|
+
return {
|
|
204
|
+
expr: manager.mkApp(OP_ITE, [condition, value, selectBase], manager.sorts[value]),
|
|
205
|
+
depth: eqs.length === 1 ? 2 : 3,
|
|
206
|
+
};
|
|
207
|
+
}
|
|
208
|
+
if (this.isOp(array, OP_ITE)) {
|
|
209
|
+
const thenArray = manager.getArg(array, 1);
|
|
210
|
+
const elseArray = manager.getArg(array, 2);
|
|
211
|
+
if (manager.getRefCount(thenArray) !== 1 && manager.getRefCount(elseArray) !== 1)
|
|
212
|
+
return undefined;
|
|
213
|
+
const thenSelect = this.mkApp(OP_SELECT, [thenArray, ...indices]);
|
|
214
|
+
const elseSelect = this.mkApp(OP_SELECT, [elseArray, ...indices]);
|
|
215
|
+
return {
|
|
216
|
+
expr: manager.mkApp(
|
|
217
|
+
OP_ITE,
|
|
218
|
+
[manager.getArg(array, 0), thenSelect, elseSelect],
|
|
219
|
+
manager.sorts[thenSelect],
|
|
220
|
+
),
|
|
221
|
+
depth: 2,
|
|
222
|
+
};
|
|
223
|
+
}
|
|
224
|
+
return undefined;
|
|
225
|
+
}
|
|
226
|
+
|
|
227
|
+
private getStoreBase(expr: number) {
|
|
228
|
+
let base = expr;
|
|
229
|
+
let count = 0;
|
|
230
|
+
while (this.isOp(base, OP_STORE)) {
|
|
231
|
+
base = this.manager.getArg(base, 0);
|
|
232
|
+
count++;
|
|
233
|
+
}
|
|
234
|
+
return { base, count };
|
|
235
|
+
}
|
|
236
|
+
|
|
237
|
+
private isDomainLargerThan(sort: number, numStores: number) {
|
|
238
|
+
const manager = this.manager;
|
|
239
|
+
let size = 1n;
|
|
240
|
+
for (let index = 0; index < manager.getArrayArity(sort); index++) {
|
|
241
|
+
const domain = manager.getSortParameters(sort)[index];
|
|
242
|
+
if (manager.isUninterpretedSort(domain)) continue;
|
|
243
|
+
const domainSize = manager.getSortSize(domain);
|
|
244
|
+
if (domainSize === SORT_SIZE_INFINITE) return true;
|
|
245
|
+
if (domainSize === SORT_SIZE_VERY_BIG) return false;
|
|
246
|
+
size *= domainSize;
|
|
247
|
+
if (size > BigInt(numStores)) return true;
|
|
248
|
+
}
|
|
249
|
+
return false;
|
|
250
|
+
}
|
|
251
|
+
|
|
252
|
+
private pushStoreEqs(store: number, lhs: number, rhs: number, eqs: number[]) {
|
|
253
|
+
const manager = this.manager;
|
|
254
|
+
for (let current = store; this.isOp(current, OP_STORE); current = manager.getArg(current, 0)) {
|
|
255
|
+
const indices = manager.getArgs(current).slice(1, -1);
|
|
256
|
+
const left = this.mkSelect([lhs, ...indices]);
|
|
257
|
+
const right = this.mkSelect([rhs, ...indices]);
|
|
258
|
+
eqs.push(manager.mkEq(left, right));
|
|
259
|
+
}
|
|
260
|
+
}
|
|
261
|
+
|
|
262
|
+
private mkSelect(args: number[]) {
|
|
263
|
+
const result = this.mkSelectCore(args);
|
|
264
|
+
if (result === undefined) return this.mkApp(OP_SELECT, args);
|
|
265
|
+
return typeof result === "number" ? result : result.expr;
|
|
266
|
+
}
|
|
267
|
+
|
|
268
|
+
private hasValueIndices(expr: number) {
|
|
269
|
+
const manager = this.manager;
|
|
270
|
+
for (let current = expr; this.isOp(current, OP_STORE); current = manager.getArg(current, 0))
|
|
271
|
+
for (let index = 1; index + 1 < manager.getNumArgs(current); index++)
|
|
272
|
+
if (!manager.isValue(manager.getArg(current, index))) return false;
|
|
273
|
+
return true;
|
|
274
|
+
}
|
|
275
|
+
|
|
276
|
+
mkEqCore(inputLhs: number, inputRhs: number): Rewrite | undefined {
|
|
277
|
+
const manager = this.manager;
|
|
278
|
+
const isSwapped = this.isOp(inputRhs, OP_CONST_ARRAY) && this.isOp(inputLhs, OP_STORE);
|
|
279
|
+
const lhs = isSwapped ? inputRhs : inputLhs;
|
|
280
|
+
const rhs = isSwapped ? inputLhs : inputRhs;
|
|
281
|
+
if (this.isOp(lhs, OP_CONST_ARRAY) && this.isOp(rhs, OP_CONST_ARRAY))
|
|
282
|
+
return { expr: manager.mkEq(manager.getArg(lhs, 0), manager.getArg(rhs, 0)), depth: 1 };
|
|
283
|
+
const left = this.getStoreBase(lhs);
|
|
284
|
+
const right = this.getStoreBase(rhs);
|
|
285
|
+
const sort = manager.sorts[lhs];
|
|
286
|
+
if (
|
|
287
|
+
this.isOp(left.base, OP_CONST_ARRAY) &&
|
|
288
|
+
this.isOp(right.base, OP_CONST_ARRAY) &&
|
|
289
|
+
this.isDomainLargerThan(sort, left.count + right.count)
|
|
290
|
+
) {
|
|
291
|
+
const eqs: number[] = [];
|
|
292
|
+
this.pushStoreEqs(lhs, lhs, rhs, eqs);
|
|
293
|
+
this.pushStoreEqs(rhs, lhs, rhs, eqs);
|
|
294
|
+
eqs.push(manager.mkEq(manager.getArg(left.base, 0), manager.getArg(right.base, 0)));
|
|
295
|
+
return { expr: manager.mkAnd(eqs), depth: Infinity };
|
|
296
|
+
}
|
|
297
|
+
if (
|
|
298
|
+
this.isOp(left.base, OP_CONST_ARRAY) &&
|
|
299
|
+
this.isOp(right.base, OP_CONST_ARRAY) &&
|
|
300
|
+
!(this.hasValueIndices(lhs) && this.hasValueIndices(rhs)) &&
|
|
301
|
+
manager
|
|
302
|
+
.getSortParameters(sort)
|
|
303
|
+
.slice(0, -1)
|
|
304
|
+
.some((domain) => manager.isUninterpretedSort(domain))
|
|
305
|
+
)
|
|
306
|
+
throw new SmtUnsupportedError("lambdas");
|
|
307
|
+
return undefined;
|
|
308
|
+
}
|
|
309
|
+
}
|