tla-ts 0.0.9 → 0.0.10-dev.09e53c2a6
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +30 -1
- package/dist/compile.cjs +23 -0
- package/dist/compile.js +23 -0
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +57 -53
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +109 -10
- package/dist/index.d.ts +109 -10
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +2746 -410
- package/dist/prove.js +2745 -409
- package/dist/run.cjs +146 -31
- package/dist/run.js +146 -31
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +132 -104
- package/dist/transfer.js +132 -104
- package/dist/worker.cjs +6 -6
- package/dist/worker.js +6 -6
- package/package.json +3 -1
- package/src/ast.ts +45 -59
- package/src/bags.ts +99 -102
- package/src/builtins.ts +28 -75
- package/src/bundled-modules.ts +1 -8
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +282 -0
- package/src/check.ts +797 -782
- package/src/cli/options.ts +12 -32
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +136 -0
- package/src/cli/shared.ts +19 -12
- package/src/cli/tlapm.ts +433 -82
- package/src/cli/tlc-arguments.ts +652 -0
- package/src/cli/tlc-output.ts +687 -0
- package/src/cli/tlc-usage.ts +360 -0
- package/src/cli/tlc.ts +323 -658
- package/src/cli/typescript.ts +23 -0
- package/src/cli/xml-exporter.ts +27 -49
- package/src/cli.ts +0 -1
- package/src/codegen.ts +196 -74
- package/src/config.ts +140 -109
- package/src/coverage.ts +830 -0
- package/src/dependencies.ts +36 -54
- package/src/dfid.ts +618 -0
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +178 -339
- package/src/errors.ts +100 -57
- package/src/evaluate.ts +598 -340
- package/src/exit-codes.ts +38 -3
- package/src/fingerprints.ts +75 -11
- package/src/index.ts +3 -0
- package/src/instances.ts +126 -21
- package/src/java-hash.ts +7 -0
- package/src/java-overrides.ts +4 -19
- package/src/json-reader.ts +455 -0
- package/src/json.ts +252 -139
- package/src/levels.ts +46 -58
- package/src/lexer.ts +83 -101
- package/src/liveness-checker.ts +590 -311
- package/src/liveness.ts +180 -124
- package/src/obligations/action.ts +17 -44
- package/src/obligations/anonymize.ts +120 -95
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +37 -26
- package/src/obligations/format.ts +0 -10
- package/src/obligations/generate.ts +66 -64
- package/src/obligations/index.ts +38 -19
- package/src/obligations/levels.ts +27 -18
- package/src/obligations/module.ts +28 -55
- package/src/obligations/normalize.ts +30 -37
- package/src/obligations/operators.ts +0 -3
- package/src/obligations/pragma.ts +52 -24
- package/src/obligations/printer.ts +89 -58
- package/src/obligations/proof.ts +3 -6
- package/src/obligations/regroup.ts +0 -5
- package/src/obligations/simplify.ts +57 -63
- package/src/obligations/source.ts +119 -95
- package/src/obligations/subexpression.ts +49 -28
- package/src/obligations/substitution.ts +1 -5
- package/src/obligations/temporal.ts +12 -20
- package/src/obligations/tuples.ts +2 -10
- package/src/parallel-worker.ts +30 -60
- package/src/parallel.ts +59 -73
- package/src/parser.ts +1082 -399
- package/src/pcal/ast.ts +53 -86
- package/src/pcal/parse.ts +144 -219
- package/src/pcal/tokenize.ts +91 -131
- package/src/pcal/translate.ts +83 -130
- package/src/pcal/validate.ts +48 -68
- package/src/pretty-print.ts +7 -8
- package/src/prover/decide-pool.ts +8 -13
- package/src/prover/deciders.ts +12 -13
- package/src/prover/first-order.ts +0 -11
- package/src/prover/isabelle/decide.ts +3 -31
- package/src/prover/isabelle/encode.ts +82 -64
- package/src/prover/isabelle/isar/attrib.ts +250 -0
- package/src/prover/isabelle/isar/context.ts +335 -0
- package/src/prover/isabelle/isar/induct.ts +382 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
- package/src/prover/isabelle/isar/method.ts +510 -226
- package/src/prover/isabelle/isar/proof.ts +570 -23
- package/src/prover/isabelle/isar/rule-cases.ts +224 -0
- package/src/prover/isabelle/isar/theory.ts +488 -88
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +99 -38
- package/src/prover/isabelle/provers/blast/blast.ts +16 -105
- package/src/prover/isabelle/provers/blast/branch.ts +0 -33
- package/src/prover/isabelle/provers/blast/prove.ts +0 -36
- package/src/prover/isabelle/provers/blast/rules.ts +5 -45
- package/src/prover/isabelle/provers/blast/state.ts +1 -29
- package/src/prover/isabelle/provers/blast/term.ts +8 -37
- package/src/prover/isabelle/provers/clasimp.ts +0 -14
- package/src/prover/isabelle/provers/classical.ts +58 -61
- package/src/prover/isabelle/provers/hypsubst.ts +27 -52
- package/src/prover/isabelle/pure/bicompose.ts +24 -39
- package/src/prover/isabelle/pure/consts.ts +0 -8
- package/src/prover/isabelle/pure/conv.ts +2 -18
- package/src/prover/isabelle/pure/drule.ts +95 -45
- package/src/prover/isabelle/pure/envir.ts +2 -53
- package/src/prover/isabelle/pure/goal.ts +1 -9
- package/src/prover/isabelle/pure/interrupt.ts +0 -5
- package/src/prover/isabelle/pure/list.ts +0 -3
- package/src/prover/isabelle/pure/logic.ts +1 -16
- package/src/prover/isabelle/pure/name.ts +1 -10
- package/src/prover/isabelle/pure/net.ts +2 -60
- package/src/prover/isabelle/pure/object-logic.ts +15 -16
- package/src/prover/isabelle/pure/pattern.ts +1 -20
- package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
- package/src/prover/isabelle/pure/rewriter.ts +31 -74
- package/src/prover/isabelle/pure/search.ts +2 -11
- package/src/prover/isabelle/pure/seq.ts +0 -11
- package/src/prover/isabelle/pure/simplifier.ts +27 -16
- package/src/prover/isabelle/pure/table.ts +2 -33
- package/src/prover/isabelle/pure/tactic.ts +11 -23
- package/src/prover/isabelle/pure/tactical.ts +47 -48
- package/src/prover/isabelle/pure/term-ord.ts +1 -7
- package/src/prover/isabelle/pure/term.ts +1 -44
- package/src/prover/isabelle/pure/thm.ts +26 -48
- package/src/prover/isabelle/pure/type.ts +1 -16
- package/src/prover/isabelle/pure/unify.ts +19 -31
- package/src/prover/isabelle/pure/variable.ts +2 -8
- package/src/prover/isabelle/tla/classical-setup.ts +17 -25
- package/src/prover/isabelle/tla/context.ts +65 -26
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +53 -32
- package/src/prover/isabelle/tla/simpdata.ts +45 -44
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
- package/src/prover/ocaml.ts +4 -7
- package/src/prover/prep/action.ts +33 -66
- package/src/prover/prep/enabled-axioms.ts +22 -20
- package/src/prover/prep/fingerprint.ts +2 -21
- package/src/prover/prep/level-comparison.ts +8 -12
- package/src/prover/prep/md5.ts +0 -2
- package/src/prover/prep/methods.ts +189 -86
- package/src/prover/prep/normalize.ts +42 -37
- package/src/prover/prove-worker.ts +0 -2
- package/src/prover/prove.ts +398 -133
- package/src/prover/ptl/decide.ts +96 -56
- package/src/prover/ptl/encode.ts +15 -38
- package/src/prover/ptl/sat.ts +24 -32
- package/src/prover/ptl/tableau.ts +40 -28
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -15
- package/src/prover/smt/context.ts +60 -32
- package/src/prover/smt/data.ts +517 -401
- package/src/prover/smt/encode.ts +155 -85
- package/src/prover/smt/extensionality.ts +5 -13
- package/src/prover/smt/flatten.ts +7 -28
- package/src/prover/smt/format.ts +33 -14
- package/src/prover/smt/instances.ts +7 -11
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1026 -658
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
- package/src/prover/smt/solver/ackr-helper.ts +179 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
- package/src/prover/smt/solver/act-cache.ts +0 -16
- package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
- package/src/prover/smt/solver/aig-tactic.ts +52 -0
- package/src/prover/smt/solver/aig.ts +889 -0
- package/src/prover/smt/solver/arith-rewriter.ts +615 -53
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +309 -0
- package/src/prover/smt/solver/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +87 -58
- package/src/prover/smt/solver/ast-lt.ts +166 -22
- package/src/prover/smt/solver/ast-util.ts +160 -7
- package/src/prover/smt/solver/ast.ts +1424 -180
- package/src/prover/smt/solver/auf-solver.ts +7 -44
- package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +600 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +110 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -10
- package/src/prover/smt/solver/cg-table.ts +39 -42
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -27
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -11
- package/src/prover/smt/solver/context.ts +519 -175
- package/src/prover/smt/solver/ctx-simplify.ts +33 -50
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
- package/src/prover/smt/solver/der.ts +39 -30
- package/src/prover/smt/solver/diff-neq.ts +206 -0
- package/src/prover/smt/solver/distribute-forall.ts +57 -0
- package/src/prover/smt/solver/dom-simplify.ts +511 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -11
- package/src/prover/smt/solver/e-matching.ts +9 -41
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
- package/src/prover/smt/solver/enode.ts +100 -23
- package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +907 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1050 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +335 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -5
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
- package/src/prover/smt/solver/expr2polynomial.ts +146 -0
- package/src/prover/smt/solver/factor.ts +141 -0
- package/src/prover/smt/solver/fd-solver.ts +265 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -26
- package/src/prover/smt/solver/fix-dl-var.ts +148 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -9
- package/src/prover/smt/solver/fm-tactic.ts +884 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +176 -28
- package/src/prover/smt/solver/goal2nlsat.ts +189 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -9
- package/src/prover/smt/solver/hashtable.ts +26 -23
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +112 -132
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -2
- package/src/prover/smt/solver/lia2card.ts +268 -0
- package/src/prover/smt/solver/lia2pb.ts +154 -0
- package/src/prover/smt/solver/literal.ts +0 -4
- package/src/prover/smt/solver/logic-tactics.ts +345 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
- package/src/prover/smt/solver/lp/constraints.ts +1 -8
- package/src/prover/smt/solver/lp/containers.ts +11 -30
- package/src/prover/smt/solver/lp/core-solver.ts +23 -29
- package/src/prover/smt/solver/lp/cross-nested.ts +5 -20
- package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
- package/src/prover/smt/solver/lp/dependency.ts +0 -5
- package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
- package/src/prover/smt/solver/lp/explanation.ts +0 -6
- package/src/prover/smt/solver/lp/gomory.ts +8 -22
- package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
- package/src/prover/smt/solver/lp/hnf.ts +10 -28
- package/src/prover/smt/solver/lp/int-cube.ts +17 -39
- package/src/prover/smt/solver/lp/int-solver.ts +3 -35
- package/src/prover/smt/solver/lp/lar-solver.ts +69 -82
- package/src/prover/smt/solver/lp/lar-term.ts +0 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -14
- package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
- package/src/prover/smt/solver/lp/nex-creator.ts +4 -28
- package/src/prover/smt/solver/lp/nex.ts +0 -6
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
- package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
- package/src/prover/smt/solver/lp/nla-core.ts +91 -135
- package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
- package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
- package/src/prover/smt/solver/lp/nla-grobner.ts +22 -72
- package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
- package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
- package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
- package/src/prover/smt/solver/lp/nla-order.ts +0 -13
- package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -12
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
- package/src/prover/smt/solver/lp/nra-solver.ts +123 -112
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +0 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +1 -14
- package/src/prover/smt/solver/lp/pdd-solver.ts +2 -33
- package/src/prover/smt/solver/lp/pdd.ts +7 -70
- package/src/prover/smt/solver/lp/random-updater.ts +0 -9
- package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
- package/src/prover/smt/solver/lp/union-find.ts +5 -5
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +129 -139
- package/src/prover/smt/solver/mam-interpreter.ts +0 -21
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +309 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +105 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +19 -62
- package/src/prover/smt/solver/model-evaluator.ts +190 -40
- package/src/prover/smt/solver/model-finder.ts +14 -32
- package/src/prover/smt/solver/model-generator.ts +56 -40
- package/src/prover/smt/solver/model-macro-solver.ts +60 -114
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +711 -0
- package/src/prover/smt/solver/mus.ts +51 -0
- package/src/prover/smt/solver/muz/dl-context.ts +404 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +177 -160
- package/src/prover/smt/solver/nlsat/atoms.ts +24 -24
- package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
- package/src/prover/smt/solver/nlsat/explain.ts +65 -69
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
- package/src/prover/smt/solver/nlsat/levelwise.ts +48 -135
- package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +29 -161
- package/src/prover/smt/solver/nlsat/solver.ts +241 -110
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -9
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -47
- package/src/prover/smt/solver/nlsat/upolynomial.ts +10 -93
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +107 -60
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +787 -0
- package/src/prover/smt/solver/opt-nlsat.ts +375 -0
- package/src/prover/smt/solver/opt-pareto.ts +282 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +308 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +21 -26
- package/src/prover/smt/solver/pb-rewriter.ts +284 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +204 -79
- package/src/prover/smt/solver/probes.ts +512 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -30
- package/src/prover/smt/solver/proto-model.ts +650 -66
- package/src/prover/smt/solver/pull-quant.ts +28 -23
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -31
- package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
- package/src/prover/smt/solver/qe-lite.ts +39 -49
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1498 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -16
- package/src/prover/smt/solver/qsat.ts +814 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +17 -74
- package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
- package/src/prover/smt/solver/quantifier-manager.ts +8 -23
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -2
- package/src/prover/smt/solver/rational.ts +45 -8
- package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -6
- package/src/prover/smt/solver/relevancy.ts +2 -16
- package/src/prover/smt/solver/rewriter-tpl.ts +52 -129
- package/src/prover/smt/solver/rewriter.ts +477 -120
- package/src/prover/smt/solver/rlimit.ts +39 -21
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2127 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +1010 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1301 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +728 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
- package/src/prover/smt/solver/seq-skolem.ts +317 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +83 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +496 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3140 -365
- package/src/prover/smt/solver/smtlib-script.ts +1631 -0
- package/src/prover/smt/solver/solve-eqs.ts +929 -0
- package/src/prover/smt/solver/solver.ts +119 -39
- package/src/prover/smt/solver/sort.ts +1 -5
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -6
- package/src/prover/smt/solver/tactic.ts +1986 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1200 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
- package/src/prover/smt/solver/theory-lra-final-check.ts +59 -91
- package/src/prover/smt/solver/theory-lra-internalize.ts +94 -53
- package/src/prover/smt/solver/theory-lra-model.ts +23 -53
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -40
- package/src/prover/smt/solver/theory-lra-state.ts +6 -27
- package/src/prover/smt/solver/theory-lra.ts +188 -8
- package/src/prover/smt/solver/theory-pb.ts +934 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +871 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
- package/src/prover/smt/solver/var-subst.ts +37 -39
- package/src/prover/smt/table.ts +3 -10
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +67 -41
- package/src/prover/tlapm/ocaml-marshal.ts +19 -21
- package/src/prover/tlapm/tlapm.ts +21 -20
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -2
- package/src/prover/zenon/check/check.ts +1 -11
- package/src/prover/zenon/check/definitions.ts +5 -15
- package/src/prover/zenon/check/equality.ts +0 -8
- package/src/prover/zenon/check/functions.ts +0 -4
- package/src/prover/zenon/check/keys.ts +0 -7
- package/src/prover/zenon/check/propositional.ts +0 -3
- package/src/prover/zenon/check/records.ts +1 -6
- package/src/prover/zenon/check/relations.ts +2 -14
- package/src/prover/zenon/check/rewrites.ts +2 -21
- package/src/prover/zenon/check/sets.ts +40 -61
- package/src/prover/zenon/check/terms.ts +1 -19
- package/src/prover/zenon/check/tla.ts +0 -6
- package/src/prover/zenon/decide.ts +10 -19
- package/src/prover/zenon/encode.ts +0 -9
- package/src/prover/zenon/eqrel.ts +2 -15
- package/src/prover/zenon/equality-rules.ts +0 -6
- package/src/prover/zenon/expr.ts +8 -28
- package/src/prover/zenon/index-table.ts +26 -59
- package/src/prover/zenon/isar-case.ts +8 -20
- package/src/prover/zenon/isar.ts +35 -65
- package/src/prover/zenon/limits.ts +0 -4
- package/src/prover/zenon/llproof.ts +2 -22
- package/src/prover/zenon/mltoll.ts +66 -106
- package/src/prover/zenon/node.ts +20 -15
- package/src/prover/zenon/ocaml.ts +1 -17
- package/src/prover/zenon/parse.ts +9 -13
- package/src/prover/zenon/phrase.ts +1 -13
- package/src/prover/zenon/proof.ts +0 -11
- package/src/prover/zenon/propositional-rules.ts +0 -7
- package/src/prover/zenon/rules.ts +2 -8
- package/src/prover/zenon/search.ts +11 -35
- package/src/prover/zenon/tla/functions.ts +59 -33
- package/src/prover/zenon/tla/llproof.ts +67 -78
- package/src/prover/zenon/tla/records.ts +57 -35
- package/src/prover/zenon/tla/rewrites.ts +12 -21
- package/src/prover/zenon/tla/sets.ts +88 -59
- package/src/prover/zenon/tla/terms.ts +0 -8
- package/src/prover/zenon/tla/tla.ts +66 -66
- package/src/randomization.ts +81 -35
- package/src/resolve.ts +67 -185
- package/src/runtime.ts +26 -22
- package/src/sany/builtins.ts +2 -5
- package/src/sany/generation.ts +394 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1100 -0
- package/src/sany/generator-proofs.ts +662 -0
- package/src/sany/generator.ts +191 -2764
- package/src/sany/levels.ts +5 -35
- package/src/sany/lexer.ts +58 -77
- package/src/sany/linter.ts +0 -10
- package/src/sany/modules.ts +1 -5
- package/src/sany/nodes.ts +5 -43
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +32 -69
- package/src/sany/selectors.ts +49 -76
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +35 -117
- package/src/search.ts +671 -169
- package/src/simulate.ts +712 -0
- package/src/spec-description.ts +192 -100
- package/src/standard-definitions.ts +4 -4
- package/src/standard-modules.ts +264 -95
- package/src/state-graph.ts +52 -33
- package/src/subexpressions.ts +69 -52
- package/src/substitution-levels.ts +7 -7
- package/src/successors.ts +267 -100
- package/src/symmetry.ts +35 -27
- package/src/tableau.ts +29 -26
- package/src/tlc/fingerprint.ts +267 -79
- package/src/tlc/jar-data.ts +112 -6
- package/src/tlc/messages.ts +125 -54
- package/src/tlc/order.ts +39 -69
- package/src/tlc/random.ts +37 -49
- package/src/tlc/replay.ts +553 -228
- package/src/tlc/summary.ts +64 -60
- package/src/tlc/tlc-operators.ts +78 -44
- package/src/tlc/tlcext-operators.ts +171 -122
- package/src/tlc/trace-spec.ts +249 -0
- package/src/tlc/value-stream.ts +139 -0
- package/src/tlc/version.ts +1 -4
- package/src/transfer.ts +22 -25
- package/src/typed-tier.ts +6535 -0
- package/src/typescript/actions.ts +479 -0
- package/src/typescript/collections.ts +614 -0
- package/src/typescript/compile.ts +63 -0
- package/src/typescript/context.ts +94 -0
- package/src/typescript/emit.ts +121 -0
- package/src/typescript/expressions.ts +496 -0
- package/src/typescript/formula.ts +154 -0
- package/src/typescript/functions.ts +284 -0
- package/src/typescript/model.ts +162 -0
- package/src/typescript/names.ts +114 -0
- package/src/typescript/program.ts +48 -0
- package/src/typescript/properties.ts +139 -0
- package/src/typescript/scope.ts +112 -0
- package/src/typescript/steps.ts +167 -0
- package/src/typescript/types.ts +171 -0
- package/src/values.ts +832 -484
- package/src/worker.ts +7 -8
- package/src/prover/isabelle/isar/statement.ts +0 -57
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/tlaps-module.ts +0 -510
- package/src/prover/zenon/LICENSE +0 -32
|
@@ -0,0 +1,154 @@
|
|
|
1
|
+
import { SmtTacticError } from "../../../errors";
|
|
2
|
+
import {
|
|
3
|
+
type AstManager,
|
|
4
|
+
FAMILY_ARITH,
|
|
5
|
+
FAMILY_BASIC,
|
|
6
|
+
KIND_APP,
|
|
7
|
+
OP_ADD,
|
|
8
|
+
OP_GE,
|
|
9
|
+
OP_GT,
|
|
10
|
+
OP_LE,
|
|
11
|
+
OP_LT,
|
|
12
|
+
OP_MUL,
|
|
13
|
+
OP_NUM,
|
|
14
|
+
SORT_BOOL,
|
|
15
|
+
SORT_INT,
|
|
16
|
+
SORT_REAL,
|
|
17
|
+
isArithSort,
|
|
18
|
+
} from "./ast";
|
|
19
|
+
import { BoundManager } from "./bound-manager";
|
|
20
|
+
import { type Definition, type Dependency, type Goal, joinDependencies } from "./goal";
|
|
21
|
+
import { Rational } from "./rational";
|
|
22
|
+
import { RefVector } from "./ref-vector";
|
|
23
|
+
import { Rewriter, type RewriterOptions } from "./rewriter";
|
|
24
|
+
|
|
25
|
+
const LINEAR_OPS = [OP_LE, OP_GE, OP_LT, OP_GT, OP_ADD, OP_NUM];
|
|
26
|
+
|
|
27
|
+
const getNumBits = (value: Rational) => value.num.toString(2).length;
|
|
28
|
+
|
|
29
|
+
export interface Lia2PbOptions {
|
|
30
|
+
isPartial: boolean;
|
|
31
|
+
maxBits: number;
|
|
32
|
+
totalBits: number;
|
|
33
|
+
rewriter: RewriterOptions;
|
|
34
|
+
}
|
|
35
|
+
|
|
36
|
+
export const lia2pb = (manager: AstManager, goal: Goal, options: Lia2PbOptions) => {
|
|
37
|
+
if (goal.isProofsEnabled) throw new SmtTacticError("lia2pb does not support proof production");
|
|
38
|
+
if (goal.isInconsistent) return;
|
|
39
|
+
const bounds = new BoundManager(manager);
|
|
40
|
+
for (let index = 0; index < goal.forms.size; index++)
|
|
41
|
+
bounds.add(goal.forms.items[index], goal.getDependency(index));
|
|
42
|
+
const getTargetUpper = (expr: number) => {
|
|
43
|
+
if (!manager.isUninterpretedConst(expr)) return undefined;
|
|
44
|
+
const lower = bounds.lowers.get(expr);
|
|
45
|
+
const upper = bounds.uppers.get(expr)?.value;
|
|
46
|
+
return lower !== undefined &&
|
|
47
|
+
upper !== undefined &&
|
|
48
|
+
lower.value.isZero() &&
|
|
49
|
+
!upper.isNegative() &&
|
|
50
|
+
upper.isInt() &&
|
|
51
|
+
getNumBits(upper) <= options.maxBits
|
|
52
|
+
? upper
|
|
53
|
+
: undefined;
|
|
54
|
+
};
|
|
55
|
+
const isTarget = (expr: number) => {
|
|
56
|
+
const upper = getTargetUpper(expr);
|
|
57
|
+
return upper !== undefined && upper.compare(Rational.one) > 0;
|
|
58
|
+
};
|
|
59
|
+
if (!bounds.boundedVars.some(isTarget)) {
|
|
60
|
+
goal.depth++;
|
|
61
|
+
return;
|
|
62
|
+
}
|
|
63
|
+
const isSupported = (expr: number) => {
|
|
64
|
+
if (manager.kinds[expr] !== KIND_APP) return false;
|
|
65
|
+
const family = manager.getFamily(expr);
|
|
66
|
+
if (family === FAMILY_BASIC) return true;
|
|
67
|
+
if (family === FAMILY_ARITH) {
|
|
68
|
+
const op = manager.getOp(expr);
|
|
69
|
+
if (LINEAR_OPS.includes(op)) return true;
|
|
70
|
+
return (
|
|
71
|
+
op === OP_MUL &&
|
|
72
|
+
manager.getNumArgs(expr) === 2 &&
|
|
73
|
+
manager.isNumeral(manager.getArg(expr, 0))
|
|
74
|
+
);
|
|
75
|
+
}
|
|
76
|
+
if (manager.isUninterpretedConst(expr)) {
|
|
77
|
+
if (manager.sorts[expr] === SORT_REAL) return options.isPartial;
|
|
78
|
+
if (manager.sorts[expr] === SORT_INT)
|
|
79
|
+
return options.isPartial || getTargetUpper(expr) !== undefined;
|
|
80
|
+
return true;
|
|
81
|
+
}
|
|
82
|
+
return !isArithSort(manager.sorts[expr]);
|
|
83
|
+
};
|
|
84
|
+
const visited = new Set<number>();
|
|
85
|
+
const todo = [...goal.forms.items];
|
|
86
|
+
for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
|
|
87
|
+
if (visited.has(expr)) continue;
|
|
88
|
+
visited.add(expr);
|
|
89
|
+
if (!isSupported(expr)) throw new SmtTacticError("goal is in a fragment unsupported by lia2pb");
|
|
90
|
+
manager.pushArgs(expr, todo);
|
|
91
|
+
}
|
|
92
|
+
let numBits = 0;
|
|
93
|
+
for (const variable of bounds.boundedVars) {
|
|
94
|
+
if (!isTarget(variable)) continue;
|
|
95
|
+
numBits += getNumBits(getTargetUpper(variable) as Rational);
|
|
96
|
+
if (numBits > options.totalBits)
|
|
97
|
+
throw new SmtTacticError(
|
|
98
|
+
"lia2pb failed, number of necessary bits exceeds specified threshold (use option :lia2pb-total-bits to increase threshold)",
|
|
99
|
+
);
|
|
100
|
+
}
|
|
101
|
+
const terms = new RefVector(manager);
|
|
102
|
+
const definitions: Definition[] = [];
|
|
103
|
+
const substitution = new Map<number, number>();
|
|
104
|
+
const substitutionDependencies = new Map<number, Dependency | undefined>();
|
|
105
|
+
const zero = manager.mkNumeral(0n);
|
|
106
|
+
const one = manager.mkNumeral(1n);
|
|
107
|
+
terms.push(zero);
|
|
108
|
+
terms.push(one);
|
|
109
|
+
for (const variable of bounds.boundedVars) {
|
|
110
|
+
if (!isTarget(variable)) continue;
|
|
111
|
+
const args: number[] = [];
|
|
112
|
+
let coeff = 1n;
|
|
113
|
+
const bits = getNumBits(getTargetUpper(variable) as Rational);
|
|
114
|
+
for (let index = 0; index < bits; index++) {
|
|
115
|
+
const bit = manager.mkFreshConst(null, SORT_INT);
|
|
116
|
+
terms.push(bit);
|
|
117
|
+
goal.assert(manager.mkApp(OP_LE, [zero, bit], SORT_BOOL));
|
|
118
|
+
goal.assert(manager.mkApp(OP_LE, [bit, one], SORT_BOOL));
|
|
119
|
+
args.push(
|
|
120
|
+
coeff === 1n ? bit : manager.mkApp(OP_MUL, [manager.mkNumeral(coeff), bit], SORT_INT),
|
|
121
|
+
);
|
|
122
|
+
definitions.push({ decl: manager.decls[bit], def: -1 });
|
|
123
|
+
coeff *= 2n;
|
|
124
|
+
}
|
|
125
|
+
const def = manager.mkApp(OP_ADD, args, SORT_INT);
|
|
126
|
+
terms.push(def);
|
|
127
|
+
substitution.set(variable, def);
|
|
128
|
+
substitutionDependencies.set(
|
|
129
|
+
variable,
|
|
130
|
+
joinDependencies(
|
|
131
|
+
bounds.lowerDependencies.get(variable),
|
|
132
|
+
bounds.upperDependencies.get(variable),
|
|
133
|
+
),
|
|
134
|
+
);
|
|
135
|
+
definitions.push({ decl: manager.decls[variable], def });
|
|
136
|
+
}
|
|
137
|
+
const rewriter = new Rewriter(manager, options.rewriter);
|
|
138
|
+
rewriter.setSubstitution(substitution, substitutionDependencies);
|
|
139
|
+
const size = goal.forms.size;
|
|
140
|
+
for (let index = 0; !goal.isInconsistent && index < size; index++) {
|
|
141
|
+
const rewritten = rewriter.rewrite(goal.forms.items[index]);
|
|
142
|
+
goal.update(
|
|
143
|
+
index,
|
|
144
|
+
rewritten,
|
|
145
|
+
joinDependencies(rewriter.usedDependencies, goal.getDependency(index)),
|
|
146
|
+
);
|
|
147
|
+
rewriter.usedDependencies = undefined;
|
|
148
|
+
manager.decRef(rewritten);
|
|
149
|
+
}
|
|
150
|
+
rewriter.release();
|
|
151
|
+
goal.depth++;
|
|
152
|
+
goal.addDefinitions(definitions);
|
|
153
|
+
terms.reset();
|
|
154
|
+
};
|
|
@@ -1,13 +1,9 @@
|
|
|
1
|
-
// Ported from Z3 (src/smt/smt_literal.h, src/smt/smt_types.h), MIT license, see z3-license.txt.
|
|
2
|
-
// A Boolean variable numbers an atom. A literal is a variable or its negation, encoded as twice the
|
|
3
|
-
// variable plus one when negated, so a literal indexes per-literal arrays directly.
|
|
4
1
|
declare const boolVarBrand: unique symbol;
|
|
5
2
|
declare const literalBrand: unique symbol;
|
|
6
3
|
|
|
7
4
|
export type BoolVar = number & { readonly [boolVarBrand]: true };
|
|
8
5
|
export type Literal = number & { readonly [literalBrand]: true };
|
|
9
6
|
|
|
10
|
-
// The variable of true. Its positive literal is true and its negative literal false.
|
|
11
7
|
export const TRUE_BOOL_VAR = 0 as BoolVar;
|
|
12
8
|
export const TRUE_LITERAL = 0 as Literal;
|
|
13
9
|
export const FALSE_LITERAL = 1 as Literal;
|
|
@@ -0,0 +1,345 @@
|
|
|
1
|
+
interface QfnraSolver {
|
|
2
|
+
simpleCheck: number;
|
|
3
|
+
heuristic?: number;
|
|
4
|
+
orders: [number, number][];
|
|
5
|
+
ls: number;
|
|
6
|
+
smt: number;
|
|
7
|
+
seeds: number;
|
|
8
|
+
seedLimit: number;
|
|
9
|
+
}
|
|
10
|
+
|
|
11
|
+
const BV2SAT =
|
|
12
|
+
"(using-params (and-then simplify propagate-values solve-eqs max-bv-sharing bit-blast aig " +
|
|
13
|
+
"(using-params sat :flat false :som false :gc dyn_psm)) :flat false :som false :gc dyn_psm)";
|
|
14
|
+
|
|
15
|
+
const QFLIA_PREAMBLE =
|
|
16
|
+
"(and-then simplify propagate-values (using-params ctx-simplify :max_depth 30 " +
|
|
17
|
+
":max_steps 5000000) (using-params simplify :pull_cheap_ite true :push_ite_arith false " +
|
|
18
|
+
":local_ctx true :local_ctx_limit 10000000 :hoist_ite true) solve-eqs (using-params lia2card " +
|
|
19
|
+
":lia2card.max_range 1 :lia2card.max_ite_nesting 1) elim-uncnstr)";
|
|
20
|
+
|
|
21
|
+
const getNoCutSmt = (seed: number) =>
|
|
22
|
+
`(using-params smt :smt.logic QF_LIA :arith.branch_cut_ratio 10000000 :random_seed ${seed})`;
|
|
23
|
+
|
|
24
|
+
const LIA2SAT =
|
|
25
|
+
"(and-then (fail-if is-unbounded) (fail-if produce-proofs) (fail-if produce-unsat-cores) " +
|
|
26
|
+
"propagate-ineqs normalize-bounds lia2pb (using-params pb2bv :pb2bv_all_clauses_limit 8) " +
|
|
27
|
+
`(fail-if (not is-qfbv)) (using-params ${BV2SAT} :ite_extra true))`;
|
|
28
|
+
|
|
29
|
+
const ILP_MODEL_FINDER =
|
|
30
|
+
"(and-then (fail-if (not (and is-ilp is-unbounded))) (fail-if produce-proofs) " +
|
|
31
|
+
`(fail-if produce-unsat-cores) propagate-ineqs (or-else (try-for ${getNoCutSmt(100)} 2000) ` +
|
|
32
|
+
`(and-then (using-params add-bounds :add_bound_lower -16 :add_bound_upper 15) ` +
|
|
33
|
+
`(try-for ${LIA2SAT} 5000)) (try-for ${getNoCutSmt(200)} 5000) (and-then ` +
|
|
34
|
+
`(using-params add-bounds :add_bound_lower -32 :add_bound_upper 31) (try-for ${LIA2SAT} ` +
|
|
35
|
+
"10000))) fail-if-undecided)";
|
|
36
|
+
|
|
37
|
+
const PB =
|
|
38
|
+
"(and-then (fail-if (not is-pb)) (fail-if produce-proofs) (fail-if produce-unsat-cores) " +
|
|
39
|
+
"(or-else (and-then (fail-if (>= num-exprs 80000)) (fail-if (not is-ilp)) " +
|
|
40
|
+
"fail-if-undecided) (and-then (using-params pb2bv :pb2bv_all_clauses_limit 8) " +
|
|
41
|
+
`(fail-if (not is-qfbv)) (using-params ${BV2SAT} :ite_extra true))))`;
|
|
42
|
+
|
|
43
|
+
const BOUNDED =
|
|
44
|
+
`(and-then (fail-if is-unbounded) (or-else (try-for ${getNoCutSmt(100)} 5000) (try-for ` +
|
|
45
|
+
"(using-params smt :arith.branch_cut_ratio 10000000 :random_seed 200 :relevancy 0) 5000) " +
|
|
46
|
+
`(try-for ${getNoCutSmt(300)} 15000)) fail-if-undecided)`;
|
|
47
|
+
|
|
48
|
+
const QFLIA =
|
|
49
|
+
`(using-params (and-then ${QFLIA_PREAMBLE} (using-params simplify :arith_lhs true) ` +
|
|
50
|
+
`(or-else ${ILP_MODEL_FINDER} ${PB} (and-then (fail-if (not is-quasi-pb)) ` +
|
|
51
|
+
`(using-params ${LIA2SAT} :lia2pb_max_bits 64) fail-if-undecided) ${BOUNDED} smt)) ` +
|
|
52
|
+
":elim_and true :som true :blast_distinct true :blast_distinct_threshold 128 " +
|
|
53
|
+
":lia2card.max_range 1 :lia2card.max_ite_nesting 1)";
|
|
54
|
+
|
|
55
|
+
const QFIDL_BV_SOLVER =
|
|
56
|
+
"(using-params (and-then simplify propagate-values solve-eqs max-bv-sharing bit-blast aig " +
|
|
57
|
+
"sat) :flat false :som false :gc dyn_psm)";
|
|
58
|
+
|
|
59
|
+
const QFIDL =
|
|
60
|
+
"(if (and (< num-consts 5000) (not produce-proofs) (not produce-unsat-cores)) " +
|
|
61
|
+
"(using-params (and-then (and-then (and-then simplify fix-dl-var propagate-values " +
|
|
62
|
+
"elim-uncnstr) (and-then solve-eqs (using-params simplify :arith_lhs true) propagate-values " +
|
|
63
|
+
"normalize-bounds solve-eqs)) (or-else (using-params diff-neq :diff_neq_max_k 25) (and-then " +
|
|
64
|
+
"(using-params lia2pb :lia2pb_max_bits 4) propagate-ineqs (using-params pb2bv " +
|
|
65
|
+
`:pb2bv_all_clauses_limit 8) (fail-if (not is-qfbv)) ${QFIDL_BV_SOLVER}) smt)) ` +
|
|
66
|
+
":elim_and true :blast_distinct true :som true) smt)";
|
|
67
|
+
|
|
68
|
+
const getQfnraNlsat = (isFactoring: boolean) =>
|
|
69
|
+
"(and-then (and-then (using-params simplify :elim_and true :blast_distinct true) " +
|
|
70
|
+
"(using-params purify-arith :complete false) propagate-values solve-eqs elim-uncnstr " +
|
|
71
|
+
"elim-term-ite (using-params purify-arith :complete false)) (and-then " +
|
|
72
|
+
`${isFactoring ? "factor" : "skip"} solve-eqs (using-params purify-arith :complete false) ` +
|
|
73
|
+
"(using-params simplify :elim_and true :blast_distinct true) tseitin-cnf-core " +
|
|
74
|
+
"(using-params simplify :elim_and true :blast_distinct true) nlsat))";
|
|
75
|
+
|
|
76
|
+
const QFNRA_NLSAT = getQfnraNlsat(true);
|
|
77
|
+
|
|
78
|
+
const getQfnraSolver = (solver: QfnraSolver) =>
|
|
79
|
+
[
|
|
80
|
+
`(try-for (and-then (using-params ${QFNRA_NLSAT} :simple_check true) fail-if-undecided) ` +
|
|
81
|
+
`${solver.simpleCheck})`,
|
|
82
|
+
...(solver.heuristic === undefined ? [] : [`(try-for ${QFNRA_NLSAT} ${solver.heuristic})`]),
|
|
83
|
+
...solver.orders.map(
|
|
84
|
+
([strategy, limit]) =>
|
|
85
|
+
`(try-for (using-params ${QFNRA_NLSAT} :variable_ordering_strategy ${strategy}) ${limit})`,
|
|
86
|
+
),
|
|
87
|
+
`(using-params smt :use_ls true :ls_time ${solver.ls})`,
|
|
88
|
+
`(and-then (try-for (using-params smt :arith.greatest_error_pivot true) ${solver.smt}) ` +
|
|
89
|
+
"fail-if-undecided)",
|
|
90
|
+
...Array.from(
|
|
91
|
+
{ length: solver.seeds },
|
|
92
|
+
(_unused, seed) =>
|
|
93
|
+
`(try-for (using-params ${QFNRA_NLSAT} :seed ${seed} :shuffle_vars true) ` +
|
|
94
|
+
`${solver.seedLimit})`,
|
|
95
|
+
),
|
|
96
|
+
QFNRA_NLSAT,
|
|
97
|
+
].join(" ");
|
|
98
|
+
|
|
99
|
+
const QFNRA_VERY_SMALL = getQfnraSolver({
|
|
100
|
+
simpleCheck: 10000,
|
|
101
|
+
heuristic: 4000,
|
|
102
|
+
orders: [
|
|
103
|
+
[4, 4000],
|
|
104
|
+
[3, 6000],
|
|
105
|
+
[1, 8000],
|
|
106
|
+
[5, 8000],
|
|
107
|
+
[2, 10000],
|
|
108
|
+
],
|
|
109
|
+
ls: 60,
|
|
110
|
+
smt: 300000,
|
|
111
|
+
seeds: 200,
|
|
112
|
+
seedLimit: 3000,
|
|
113
|
+
});
|
|
114
|
+
|
|
115
|
+
const QFNRA_SMALL = getQfnraSolver({
|
|
116
|
+
simpleCheck: 20000,
|
|
117
|
+
heuristic: 5000,
|
|
118
|
+
orders: [
|
|
119
|
+
[4, 5000],
|
|
120
|
+
[3, 10000],
|
|
121
|
+
[1, 15000],
|
|
122
|
+
[5, 15000],
|
|
123
|
+
[2, 20000],
|
|
124
|
+
],
|
|
125
|
+
ls: 70,
|
|
126
|
+
smt: 350000,
|
|
127
|
+
seeds: 100,
|
|
128
|
+
seedLimit: 5000,
|
|
129
|
+
});
|
|
130
|
+
|
|
131
|
+
const QFNRA_MIDDLE = getQfnraSolver({
|
|
132
|
+
simpleCheck: 30000,
|
|
133
|
+
heuristic: 10000,
|
|
134
|
+
orders: [
|
|
135
|
+
[4, 15000],
|
|
136
|
+
[3, 15000],
|
|
137
|
+
[1, 20000],
|
|
138
|
+
[5, 20000],
|
|
139
|
+
[2, 25000],
|
|
140
|
+
],
|
|
141
|
+
ls: 80,
|
|
142
|
+
smt: 375000,
|
|
143
|
+
seeds: 40,
|
|
144
|
+
seedLimit: 10000,
|
|
145
|
+
});
|
|
146
|
+
|
|
147
|
+
const QFNRA_LARGE = getQfnraSolver({
|
|
148
|
+
simpleCheck: 50000,
|
|
149
|
+
orders: [
|
|
150
|
+
[4, 15000],
|
|
151
|
+
[3, 30000],
|
|
152
|
+
[1, 40000],
|
|
153
|
+
[5, 40000],
|
|
154
|
+
[2, 50000],
|
|
155
|
+
],
|
|
156
|
+
ls: 90,
|
|
157
|
+
smt: 400000,
|
|
158
|
+
seeds: 10,
|
|
159
|
+
seedLimit: 20000,
|
|
160
|
+
});
|
|
161
|
+
|
|
162
|
+
const QFNRA_VERY_LARGE = getQfnraSolver({
|
|
163
|
+
simpleCheck: 100000,
|
|
164
|
+
orders: [
|
|
165
|
+
[1, 80000],
|
|
166
|
+
[5, 80000],
|
|
167
|
+
[2, 100000],
|
|
168
|
+
],
|
|
169
|
+
ls: 100,
|
|
170
|
+
smt: 425000,
|
|
171
|
+
seeds: 0,
|
|
172
|
+
seedLimit: 0,
|
|
173
|
+
});
|
|
174
|
+
|
|
175
|
+
const QFNRA =
|
|
176
|
+
"(and-then simplify propagate-values (if (< memory 30) (or-else " +
|
|
177
|
+
`${QFNRA_VERY_SMALL}) (if (< memory 80) (or-else ${QFNRA_SMALL}) (if (< memory 300) (or-else ` +
|
|
178
|
+
`${QFNRA_MIDDLE}) (if (< memory 600) (or-else ${QFNRA_LARGE}) (or-else ${QFNRA_VERY_LARGE}))))))`;
|
|
179
|
+
|
|
180
|
+
const NRA =
|
|
181
|
+
"(and-then simplify propagate-values qe-light simplify (if is-qfnra (or-else (try-for " +
|
|
182
|
+
`${QFNRA_NLSAT} 5000) (try-for (using-params ${getQfnraNlsat(false)} :seed 11 ` +
|
|
183
|
+
`:factor false) 10000) (using-params ${getQfnraNlsat(false)} :seed 13 :factor false)) ` +
|
|
184
|
+
"(or-else nlqsat smt)))";
|
|
185
|
+
|
|
186
|
+
const QFNIA_BV_SOLVER =
|
|
187
|
+
"(using-params (and-then simplify propagate-values (using-params simplify :local_ctx true " +
|
|
188
|
+
":local_ctx_limit 10000000) max-bv-sharing (using-params bit-blast :max_memory 100 " +
|
|
189
|
+
":max_conflicts 500) (using-params sat :max_memory 100 :max_conflicts 500)) :flat false " +
|
|
190
|
+
":hi_div0 true :elim_and true :blast_distinct true)";
|
|
191
|
+
|
|
192
|
+
const QFNIA_SMT_SOLVER = "(and-then (using-params simplify :som true) smt)";
|
|
193
|
+
|
|
194
|
+
const QFNIA =
|
|
195
|
+
"(and-then (and-then simplify propagate-values solve-eqs (using-params ctx-simplify " +
|
|
196
|
+
":max_depth 30 :max_steps 5000000) (using-params simplify :pull_cheap_ite true :local_ctx " +
|
|
197
|
+
"true :local_ctx_limit 10000000) elim-uncnstr (using-params lia2card :lia2card.max_range 1 " +
|
|
198
|
+
":lia2card.max_ite_nesting 1) card2bv (skip-if-failed (using-params cofactor-term-ite " +
|
|
199
|
+
":max_memory 20))) (or-else (and-then (using-params simplify :hoist_mul true) (using-params " +
|
|
200
|
+
`nla2bv :nla2bv_max_bv_size 64) (skip-if-failed ${QFNIA_BV_SOLVER}) fail-if-undecided) ` +
|
|
201
|
+
`(try-for ${QFNIA_SMT_SOLVER} 2000) (and-then (using-params simplify :som true) (try-for ` +
|
|
202
|
+
`(using-params ${getQfnraNlsat(false)} :som true) 3000) fail-if-undecided) ` +
|
|
203
|
+
`${QFNIA_SMT_SOLVER}))`;
|
|
204
|
+
|
|
205
|
+
const QUANT_PREPROCESSOR = (isSolvingEqs: boolean) =>
|
|
206
|
+
"(and-then simplify propagate-values (using-params ctx-simplify :max_depth 30 :max_steps " +
|
|
207
|
+
"5000000) (using-params simplify :pull_cheap_ite true :local_ctx true :local_ctx_limit " +
|
|
208
|
+
`10000000) ${isSolvingEqs ? "(when (not has-patterns) solve-eqs)" : "skip"} elim-uncnstr ` +
|
|
209
|
+
"simplify)";
|
|
210
|
+
|
|
211
|
+
const LRA =
|
|
212
|
+
`(and-then ${QUANT_PREPROCESSOR(true)} qe-light (if has-quantifiers (if is-lira (or-else ` +
|
|
213
|
+
"qsat smt) smt) smt))";
|
|
214
|
+
|
|
215
|
+
const DER_FP = "(repeat (and-then der simplify) 5)";
|
|
216
|
+
|
|
217
|
+
const UFBV_PREPROCESSOR =
|
|
218
|
+
"(and-then (and-then simplify propagate-values (and-then (if-no-proofs (if-no-unsat-cores " +
|
|
219
|
+
"(using-params macro-finder :elim_and false))) simplify) (and-then snf simplify) elim-and " +
|
|
220
|
+
`solve-eqs (and-then ${DER_FP} simplify) (and-then distribute-forall simplify)) ` +
|
|
221
|
+
"(if-no-unsat-cores (and-then (and-then reduce-args simplify) (and-then macro-finder " +
|
|
222
|
+
"simplify) (and-then ufbv-rewriter simplify) (and-then quasi-macros simplify))) " +
|
|
223
|
+
`(and-then ${DER_FP} simplify) simplify)`;
|
|
224
|
+
|
|
225
|
+
const UFBV =
|
|
226
|
+
`(using-params (and-then (repeat ${UFBV_PREPROCESSOR} 2) smt) :mbqi true ` +
|
|
227
|
+
":mbqi.max_iterations 4294967295 :elim_and true)";
|
|
228
|
+
|
|
229
|
+
const QFBV_PREAMBLE =
|
|
230
|
+
"(and-then (using-params simplify :flat_and_or false) (using-params propagate-values " +
|
|
231
|
+
":flat_and_or false) (using-params solve-eqs :solve_eqs_max_occs 2) elim-uncnstr " +
|
|
232
|
+
"bv-divrem-bounds (if-no-proofs (if-no-unsat-cores reduce-bv-size)) (using-params simplify " +
|
|
233
|
+
":som true :pull_cheap_ite true :push_ite_bv false :local_ctx true :local_ctx_limit 10000000 " +
|
|
234
|
+
":flat true :hoist_mul false :flat_and_or false) (using-params simplify :hoist_mul true :som " +
|
|
235
|
+
"false :flat_and_or false) max-bv-sharing (if-no-proofs (if-no-unsat-cores ackermannize_bv)))";
|
|
236
|
+
|
|
237
|
+
// Z3 skips this simplification past 300 MB of memory, which the port does not track.
|
|
238
|
+
const QFBV =
|
|
239
|
+
`(using-params (and-then ${QFBV_PREAMBLE} (if is-qfbv-eq (and-then bv1-blast (using-params ` +
|
|
240
|
+
"smt :preprocess false)) (if is-qfbv (and-then bit-blast (and-then (using-params (and-then " +
|
|
241
|
+
"simplify solve-eqs) :local_ctx true :flat false :flat_and_or false) (if-no-proofs aig)) " +
|
|
242
|
+
"(if produce-proofs (and-then simplify smt) psat)) smt))) :elim_and true " +
|
|
243
|
+
":push_ite_bv true :blast_distinct true)";
|
|
244
|
+
|
|
245
|
+
export const QFAUFBV =
|
|
246
|
+
"(using-params (and-then (and-then simplify propagate-values solve-eqs elim-uncnstr " +
|
|
247
|
+
"bv-divrem-bounds (if-no-proofs (if-no-unsat-cores reduce-bv-size)) (using-params simplify " +
|
|
248
|
+
":som true :pull_cheap_ite true :push_ite_bv false :local_ctx true :local_ctx_limit 10000000) " +
|
|
249
|
+
"max-bv-sharing (if-no-proofs (if-no-unsat-cores ackermannize_bv))) (if is-qfbv qfbv smt)) " +
|
|
250
|
+
":elim_and true :sort_store true)";
|
|
251
|
+
|
|
252
|
+
export const QFUFBV_ACKR_PREAMBLE =
|
|
253
|
+
"(and-then (using-params simplify :flat_and_or false) (using-params propagate-values " +
|
|
254
|
+
":flat_and_or false) (if-no-proofs (if-no-unsat-cores bv_bound_chk)) solve-eqs elim-uncnstr " +
|
|
255
|
+
"(if-no-proofs (if-no-unsat-cores reduce-bv-size)) max-bv-sharing (using-params simplify " +
|
|
256
|
+
":pull_cheap_ite true :push_ite_bv false :local_ctx true :local_ctx_limit 10000000 " +
|
|
257
|
+
":ite_extra_rules true :mul2concat true :flat_and_or false))";
|
|
258
|
+
|
|
259
|
+
const QFAUFLIA =
|
|
260
|
+
"(and-then (using-params (and-then simplify propagate-values solve-eqs elim-uncnstr simplify) " +
|
|
261
|
+
":elim_and true :som true :sort_store true) (using-params smt :array.simplify false))";
|
|
262
|
+
|
|
263
|
+
const QFUF =
|
|
264
|
+
"(and-then simplify propagate-values solve-eqs (using-params simplify :pull_cheap_ite true " +
|
|
265
|
+
":local_ctx true :local_ctx_limit 10000000) (if-no-proofs (if-no-unsat-cores " +
|
|
266
|
+
"symmetry-reduce)) smt)";
|
|
267
|
+
|
|
268
|
+
const DEFAULT =
|
|
269
|
+
"(and-then simplify (if (and is-propositional (not produce-proofs)) qffd (if is-qfbv qfbv " +
|
|
270
|
+
"(if is-qfaufbv qfaufbv (if is-qflia qflia (if is-qfauflia qfauflia (if is-qflra qflra (if " +
|
|
271
|
+
"is-qfnra qfnra (if is-qfnia qfnia (if is-lira lira (if is-nra nra (if is-qffp qffp (if " +
|
|
272
|
+
`is-qffplra qffplra (and-then ${QFLIA_PREAMBLE} smt))))))))))))))`;
|
|
273
|
+
|
|
274
|
+
const QFFP_SIMPLIFY = "(using-params simplify :arith_lhs true :elim_and true)";
|
|
275
|
+
|
|
276
|
+
const QFFP =
|
|
277
|
+
`(and-then (and-then ${QFFP_SIMPLIFY} propagate-values fpa2bv propagate-values ${QFFP_SIMPLIFY} ` +
|
|
278
|
+
"(if-no-proofs (if-no-unsat-cores ackermannize_bv))) bit-blast " +
|
|
279
|
+
`${QFFP_SIMPLIFY} (if is-propositional (if produce-proofs smt psat) (if is-fp-qfnra qfnra smt)))`;
|
|
280
|
+
|
|
281
|
+
export const LOGIC_TACTICS: ReadonlyMap<string, string> = new Map([
|
|
282
|
+
["qflia", QFLIA],
|
|
283
|
+
["qfidl", QFIDL],
|
|
284
|
+
["qfnia", QFNIA],
|
|
285
|
+
["qfnra-nlsat", QFNRA_NLSAT],
|
|
286
|
+
["qfnra", QFNRA],
|
|
287
|
+
["nra", NRA],
|
|
288
|
+
["qflra", "(using-params smt :arith.greatest_error_pivot true)"],
|
|
289
|
+
["lra", LRA],
|
|
290
|
+
["lia", LRA],
|
|
291
|
+
["lira", LRA],
|
|
292
|
+
["uflra", `(and-then ${QUANT_PREPROCESSOR(true)} smt)`],
|
|
293
|
+
["auflira", `(and-then ${QUANT_PREPROCESSOR(true)} smt)`],
|
|
294
|
+
["aufnira", `(and-then ${QUANT_PREPROCESSOR(true)} smt)`],
|
|
295
|
+
[
|
|
296
|
+
"auflia",
|
|
297
|
+
`(and-then ${QUANT_PREPROCESSOR(false)} (or-else (and-then (fail-if (> num-exprs 128)) ` +
|
|
298
|
+
"(using-params smt :qi.cost 0) fail-if-undecided) smt))",
|
|
299
|
+
],
|
|
300
|
+
["ufnia", `(and-then ${QUANT_PREPROCESSOR(false)} qe-light smt)`],
|
|
301
|
+
["ufbv", UFBV],
|
|
302
|
+
["bv", UFBV],
|
|
303
|
+
["qfbv", QFBV],
|
|
304
|
+
["qfaufbv", QFAUFBV],
|
|
305
|
+
["qfauflia", QFAUFLIA],
|
|
306
|
+
["qfuf", QFUF],
|
|
307
|
+
["qffp", QFFP],
|
|
308
|
+
["qffpbv", QFFP],
|
|
309
|
+
["qffplra", QFFP],
|
|
310
|
+
["default", DEFAULT],
|
|
311
|
+
]);
|
|
312
|
+
|
|
313
|
+
const LOGIC_STRATEGIES = new Map([
|
|
314
|
+
["QF_UF", "qfuf"],
|
|
315
|
+
["QF_BV", "qfbv"],
|
|
316
|
+
["QF_IDL", "qfidl"],
|
|
317
|
+
["QF_LIA", "qflia"],
|
|
318
|
+
["QF_LRA", "qflra"],
|
|
319
|
+
["QF_NIA", "qfnia"],
|
|
320
|
+
["QF_NRA", "qfnra"],
|
|
321
|
+
["QF_NTA", "qfnra"],
|
|
322
|
+
["QF_AUFLIA", "qfauflia"],
|
|
323
|
+
["QF_AUFBV", "qfaufbv"],
|
|
324
|
+
["QF_ABV", "qfaufbv"],
|
|
325
|
+
["QF_UFBV", "qfufbv"],
|
|
326
|
+
["AUFLIA", "auflia"],
|
|
327
|
+
["AUFLIRA", "auflira"],
|
|
328
|
+
["AUFNIRA", "aufnira"],
|
|
329
|
+
["UFNIA", "ufnia"],
|
|
330
|
+
["UFLRA", "uflra"],
|
|
331
|
+
["LRA", "lra"],
|
|
332
|
+
["NRA", "nra"],
|
|
333
|
+
["LIA", "lia"],
|
|
334
|
+
["UFBV", "ufbv"],
|
|
335
|
+
["BV", "bv"],
|
|
336
|
+
["QF_FP", "qffp"],
|
|
337
|
+
["QF_FPBV", "qffpbv"],
|
|
338
|
+
["QF_BVFP", "qffpbv"],
|
|
339
|
+
["HORN", "horn"],
|
|
340
|
+
]);
|
|
341
|
+
|
|
342
|
+
export const getLogicStrategy = (logic: string | undefined, isProofsEnabled: boolean) =>
|
|
343
|
+
(logic === "QF_FD" || logic === "SAT") && !isProofsEnabled
|
|
344
|
+
? "qffd"
|
|
345
|
+
: (LOGIC_STRATEGIES.get(logic ?? "") ?? "default");
|
|
@@ -1,16 +1,11 @@
|
|
|
1
|
-
// Ported from Z3 (src/math/lp/bound_analyzer_on_row.h, src/math/lp/lp_bound_propagator.h,
|
|
2
|
-
// src/math/lp/implied_bound.h, and propagate_bounds_for_touched_rows in src/math/lp/lar_solver.h),
|
|
3
|
-
// MIT license, see z3-license.txt. Bounds that a row implies on its columns from the bounds of the
|
|
4
|
-
// others, and equalities between columns that rows with fixed columns imply.
|
|
5
1
|
import { Rational } from "../rational";
|
|
6
2
|
import { COLUMN_FIXED, COLUMN_FREE, COLUMN_LOWER, COLUMN_UPPER } from "./core-solver";
|
|
7
3
|
import { type ConstraintKind, KIND_GE, KIND_GT, KIND_LE, KIND_LT } from "./constraints";
|
|
8
|
-
import { Dependency, linearize } from "./dependency";
|
|
4
|
+
import { type Dependency, linearize } from "./dependency";
|
|
9
5
|
import { Explanation } from "./explanation";
|
|
10
6
|
import type { LarSolver } from "./lar-solver";
|
|
11
7
|
import type { RowCell } from "./static-matrix";
|
|
12
8
|
|
|
13
|
-
// The theory side of lp_bound_propagator.
|
|
14
9
|
interface BoundPropagatorHost {
|
|
15
10
|
columnIsInteresting(column: number): boolean;
|
|
16
11
|
boundIsInteresting(column: number, kind: ConstraintKind, value: Rational): boolean;
|
|
@@ -18,7 +13,6 @@ interface BoundPropagatorHost {
|
|
|
18
13
|
addEq(first: number, second: number, explanation: Explanation, isFixed: boolean): boolean;
|
|
19
14
|
}
|
|
20
15
|
|
|
21
|
-
// implied_bound: the explanation is a weighted list of the witnesses of the other columns.
|
|
22
16
|
const getBoundKind = (isLower: boolean, isStrict: boolean) => {
|
|
23
17
|
if (isLower) return isStrict ? KIND_GT : KIND_GE;
|
|
24
18
|
return isStrict ? KIND_LT : KIND_LE;
|
|
@@ -32,7 +26,6 @@ export interface ImpliedBound {
|
|
|
32
26
|
explain: () => [Rational, Dependency][];
|
|
33
27
|
}
|
|
34
28
|
|
|
35
|
-
// bound_kind: the kind of a lower or upper bound, strict or not.
|
|
36
29
|
export const getImpliedKind = (bound: ImpliedBound) => getBoundKind(bound.isLower, bound.isStrict);
|
|
37
30
|
|
|
38
31
|
export class BoundPropagator {
|
|
@@ -55,7 +48,6 @@ export class BoundPropagator {
|
|
|
55
48
|
this.ibounds = [];
|
|
56
49
|
}
|
|
57
50
|
|
|
58
|
-
// propagate_bounds_for_touched_rows.
|
|
59
51
|
propagateBoundsForTouchedRows() {
|
|
60
52
|
const solver = this.solver;
|
|
61
53
|
const settings = solver.settings;
|
|
@@ -80,8 +72,6 @@ export class BoundPropagator {
|
|
|
80
72
|
solver.touchedRows.clear();
|
|
81
73
|
}
|
|
82
74
|
|
|
83
|
-
// Bound analysis of a row whose sum is zero.
|
|
84
|
-
|
|
85
75
|
private analyzeRow(row: RowCell[]) {
|
|
86
76
|
const core = this.solver.core;
|
|
87
77
|
let columnOfU = -1;
|
|
@@ -123,7 +113,6 @@ export class BoundPropagator {
|
|
|
123
113
|
} else if (columnOfL === -1 && isSomeInteresting()) this.limitAllMonoids(row, false);
|
|
124
114
|
}
|
|
125
115
|
|
|
126
|
-
// The bound of a monoid a * x at its maximum, or its minimum, and whether it is strict.
|
|
127
116
|
private getMonoidBound(coeff: Rational, column: number, isMax: boolean) {
|
|
128
117
|
const solver = this.solver;
|
|
129
118
|
const isUpper = coeff.isPositive() === isMax;
|
|
@@ -131,7 +120,6 @@ export class BoundPropagator {
|
|
|
131
120
|
return { value: bound.x, isStrict: !bound.y.isZero() };
|
|
132
121
|
}
|
|
133
122
|
|
|
134
|
-
// limit_all_monoids_from_below (isFromBelow) and limit_all_monoids_from_above.
|
|
135
123
|
private limitAllMonoids(row: RowCell[], isFromBelow: boolean) {
|
|
136
124
|
let numStrict = 0;
|
|
137
125
|
let total = Rational.zero;
|
|
@@ -150,7 +138,6 @@ export class BoundPropagator {
|
|
|
150
138
|
}
|
|
151
139
|
}
|
|
152
140
|
|
|
153
|
-
// limit_monoid_u_from_below (isFromBelow) and limit_monoid_l_from_above.
|
|
154
141
|
private limitMonoidFromOne(row: RowCell[], target: number, isFromBelow: boolean) {
|
|
155
142
|
let bound = Rational.zero;
|
|
156
143
|
let targetCoeff = Rational.zero;
|
|
@@ -221,10 +208,7 @@ export class BoundPropagator {
|
|
|
221
208
|
}
|
|
222
209
|
}
|
|
223
210
|
|
|
224
|
-
|
|
225
|
-
|
|
226
|
-
// column_is_fixed: fixed, without an infinitesimal.
|
|
227
|
-
private isFixed(column: number) {
|
|
211
|
+
private columnIsFixed(column: number) {
|
|
228
212
|
const solver = this.solver;
|
|
229
213
|
return (
|
|
230
214
|
solver.core.getColumnType(column) === COLUMN_FIXED && solver.getLowerBound(column).y.isZero()
|
|
@@ -257,8 +241,7 @@ export class BoundPropagator {
|
|
|
257
241
|
second: number,
|
|
258
242
|
isFixed: boolean,
|
|
259
243
|
) {
|
|
260
|
-
|
|
261
|
-
if (!isAdded) return;
|
|
244
|
+
if (!this.host.addEq(first, second, explanation, isFixed)) return;
|
|
262
245
|
const stats = this.solver.settings.stats;
|
|
263
246
|
if (isFixed) stats.fixedEqs++;
|
|
264
247
|
else stats.offsetEqs++;
|
|
@@ -267,7 +250,7 @@ export class BoundPropagator {
|
|
|
267
250
|
private getOnlyOneNonFixed(rowIndex: number) {
|
|
268
251
|
let result = -1;
|
|
269
252
|
for (const cell of this.solver.getRow(rowIndex)) {
|
|
270
|
-
if (this.
|
|
253
|
+
if (this.columnIsFixed(cell.column)) continue;
|
|
271
254
|
if (result !== -1) return -1;
|
|
272
255
|
result = cell.column;
|
|
273
256
|
}
|
|
@@ -302,7 +285,7 @@ export class BoundPropagator {
|
|
|
302
285
|
|
|
303
286
|
private tryAddEquationWithLpFixedTables(rowIndex: number, column: number) {
|
|
304
287
|
const solver = this.solver;
|
|
305
|
-
if (this.
|
|
288
|
+
if (this.columnIsFixed(column)) return;
|
|
306
289
|
const value = solver.getValue(column);
|
|
307
290
|
const other = value.y.isZero()
|
|
308
291
|
? solver.findInFixedTables(value.x, solver.isInt(column))
|
|
@@ -322,17 +305,15 @@ export class BoundPropagator {
|
|
|
322
305
|
this.addEqOnColumns(explanation, other, column, true);
|
|
323
306
|
}
|
|
324
307
|
|
|
325
|
-
// extract_non_fixed: the basic column, the other non-fixed column and the sign of its unit
|
|
326
|
-
// coefficient, when the row has at most two non-fixed columns.
|
|
327
308
|
private extractNonFixed(rowIndex: number) {
|
|
328
309
|
const solver = this.solver;
|
|
329
310
|
const x = solver.core.basis[rowIndex];
|
|
330
|
-
if (this.
|
|
311
|
+
if (this.columnIsFixed(x)) return { count: 0, x, y: -1, ySign: 0 };
|
|
331
312
|
let count = 1;
|
|
332
313
|
let y = -1;
|
|
333
314
|
let ySign = 0;
|
|
334
315
|
for (const cell of solver.getRow(rowIndex)) {
|
|
335
|
-
if (cell.column === x || this.
|
|
316
|
+
if (cell.column === x || this.columnIsFixed(cell.column)) continue;
|
|
336
317
|
if (++count > 2) return { count, x, y, ySign };
|
|
337
318
|
y = cell.column;
|
|
338
319
|
ySign = cell.coeff.equals(Rational.one) ? 1 : cell.coeff.equals(Rational.minusOne) ? -1 : 0;
|
|
@@ -1,17 +1,12 @@
|
|
|
1
|
-
|
|
2
|
-
// that the theory asserts on columns, each with a leaf dependency on its own index, and the set of
|
|
3
|
-
// active ones, both undone by pop.
|
|
4
|
-
import { Dependency, mkLeaf } from "./dependency";
|
|
1
|
+
import { type Dependency, mkLeaf } from "./dependency";
|
|
5
2
|
import { Impq } from "./numeric-pair";
|
|
6
3
|
import { shrink } from "../array";
|
|
7
4
|
|
|
8
|
-
// lconstraint_kind: flipping negates the kind, and halving a non-strict kind gives the strict one.
|
|
9
5
|
export const KIND_LE = -2;
|
|
10
6
|
export const KIND_LT = -1;
|
|
11
7
|
export const KIND_EQ = 0;
|
|
12
8
|
export const KIND_GT = 1;
|
|
13
9
|
export const KIND_GE = 2;
|
|
14
|
-
// NE: a kind of nla's inequalities, never of a bound the theory asserts.
|
|
15
10
|
export const KIND_NE = 3;
|
|
16
11
|
|
|
17
12
|
export type ConstraintKind =
|
|
@@ -27,7 +22,6 @@ export interface LarConstraint {
|
|
|
27
22
|
readonly rhs: Impq;
|
|
28
23
|
readonly dep: Dependency;
|
|
29
24
|
isActive: boolean;
|
|
30
|
-
// Made for the atom of an nla lemma.
|
|
31
25
|
readonly isAuxiliary: boolean;
|
|
32
26
|
}
|
|
33
27
|
|
|
@@ -40,7 +34,6 @@ export class ConstraintSet {
|
|
|
40
34
|
readonly constraints: LarConstraint[] = [];
|
|
41
35
|
private active: number[] = [];
|
|
42
36
|
private scopes: ConstraintScope[] = [];
|
|
43
|
-
// m_is_auxiliary_mode: whether new constraints are auxiliary.
|
|
44
37
|
isAuxiliaryMode = false;
|
|
45
38
|
|
|
46
39
|
add(column: number, kind: ConstraintKind, rhs: Impq) {
|