tla-ts 0.0.10-dev.f16792fed → 0.0.10-dev.fdc173479
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +2 -1
- package/dist/compile.cjs +6 -6
- package/dist/compile.js +10 -10
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +41 -37
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +21 -4
- package/dist/index.d.ts +21 -4
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +2681 -425
- package/dist/prove.js +2681 -425
- package/dist/run.cjs +41 -42
- package/dist/run.js +41 -42
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +97 -89
- package/dist/transfer.js +97 -89
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +72 -39
- package/src/bags.ts +50 -29
- package/src/builtins.ts +8 -16
- package/src/check-failure.ts +118 -0
- package/src/check-trace.ts +321 -0
- package/src/check.ts +828 -770
- package/src/cli/options.ts +6 -31
- package/src/cli/runtime-invariants.ts +20 -56
- package/src/cli/shared.ts +1 -1
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +224 -212
- package/src/cli/tlc-output.ts +701 -0
- package/src/cli/tlc-usage.ts +1 -2
- package/src/cli/tlc.ts +65 -712
- package/src/cli/xml-exporter.ts +23 -33
- package/src/codegen.ts +28 -20
- package/src/coverage.ts +255 -20
- package/src/dependencies.ts +96 -27
- package/src/dfid.ts +115 -50
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +175 -373
- package/src/errors.ts +40 -5
- package/src/evaluate.ts +429 -139
- package/src/exit-codes.ts +28 -12
- package/src/fingerprints.ts +65 -1
- package/src/instances.ts +178 -17
- package/src/java-hash.ts +14 -0
- package/src/java-overrides.ts +2 -2
- package/src/json.ts +4 -7
- package/src/levels.ts +708 -272
- package/src/lexer.ts +17 -5
- package/src/liveness-checker.ts +707 -249
- package/src/liveness.ts +148 -95
- package/src/obligations/action.ts +14 -17
- package/src/obligations/anonymize.ts +37 -16
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +36 -8
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +66 -54
- package/src/obligations/index.ts +39 -9
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +28 -41
- package/src/obligations/normalize.ts +27 -18
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +48 -18
- package/src/obligations/proof.ts +3 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +55 -50
- package/src/obligations/source.ts +120 -74
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +5 -7
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +17 -31
- package/src/parallel.ts +29 -47
- package/src/parser.ts +757 -326
- package/src/pretty-print.ts +1 -1
- package/src/prover/decide-pool.ts +3 -3
- package/src/prover/deciders.ts +12 -9
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +72 -42
- package/src/prover/isabelle/isar/attrib.ts +250 -0
- package/src/prover/isabelle/isar/context.ts +335 -0
- package/src/prover/isabelle/isar/induct.ts +382 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
- package/src/prover/isabelle/isar/method.ts +509 -212
- package/src/prover/isabelle/isar/proof.ts +570 -14
- package/src/prover/isabelle/isar/rule-cases.ts +226 -0
- package/src/prover/isabelle/isar/theory.ts +487 -76
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +89 -14
- package/src/prover/isabelle/provers/blast/blast.ts +7 -65
- package/src/prover/isabelle/provers/blast/branch.ts +0 -2
- package/src/prover/isabelle/provers/blast/prove.ts +0 -2
- package/src/prover/isabelle/provers/blast/rules.ts +0 -2
- package/src/prover/isabelle/provers/blast/state.ts +0 -2
- package/src/prover/isabelle/provers/blast/term.ts +0 -2
- package/src/prover/isabelle/provers/clasimp.ts +1 -3
- package/src/prover/isabelle/provers/classical.ts +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +19 -30
- package/src/prover/isabelle/pure/bicompose.ts +9 -27
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +2 -10
- package/src/prover/isabelle/pure/drule.ts +72 -6
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +1 -3
- package/src/prover/isabelle/pure/logic.ts +1 -3
- package/src/prover/isabelle/pure/name.ts +0 -2
- package/src/prover/isabelle/pure/net.ts +0 -2
- package/src/prover/isabelle/pure/object-logic.ts +13 -7
- package/src/prover/isabelle/pure/pattern.ts +0 -2
- package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
- package/src/prover/isabelle/pure/rewriter.ts +9 -20
- package/src/prover/isabelle/pure/search.ts +0 -2
- package/src/prover/isabelle/pure/seq.ts +0 -2
- package/src/prover/isabelle/pure/simplifier.ts +26 -7
- package/src/prover/isabelle/pure/table.ts +2 -3
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +42 -37
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +3 -5
- package/src/prover/isabelle/pure/thm.ts +14 -13
- package/src/prover/isabelle/pure/type.ts +0 -2
- package/src/prover/isabelle/pure/unify.ts +0 -2
- package/src/prover/isabelle/pure/variable.ts +0 -2
- package/src/prover/isabelle/tla/classical-setup.ts +18 -16
- package/src/prover/isabelle/tla/context.ts +58 -11
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +49 -21
- package/src/prover/isabelle/tla/simpdata.ts +1 -12
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +30 -31
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/fingerprint.ts +2 -5
- package/src/prover/prep/md5.ts +26 -29
- package/src/prover/prep/methods.ts +181 -51
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +395 -94
- package/src/prover/ptl/decide.ts +95 -50
- package/src/prover/ptl/encode.ts +2 -3
- package/src/prover/ptl/tableau.ts +28 -2
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -8
- package/src/prover/smt/context.ts +43 -8
- package/src/prover/smt/data.ts +498 -379
- package/src/prover/smt/encode.ts +148 -57
- package/src/prover/smt/extensionality.ts +5 -3
- package/src/prover/smt/flatten.ts +4 -6
- package/src/prover/smt/format.ts +28 -4
- package/src/prover/smt/instances.ts +7 -1
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1016 -618
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +62 -0
- package/src/prover/smt/solver/ackr-helper.ts +179 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
- package/src/prover/smt/solver/act-cache.ts +0 -1
- package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
- package/src/prover/smt/solver/aig-tactic.ts +52 -0
- package/src/prover/smt/solver/aig.ts +889 -0
- package/src/prover/smt/solver/arith-rewriter.ts +624 -9
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +319 -0
- package/src/prover/smt/solver/asserted-formulas.ts +240 -56
- package/src/prover/smt/solver/ast-lt.ts +165 -11
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1483 -45
- package/src/prover/smt/solver/auf-solver.ts +25 -18
- package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/blast-term-ite.ts +47 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +598 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +127 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -2
- package/src/prover/smt/solver/cg-table.ts +39 -25
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +598 -128
- package/src/prover/smt/solver/ctx-simplify.ts +29 -14
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
- package/src/prover/smt/solver/der.ts +38 -10
- package/src/prover/smt/solver/diff-neq.ts +207 -0
- package/src/prover/smt/solver/distribute-forall.ts +57 -0
- package/src/prover/smt/solver/dom-simplify.ts +511 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +298 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -1
- package/src/prover/smt/solver/e-matching.ts +7 -8
- package/src/prover/smt/solver/elim-bounds.ts +89 -0
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +548 -0
- package/src/prover/smt/solver/enode.ts +100 -3
- package/src/prover/smt/solver/eq2bv-tactic.ts +227 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +901 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1046 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +328 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
- package/src/prover/smt/solver/expr2polynomial.ts +271 -0
- package/src/prover/smt/solver/factor.ts +163 -0
- package/src/prover/smt/solver/fd-solver.ts +734 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -15
- package/src/prover/smt/solver/fix-dl-var.ts +147 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +886 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +178 -15
- package/src/prover/smt/solver/goal2nlsat.ts +216 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -1
- package/src/prover/smt/solver/hashtable.ts +34 -16
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +111 -39
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -1
- package/src/prover/smt/solver/lia2card.ts +268 -0
- package/src/prover/smt/solver/lia2pb.ts +154 -0
- package/src/prover/smt/solver/literal.ts +0 -1
- package/src/prover/smt/solver/logic-tactics.ts +355 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
- package/src/prover/smt/solver/lp/constraints.ts +0 -1
- package/src/prover/smt/solver/lp/containers.ts +7 -2
- package/src/prover/smt/solver/lp/core-solver.ts +30 -11
- package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
- package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
- package/src/prover/smt/solver/lp/dependency.ts +0 -2
- package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
- package/src/prover/smt/solver/lp/explanation.ts +0 -1
- package/src/prover/smt/solver/lp/gomory.ts +0 -1
- package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
- package/src/prover/smt/solver/lp/hnf.ts +0 -3
- package/src/prover/smt/solver/lp/int-cube.ts +3 -4
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +41 -5
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +6 -3
- package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
- package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
- package/src/prover/smt/solver/lp/nex.ts +2 -2
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
- package/src/prover/smt/solver/lp/nla-core.ts +68 -17
- package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
- package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
- package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
- package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
- package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
- package/src/prover/smt/solver/lp/nla-order.ts +0 -2
- package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -2
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
- package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
- package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
- package/src/prover/smt/solver/lp/pdd.ts +725 -290
- package/src/prover/smt/solver/lp/random-updater.ts +0 -2
- package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
- package/src/prover/smt/solver/lp/union-find.ts +7 -2
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +122 -90
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +310 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +106 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +19 -28
- package/src/prover/smt/solver/model-evaluator.ts +190 -12
- package/src/prover/smt/solver/model-finder.ts +12 -18
- package/src/prover/smt/solver/model-generator.ts +104 -35
- package/src/prover/smt/solver/model-macro-solver.ts +49 -46
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +709 -0
- package/src/prover/smt/solver/mus.ts +50 -0
- package/src/prover/smt/solver/muz/dl-context.ts +382 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +485 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +315 -98
- package/src/prover/smt/solver/nlsat/atoms.ts +71 -38
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +427 -229
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +460 -246
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +2376 -684
- package/src/prover/smt/solver/nlsat/solver.ts +293 -92
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -8
- package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +110 -24
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +801 -0
- package/src/prover/smt/solver/opt-nlsat.ts +386 -0
- package/src/prover/smt/solver/opt-pareto.ts +301 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +312 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +19 -11
- package/src/prover/smt/solver/pb-rewriter.ts +281 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +546 -0
- package/src/prover/smt/solver/poly-rewriter.ts +259 -57
- package/src/prover/smt/solver/probes.ts +577 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +648 -19
- package/src/prover/smt/solver/pull-quant.ts +28 -12
- package/src/prover/smt/solver/purify-arith.ts +634 -0
- package/src/prover/smt/solver/push-app-ite.ts +37 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -3
- package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
- package/src/prover/smt/solver/qe-lite.ts +39 -19
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1499 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -1
- package/src/prover/smt/solver/qsat.ts +829 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +16 -56
- package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
- package/src/prover/smt/solver/quantifier-manager.ts +22 -25
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +45 -1
- package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -1
- package/src/prover/smt/solver/relevancy.ts +1 -2
- package/src/prover/smt/solver/rewriter-tpl.ts +82 -14
- package/src/prover/smt/solver/rewriter.ts +505 -60
- package/src/prover/smt/solver/rlimit.ts +45 -5
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +589 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +480 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +72 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +190 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2107 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +995 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1298 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +730 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
- package/src/prover/smt/solver/seq-skolem.ts +294 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +124 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +589 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3535 -360
- package/src/prover/smt/solver/smtlib-script.ts +2136 -0
- package/src/prover/smt/solver/solve-eqs.ts +928 -0
- package/src/prover/smt/solver/solver.ts +128 -23
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +2176 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1210 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
- package/src/prover/smt/solver/theory-lra-final-check.ts +57 -70
- package/src/prover/smt/solver/theory-lra-internalize.ts +96 -27
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +35 -28
- package/src/prover/smt/solver/theory-lra-state.ts +7 -23
- package/src/prover/smt/solver/theory-lra.ts +189 -2
- package/src/prover/smt/solver/theory-pb.ts +951 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +852 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory-without-terms.ts +24 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +495 -0
- package/src/prover/smt/solver/var-subst.ts +36 -14
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +57 -26
- package/src/prover/tlapm/tlapm.ts +15 -9
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -0
- package/src/prover/zenon/check/check.ts +1 -2
- package/src/prover/zenon/check/records.ts +1 -1
- package/src/prover/zenon/check/relations.ts +2 -1
- package/src/prover/zenon/check/rewrites.ts +2 -15
- package/src/prover/zenon/check/sets.ts +40 -58
- package/src/prover/zenon/check/terms.ts +1 -2
- package/src/prover/zenon/decide.ts +10 -7
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +2 -2
- package/src/prover/zenon/equality-rules.ts +24 -2
- package/src/prover/zenon/expr.ts +28 -2
- package/src/prover/zenon/index-table.ts +16 -23
- package/src/prover/zenon/isar-case.ts +1 -3
- package/src/prover/zenon/isar.ts +37 -39
- package/src/prover/zenon/llproof.ts +2 -13
- package/src/prover/zenon/mltoll.ts +12 -30
- package/src/prover/zenon/node.ts +20 -5
- package/src/prover/zenon/parse.ts +9 -8
- package/src/prover/zenon/phrase.ts +1 -3
- package/src/prover/zenon/proof.ts +0 -2
- package/src/prover/zenon/propositional-rules.ts +0 -2
- package/src/prover/zenon/rules.ts +2 -3
- package/src/prover/zenon/search.ts +11 -19
- package/src/prover/zenon/tla/functions.ts +2 -4
- package/src/prover/zenon/tla/llproof.ts +9 -13
- package/src/prover/zenon/tla/records.ts +1 -8
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +22 -22
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +7 -8
- package/src/resolve.ts +1327 -328
- package/src/runtime.ts +25 -2
- package/src/sany/builtins.ts +10 -10
- package/src/sany/generation.ts +384 -0
- package/src/sany/generator-def-entries.ts +297 -0
- package/src/sany/generator-definitions.ts +688 -0
- package/src/sany/generator-expressions.ts +1123 -0
- package/src/sany/generator-proofs.ts +668 -0
- package/src/sany/generator.ts +161 -2625
- package/src/sany/levels.ts +0 -2
- package/src/sany/lexer.ts +32 -23
- package/src/sany/linter.ts +0 -2
- package/src/sany/modules.ts +4 -2
- package/src/sany/nodes.ts +3 -4
- package/src/sany/report.ts +3 -6
- package/src/sany/selectors.ts +46 -44
- package/src/sany/xml.ts +25 -58
- package/src/search.ts +513 -165
- package/src/simulate.ts +340 -251
- package/src/spec-description.ts +48 -55
- package/src/standard-definitions.ts +5 -0
- package/src/standard-modules.ts +72 -54
- package/src/state-graph.ts +0 -2
- package/src/subexpressions.ts +564 -138
- package/src/substitution-levels.ts +5 -4
- package/src/successors.ts +56 -28
- package/src/symmetry.ts +4 -3
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/jar-data.ts +10 -0
- package/src/tlc/messages.ts +23 -18
- package/src/tlc/order.ts +14 -3
- package/src/tlc/random.ts +6 -5
- package/src/tlc/replay.ts +152 -58
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlc-operators.ts +12 -11
- package/src/tlc/tlcext-operators.ts +87 -26
- package/src/tlc/trace-spec.ts +27 -60
- package/src/trace-liveness.ts +529 -0
- package/src/typed-tier.ts +6556 -0
- package/src/typescript/actions.ts +2 -4
- package/src/typescript/collections.ts +34 -20
- package/src/typescript/compile.ts +1 -3
- package/src/typescript/formula.ts +5 -3
- package/src/typescript/model.ts +4 -5
- package/src/typescript/steps.ts +20 -18
- package/src/typescript/types.ts +2 -2
- package/src/values.ts +208 -227
- package/src/prover/isabelle/isar/statement.ts +0 -52
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/tlaps-module.ts +0 -510
- package/src/prover/zenon/LICENSE +0 -32
|
@@ -0,0 +1,101 @@
|
|
|
1
|
+
import { type AstManager, OP_OR, SORT_BOOL } from "./ast";
|
|
2
|
+
import { mkNot } from "./ast-util";
|
|
3
|
+
import { ObjMap } from "./hashtable";
|
|
4
|
+
import { L_FALSE, L_UNDEF } from "./lbool";
|
|
5
|
+
import type { MaxsatSolver, Soft } from "./maxsmt-base";
|
|
6
|
+
import { Rational } from "./rational";
|
|
7
|
+
import { RefVector } from "./ref-vector";
|
|
8
|
+
|
|
9
|
+
export class Preprocess {
|
|
10
|
+
private trail: RefVector;
|
|
11
|
+
|
|
12
|
+
constructor(
|
|
13
|
+
private manager: AstManager,
|
|
14
|
+
private solver: MaxsatSolver,
|
|
15
|
+
) {
|
|
16
|
+
this.trail = new RefVector(manager);
|
|
17
|
+
}
|
|
18
|
+
|
|
19
|
+
private mkMap() {
|
|
20
|
+
const manager = this.manager;
|
|
21
|
+
return new ObjMap<Rational>((expr) => manager.hashes[expr]);
|
|
22
|
+
}
|
|
23
|
+
|
|
24
|
+
private soft2map(softs: readonly Soft[], fmls: number[]) {
|
|
25
|
+
const result = this.mkMap();
|
|
26
|
+
for (const soft of softs) {
|
|
27
|
+
this.trail.push(soft.expr);
|
|
28
|
+
const weight = result.get(soft.expr);
|
|
29
|
+
if (weight !== undefined) result.set(soft.expr, weight.add(soft.weight));
|
|
30
|
+
else {
|
|
31
|
+
result.set(soft.expr, soft.weight);
|
|
32
|
+
fmls.push(soft.expr);
|
|
33
|
+
}
|
|
34
|
+
}
|
|
35
|
+
return result;
|
|
36
|
+
}
|
|
37
|
+
|
|
38
|
+
private dualize(soft: ObjMap<Rational>, fmls: number[]) {
|
|
39
|
+
const result = this.mkMap();
|
|
40
|
+
for (const [key, value] of soft) {
|
|
41
|
+
const negated = mkNot(this.manager, key);
|
|
42
|
+
this.trail.push(negated);
|
|
43
|
+
result.set(negated, value);
|
|
44
|
+
}
|
|
45
|
+
for (let index = 0; index < fmls.length; index++) {
|
|
46
|
+
fmls[index] = mkNot(this.manager, fmls[index]);
|
|
47
|
+
this.trail.push(fmls[index]);
|
|
48
|
+
}
|
|
49
|
+
return result;
|
|
50
|
+
}
|
|
51
|
+
|
|
52
|
+
private processMutex(mutex: number[], soft: ObjMap<Rational>, lower: { value: Rational }) {
|
|
53
|
+
if (mutex.length <= 1) return;
|
|
54
|
+
const manager = this.manager;
|
|
55
|
+
const getWeight = (expr: number) => soft.get(expr) ?? Rational.zero;
|
|
56
|
+
mutex.sort(
|
|
57
|
+
(first, second) =>
|
|
58
|
+
getWeight(second).compare(getWeight(first)) || manager.ids[second] - manager.ids[first],
|
|
59
|
+
);
|
|
60
|
+
const weights = mutex.map(getWeight);
|
|
61
|
+
for (const expr of mutex) soft.delete(expr);
|
|
62
|
+
let weight = Rational.zero;
|
|
63
|
+
for (let index = mutex.length; index-- > 0;) {
|
|
64
|
+
const disjunction = manager.mkApp(OP_OR, mutex.slice(0, index + 1), SORT_BOOL);
|
|
65
|
+
this.trail.push(disjunction);
|
|
66
|
+
const current = weights[index];
|
|
67
|
+
weight = current.sub(weight);
|
|
68
|
+
lower.value = lower.value.add(weight.mul(Rational.of(BigInt(index))));
|
|
69
|
+
soft.set(disjunction, weight);
|
|
70
|
+
while (index > 0 && weights[index - 1].equals(current)) index--;
|
|
71
|
+
weight = current;
|
|
72
|
+
}
|
|
73
|
+
}
|
|
74
|
+
|
|
75
|
+
run(softs: readonly Soft[]) {
|
|
76
|
+
const fmls: number[] = [];
|
|
77
|
+
let soft = this.soft2map(softs, fmls);
|
|
78
|
+
const lower = { value: Rational.zero };
|
|
79
|
+
const found = this.solver.findMutexes(fmls);
|
|
80
|
+
if (found.status === L_FALSE) return { soft: [...softs], lower: lower.value };
|
|
81
|
+
if (found.status === L_UNDEF) return undefined;
|
|
82
|
+
for (const mutex of found.mutexes) this.processMutex(mutex, soft, lower);
|
|
83
|
+
if (found.mutexes.length === 0) {
|
|
84
|
+
const dual = this.dualize(soft, fmls);
|
|
85
|
+
const dualFound = this.solver.findMutexes(fmls);
|
|
86
|
+
if (dualFound.status === L_FALSE) return { soft: [...softs], lower: lower.value };
|
|
87
|
+
if (dualFound.status === L_UNDEF) return undefined;
|
|
88
|
+
const dualLower = { value: Rational.zero };
|
|
89
|
+
for (const mutex of dualFound.mutexes) this.processMutex(mutex, dual, dualLower);
|
|
90
|
+
if (dual.size !== soft.size) soft = this.dualize(dual, fmls);
|
|
91
|
+
}
|
|
92
|
+
return {
|
|
93
|
+
soft: [...soft].map((entry) => ({ expr: entry[0], weight: entry[1], value: L_UNDEF })),
|
|
94
|
+
lower: lower.value,
|
|
95
|
+
};
|
|
96
|
+
}
|
|
97
|
+
|
|
98
|
+
release() {
|
|
99
|
+
this.trail.reset();
|
|
100
|
+
}
|
|
101
|
+
}
|
|
@@ -0,0 +1,312 @@
|
|
|
1
|
+
import { SmtCanceledError, SmtDefaultError, SmtInvariantError } from "../../../errors";
|
|
2
|
+
import { type AstManager, FAMILY_ARITH, FAMILY_PB } from "./ast";
|
|
3
|
+
import { InfEps } from "./inf-eps";
|
|
4
|
+
import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
|
|
5
|
+
import type { AlgebraicManager } from "./nlsat/algebraic";
|
|
6
|
+
import type { ParetoSolver } from "./opt-pareto";
|
|
7
|
+
import type { ProtoModel } from "./proto-model";
|
|
8
|
+
import { Rational } from "./rational";
|
|
9
|
+
import { RefVector } from "./ref-vector";
|
|
10
|
+
import { SmtKernel } from "./smt-kernel";
|
|
11
|
+
import type { TacticEnvironment } from "./tactic";
|
|
12
|
+
|
|
13
|
+
const MODEL_BOUND_SCALE = Rational.of(10n ** 12n);
|
|
14
|
+
|
|
15
|
+
export interface MaximizeResult {
|
|
16
|
+
// The no-model path accepts the hint without validating it.
|
|
17
|
+
isBoundValid: boolean;
|
|
18
|
+
hint: InfEps;
|
|
19
|
+
// L_TRUE: accepted; L_FALSE: obj >= hint refuted; L_UNDEF: undecided or unchecked.
|
|
20
|
+
hintStatus: number;
|
|
21
|
+
// Independent of the hint, it holds over the current assertions.
|
|
22
|
+
upperBound: Rational | null;
|
|
23
|
+
}
|
|
24
|
+
|
|
25
|
+
// An irrational value gives the requested side of an isolating interval, rounded outward to
|
|
26
|
+
// twelve decimals.
|
|
27
|
+
export const getModelValueBound = (
|
|
28
|
+
manager: AstManager,
|
|
29
|
+
am: AlgebraicManager,
|
|
30
|
+
value: number,
|
|
31
|
+
isLower: boolean,
|
|
32
|
+
) => {
|
|
33
|
+
if (manager.isNumeral(value)) return manager.getRationalValue(value);
|
|
34
|
+
if (!manager.isAlgebraicNumeral(value)) return undefined;
|
|
35
|
+
const interval = am.getInterval(manager.getAlgebraicValue(value), 40);
|
|
36
|
+
return isLower
|
|
37
|
+
? interval[0].mul(MODEL_BOUND_SCALE).floor().div(MODEL_BOUND_SCALE)
|
|
38
|
+
: interval[1].mul(MODEL_BOUND_SCALE).ceil().div(MODEL_BOUND_SCALE);
|
|
39
|
+
};
|
|
40
|
+
|
|
41
|
+
export class OptSolver {
|
|
42
|
+
private readonly kernel: SmtKernel;
|
|
43
|
+
private model: ProtoModel | null = null;
|
|
44
|
+
private objectiveVars: number[] = [];
|
|
45
|
+
private objectiveValues: InfEps[] = [];
|
|
46
|
+
private objectiveModels: (ProtoModel | null)[] = [];
|
|
47
|
+
private objectiveTerms: number[] = [];
|
|
48
|
+
// Every model and bound the search makes lives until the solver is released.
|
|
49
|
+
private models: ProtoModel[] = [];
|
|
50
|
+
private pinned: RefVector;
|
|
51
|
+
private isFirst = true;
|
|
52
|
+
private numScopes = 0;
|
|
53
|
+
private readonly dualBoundRlimit: number;
|
|
54
|
+
wasUnknown = false;
|
|
55
|
+
|
|
56
|
+
constructor(
|
|
57
|
+
private readonly manager: AstManager,
|
|
58
|
+
params: TacticEnvironment,
|
|
59
|
+
) {
|
|
60
|
+
this.dualBoundRlimit = Number(params.parameters.get("opt.optsmt_dual_bound_rlimit") ?? 100);
|
|
61
|
+
// opt_solver turns relevancy off under the default case split strategy, so a decided bound,
|
|
62
|
+
// such as one optsmt made for a lower bound, reaches the arithmetic solver.
|
|
63
|
+
this.kernel = new SmtKernel(manager, {
|
|
64
|
+
...params,
|
|
65
|
+
relevancyLevel: 0,
|
|
66
|
+
setup: params.setup && { ...params.setup, isArithAutoConfigSimplex: true },
|
|
67
|
+
});
|
|
68
|
+
this.kernel.context.registerFamily(FAMILY_PB);
|
|
69
|
+
this.pinned = new RefVector(manager);
|
|
70
|
+
}
|
|
71
|
+
|
|
72
|
+
private hold(model: ProtoModel) {
|
|
73
|
+
model.incRef();
|
|
74
|
+
this.models.push(model);
|
|
75
|
+
return model;
|
|
76
|
+
}
|
|
77
|
+
|
|
78
|
+
private getContextModel() {
|
|
79
|
+
return this.hold(this.kernel.context.getSatModel());
|
|
80
|
+
}
|
|
81
|
+
|
|
82
|
+
// get_optimizer makes an arithmetic theory when the setup made none.
|
|
83
|
+
private get arith() {
|
|
84
|
+
const context = this.kernel.context;
|
|
85
|
+
context.registerFamily(FAMILY_ARITH);
|
|
86
|
+
if (context.arith === undefined)
|
|
87
|
+
throw new SmtInvariantError("get_optimizer found no arithmetic theory");
|
|
88
|
+
return context.arith;
|
|
89
|
+
}
|
|
90
|
+
|
|
91
|
+
assertExpr(expr: number) {
|
|
92
|
+
this.model = null;
|
|
93
|
+
this.pinned.push(expr);
|
|
94
|
+
this.kernel.assertExpr(expr);
|
|
95
|
+
}
|
|
96
|
+
|
|
97
|
+
push() {
|
|
98
|
+
this.kernel.push();
|
|
99
|
+
this.numScopes++;
|
|
100
|
+
}
|
|
101
|
+
|
|
102
|
+
pop(numScopes: number) {
|
|
103
|
+
this.kernel.pop(numScopes);
|
|
104
|
+
this.numScopes -= numScopes;
|
|
105
|
+
}
|
|
106
|
+
|
|
107
|
+
private adjustResult(result: number) {
|
|
108
|
+
if (result !== L_UNDEF || !this.kernel.context.isQuantifierIncomplete()) return result;
|
|
109
|
+
this.wasUnknown = true;
|
|
110
|
+
return L_TRUE;
|
|
111
|
+
}
|
|
112
|
+
|
|
113
|
+
check(assumptions: readonly number[] = []) {
|
|
114
|
+
this.model = null;
|
|
115
|
+
const result = this.adjustResult(
|
|
116
|
+
this.isFirst && assumptions.length === 0 && this.numScopes === 0
|
|
117
|
+
? this.kernel.setupAndCheck()
|
|
118
|
+
: this.kernel.check(assumptions),
|
|
119
|
+
);
|
|
120
|
+
this.isFirst = false;
|
|
121
|
+
if (result === L_TRUE) {
|
|
122
|
+
this.model = this.getContextModel();
|
|
123
|
+
if (this.objectiveModels.length === 1) this.objectiveModels[0] = this.model;
|
|
124
|
+
}
|
|
125
|
+
return result;
|
|
126
|
+
}
|
|
127
|
+
|
|
128
|
+
getUnsatCore() {
|
|
129
|
+
return this.kernel.context.unsatCore;
|
|
130
|
+
}
|
|
131
|
+
|
|
132
|
+
get reasonUnknown() {
|
|
133
|
+
return this.kernel.context.getLastFailureMessage();
|
|
134
|
+
}
|
|
135
|
+
|
|
136
|
+
findMutexes(vars: readonly number[]) {
|
|
137
|
+
const mutexes = this.kernel.context.findMutexes(vars);
|
|
138
|
+
for (const mutex of mutexes) for (const literal of mutex) this.pinned.push(literal);
|
|
139
|
+
return mutexes;
|
|
140
|
+
}
|
|
141
|
+
|
|
142
|
+
getModel() {
|
|
143
|
+
if (this.model !== null) return this.model;
|
|
144
|
+
for (let index = this.objectiveModels.length; index-- > 0;) {
|
|
145
|
+
const model = this.objectiveModels[index];
|
|
146
|
+
if (model !== null) return model;
|
|
147
|
+
}
|
|
148
|
+
return null;
|
|
149
|
+
}
|
|
150
|
+
|
|
151
|
+
addObjective(term: number) {
|
|
152
|
+
this.pinned.push(term);
|
|
153
|
+
this.objectiveVars.push(this.arith.addObjective(term));
|
|
154
|
+
this.objectiveValues.push(InfEps.minusInfinity);
|
|
155
|
+
this.objectiveTerms.push(term);
|
|
156
|
+
this.objectiveModels.push(null);
|
|
157
|
+
}
|
|
158
|
+
|
|
159
|
+
resetObjectives() {
|
|
160
|
+
this.objectiveVars = [];
|
|
161
|
+
this.objectiveValues = [];
|
|
162
|
+
this.objectiveTerms = [];
|
|
163
|
+
}
|
|
164
|
+
|
|
165
|
+
getSavedObjectiveValue(index: number) {
|
|
166
|
+
return this.objectiveValues[index];
|
|
167
|
+
}
|
|
168
|
+
|
|
169
|
+
private getModelValueLowerBound(model: ProtoModel, index: number) {
|
|
170
|
+
const value = model.eval(this.objectiveTerms[index], false);
|
|
171
|
+
const bound = getModelValueBound(this.manager, this.manager.am, value, true);
|
|
172
|
+
this.manager.decRef(value);
|
|
173
|
+
return bound;
|
|
174
|
+
}
|
|
175
|
+
|
|
176
|
+
mkGe(index: number, value: InfEps) {
|
|
177
|
+
const manager = this.manager;
|
|
178
|
+
if (!value.isFinite()) return value.isPositive() ? manager.falseExpr : manager.trueExpr;
|
|
179
|
+
const bound = this.arith.mkGe(this.objectiveVars[index], value);
|
|
180
|
+
this.pinned.push(bound);
|
|
181
|
+
return bound;
|
|
182
|
+
}
|
|
183
|
+
|
|
184
|
+
// The arithmetic relaxation only hints at the optimum, so a finite hint is checked against
|
|
185
|
+
// the other theories before it becomes the objective's value. With isDual, the relaxation of
|
|
186
|
+
// nonlinear arithmetic also yields an upper bound; one that holds only on the current branch is
|
|
187
|
+
// probed across all branches when isProbing.
|
|
188
|
+
maximizeObjective(index: number, isDual = false, isProbing = true) {
|
|
189
|
+
this.model = null;
|
|
190
|
+
const maximized = this.arith.maximize(this.objectiveVars[index], isDual);
|
|
191
|
+
this.pinned.push(maximized.blocker);
|
|
192
|
+
const value = maximized.value;
|
|
193
|
+
const upper = maximized.upper;
|
|
194
|
+
const result: MaximizeResult = {
|
|
195
|
+
isBoundValid: false,
|
|
196
|
+
hint: value,
|
|
197
|
+
hintStatus: L_UNDEF,
|
|
198
|
+
upperBound: upper?.isGlobal === true ? upper.value : null,
|
|
199
|
+
};
|
|
200
|
+
const outcome = { result, blocker: maximized.blocker };
|
|
201
|
+
this.model = this.getContextModel();
|
|
202
|
+
this.objectiveModels[index] ??= this.model;
|
|
203
|
+
if (this.manager.limit.isExhausted()) return outcome;
|
|
204
|
+
const bound = this.getModelValueLowerBound(this.model, index);
|
|
205
|
+
if (bound !== undefined && InfEps.of(bound).compare(this.objectiveValues[index]) > 0)
|
|
206
|
+
this.objectiveValues[index] = InfEps.of(bound);
|
|
207
|
+
if (this.manager.limit.isExhausted()) return outcome;
|
|
208
|
+
if (
|
|
209
|
+
isProbing &&
|
|
210
|
+
value.isFinite() &&
|
|
211
|
+
upper !== null &&
|
|
212
|
+
!upper.isGlobal &&
|
|
213
|
+
this.dualBoundRlimit !== 0
|
|
214
|
+
) {
|
|
215
|
+
if (this.checkUpperBound(index, upper.value) === L_FALSE) result.upperBound = upper.value;
|
|
216
|
+
if (!this.manager.limit.inc() || !this.checkBound(index, value, result)) return outcome;
|
|
217
|
+
} else if (value.isFinite()) {
|
|
218
|
+
this.kernel.context.updateModel();
|
|
219
|
+
if (!this.checkBound(index, value, result)) return outcome;
|
|
220
|
+
}
|
|
221
|
+
this.objectiveValues[index] = value;
|
|
222
|
+
result.hintStatus = L_TRUE;
|
|
223
|
+
result.isBoundValid = true;
|
|
224
|
+
return outcome;
|
|
225
|
+
}
|
|
226
|
+
|
|
227
|
+
// Whether the objective can exceed the value at all, within a small resource budget.
|
|
228
|
+
private checkUpperBound(index: number, value: Rational) {
|
|
229
|
+
const limit = this.manager.limit;
|
|
230
|
+
if (!limit.inc()) return L_UNDEF;
|
|
231
|
+
const baseline = this.model;
|
|
232
|
+
try {
|
|
233
|
+
this.kernel.push();
|
|
234
|
+
} catch (error) {
|
|
235
|
+
const isPushCanceled = error instanceof SmtDefaultError && error.message === "push canceled";
|
|
236
|
+
if (!(error instanceof SmtCanceledError || isPushCanceled)) throw error;
|
|
237
|
+
return L_UNDEF;
|
|
238
|
+
}
|
|
239
|
+
limit.push(this.dualBoundRlimit);
|
|
240
|
+
const result = (() => {
|
|
241
|
+
try {
|
|
242
|
+
this.assertExpr(this.mkGe(index, InfEps.of(value, Rational.one)));
|
|
243
|
+
return this.kernel.check();
|
|
244
|
+
} catch (error) {
|
|
245
|
+
if (!(error instanceof SmtCanceledError)) throw error;
|
|
246
|
+
return L_UNDEF;
|
|
247
|
+
}
|
|
248
|
+
})();
|
|
249
|
+
limit.pop();
|
|
250
|
+
this.kernel.pop(1);
|
|
251
|
+
this.model = baseline;
|
|
252
|
+
return result;
|
|
253
|
+
}
|
|
254
|
+
|
|
255
|
+
getAssertions() {
|
|
256
|
+
return this.kernel.getAssertions();
|
|
257
|
+
}
|
|
258
|
+
|
|
259
|
+
private checkBound(index: number, value: InfEps, result: MaximizeResult) {
|
|
260
|
+
if (this.manager.limit.isExhausted()) return false;
|
|
261
|
+
const bounded = this.boundValue(index, value);
|
|
262
|
+
result.hintStatus = bounded === L_TRUE ? this.kernel.check() : bounded;
|
|
263
|
+
return result.hintStatus === L_TRUE;
|
|
264
|
+
}
|
|
265
|
+
|
|
266
|
+
private boundValue(index: number, value: InfEps) {
|
|
267
|
+
this.kernel.push();
|
|
268
|
+
this.assertExpr(this.mkGe(index, value));
|
|
269
|
+
const result = this.adjustResult(this.kernel.check());
|
|
270
|
+
if (result === L_TRUE) {
|
|
271
|
+
this.model = this.getContextModel();
|
|
272
|
+
this.objectiveModels[index] = this.model;
|
|
273
|
+
}
|
|
274
|
+
this.kernel.pop(1);
|
|
275
|
+
return result;
|
|
276
|
+
}
|
|
277
|
+
|
|
278
|
+
release() {
|
|
279
|
+
for (const model of this.models) model.decRef();
|
|
280
|
+
this.models = [];
|
|
281
|
+
this.pinned.reset();
|
|
282
|
+
}
|
|
283
|
+
}
|
|
284
|
+
|
|
285
|
+
// The pareto search runs on the solver of the hard constraints.
|
|
286
|
+
export class OptParetoSolver implements ParetoSolver {
|
|
287
|
+
reasonUnknown = "";
|
|
288
|
+
|
|
289
|
+
constructor(private readonly solver: OptSolver) {}
|
|
290
|
+
|
|
291
|
+
get model() {
|
|
292
|
+
return this.solver.getModel();
|
|
293
|
+
}
|
|
294
|
+
|
|
295
|
+
check() {
|
|
296
|
+
return this.solver.check();
|
|
297
|
+
}
|
|
298
|
+
|
|
299
|
+
assert(expr: number) {
|
|
300
|
+
this.solver.assertExpr(expr);
|
|
301
|
+
}
|
|
302
|
+
|
|
303
|
+
push() {
|
|
304
|
+
this.solver.push();
|
|
305
|
+
}
|
|
306
|
+
|
|
307
|
+
pop() {
|
|
308
|
+
this.solver.pop(1);
|
|
309
|
+
}
|
|
310
|
+
|
|
311
|
+
release() {}
|
|
312
|
+
}
|
|
@@ -0,0 +1,55 @@
|
|
|
1
|
+
import { InfEps } from "./inf-eps";
|
|
2
|
+
import type { AlgebraicManager, Anum } from "./nlsat/algebraic";
|
|
3
|
+
|
|
4
|
+
// A bound whose finite part may also be known exactly, as an algebraic number, while the bound
|
|
5
|
+
// keeps an outward rational endpoint.
|
|
6
|
+
export class ObjectiveValue {
|
|
7
|
+
static readonly infinity = new ObjectiveValue(InfEps.infinity);
|
|
8
|
+
static readonly minusInfinity = new ObjectiveValue(InfEps.minusInfinity);
|
|
9
|
+
|
|
10
|
+
constructor(
|
|
11
|
+
readonly bound: InfEps,
|
|
12
|
+
readonly exact: Anum | null = null,
|
|
13
|
+
) {}
|
|
14
|
+
|
|
15
|
+
isFinite() {
|
|
16
|
+
return this.bound.isFinite();
|
|
17
|
+
}
|
|
18
|
+
|
|
19
|
+
hasInfinitesimal() {
|
|
20
|
+
return !this.bound.epsilon.isZero();
|
|
21
|
+
}
|
|
22
|
+
|
|
23
|
+
withRationalBound(bound: InfEps) {
|
|
24
|
+
return new ObjectiveValue(bound, this.exact);
|
|
25
|
+
}
|
|
26
|
+
|
|
27
|
+
withoutExact() {
|
|
28
|
+
return new ObjectiveValue(this.bound);
|
|
29
|
+
}
|
|
30
|
+
|
|
31
|
+
negated(am: AlgebraicManager) {
|
|
32
|
+
const bound = this.bound;
|
|
33
|
+
const exact = this.exact === null ? null : am.copy(this.exact);
|
|
34
|
+
if (exact !== null) am.neg(exact);
|
|
35
|
+
return new ObjectiveValue(
|
|
36
|
+
new InfEps(bound.infinity.neg(), bound.value.neg(), bound.epsilon.neg()),
|
|
37
|
+
exact,
|
|
38
|
+
);
|
|
39
|
+
}
|
|
40
|
+
|
|
41
|
+
// Equal isolating endpoints do not imply equal algebraic values.
|
|
42
|
+
equals(other: ObjectiveValue, am: AlgebraicManager) {
|
|
43
|
+
const first = this.bound;
|
|
44
|
+
const second = other.bound;
|
|
45
|
+
if (!first.infinity.equals(second.infinity) || !first.epsilon.equals(second.epsilon))
|
|
46
|
+
return false;
|
|
47
|
+
if (this.exact === null && other.exact === null) return first.value.equals(second.value);
|
|
48
|
+
const isAlgebraic = this.exact !== null && !am.isRational(this.exact);
|
|
49
|
+
const isOtherAlgebraic = other.exact !== null && !am.isRational(other.exact);
|
|
50
|
+
if (isAlgebraic !== isOtherAlgebraic) return false;
|
|
51
|
+
if (isAlgebraic && this.exact !== null && other.exact !== null)
|
|
52
|
+
return am.compare(this.exact, other.exact) === 0;
|
|
53
|
+
return first.value.equals(second.value);
|
|
54
|
+
}
|
|
55
|
+
}
|