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,546 @@
|
|
|
1
|
+
import { SmtTacticError } from "../../../errors";
|
|
2
|
+
import {
|
|
3
|
+
type AstManager,
|
|
4
|
+
FAMILY_ARITH,
|
|
5
|
+
FAMILY_BASIC,
|
|
6
|
+
KIND_APP,
|
|
7
|
+
OP_ADD,
|
|
8
|
+
OP_BADD,
|
|
9
|
+
OP_DISTINCT,
|
|
10
|
+
OP_EQ,
|
|
11
|
+
OP_GE,
|
|
12
|
+
OP_GT,
|
|
13
|
+
OP_ITE,
|
|
14
|
+
OP_LE,
|
|
15
|
+
OP_LT,
|
|
16
|
+
OP_MUL,
|
|
17
|
+
OP_NOT,
|
|
18
|
+
OP_NUM,
|
|
19
|
+
OP_OR,
|
|
20
|
+
OP_ULEQ,
|
|
21
|
+
SORT_BOOL,
|
|
22
|
+
SORT_INT,
|
|
23
|
+
} from "./ast";
|
|
24
|
+
import { BoundManager } from "./bound-manager";
|
|
25
|
+
import { mkBvApp } from "./bv-decl-plugin";
|
|
26
|
+
import { CardPbRewriter, checkPbFree } from "./card2bv";
|
|
27
|
+
import type { Definition, Goal } from "./goal";
|
|
28
|
+
import { ObjMap } from "./hashtable";
|
|
29
|
+
import { getGcd, Rational } from "./rational";
|
|
30
|
+
import { RefVector } from "./ref-vector";
|
|
31
|
+
import { Rewriter, type RewriterOptions } from "./rewriter";
|
|
32
|
+
import { RewriterTpl } from "./rewriter-tpl";
|
|
33
|
+
import { DEFAULT_PRINT_OPTIONS, printExpr } from "./smt2-printer";
|
|
34
|
+
|
|
35
|
+
const LINEAR_OPS = [OP_LE, OP_GE, OP_LT, OP_GT, OP_ADD, OP_NUM];
|
|
36
|
+
|
|
37
|
+
const PRINT_ENVIRONMENT = {
|
|
38
|
+
options: DEFAULT_PRINT_OPTIONS,
|
|
39
|
+
isUsed: () => false,
|
|
40
|
+
isClashing: () => false,
|
|
41
|
+
};
|
|
42
|
+
|
|
43
|
+
// only_01_visitor, which visits each subterm after its arguments: the first expression outside
|
|
44
|
+
// pseudo-Boolean constraints over Booleans and 0-1 integers, or undefined.
|
|
45
|
+
export const findNonPb = (manager: AstManager, forms: number[], bounds: BoundManager) => {
|
|
46
|
+
const isNonPb = (expr: number) => {
|
|
47
|
+
if (manager.kinds[expr] !== KIND_APP) return true;
|
|
48
|
+
const family = manager.getFamily(expr);
|
|
49
|
+
const op = manager.getOp(expr);
|
|
50
|
+
if (family === FAMILY_BASIC)
|
|
51
|
+
return (op === OP_ITE && manager.sorts[expr] !== SORT_BOOL) || op === OP_DISTINCT;
|
|
52
|
+
if (family === FAMILY_ARITH)
|
|
53
|
+
return !(
|
|
54
|
+
LINEAR_OPS.includes(op) ||
|
|
55
|
+
(op === OP_MUL &&
|
|
56
|
+
manager.getNumArgs(expr) === 2 &&
|
|
57
|
+
manager.isNumeral(manager.getArg(expr, 0)))
|
|
58
|
+
);
|
|
59
|
+
if (manager.isUninterpretedConst(expr)) {
|
|
60
|
+
if (manager.sorts[expr] === SORT_BOOL) return false;
|
|
61
|
+
if (manager.sorts[expr] === SORT_INT && bounds.isZeroOne(expr)) return false;
|
|
62
|
+
}
|
|
63
|
+
return true;
|
|
64
|
+
};
|
|
65
|
+
const visited = new Set<number>();
|
|
66
|
+
for (const form of forms) {
|
|
67
|
+
const todo = [{ expr: form, isExpanded: false }];
|
|
68
|
+
for (let frame = todo.pop(); frame !== undefined; frame = todo.pop()) {
|
|
69
|
+
if (frame.isExpanded) {
|
|
70
|
+
if (isNonPb(frame.expr)) return frame.expr;
|
|
71
|
+
continue;
|
|
72
|
+
}
|
|
73
|
+
if (visited.has(frame.expr)) continue;
|
|
74
|
+
visited.add(frame.expr);
|
|
75
|
+
todo.push({ expr: frame.expr, isExpanded: true });
|
|
76
|
+
if (manager.kinds[frame.expr] === KIND_APP)
|
|
77
|
+
for (let index = manager.getNumArgs(frame.expr) - 1; index >= 0; index--)
|
|
78
|
+
todo.push({ expr: manager.getArg(frame.expr, index), isExpanded: false });
|
|
79
|
+
}
|
|
80
|
+
}
|
|
81
|
+
return undefined;
|
|
82
|
+
};
|
|
83
|
+
|
|
84
|
+
interface Lit {
|
|
85
|
+
variable: number;
|
|
86
|
+
isSigned: boolean;
|
|
87
|
+
}
|
|
88
|
+
|
|
89
|
+
interface Monomial {
|
|
90
|
+
coeff: Rational;
|
|
91
|
+
lit: Lit;
|
|
92
|
+
}
|
|
93
|
+
|
|
94
|
+
const EQ = 0;
|
|
95
|
+
const GE = 1;
|
|
96
|
+
const LE = 2;
|
|
97
|
+
|
|
98
|
+
const getNumBits = (value: Rational) => value.num.toString(2).length;
|
|
99
|
+
|
|
100
|
+
class ConstraintRewriter extends RewriterTpl {
|
|
101
|
+
constructor(
|
|
102
|
+
manager: AstManager,
|
|
103
|
+
private converter: Pb2Bv,
|
|
104
|
+
) {
|
|
105
|
+
super(manager);
|
|
106
|
+
}
|
|
107
|
+
|
|
108
|
+
getSubst(expr: number) {
|
|
109
|
+
return this.converter.isConstraintCore(expr) ? this.converter.convertSaved(expr) : undefined;
|
|
110
|
+
}
|
|
111
|
+
}
|
|
112
|
+
|
|
113
|
+
class Pb2Bv {
|
|
114
|
+
private bounds: BoundManager;
|
|
115
|
+
private boolRewriter: Rewriter;
|
|
116
|
+
readonly const2bit: ObjMap<number>;
|
|
117
|
+
private notConst2bit: ObjMap<number>;
|
|
118
|
+
readonly temporaryInts: RefVector;
|
|
119
|
+
readonly terms: RefVector;
|
|
120
|
+
private allClausesLimit: number;
|
|
121
|
+
private cardinalityLimit: number;
|
|
122
|
+
private rewriter: ConstraintRewriter | undefined;
|
|
123
|
+
private pbRewriter: CardPbRewriter;
|
|
124
|
+
private results: RefVector | undefined;
|
|
125
|
+
|
|
126
|
+
constructor(
|
|
127
|
+
private manager: AstManager,
|
|
128
|
+
params: ReadonlyMap<string, boolean | number | string>,
|
|
129
|
+
options: RewriterOptions,
|
|
130
|
+
) {
|
|
131
|
+
this.bounds = new BoundManager(manager);
|
|
132
|
+
this.boolRewriter = new Rewriter(manager, options);
|
|
133
|
+
this.const2bit = new ObjMap((decl) => manager.getDeclHash(decl));
|
|
134
|
+
this.notConst2bit = new ObjMap((decl) => manager.getDeclHash(decl));
|
|
135
|
+
this.temporaryInts = new RefVector(manager);
|
|
136
|
+
this.terms = new RefVector(manager);
|
|
137
|
+
const getUint = (name: string, defaultValue: number) => {
|
|
138
|
+
const value = params.get(name);
|
|
139
|
+
return typeof value === "number" ? value : defaultValue;
|
|
140
|
+
};
|
|
141
|
+
this.allClausesLimit = getUint("pb2bv_all_clauses_limit", 8);
|
|
142
|
+
this.cardinalityLimit = getUint("pb2bv_cardinality_limit", 4294967295);
|
|
143
|
+
this.pbRewriter = new CardPbRewriter(manager);
|
|
144
|
+
}
|
|
145
|
+
|
|
146
|
+
private hold(expr: number) {
|
|
147
|
+
this.terms.push(expr);
|
|
148
|
+
return expr;
|
|
149
|
+
}
|
|
150
|
+
|
|
151
|
+
private int2lit(variable: number, isSigned = false) {
|
|
152
|
+
const manager = this.manager;
|
|
153
|
+
const decl = manager.decls[variable];
|
|
154
|
+
const found = (isSigned ? this.notConst2bit : this.const2bit).get(decl);
|
|
155
|
+
if (found !== undefined) return found;
|
|
156
|
+
const bit = this.hold(manager.mkFreshConst(null, SORT_BOOL));
|
|
157
|
+
const notBit = this.hold(manager.mkApp(OP_NOT, [bit], SORT_BOOL));
|
|
158
|
+
this.const2bit.set(decl, bit);
|
|
159
|
+
this.notConst2bit.set(decl, notBit);
|
|
160
|
+
manager.incDeclRef(decl);
|
|
161
|
+
return isSigned ? notBit : bit;
|
|
162
|
+
}
|
|
163
|
+
|
|
164
|
+
private monLit2lit(lit: Lit) {
|
|
165
|
+
return this.int2lit(lit.variable, lit.isSigned);
|
|
166
|
+
}
|
|
167
|
+
|
|
168
|
+
private mkAnd(args: number[]) {
|
|
169
|
+
return this.hold(this.boolRewriter.mkAnd(args));
|
|
170
|
+
}
|
|
171
|
+
|
|
172
|
+
private mkNot(arg: number) {
|
|
173
|
+
return this.hold(this.boolRewriter.mkNot(arg));
|
|
174
|
+
}
|
|
175
|
+
|
|
176
|
+
private mkIte(condition: number, thenExpr: number, elseExpr: number) {
|
|
177
|
+
const result = this.boolRewriter.mkIte(condition, thenExpr, elseExpr);
|
|
178
|
+
return this.hold(typeof result === "number" ? result : result.expr);
|
|
179
|
+
}
|
|
180
|
+
|
|
181
|
+
private mkAllClauses(polynomial: Monomial[], bound: Rational) {
|
|
182
|
+
const manager = this.manager;
|
|
183
|
+
const size = polynomial.length;
|
|
184
|
+
const sums: Rational[] = [];
|
|
185
|
+
for (let index = size - 1; index >= 0; index--)
|
|
186
|
+
sums[index] =
|
|
187
|
+
index === size - 1 ? polynomial[index].coeff : polynomial[index].coeff.add(sums[index + 1]);
|
|
188
|
+
const lits = polynomial.map((monomial) => this.monLit2lit(monomial.lit));
|
|
189
|
+
const clause: number[] = [];
|
|
190
|
+
const result: number[] = [];
|
|
191
|
+
const process = (index: number, remaining: Rational) => {
|
|
192
|
+
if (!remaining.isPositive()) return;
|
|
193
|
+
if (index === size || sums[index].compare(remaining) < 0) {
|
|
194
|
+
result.push(
|
|
195
|
+
clause.length === 0
|
|
196
|
+
? manager.falseExpr
|
|
197
|
+
: clause.length === 1
|
|
198
|
+
? clause[0]
|
|
199
|
+
: this.hold(manager.mkApp(OP_OR, [...clause], SORT_BOOL)),
|
|
200
|
+
);
|
|
201
|
+
return;
|
|
202
|
+
}
|
|
203
|
+
clause.push(lits[index]);
|
|
204
|
+
process(index + 1, remaining);
|
|
205
|
+
clause.pop();
|
|
206
|
+
process(index + 1, remaining.sub(polynomial[index].coeff));
|
|
207
|
+
};
|
|
208
|
+
process(0, bound);
|
|
209
|
+
return this.mkAnd(result);
|
|
210
|
+
}
|
|
211
|
+
|
|
212
|
+
private bitblastPbc(polynomial: Monomial[], bound: Rational): number {
|
|
213
|
+
const manager = this.manager;
|
|
214
|
+
const size = polynomial.length;
|
|
215
|
+
const isCard = polynomial.every((monomial) => monomial.coeff.equals(Rational.one));
|
|
216
|
+
const sizeValue = Rational.fromNumber(size);
|
|
217
|
+
if (isCard && sizeValue.compare(bound) < 0) return manager.falseExpr;
|
|
218
|
+
if (isCard && bound.equals(Rational.one))
|
|
219
|
+
return this.hold(manager.mkOr(polynomial.map((monomial) => this.monLit2lit(monomial.lit))));
|
|
220
|
+
if (isCard && bound.equals(sizeValue))
|
|
221
|
+
return this.mkAnd(polynomial.map((monomial) => this.monLit2lit(monomial.lit)));
|
|
222
|
+
if (size <= this.allClausesLimit) return this.mkAllClauses(polynomial, bound);
|
|
223
|
+
if (isCard) {
|
|
224
|
+
const k = Number(bound.num);
|
|
225
|
+
const rowSize = size - k + 1;
|
|
226
|
+
if ((k * rowSize) % 4294967296 <= this.cardinalityLimit) {
|
|
227
|
+
const row: number[] = Array.from({ length: rowSize }, () => manager.trueExpr);
|
|
228
|
+
for (let index = 0; index < k; index++)
|
|
229
|
+
for (let column = 0; column < rowSize; column++)
|
|
230
|
+
row[column] = this.mkIte(
|
|
231
|
+
this.monLit2lit(polynomial[index + column].lit),
|
|
232
|
+
row[column],
|
|
233
|
+
column === 0 ? manager.falseExpr : row[column - 1],
|
|
234
|
+
);
|
|
235
|
+
return row[rowSize - 1];
|
|
236
|
+
}
|
|
237
|
+
}
|
|
238
|
+
const sum = polynomial.reduce((total, monomial) => total.add(monomial.coeff), Rational.zero);
|
|
239
|
+
if (sum.compare(bound) < 0) return manager.falseExpr;
|
|
240
|
+
const bits = getNumBits(sum);
|
|
241
|
+
const sort = manager.mkBvSort(bits);
|
|
242
|
+
const zero = manager.mkBvNumeral(0n, bits);
|
|
243
|
+
const summands = polynomial.map((monomial) =>
|
|
244
|
+
manager.mkApp(
|
|
245
|
+
OP_ITE,
|
|
246
|
+
[this.monLit2lit(monomial.lit), manager.mkBvNumeral(monomial.coeff.num, bits), zero],
|
|
247
|
+
sort,
|
|
248
|
+
),
|
|
249
|
+
);
|
|
250
|
+
return this.hold(
|
|
251
|
+
mkBvApp(manager, OP_ULEQ, [
|
|
252
|
+
manager.mkBvNumeral(bound.num, bits),
|
|
253
|
+
mkBvApp(manager, OP_BADD, summands),
|
|
254
|
+
]),
|
|
255
|
+
);
|
|
256
|
+
}
|
|
257
|
+
|
|
258
|
+
private split(polynomial: Monomial[], bound: Rational, clause: Monomial[]) {
|
|
259
|
+
const manager = this.manager;
|
|
260
|
+
if (polynomial.length <= 2 || bound.equals(Rational.one)) return polynomial;
|
|
261
|
+
if (!polynomial[0].coeff.equals(bound) || !polynomial[1].coeff.equals(bound)) return polynomial;
|
|
262
|
+
const end = polynomial.findIndex(
|
|
263
|
+
(monomial, index) => index >= 2 && !monomial.coeff.equals(bound),
|
|
264
|
+
);
|
|
265
|
+
if (end === -1) return polynomial;
|
|
266
|
+
for (const monomial of polynomial.slice(0, end))
|
|
267
|
+
clause.push({ coeff: Rational.one, lit: monomial.lit });
|
|
268
|
+
const fresh = manager.mkFreshConst(null, SORT_INT);
|
|
269
|
+
this.temporaryInts.push(fresh);
|
|
270
|
+
clause.push({ coeff: Rational.one, lit: { variable: fresh, isSigned: true } });
|
|
271
|
+
return [{ coeff: bound, lit: { variable: fresh, isSigned: false } }, ...polynomial.slice(end)];
|
|
272
|
+
}
|
|
273
|
+
|
|
274
|
+
private mkPbc(input: Monomial[], inputBound: Rational, isSplitting: boolean) {
|
|
275
|
+
const manager = this.manager;
|
|
276
|
+
if (!inputBound.isPositive()) return manager.trueExpr;
|
|
277
|
+
let gcd = input[0].coeff.compare(inputBound) > 0 ? inputBound.num : input[0].coeff.num;
|
|
278
|
+
let polynomial = input.map((monomial) => {
|
|
279
|
+
const coeff = monomial.coeff.compare(inputBound) > 0 ? inputBound : monomial.coeff;
|
|
280
|
+
gcd = getGcd(gcd, coeff.num);
|
|
281
|
+
return { coeff, lit: monomial.lit };
|
|
282
|
+
});
|
|
283
|
+
let bound = inputBound;
|
|
284
|
+
if (gcd !== 1n) {
|
|
285
|
+
const divisor = Rational.of(gcd);
|
|
286
|
+
polynomial = polynomial.map((monomial) => ({
|
|
287
|
+
coeff: monomial.coeff.div(divisor),
|
|
288
|
+
lit: monomial.lit,
|
|
289
|
+
}));
|
|
290
|
+
bound = bound.div(divisor).ceil();
|
|
291
|
+
}
|
|
292
|
+
// Z3's a_sum adds the bound rather than each coefficient, so only an empty polynomial is false.
|
|
293
|
+
if (polynomial.length === 0) return manager.falseExpr;
|
|
294
|
+
const clause: Monomial[] = [];
|
|
295
|
+
if (isSplitting) polynomial = this.split(polynomial, bound, clause);
|
|
296
|
+
if (clause.length === 0) return this.bitblastPbc(polynomial, bound);
|
|
297
|
+
const first = this.bitblastPbc(polynomial, bound);
|
|
298
|
+
const second = this.bitblastPbc(clause, Rational.one);
|
|
299
|
+
return this.mkAnd([first, second]);
|
|
300
|
+
}
|
|
301
|
+
|
|
302
|
+
private isEqVector(polynomial: Monomial[], bound: Rational) {
|
|
303
|
+
const size = polynomial.length;
|
|
304
|
+
if (size % 2 === 1) return false;
|
|
305
|
+
const half = size / 2;
|
|
306
|
+
if (!bound.equals(Rational.of(2n ** BigInt(half) - 1n))) return false;
|
|
307
|
+
for (let index = 0; index < half; index++) {
|
|
308
|
+
const first = polynomial[index * 2];
|
|
309
|
+
const second = polynomial[index * 2 + 1];
|
|
310
|
+
if (first.lit.isSigned === second.lit.isSigned) return false;
|
|
311
|
+
if (!first.coeff.equals(second.coeff)) return false;
|
|
312
|
+
if (!first.coeff.equals(Rational.of(2n ** BigInt(half - index - 1)))) return false;
|
|
313
|
+
}
|
|
314
|
+
return true;
|
|
315
|
+
}
|
|
316
|
+
|
|
317
|
+
private mkUnit(variable: number, isSigned: boolean) {
|
|
318
|
+
return this.monLit2lit({ variable, isSigned });
|
|
319
|
+
}
|
|
320
|
+
|
|
321
|
+
convert(atom: number, isPositive: boolean, isRoot: boolean): number {
|
|
322
|
+
const manager = this.manager;
|
|
323
|
+
const op = manager.getOp(atom);
|
|
324
|
+
const [lhs, rhs] = manager.getArgs(atom);
|
|
325
|
+
let kind: number;
|
|
326
|
+
let pos = isPositive;
|
|
327
|
+
if (op === OP_EQ) {
|
|
328
|
+
if (manager.isUninterpretedConst(lhs) && manager.isUninterpretedConst(rhs)) {
|
|
329
|
+
const lhsLit = this.mkUnit(lhs, false);
|
|
330
|
+
const rhsLit = this.mkUnit(rhs, !pos);
|
|
331
|
+
return this.hold(manager.mkEq(lhsLit, rhsLit));
|
|
332
|
+
}
|
|
333
|
+
kind = EQ;
|
|
334
|
+
} else if (op === OP_LE) kind = LE;
|
|
335
|
+
else if (op === OP_GE) kind = GE;
|
|
336
|
+
else this.throwNonPb(atom);
|
|
337
|
+
const adjust = (value: Rational) => {
|
|
338
|
+
if (pos) return value;
|
|
339
|
+
if (kind === LE) {
|
|
340
|
+
pos = true;
|
|
341
|
+
kind = GE;
|
|
342
|
+
return value.add(Rational.one);
|
|
343
|
+
}
|
|
344
|
+
if (kind === GE) {
|
|
345
|
+
pos = true;
|
|
346
|
+
kind = LE;
|
|
347
|
+
return value.sub(Rational.one);
|
|
348
|
+
}
|
|
349
|
+
return value;
|
|
350
|
+
};
|
|
351
|
+
if (manager.isNumeral(lhs)) {
|
|
352
|
+
const value = adjust(manager.getRationalValue(lhs));
|
|
353
|
+
if (!manager.isUninterpretedConst(rhs)) this.throwNonPb(atom);
|
|
354
|
+
if (kind === EQ) return this.mkUnit(rhs, value.isZero() !== !pos);
|
|
355
|
+
if ((value.isZero() && kind === LE) || (value.equals(Rational.one) && kind === GE))
|
|
356
|
+
return manager.trueExpr;
|
|
357
|
+
if ((value.isZero() && kind === GE) || (value.equals(Rational.one) && kind === LE))
|
|
358
|
+
return this.mkUnit(rhs, kind === GE);
|
|
359
|
+
this.throwNonPb(atom);
|
|
360
|
+
}
|
|
361
|
+
if (!manager.isNumeral(rhs) || manager.sorts[rhs] !== SORT_INT) this.throwNonPb(atom);
|
|
362
|
+
const value = adjust(manager.getRationalValue(rhs));
|
|
363
|
+
if (manager.isUninterpretedConst(lhs)) {
|
|
364
|
+
if (kind === EQ) {
|
|
365
|
+
if (!value.isZero() && !value.equals(Rational.one))
|
|
366
|
+
return pos ? manager.falseExpr : manager.trueExpr;
|
|
367
|
+
return this.mkUnit(lhs, value.isZero() !== !pos);
|
|
368
|
+
}
|
|
369
|
+
if (kind === LE) {
|
|
370
|
+
if (value.compare(Rational.one) >= 0) return manager.trueExpr;
|
|
371
|
+
if (value.isNegative()) return manager.falseExpr;
|
|
372
|
+
} else {
|
|
373
|
+
if (!value.isPositive()) return manager.trueExpr;
|
|
374
|
+
if (value.compare(Rational.one) > 0) return manager.falseExpr;
|
|
375
|
+
}
|
|
376
|
+
return this.mkUnit(lhs, kind === LE);
|
|
377
|
+
}
|
|
378
|
+
if (manager.getOp(lhs) !== OP_ADD) this.throwNonPb(atom);
|
|
379
|
+
const monomials = manager.getArgs(lhs);
|
|
380
|
+
const getMulArgs = (monomial: number) =>
|
|
381
|
+
manager.getOp(monomial) === OP_MUL && manager.getNumArgs(monomial) === 2
|
|
382
|
+
? manager.getArgs(monomial)
|
|
383
|
+
: undefined;
|
|
384
|
+
for (const monomial of monomials) {
|
|
385
|
+
if (manager.isUninterpretedConst(monomial)) continue;
|
|
386
|
+
const args = getMulArgs(monomial);
|
|
387
|
+
if (args !== undefined && manager.isNumeral(args[0]) && manager.isUninterpretedConst(args[1]))
|
|
388
|
+
continue;
|
|
389
|
+
this.throwNonPb(atom);
|
|
390
|
+
}
|
|
391
|
+
let bound = value;
|
|
392
|
+
const polynomial: Monomial[] = monomials.map((monomial) => {
|
|
393
|
+
if (manager.isUninterpretedConst(monomial))
|
|
394
|
+
return { coeff: Rational.one, lit: { variable: monomial, isSigned: false } };
|
|
395
|
+
const [coeffExpr, variable] = getMulArgs(monomial) as number[];
|
|
396
|
+
const coeff = manager.getRationalValue(coeffExpr);
|
|
397
|
+
if (!coeff.isNegative()) return { coeff, lit: { variable, isSigned: false } };
|
|
398
|
+
bound = bound.add(coeff.neg());
|
|
399
|
+
return { coeff: coeff.neg(), lit: { variable, isSigned: true } };
|
|
400
|
+
});
|
|
401
|
+
const sorted = polynomial
|
|
402
|
+
.map((monomial, index) => ({ monomial, index }))
|
|
403
|
+
.sort(
|
|
404
|
+
(first, second) =>
|
|
405
|
+
second.monomial.coeff.compare(first.monomial.coeff) || first.index - second.index,
|
|
406
|
+
)
|
|
407
|
+
.map((entry) => entry.monomial);
|
|
408
|
+
const negate = (monomials: Monomial[], total: Rational) => ({
|
|
409
|
+
polynomial: monomials.map((monomial) => ({
|
|
410
|
+
coeff: monomial.coeff,
|
|
411
|
+
lit: { variable: monomial.lit.variable, isSigned: !monomial.lit.isSigned },
|
|
412
|
+
})),
|
|
413
|
+
bound: monomials.reduce((sum, monomial) => sum.add(monomial.coeff), total.neg()),
|
|
414
|
+
});
|
|
415
|
+
if (kind === GE) return this.mkPbc(sorted, bound, isRoot);
|
|
416
|
+
if (kind === LE) {
|
|
417
|
+
const negated = negate(sorted, bound);
|
|
418
|
+
return this.mkPbc(negated.polynomial, negated.bound, isRoot);
|
|
419
|
+
}
|
|
420
|
+
if (this.isEqVector(sorted, bound)) {
|
|
421
|
+
const eqs: number[] = [];
|
|
422
|
+
for (let index = 0; index < sorted.length; index += 2)
|
|
423
|
+
eqs.push(
|
|
424
|
+
this.hold(
|
|
425
|
+
manager.mkEq(
|
|
426
|
+
this.int2lit(sorted[index].lit.variable),
|
|
427
|
+
this.int2lit(sorted[index + 1].lit.variable),
|
|
428
|
+
),
|
|
429
|
+
),
|
|
430
|
+
);
|
|
431
|
+
const conjunction = this.mkAnd(eqs);
|
|
432
|
+
return pos ? conjunction : this.mkNot(conjunction);
|
|
433
|
+
}
|
|
434
|
+
const negated = negate(sorted, bound);
|
|
435
|
+
const first = this.mkPbc(sorted, bound, false);
|
|
436
|
+
const second = this.mkPbc(negated.polynomial, negated.bound, false);
|
|
437
|
+
const conjunction = this.mkAnd([first, second]);
|
|
438
|
+
return pos ? conjunction : this.mkNot(conjunction);
|
|
439
|
+
}
|
|
440
|
+
|
|
441
|
+
convertSaved(atom: number) {
|
|
442
|
+
return this.convert(atom, true, false);
|
|
443
|
+
}
|
|
444
|
+
|
|
445
|
+
isConstraintCore(expr: number) {
|
|
446
|
+
const manager = this.manager;
|
|
447
|
+
const op = manager.getOp(expr);
|
|
448
|
+
return (
|
|
449
|
+
(op === OP_EQ && manager.sorts[manager.getArg(expr, 0)] === SORT_INT) ||
|
|
450
|
+
op === OP_LE ||
|
|
451
|
+
op === OP_GE
|
|
452
|
+
);
|
|
453
|
+
}
|
|
454
|
+
|
|
455
|
+
run(goal: Goal) {
|
|
456
|
+
const manager = this.manager;
|
|
457
|
+
for (const form of goal.forms.items) this.bounds.add(form);
|
|
458
|
+
const failed = findNonPb(manager, goal.forms.items, this.bounds);
|
|
459
|
+
if (failed !== undefined) this.throwNonPb(failed);
|
|
460
|
+
const rewriter = new ConstraintRewriter(manager, this);
|
|
461
|
+
this.rewriter = rewriter;
|
|
462
|
+
const results = new RefVector(manager);
|
|
463
|
+
this.results = results;
|
|
464
|
+
for (const form of goal.forms.items) {
|
|
465
|
+
let atom = form;
|
|
466
|
+
let isPositive = true;
|
|
467
|
+
while (manager.isNot(atom)) {
|
|
468
|
+
atom = manager.getArg(atom, 0);
|
|
469
|
+
isPositive = !isPositive;
|
|
470
|
+
}
|
|
471
|
+
if (this.isConstraintCore(atom)) {
|
|
472
|
+
results.push(this.convert(atom, isPositive, true));
|
|
473
|
+
continue;
|
|
474
|
+
}
|
|
475
|
+
const simplified = rewriter.rewrite(form);
|
|
476
|
+
const rewritten = this.pbRewriter.rewrite(simplified);
|
|
477
|
+
manager.decRef(simplified);
|
|
478
|
+
checkPbFree(manager, rewritten);
|
|
479
|
+
results.pushOwned(rewritten);
|
|
480
|
+
}
|
|
481
|
+
for (const [index, result] of results.items.entries()) goal.update(index, result);
|
|
482
|
+
results.reset();
|
|
483
|
+
goal.depth++;
|
|
484
|
+
if (!goal.isModelsEnabled) return;
|
|
485
|
+
const hidden: Definition[] = [];
|
|
486
|
+
for (const [, bit] of this.const2bit) hidden.push({ decl: manager.decls[bit], def: -1 });
|
|
487
|
+
for (const fresh of this.temporaryInts.items)
|
|
488
|
+
hidden.push({ decl: manager.decls[fresh], def: -1 });
|
|
489
|
+
goal.addDefinitions(hidden);
|
|
490
|
+
const c2bit: { decl: number; bit: number }[] = [];
|
|
491
|
+
for (const [decl, bit] of this.const2bit) {
|
|
492
|
+
manager.incDeclRef(decl);
|
|
493
|
+
manager.incDeclRef(manager.decls[bit]);
|
|
494
|
+
c2bit.push({ decl, bit: manager.decls[bit] });
|
|
495
|
+
}
|
|
496
|
+
for (const variable of this.bounds.boundedVars) {
|
|
497
|
+
const decl = manager.decls[variable];
|
|
498
|
+
if (this.const2bit.has(decl)) continue;
|
|
499
|
+
manager.incDeclRef(decl);
|
|
500
|
+
c2bit.push({ decl, bit: -1 });
|
|
501
|
+
}
|
|
502
|
+
goal.addModelConversion((model) => {
|
|
503
|
+
for (const entry of c2bit) {
|
|
504
|
+
const value = entry.bit === -1 ? undefined : model.constInterps.get(entry.bit);
|
|
505
|
+
const isOne = value !== undefined && !manager.isFalse(value);
|
|
506
|
+
model.registerConst(entry.decl, manager.mkNumeral(isOne ? 1n : 0n));
|
|
507
|
+
}
|
|
508
|
+
return model;
|
|
509
|
+
});
|
|
510
|
+
}
|
|
511
|
+
|
|
512
|
+
private throwNonPb(expr: number): never {
|
|
513
|
+
throw new SmtTacticError(
|
|
514
|
+
`goal is in a fragment not supported by pb2bv. Offending expression: ${printExpr(this.manager, PRINT_ENVIRONMENT, expr)}`,
|
|
515
|
+
);
|
|
516
|
+
}
|
|
517
|
+
|
|
518
|
+
release() {
|
|
519
|
+
this.results?.reset();
|
|
520
|
+
this.rewriter?.release();
|
|
521
|
+
this.pbRewriter.release();
|
|
522
|
+
for (const [decl] of this.const2bit) this.manager.decDeclRef(decl);
|
|
523
|
+
this.terms.reset();
|
|
524
|
+
this.temporaryInts.reset();
|
|
525
|
+
this.boolRewriter.release();
|
|
526
|
+
}
|
|
527
|
+
}
|
|
528
|
+
|
|
529
|
+
export const runPb2Bv =
|
|
530
|
+
(
|
|
531
|
+
manager: AstManager,
|
|
532
|
+
params: ReadonlyMap<string, boolean | number | string>,
|
|
533
|
+
options: RewriterOptions,
|
|
534
|
+
) =>
|
|
535
|
+
(goal: Goal) => {
|
|
536
|
+
if (goal.isProofsEnabled) throw new SmtTacticError("pb2bv does not support proof production");
|
|
537
|
+
if (!goal.isInconsistent) {
|
|
538
|
+
const converter = new Pb2Bv(manager, params, options);
|
|
539
|
+
try {
|
|
540
|
+
converter.run(goal);
|
|
541
|
+
} finally {
|
|
542
|
+
converter.release();
|
|
543
|
+
}
|
|
544
|
+
}
|
|
545
|
+
return [goal];
|
|
546
|
+
};
|