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,600 @@
|
|
|
1
|
+
import {
|
|
2
|
+
type AstManager,
|
|
3
|
+
OP_ADD,
|
|
4
|
+
OP_DIV,
|
|
5
|
+
OP_EQ,
|
|
6
|
+
OP_GE,
|
|
7
|
+
OP_IDIV,
|
|
8
|
+
OP_LE,
|
|
9
|
+
OP_MOD,
|
|
10
|
+
OP_MUL,
|
|
11
|
+
OP_NOT,
|
|
12
|
+
OP_SUB,
|
|
13
|
+
OP_TO_REAL,
|
|
14
|
+
SORT_BOOL,
|
|
15
|
+
SORT_INT,
|
|
16
|
+
} from "./ast";
|
|
17
|
+
import type { Goal } from "./goal";
|
|
18
|
+
import {
|
|
19
|
+
add,
|
|
20
|
+
type DepInterval,
|
|
21
|
+
div,
|
|
22
|
+
intersect,
|
|
23
|
+
mkDepInterval,
|
|
24
|
+
mul,
|
|
25
|
+
set,
|
|
26
|
+
setValue,
|
|
27
|
+
} from "./lp/dep-intervals";
|
|
28
|
+
import { Rational } from "./rational";
|
|
29
|
+
import { RefVector } from "./ref-vector";
|
|
30
|
+
import { Rewriter, TACTIC_REWRITER_OPTIONS } from "./rewriter";
|
|
31
|
+
import { RewriterTpl } from "./rewriter-tpl";
|
|
32
|
+
|
|
33
|
+
interface Bound {
|
|
34
|
+
value: Rational;
|
|
35
|
+
isStrict: boolean;
|
|
36
|
+
}
|
|
37
|
+
|
|
38
|
+
// bound_simplifier never adds a linear equation to its bound_propagator, so the propagator only
|
|
39
|
+
// keeps the asserted bounds and its propagate has nothing to do.
|
|
40
|
+
class BoundPropagator {
|
|
41
|
+
private isInts: boolean[] = [];
|
|
42
|
+
readonly lowers: (Bound | undefined)[] = [];
|
|
43
|
+
readonly uppers: (Bound | undefined)[] = [];
|
|
44
|
+
|
|
45
|
+
mkVar(variable: number, isInt: boolean) {
|
|
46
|
+
this.isInts[variable] = isInt;
|
|
47
|
+
this.lowers[variable] = undefined;
|
|
48
|
+
this.uppers[variable] = undefined;
|
|
49
|
+
}
|
|
50
|
+
|
|
51
|
+
assertLower(variable: number, value: Rational, isStrict: boolean) {
|
|
52
|
+
const bound = this.isInts[variable]
|
|
53
|
+
? {
|
|
54
|
+
value: value.isInt() ? (isStrict ? value.add(Rational.one) : value) : value.ceil(),
|
|
55
|
+
isStrict: false,
|
|
56
|
+
}
|
|
57
|
+
: { value, isStrict };
|
|
58
|
+
const old = this.lowers[variable];
|
|
59
|
+
if (
|
|
60
|
+
old !== undefined &&
|
|
61
|
+
!(
|
|
62
|
+
bound.value.compare(old.value) > 0 ||
|
|
63
|
+
(!old.isStrict && bound.isStrict && bound.value.equals(old.value))
|
|
64
|
+
)
|
|
65
|
+
)
|
|
66
|
+
return;
|
|
67
|
+
this.lowers[variable] = bound;
|
|
68
|
+
}
|
|
69
|
+
|
|
70
|
+
assertUpper(variable: number, value: Rational, isStrict: boolean) {
|
|
71
|
+
const bound = this.isInts[variable]
|
|
72
|
+
? {
|
|
73
|
+
value: value.isInt() ? (isStrict ? value.sub(Rational.one) : value) : value.floor(),
|
|
74
|
+
isStrict: false,
|
|
75
|
+
}
|
|
76
|
+
: { value, isStrict };
|
|
77
|
+
const old = this.uppers[variable];
|
|
78
|
+
if (
|
|
79
|
+
old !== undefined &&
|
|
80
|
+
!(
|
|
81
|
+
bound.value.compare(old.value) < 0 ||
|
|
82
|
+
(!old.isStrict && bound.isStrict && bound.value.equals(old.value))
|
|
83
|
+
)
|
|
84
|
+
)
|
|
85
|
+
return;
|
|
86
|
+
this.uppers[variable] = bound;
|
|
87
|
+
}
|
|
88
|
+
|
|
89
|
+
getBound(isLower: boolean, coeffs: Rational[], variables: number[]): Bound | undefined {
|
|
90
|
+
let value = Rational.zero;
|
|
91
|
+
let isStrict = false;
|
|
92
|
+
for (const [index, coeff] of coeffs.entries()) {
|
|
93
|
+
if (coeff.isZero()) continue;
|
|
94
|
+
const bound =
|
|
95
|
+
coeff.isNegative() === isLower
|
|
96
|
+
? this.uppers[variables[index]]
|
|
97
|
+
: this.lowers[variables[index]];
|
|
98
|
+
if (bound === undefined) return undefined;
|
|
99
|
+
if (bound.isStrict) isStrict = true;
|
|
100
|
+
value = value.add(coeff.mul(bound.value));
|
|
101
|
+
}
|
|
102
|
+
return { value, isStrict };
|
|
103
|
+
}
|
|
104
|
+
|
|
105
|
+
reset() {
|
|
106
|
+
this.isInts = [];
|
|
107
|
+
this.lowers.length = 0;
|
|
108
|
+
this.uppers.length = 0;
|
|
109
|
+
}
|
|
110
|
+
}
|
|
111
|
+
|
|
112
|
+
class BoundRewriter extends RewriterTpl {
|
|
113
|
+
constructor(
|
|
114
|
+
manager: AstManager,
|
|
115
|
+
private simplifier: BoundSimplifier,
|
|
116
|
+
) {
|
|
117
|
+
super(manager);
|
|
118
|
+
}
|
|
119
|
+
|
|
120
|
+
reduceApp(decl: number, args: number[], sort: number) {
|
|
121
|
+
return this.simplifier.reduceApp(decl, args, sort);
|
|
122
|
+
}
|
|
123
|
+
}
|
|
124
|
+
|
|
125
|
+
class BoundSimplifier {
|
|
126
|
+
private propagator = new BoundPropagator();
|
|
127
|
+
private rewriter: Rewriter;
|
|
128
|
+
private var2expr: number[] = [];
|
|
129
|
+
private expr2var = new Map<number, number>();
|
|
130
|
+
private trail: RefVector;
|
|
131
|
+
|
|
132
|
+
constructor(
|
|
133
|
+
private manager: AstManager,
|
|
134
|
+
private goal: Goal,
|
|
135
|
+
) {
|
|
136
|
+
this.rewriter = new Rewriter(manager, TACTIC_REWRITER_OPTIONS);
|
|
137
|
+
this.trail = new RefVector(manager);
|
|
138
|
+
}
|
|
139
|
+
|
|
140
|
+
private getNumeral(expr: number) {
|
|
141
|
+
return this.manager.isNumeral(expr) ? this.manager.getRationalValue(expr) : undefined;
|
|
142
|
+
}
|
|
143
|
+
|
|
144
|
+
private isVar(expr: number) {
|
|
145
|
+
return this.expr2var.has(expr);
|
|
146
|
+
}
|
|
147
|
+
|
|
148
|
+
private toVar(expr: number) {
|
|
149
|
+
const manager = this.manager;
|
|
150
|
+
const existing = this.expr2var.get(expr);
|
|
151
|
+
if (existing !== undefined) return existing;
|
|
152
|
+
const variable = this.var2expr.length;
|
|
153
|
+
const core = manager.getOp(expr) === OP_TO_REAL ? manager.getArg(expr, 0) : expr;
|
|
154
|
+
this.propagator.mkVar(variable, manager.sorts[core] === SORT_INT);
|
|
155
|
+
this.expr2var.set(expr, variable);
|
|
156
|
+
if (core !== expr) this.expr2var.set(core, variable);
|
|
157
|
+
this.var2expr.push(core);
|
|
158
|
+
this.trail.push(expr);
|
|
159
|
+
return variable;
|
|
160
|
+
}
|
|
161
|
+
|
|
162
|
+
private getBinary(expr: number, op: number) {
|
|
163
|
+
const manager = this.manager;
|
|
164
|
+
return manager.getOp(expr) === op && manager.getNumArgs(expr) === 2
|
|
165
|
+
? manager.getArgs(expr)
|
|
166
|
+
: undefined;
|
|
167
|
+
}
|
|
168
|
+
|
|
169
|
+
private getBounds(expr: number): DepInterval {
|
|
170
|
+
const manager = this.manager;
|
|
171
|
+
const interval = mkDepInterval();
|
|
172
|
+
const value = this.getNumeral(expr);
|
|
173
|
+
if (value !== undefined) {
|
|
174
|
+
setValue(interval, value);
|
|
175
|
+
return interval;
|
|
176
|
+
}
|
|
177
|
+
if (this.isVar(expr)) {
|
|
178
|
+
const variable = this.toVar(expr);
|
|
179
|
+
const upper = this.propagator.uppers[variable];
|
|
180
|
+
if (upper !== undefined) {
|
|
181
|
+
interval.upper = upper.value;
|
|
182
|
+
interval.isUpperInf = false;
|
|
183
|
+
interval.isUpperOpen = upper.isStrict;
|
|
184
|
+
}
|
|
185
|
+
const lower = this.propagator.lowers[variable];
|
|
186
|
+
if (lower !== undefined) {
|
|
187
|
+
interval.lower = lower.value;
|
|
188
|
+
interval.isLowerInf = false;
|
|
189
|
+
interval.isLowerOpen = lower.isStrict;
|
|
190
|
+
}
|
|
191
|
+
}
|
|
192
|
+
const op = manager.getOp(expr);
|
|
193
|
+
if (op === OP_ADD) {
|
|
194
|
+
const sum = mkDepInterval();
|
|
195
|
+
setValue(sum, Rational.zero);
|
|
196
|
+
for (const arg of manager.getArgs(expr)) {
|
|
197
|
+
const result = mkDepInterval();
|
|
198
|
+
add(sum, this.getBounds(arg), result, "without-deps");
|
|
199
|
+
set(sum, result, "without-deps");
|
|
200
|
+
}
|
|
201
|
+
intersect(interval, sum, interval, "without-deps");
|
|
202
|
+
}
|
|
203
|
+
if (op === OP_MUL) {
|
|
204
|
+
const product = mkDepInterval();
|
|
205
|
+
setValue(product, Rational.one);
|
|
206
|
+
for (const arg of manager.getArgs(expr)) {
|
|
207
|
+
const result = mkDepInterval();
|
|
208
|
+
mul(product, this.getBounds(arg), result, "without-deps");
|
|
209
|
+
set(product, result, "without-deps");
|
|
210
|
+
}
|
|
211
|
+
intersect(interval, product, interval, "without-deps");
|
|
212
|
+
}
|
|
213
|
+
const modArgs = this.getBinary(expr, OP_MOD);
|
|
214
|
+
const modulus = modArgs === undefined ? undefined : this.getNumeral(modArgs[1]);
|
|
215
|
+
if (modulus !== undefined && modulus.isPositive()) {
|
|
216
|
+
const range = mkDepInterval();
|
|
217
|
+
range.isLowerInf = false;
|
|
218
|
+
range.isLowerOpen = false;
|
|
219
|
+
range.lower = Rational.zero;
|
|
220
|
+
range.isUpperInf = false;
|
|
221
|
+
range.isUpperOpen = false;
|
|
222
|
+
range.upper = modulus.sub(Rational.one);
|
|
223
|
+
intersect(interval, range, interval, "without-deps");
|
|
224
|
+
}
|
|
225
|
+
const mulArgs = this.getBinary(expr, OP_MUL);
|
|
226
|
+
const mulDivArgs = mulArgs === undefined ? undefined : this.getBinary(mulArgs[1], OP_IDIV);
|
|
227
|
+
if (mulArgs !== undefined && mulDivArgs !== undefined && mulDivArgs[1] === mulArgs[0]) {
|
|
228
|
+
const divisor = this.getBounds(mulArgs[0]);
|
|
229
|
+
const dividend = this.getBounds(mulDivArgs[0]);
|
|
230
|
+
if (
|
|
231
|
+
!divisor.isLowerInf &&
|
|
232
|
+
divisor.lower.isPositive() &&
|
|
233
|
+
!dividend.isUpperInf &&
|
|
234
|
+
!dividend.upper.isNegative()
|
|
235
|
+
) {
|
|
236
|
+
const range = mkDepInterval();
|
|
237
|
+
range.isUpperInf = false;
|
|
238
|
+
range.isUpperOpen = dividend.isUpperOpen;
|
|
239
|
+
range.upper = dividend.upper;
|
|
240
|
+
intersect(interval, range, interval, "without-deps");
|
|
241
|
+
}
|
|
242
|
+
}
|
|
243
|
+
const idivArgs = this.getBinary(expr, OP_IDIV);
|
|
244
|
+
if (idivArgs !== undefined) {
|
|
245
|
+
const dividend = this.getBounds(idivArgs[0]);
|
|
246
|
+
const divisor = this.getBounds(idivArgs[1]);
|
|
247
|
+
if (
|
|
248
|
+
!divisor.isLowerInf &&
|
|
249
|
+
divisor.lower.isPositive() &&
|
|
250
|
+
!dividend.isUpperInf &&
|
|
251
|
+
!dividend.upper.isNegative()
|
|
252
|
+
) {
|
|
253
|
+
const range = mkDepInterval();
|
|
254
|
+
range.isUpperInf = false;
|
|
255
|
+
range.isUpperOpen = dividend.isUpperOpen;
|
|
256
|
+
range.upper = dividend.upper;
|
|
257
|
+
range.isLowerInf = false;
|
|
258
|
+
range.isLowerOpen = false;
|
|
259
|
+
range.lower = Rational.zero;
|
|
260
|
+
intersect(interval, range, interval, "without-deps");
|
|
261
|
+
}
|
|
262
|
+
}
|
|
263
|
+
const divArgs = this.getBinary(expr, OP_DIV);
|
|
264
|
+
if (divArgs !== undefined) {
|
|
265
|
+
const quotient = mkDepInterval();
|
|
266
|
+
div(this.getBounds(divArgs[0]), this.getBounds(divArgs[1]), quotient, "without-deps");
|
|
267
|
+
intersect(interval, quotient, interval, "without-deps");
|
|
268
|
+
}
|
|
269
|
+
return interval;
|
|
270
|
+
}
|
|
271
|
+
|
|
272
|
+
private getLower(expr: number): Bound | undefined {
|
|
273
|
+
const interval = this.getBounds(expr);
|
|
274
|
+
return interval.isLowerInf
|
|
275
|
+
? undefined
|
|
276
|
+
: { value: interval.lower, isStrict: interval.isLowerOpen };
|
|
277
|
+
}
|
|
278
|
+
|
|
279
|
+
private getUpper(expr: number): Bound | undefined {
|
|
280
|
+
const interval = this.getBounds(expr);
|
|
281
|
+
return interval.isUpperInf
|
|
282
|
+
? undefined
|
|
283
|
+
: { value: interval.upper, isStrict: interval.isUpperOpen };
|
|
284
|
+
}
|
|
285
|
+
|
|
286
|
+
private assertLower(expr: number, value: Rational, isStrict: boolean) {
|
|
287
|
+
this.propagator.assertLower(this.toVar(expr), value, isStrict);
|
|
288
|
+
}
|
|
289
|
+
|
|
290
|
+
private assertUpper(expr: number, value: Rational, isStrict: boolean) {
|
|
291
|
+
this.propagator.assertUpper(this.toVar(expr), value, isStrict);
|
|
292
|
+
}
|
|
293
|
+
|
|
294
|
+
private mkInt(value: Rational) {
|
|
295
|
+
return this.manager.mkNumeralOfSort(value, SORT_INT);
|
|
296
|
+
}
|
|
297
|
+
|
|
298
|
+
// The result comes with a reference, and -1 is BR_FAILED.
|
|
299
|
+
reduceApp(decl: number, args: number[], sort: number): number {
|
|
300
|
+
const manager = this.manager;
|
|
301
|
+
const op = manager.funcDecls[decl].op;
|
|
302
|
+
const modulus = op === OP_MOD && args.length === 2 ? this.getNumeral(args[1]) : undefined;
|
|
303
|
+
if (modulus !== undefined) {
|
|
304
|
+
const interval = this.getBounds(args[0]);
|
|
305
|
+
if (interval.isUpperInf || interval.isLowerInf) return -1;
|
|
306
|
+
if (interval.isUpperOpen || interval.isLowerOpen) return -1;
|
|
307
|
+
if (interval.upper.sub(interval.lower).compare(modulus) >= 0) return -1;
|
|
308
|
+
if (modulus.compare(interval.upper) > 0 && !interval.lower.isNegative()) {
|
|
309
|
+
manager.incRef(args[0]);
|
|
310
|
+
return args[0];
|
|
311
|
+
}
|
|
312
|
+
if (
|
|
313
|
+
modulus.add(modulus).compare(interval.upper) > 0 &&
|
|
314
|
+
interval.lower.compare(modulus) >= 0
|
|
315
|
+
) {
|
|
316
|
+
const difference = manager.mkApp(OP_SUB, [args[0], this.mkInt(modulus)], SORT_INT);
|
|
317
|
+
manager.incRef(difference);
|
|
318
|
+
const result = this.rewriter.rewrite(difference);
|
|
319
|
+
manager.decRef(difference);
|
|
320
|
+
return result;
|
|
321
|
+
}
|
|
322
|
+
}
|
|
323
|
+
let isChanged = false;
|
|
324
|
+
const newArgs = args.map((arg) => {
|
|
325
|
+
const reduced = this.reduceArg(arg);
|
|
326
|
+
if (reduced !== arg) isChanged = true;
|
|
327
|
+
return reduced;
|
|
328
|
+
});
|
|
329
|
+
if (!isChanged) return -1;
|
|
330
|
+
const result = manager.mkApp(decl, newArgs, sort);
|
|
331
|
+
manager.incRef(result);
|
|
332
|
+
return result;
|
|
333
|
+
}
|
|
334
|
+
|
|
335
|
+
private reduceArg(arg: number) {
|
|
336
|
+
const manager = this.manager;
|
|
337
|
+
const op = manager.getOp(arg);
|
|
338
|
+
if ((op !== OP_LE && op !== OP_GE) || manager.getNumArgs(arg) !== 2) return arg;
|
|
339
|
+
const [first, second] = manager.getArgs(arg);
|
|
340
|
+
const firstValue = this.getNumeral(first);
|
|
341
|
+
const secondValue = this.getNumeral(second);
|
|
342
|
+
if (op === OP_LE && secondValue !== undefined)
|
|
343
|
+
return this.reduceBound(first, secondValue, true) ?? arg;
|
|
344
|
+
if (op === OP_GE && firstValue !== undefined)
|
|
345
|
+
return this.reduceBound(second, firstValue, true) ?? arg;
|
|
346
|
+
if (op === OP_LE && firstValue !== undefined)
|
|
347
|
+
return this.reduceBound(second, firstValue, false) ?? arg;
|
|
348
|
+
if (op === OP_GE && secondValue !== undefined)
|
|
349
|
+
return this.reduceBound(first, secondValue, false) ?? arg;
|
|
350
|
+
return arg;
|
|
351
|
+
}
|
|
352
|
+
|
|
353
|
+
// x <= n when isUpper, and x >= n otherwise.
|
|
354
|
+
private reduceBound(expr: number, value: Rational, isUpper: boolean) {
|
|
355
|
+
const manager = this.manager;
|
|
356
|
+
if (isUpper) {
|
|
357
|
+
const upper = this.getUpper(expr);
|
|
358
|
+
if (upper !== undefined && !upper.isStrict && value.compare(upper.value) >= 0)
|
|
359
|
+
return manager.trueExpr;
|
|
360
|
+
const lower = this.getLower(expr);
|
|
361
|
+
if (lower !== undefined && !lower.isStrict && value.compare(lower.value) < 0)
|
|
362
|
+
return manager.falseExpr;
|
|
363
|
+
return undefined;
|
|
364
|
+
}
|
|
365
|
+
const lower = this.getLower(expr);
|
|
366
|
+
if (lower !== undefined && !lower.isStrict && value.compare(lower.value) <= 0)
|
|
367
|
+
return manager.trueExpr;
|
|
368
|
+
const upper = this.getUpper(expr);
|
|
369
|
+
if (upper !== undefined && !upper.isStrict && value.compare(upper.value) > 0)
|
|
370
|
+
return manager.falseExpr;
|
|
371
|
+
return undefined;
|
|
372
|
+
}
|
|
373
|
+
|
|
374
|
+
reduce() {
|
|
375
|
+
const goal = this.goal;
|
|
376
|
+
let isUpdated = true;
|
|
377
|
+
for (let round = 0; round < 5 && isUpdated; round++) {
|
|
378
|
+
isUpdated = false;
|
|
379
|
+
let isBoundFound = false;
|
|
380
|
+
this.reset();
|
|
381
|
+
const size = goal.forms.size;
|
|
382
|
+
for (let index = 0; index < size && !goal.isInconsistent; index++)
|
|
383
|
+
if (this.insertBound(goal.forms.items[index])) {
|
|
384
|
+
goal.update(index, this.manager.trueExpr);
|
|
385
|
+
isBoundFound = true;
|
|
386
|
+
}
|
|
387
|
+
if (!isBoundFound) break;
|
|
388
|
+
for (let index = 0; index < size && !goal.isInconsistent; index++)
|
|
389
|
+
this.tightenBound(goal.forms.items[index]);
|
|
390
|
+
const rewriter = new BoundRewriter(this.manager, this);
|
|
391
|
+
for (let index = 0; index < size && !goal.isInconsistent; index++) {
|
|
392
|
+
const form = goal.forms.items[index];
|
|
393
|
+
const result = rewriter.rewrite(form);
|
|
394
|
+
if (result !== form) {
|
|
395
|
+
goal.update(index, result);
|
|
396
|
+
isUpdated = true;
|
|
397
|
+
}
|
|
398
|
+
this.manager.decRef(result);
|
|
399
|
+
}
|
|
400
|
+
rewriter.release();
|
|
401
|
+
this.restoreBounds();
|
|
402
|
+
}
|
|
403
|
+
}
|
|
404
|
+
|
|
405
|
+
private insertBound(form: number) {
|
|
406
|
+
const manager = this.manager;
|
|
407
|
+
const op = manager.getOp(form);
|
|
408
|
+
if (op === OP_EQ) {
|
|
409
|
+
const [first, second] = manager.getArgs(form);
|
|
410
|
+
const isSwapped = this.getNumeral(second) !== undefined;
|
|
411
|
+
const value = this.getNumeral(isSwapped ? second : first);
|
|
412
|
+
if (value === undefined) return false;
|
|
413
|
+
const other = isSwapped ? first : second;
|
|
414
|
+
this.assertLower(other, value, false);
|
|
415
|
+
this.assertUpper(other, value, false);
|
|
416
|
+
return true;
|
|
417
|
+
}
|
|
418
|
+
if (op === OP_LE || op === OP_GE) return this.insertInequality(form, op, false);
|
|
419
|
+
if (op === OP_NOT) {
|
|
420
|
+
const atom = manager.getArg(form, 0);
|
|
421
|
+
const atomOp = manager.getOp(atom);
|
|
422
|
+
if (atomOp === OP_LE || atomOp === OP_GE) return this.insertInequality(atom, atomOp, true);
|
|
423
|
+
}
|
|
424
|
+
return false;
|
|
425
|
+
}
|
|
426
|
+
|
|
427
|
+
private insertInequality(atom: number, op: number, isNegated: boolean) {
|
|
428
|
+
const [first, second] = this.manager.getArgs(atom);
|
|
429
|
+
const firstValue = this.getNumeral(first);
|
|
430
|
+
const secondValue = this.getNumeral(second);
|
|
431
|
+
const isLowerOfSecond = (op === OP_LE) !== isNegated;
|
|
432
|
+
if (firstValue !== undefined) {
|
|
433
|
+
if (isLowerOfSecond) this.assertLower(second, firstValue, isNegated);
|
|
434
|
+
else this.assertUpper(second, firstValue, isNegated);
|
|
435
|
+
return true;
|
|
436
|
+
}
|
|
437
|
+
if (secondValue !== undefined) {
|
|
438
|
+
if (isLowerOfSecond) this.assertUpper(first, secondValue, isNegated);
|
|
439
|
+
else this.assertLower(first, secondValue, isNegated);
|
|
440
|
+
return true;
|
|
441
|
+
}
|
|
442
|
+
return false;
|
|
443
|
+
}
|
|
444
|
+
|
|
445
|
+
private getOffset(expr: number, variable: number) {
|
|
446
|
+
const args = this.getBinary(expr, OP_ADD);
|
|
447
|
+
if (args === undefined) return undefined;
|
|
448
|
+
const [first, second] = args[0] === variable ? args : [args[1], args[0]];
|
|
449
|
+
return first === variable ? this.getNumeral(second) : undefined;
|
|
450
|
+
}
|
|
451
|
+
|
|
452
|
+
private tightenBound(form: number) {
|
|
453
|
+
const manager = this.manager;
|
|
454
|
+
const le = this.getBinary(form, OP_LE);
|
|
455
|
+
if (le !== undefined) {
|
|
456
|
+
const [variable, modExpr] = le;
|
|
457
|
+
const modArgs = this.getBinary(modExpr, OP_MOD);
|
|
458
|
+
const modulus = modArgs === undefined ? undefined : this.getNumeral(modArgs[1]);
|
|
459
|
+
if (modArgs !== undefined && modulus !== undefined) {
|
|
460
|
+
const lower = this.getLower(variable);
|
|
461
|
+
const offset = this.getOffset(modArgs[0], variable);
|
|
462
|
+
if (
|
|
463
|
+
lower !== undefined &&
|
|
464
|
+
!lower.value.isNegative() &&
|
|
465
|
+
offset !== undefined &&
|
|
466
|
+
offset.isPositive() &&
|
|
467
|
+
offset.compare(modulus) < 0
|
|
468
|
+
)
|
|
469
|
+
this.assertUpper(variable, modulus.sub(offset), true);
|
|
470
|
+
if (modulus.isPositive()) {
|
|
471
|
+
this.assertUpper(variable, modulus, true);
|
|
472
|
+
const sum = this.getBinary(modArgs[0], OP_ADD);
|
|
473
|
+
const variableLower = this.getLower(variable);
|
|
474
|
+
if (
|
|
475
|
+
variableLower !== undefined &&
|
|
476
|
+
!variableLower.value.isNegative() &&
|
|
477
|
+
sum !== undefined
|
|
478
|
+
) {
|
|
479
|
+
const [first, second] = sum;
|
|
480
|
+
const firstUpper = first === variable ? this.getUpper(second) : undefined;
|
|
481
|
+
if (firstUpper !== undefined && firstUpper.value.compare(modulus) < 0)
|
|
482
|
+
this.assertUpper(modArgs[0], modulus, true);
|
|
483
|
+
const secondUpper = second === variable ? this.getUpper(first) : undefined;
|
|
484
|
+
if (secondUpper !== undefined && secondUpper.value.compare(modulus) < 0)
|
|
485
|
+
this.assertUpper(modArgs[0], modulus, true);
|
|
486
|
+
}
|
|
487
|
+
}
|
|
488
|
+
}
|
|
489
|
+
}
|
|
490
|
+
if (!manager.isNot(form)) return;
|
|
491
|
+
const eq = this.getBinary(manager.getArg(form, 0), OP_EQ);
|
|
492
|
+
if (eq === undefined) return;
|
|
493
|
+
const [variable, valueExpr] = this.getNumeral(eq[0]) !== undefined ? [eq[1], eq[0]] : eq;
|
|
494
|
+
const value = this.getNumeral(valueExpr);
|
|
495
|
+
if (value === undefined) return;
|
|
496
|
+
const interval = this.getBounds(variable);
|
|
497
|
+
if (!interval.isLowerInf && !interval.isLowerOpen && interval.lower.equals(value))
|
|
498
|
+
this.assertLower(variable, value, true);
|
|
499
|
+
else if (!interval.isUpperInf && !interval.isUpperOpen && interval.upper.equals(value))
|
|
500
|
+
this.assertUpper(variable, value, true);
|
|
501
|
+
}
|
|
502
|
+
|
|
503
|
+
private getLinearPolynomial(expr: number) {
|
|
504
|
+
const manager = this.manager;
|
|
505
|
+
const coeffs: Rational[] = [];
|
|
506
|
+
const variables: number[] = [];
|
|
507
|
+
const monomials = manager.getOp(expr) === OP_ADD ? manager.getArgs(expr) : [expr];
|
|
508
|
+
for (const monomial of monomials) {
|
|
509
|
+
const args = this.getBinary(monomial, OP_MUL);
|
|
510
|
+
const coeff = args === undefined ? undefined : this.getNumeral(args[0]);
|
|
511
|
+
if (args !== undefined && coeff !== undefined) {
|
|
512
|
+
coeffs.push(coeff);
|
|
513
|
+
variables.push(this.toVar(args[1]));
|
|
514
|
+
} else {
|
|
515
|
+
coeffs.push(Rational.one);
|
|
516
|
+
variables.push(this.toVar(monomial));
|
|
517
|
+
}
|
|
518
|
+
}
|
|
519
|
+
return { coeffs, variables };
|
|
520
|
+
}
|
|
521
|
+
|
|
522
|
+
private isSubsumed(expr: number, bound: Bound, isLower: boolean) {
|
|
523
|
+
if (this.manager.getOp(expr) !== OP_ADD) return false;
|
|
524
|
+
const polynomial = this.getLinearPolynomial(expr);
|
|
525
|
+
const implied = this.propagator.getBound(isLower, polynomial.coeffs, polynomial.variables);
|
|
526
|
+
if (implied === undefined) return false;
|
|
527
|
+
const order = implied.value.compare(bound.value);
|
|
528
|
+
return (
|
|
529
|
+
(isLower ? order > 0 : order < 0) || (order === 0 && (!bound.isStrict || implied.isStrict))
|
|
530
|
+
);
|
|
531
|
+
}
|
|
532
|
+
|
|
533
|
+
private restoreBounds() {
|
|
534
|
+
const manager = this.manager;
|
|
535
|
+
const goal = this.goal;
|
|
536
|
+
const rewriter = new BoundRewriter(manager, this);
|
|
537
|
+
const addBound = (form: number) => {
|
|
538
|
+
manager.incRef(form);
|
|
539
|
+
const reduced = rewriter.rewrite(form);
|
|
540
|
+
manager.decRef(form);
|
|
541
|
+
const simplified = this.rewriter.rewrite(reduced);
|
|
542
|
+
manager.decRef(reduced);
|
|
543
|
+
goal.assert(simplified);
|
|
544
|
+
manager.decRef(simplified);
|
|
545
|
+
};
|
|
546
|
+
const mkNumeral = (expr: number, value: Rational) =>
|
|
547
|
+
manager.mkNumeralOfSort(value, manager.sorts[expr]);
|
|
548
|
+
const size = this.var2expr.length;
|
|
549
|
+
for (let variable = 0; variable < size; variable++) {
|
|
550
|
+
const expr = this.var2expr[variable];
|
|
551
|
+
const lower = this.propagator.lowers[variable];
|
|
552
|
+
const upper = this.propagator.uppers[variable];
|
|
553
|
+
if (lower === undefined && upper === undefined) continue;
|
|
554
|
+
if (
|
|
555
|
+
lower !== undefined &&
|
|
556
|
+
upper !== undefined &&
|
|
557
|
+
lower.value.equals(upper.value) &&
|
|
558
|
+
!lower.isStrict &&
|
|
559
|
+
!upper.isStrict
|
|
560
|
+
) {
|
|
561
|
+
addBound(manager.mkEq(expr, mkNumeral(expr, lower.value)));
|
|
562
|
+
continue;
|
|
563
|
+
}
|
|
564
|
+
if (lower !== undefined && !this.isSubsumed(expr, lower, true)) {
|
|
565
|
+
const atom = (op: number) =>
|
|
566
|
+
manager.mkApp(op, [expr, mkNumeral(expr, lower.value)], SORT_BOOL);
|
|
567
|
+
addBound(lower.isStrict ? manager.mkApp(OP_NOT, [atom(OP_LE)], SORT_BOOL) : atom(OP_GE));
|
|
568
|
+
}
|
|
569
|
+
if (upper !== undefined && !this.isSubsumed(expr, upper, false)) {
|
|
570
|
+
const atom = (op: number) =>
|
|
571
|
+
manager.mkApp(op, [expr, mkNumeral(expr, upper.value)], SORT_BOOL);
|
|
572
|
+
addBound(upper.isStrict ? manager.mkApp(OP_NOT, [atom(OP_GE)], SORT_BOOL) : atom(OP_LE));
|
|
573
|
+
}
|
|
574
|
+
}
|
|
575
|
+
rewriter.release();
|
|
576
|
+
}
|
|
577
|
+
|
|
578
|
+
private reset() {
|
|
579
|
+
this.propagator.reset();
|
|
580
|
+
this.var2expr = [];
|
|
581
|
+
this.expr2var.clear();
|
|
582
|
+
this.trail.reset();
|
|
583
|
+
}
|
|
584
|
+
|
|
585
|
+
release() {
|
|
586
|
+
this.trail.reset();
|
|
587
|
+
this.rewriter.release();
|
|
588
|
+
}
|
|
589
|
+
}
|
|
590
|
+
|
|
591
|
+
export const propagateIneqs = (manager: AstManager, goal: Goal) => {
|
|
592
|
+
if (!goal.isProofsEnabled) {
|
|
593
|
+
const simplifier = new BoundSimplifier(manager, goal);
|
|
594
|
+
simplifier.reduce();
|
|
595
|
+
simplifier.release();
|
|
596
|
+
}
|
|
597
|
+
goal.elimTrue();
|
|
598
|
+
goal.elimRedundancies();
|
|
599
|
+
goal.depth++;
|
|
600
|
+
};
|