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,692 @@
|
|
|
1
|
+
import { SmtCanceledError, SmtUnsupportedError } from "../../../errors";
|
|
2
|
+
import { type AstManager, OP_GE, OP_GT, SORT_BOOL, SORT_INT, SORT_REAL } from "./ast";
|
|
3
|
+
import { InfEps, maxInfEps, minInfEps } from "./inf-eps";
|
|
4
|
+
import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
|
|
5
|
+
import { mkAlgebraicEq, NlsatOpt } from "./opt-nlsat";
|
|
6
|
+
import { getModelValueBound, type MaximizeResult, type OptSolver } from "./opt-solver";
|
|
7
|
+
import { ObjectiveValue } from "./opt-value";
|
|
8
|
+
import type { ProtoModel } from "./proto-model";
|
|
9
|
+
import { Rational } from "./rational";
|
|
10
|
+
import { RefVector } from "./ref-vector";
|
|
11
|
+
import { Rewriter, TACTIC_REWRITER_OPTIONS } from "./rewriter";
|
|
12
|
+
import type { TacticEnvironment } from "./tactic";
|
|
13
|
+
|
|
14
|
+
// The initial budget is the one of the bounded nlsat run in nla_core; the known proofs of
|
|
15
|
+
// unboundedness need 4k to 23k.
|
|
16
|
+
const UNBOUNDED_CHECK_RLIMIT = 100000;
|
|
17
|
+
const UNBOUNDED_CHECK_ROUNDS = 8;
|
|
18
|
+
const MAX_ONE_SIDED_ROUNDS = 16;
|
|
19
|
+
|
|
20
|
+
interface OptsmtHost {
|
|
21
|
+
getBaseModel(): ProtoModel | null;
|
|
22
|
+
setModel(model: ProtoModel | null): void;
|
|
23
|
+
}
|
|
24
|
+
|
|
25
|
+
export interface OptsmtParams {
|
|
26
|
+
bisectRounds: number;
|
|
27
|
+
isNlsat: boolean;
|
|
28
|
+
isDualBounds: boolean;
|
|
29
|
+
supremumRlimit: number;
|
|
30
|
+
isLexAfterUnbounded: boolean;
|
|
31
|
+
}
|
|
32
|
+
|
|
33
|
+
const NLSAT_NO_RESULT = 0;
|
|
34
|
+
const NLSAT_CERTIFIED = 1;
|
|
35
|
+
const NLSAT_INCOMPLETE = 2;
|
|
36
|
+
|
|
37
|
+
class GeometricStep {
|
|
38
|
+
private steps = 0;
|
|
39
|
+
private stepIncs = 0;
|
|
40
|
+
value = Rational.one;
|
|
41
|
+
|
|
42
|
+
// A round that cannot grow uses step one but keeps both counters.
|
|
43
|
+
update(canIncrease: boolean) {
|
|
44
|
+
if (!canIncrease) {
|
|
45
|
+
this.value = Rational.one;
|
|
46
|
+
return;
|
|
47
|
+
}
|
|
48
|
+
if (this.steps <= this.stepIncs) {
|
|
49
|
+
this.steps++;
|
|
50
|
+
return;
|
|
51
|
+
}
|
|
52
|
+
this.value = this.value.mul(Rational.of(2n));
|
|
53
|
+
this.stepIncs++;
|
|
54
|
+
this.steps = 0;
|
|
55
|
+
}
|
|
56
|
+
|
|
57
|
+
reset() {
|
|
58
|
+
this.steps = 0;
|
|
59
|
+
this.stepIncs = 0;
|
|
60
|
+
this.value = Rational.one;
|
|
61
|
+
}
|
|
62
|
+
}
|
|
63
|
+
|
|
64
|
+
// A region excludes the objective values at or below its bound, so a certificate over the region
|
|
65
|
+
// lifts to the whole search space with the values every enclosing cut discarded.
|
|
66
|
+
class ObjectiveSearch {
|
|
67
|
+
private excludedUpper = InfEps.minusInfinity;
|
|
68
|
+
private regions: InfEps[] = [];
|
|
69
|
+
|
|
70
|
+
constructor(public upper: InfEps) {}
|
|
71
|
+
|
|
72
|
+
private tightenUpper(bound: InfEps) {
|
|
73
|
+
this.upper = minInfEps(this.upper, maxInfEps(bound, this.excludedUpper));
|
|
74
|
+
}
|
|
75
|
+
|
|
76
|
+
update(result: MaximizeResult) {
|
|
77
|
+
if (result.upperBound !== null) this.tightenUpper(InfEps.of(result.upperBound));
|
|
78
|
+
if (!result.isBoundValid && result.hintStatus === L_FALSE && result.hint.isFinite())
|
|
79
|
+
this.tightenUpper(result.hint);
|
|
80
|
+
}
|
|
81
|
+
|
|
82
|
+
excludeBelow(upper: InfEps) {
|
|
83
|
+
this.excludedUpper = maxInfEps(this.excludedUpper, upper);
|
|
84
|
+
}
|
|
85
|
+
|
|
86
|
+
enterRegion(excludedUpper: InfEps) {
|
|
87
|
+
this.regions.push(this.excludedUpper);
|
|
88
|
+
this.excludeBelow(excludedUpper);
|
|
89
|
+
}
|
|
90
|
+
|
|
91
|
+
refuteRegion() {
|
|
92
|
+
this.upper = minInfEps(this.upper, this.excludedUpper);
|
|
93
|
+
}
|
|
94
|
+
|
|
95
|
+
leaveRegion(status: number) {
|
|
96
|
+
if (status === L_FALSE) this.refuteRegion();
|
|
97
|
+
this.excludedUpper = this.regions.pop() ?? this.excludedUpper;
|
|
98
|
+
}
|
|
99
|
+
|
|
100
|
+
resetRegions() {
|
|
101
|
+
if (this.regions.length > 0) this.excludedUpper = this.regions[0];
|
|
102
|
+
this.regions = [];
|
|
103
|
+
}
|
|
104
|
+
}
|
|
105
|
+
|
|
106
|
+
// The pushes that try bounds such as obj >= best + step, which may be infeasible.
|
|
107
|
+
class ScopedPushes {
|
|
108
|
+
size = 0;
|
|
109
|
+
|
|
110
|
+
constructor(private solver: OptSolver) {}
|
|
111
|
+
|
|
112
|
+
push() {
|
|
113
|
+
this.solver.push();
|
|
114
|
+
this.size++;
|
|
115
|
+
}
|
|
116
|
+
|
|
117
|
+
pop() {
|
|
118
|
+
this.solver.pop(1);
|
|
119
|
+
this.size--;
|
|
120
|
+
}
|
|
121
|
+
|
|
122
|
+
reset() {
|
|
123
|
+
if (this.size > 0) this.solver.pop(this.size);
|
|
124
|
+
this.size = 0;
|
|
125
|
+
}
|
|
126
|
+
}
|
|
127
|
+
|
|
128
|
+
export class Optsmt {
|
|
129
|
+
private solver: OptSolver | null = null;
|
|
130
|
+
private objs: RefVector;
|
|
131
|
+
readonly lower: ObjectiveValue[] = [];
|
|
132
|
+
readonly upper: ObjectiveValue[] = [];
|
|
133
|
+
readonly models: (ProtoModel | null)[] = [];
|
|
134
|
+
private model: ProtoModel | null = null;
|
|
135
|
+
private bestModel: ProtoModel | null = null;
|
|
136
|
+
private nlsatModels: ProtoModel[] = [];
|
|
137
|
+
private pinned: RefVector;
|
|
138
|
+
|
|
139
|
+
constructor(
|
|
140
|
+
private manager: AstManager,
|
|
141
|
+
private environment: TacticEnvironment,
|
|
142
|
+
private host: OptsmtHost,
|
|
143
|
+
private params: OptsmtParams,
|
|
144
|
+
) {
|
|
145
|
+
this.objs = new RefVector(manager);
|
|
146
|
+
this.pinned = new RefVector(manager);
|
|
147
|
+
}
|
|
148
|
+
|
|
149
|
+
private get optSolver() {
|
|
150
|
+
if (this.solver === null) throw new SmtUnsupportedError("optimization before setup");
|
|
151
|
+
return this.solver;
|
|
152
|
+
}
|
|
153
|
+
|
|
154
|
+
private getLower(index: number) {
|
|
155
|
+
return this.lower[index].bound;
|
|
156
|
+
}
|
|
157
|
+
|
|
158
|
+
private getUpper(index: number) {
|
|
159
|
+
return this.upper[index].bound;
|
|
160
|
+
}
|
|
161
|
+
|
|
162
|
+
add(term: number) {
|
|
163
|
+
const rewriter = new Rewriter(this.manager, TACTIC_REWRITER_OPTIONS);
|
|
164
|
+
const rewritten = rewriter.rewrite(term);
|
|
165
|
+
this.objs.push(rewritten);
|
|
166
|
+
rewriter.release();
|
|
167
|
+
this.manager.decRef(rewritten);
|
|
168
|
+
this.lower.push(ObjectiveValue.minusInfinity);
|
|
169
|
+
this.upper.push(ObjectiveValue.infinity);
|
|
170
|
+
this.models.push(null);
|
|
171
|
+
return this.objs.size - 1;
|
|
172
|
+
}
|
|
173
|
+
|
|
174
|
+
setup(solver: OptSolver) {
|
|
175
|
+
this.solver = solver;
|
|
176
|
+
solver.resetObjectives();
|
|
177
|
+
solver.push();
|
|
178
|
+
solver.pop(1);
|
|
179
|
+
for (const term of this.objs.items) solver.addObjective(term);
|
|
180
|
+
}
|
|
181
|
+
|
|
182
|
+
private publishBestModel() {
|
|
183
|
+
this.bestModel = this.model;
|
|
184
|
+
this.host.setModel(this.model);
|
|
185
|
+
}
|
|
186
|
+
|
|
187
|
+
private setBest(index: number, value: InfEps) {
|
|
188
|
+
this.lower[index] = new ObjectiveValue(value);
|
|
189
|
+
this.upper[index] = this.upper[index].withoutExact();
|
|
190
|
+
this.publishBestModel();
|
|
191
|
+
}
|
|
192
|
+
|
|
193
|
+
private updateLowerLex(index: number, value: InfEps) {
|
|
194
|
+
if (value.compare(this.getLower(index)) <= 0) return;
|
|
195
|
+
this.lower[index] = new ObjectiveValue(value);
|
|
196
|
+
for (let later = index + 1; later < this.objs.size; later++)
|
|
197
|
+
this.lower[later] = new ObjectiveValue(this.optSolver.getSavedObjectiveValue(later));
|
|
198
|
+
this.publishBestModel();
|
|
199
|
+
}
|
|
200
|
+
|
|
201
|
+
updateLowerBound(index: number, value: InfEps) {
|
|
202
|
+
this.optSolver.mkGe(index, value);
|
|
203
|
+
this.lower[index] = this.lower[index].withRationalBound(value);
|
|
204
|
+
}
|
|
205
|
+
|
|
206
|
+
// A model callback can reset the bound to infinity, which does not refine its exact value.
|
|
207
|
+
updateUpperBound(index: number, value: InfEps) {
|
|
208
|
+
this.upper[index] = value.isFinite()
|
|
209
|
+
? this.upper[index].withRationalBound(value)
|
|
210
|
+
: new ObjectiveValue(value);
|
|
211
|
+
}
|
|
212
|
+
|
|
213
|
+
// A finite, unattained limit that nlsat certified.
|
|
214
|
+
hasOpenBound(index: number) {
|
|
215
|
+
return this.lower[index].exact !== null && this.lower[index].hasInfinitesimal();
|
|
216
|
+
}
|
|
217
|
+
|
|
218
|
+
lex(index: number) {
|
|
219
|
+
const solver = this.optSolver;
|
|
220
|
+
this.bestModel = this.host.getBaseModel();
|
|
221
|
+
solver.push();
|
|
222
|
+
this.lower[index] = this.lower[index].withoutExact();
|
|
223
|
+
this.upper[index] = this.upper[index].withoutExact();
|
|
224
|
+
for (let earlier = 0; earlier < index; earlier++) this.commitAssignment(earlier);
|
|
225
|
+
const result = this.geometricSearch(index, UNBOUNDED_CHECK_ROUNDS);
|
|
226
|
+
if (result === L_TRUE)
|
|
227
|
+
for (let later = index + 1; later < this.lower.length; later++)
|
|
228
|
+
this.lower[later] = ObjectiveValue.minusInfinity;
|
|
229
|
+
solver.pop(1);
|
|
230
|
+
return result;
|
|
231
|
+
}
|
|
232
|
+
|
|
233
|
+
box() {
|
|
234
|
+
const solver = this.optSolver;
|
|
235
|
+
if (this.objs.size === 0) return L_TRUE;
|
|
236
|
+
this.bestModel = this.host.getBaseModel();
|
|
237
|
+
for (let index = 0; index < this.objs.size && this.manager.limit.inc(); index++) {
|
|
238
|
+
this.lower[index] = ObjectiveValue.minusInfinity;
|
|
239
|
+
this.upper[index] = ObjectiveValue.infinity;
|
|
240
|
+
solver.push();
|
|
241
|
+
const status = this.geometricSearch(index, UNBOUNDED_CHECK_ROUNDS);
|
|
242
|
+
solver.pop(1);
|
|
243
|
+
if (status !== L_TRUE) return status;
|
|
244
|
+
this.models[index] = this.bestModel;
|
|
245
|
+
}
|
|
246
|
+
return L_TRUE;
|
|
247
|
+
}
|
|
248
|
+
|
|
249
|
+
getBestModel() {
|
|
250
|
+
return this.bestModel;
|
|
251
|
+
}
|
|
252
|
+
|
|
253
|
+
isUnbounded(index: number, isMax: boolean) {
|
|
254
|
+
return !(isMax ? this.upper : this.lower)[index].isFinite();
|
|
255
|
+
}
|
|
256
|
+
|
|
257
|
+
commitAssignment(index: number) {
|
|
258
|
+
const solver = this.optSolver;
|
|
259
|
+
const lower = this.getLower(index);
|
|
260
|
+
const exact = this.lower[index].exact;
|
|
261
|
+
if (exact !== null && !this.manager.am.isRational(exact)) {
|
|
262
|
+
// The SMT core cannot use a root numeral, so the defining equation and its isolating
|
|
263
|
+
// interval stand for it.
|
|
264
|
+
const constraint = mkAlgebraicEq(this.manager, this.objs.items[index], exact);
|
|
265
|
+
this.pinned.push(constraint);
|
|
266
|
+
solver.assertExpr(constraint);
|
|
267
|
+
} else if (lower.isFinite()) solver.assertExpr(solver.mkGe(index, lower));
|
|
268
|
+
}
|
|
269
|
+
|
|
270
|
+
private geometricSearch(index: number, initialCheckRounds: number) {
|
|
271
|
+
const manager = this.manager;
|
|
272
|
+
const solver = this.optSolver;
|
|
273
|
+
const isInt = manager.isInt(this.objs.items[index]);
|
|
274
|
+
let status = L_TRUE;
|
|
275
|
+
let bound = -1;
|
|
276
|
+
let lastBound = -1;
|
|
277
|
+
const step = new GeometricStep();
|
|
278
|
+
const scopes = new ScopedPushes(solver);
|
|
279
|
+
const search = new ObjectiveSearch(this.getUpper(index));
|
|
280
|
+
let lastObjective = InfEps.minusInfinity;
|
|
281
|
+
let isLastBoundValid = true;
|
|
282
|
+
let climbRounds = 0;
|
|
283
|
+
let unboundedCheckRounds = initialCheckRounds;
|
|
284
|
+
let unboundedCheckRlimit = UNBOUNDED_CHECK_RLIMIT;
|
|
285
|
+
const enterRegion = (objective: InfEps) => {
|
|
286
|
+
scopes.push();
|
|
287
|
+
const excluded = objective.add(InfEps.of(step.value));
|
|
288
|
+
search.enterRegion(excluded);
|
|
289
|
+
return solver.mkGe(index, excluded);
|
|
290
|
+
};
|
|
291
|
+
while (manager.limit.inc()) {
|
|
292
|
+
status = solver.check();
|
|
293
|
+
if (status === L_TRUE) {
|
|
294
|
+
// Once a finite cap is known, the search refines it without more probes.
|
|
295
|
+
const maximized = solver.maximizeObjective(
|
|
296
|
+
index,
|
|
297
|
+
this.params.isDualBounds && !isInt,
|
|
298
|
+
!search.upper.isFinite(),
|
|
299
|
+
);
|
|
300
|
+
bound = maximized.blocker;
|
|
301
|
+
isLastBoundValid = maximized.result.isBoundValid;
|
|
302
|
+
search.update(maximized.result);
|
|
303
|
+
this.upper[index] = new ObjectiveValue(search.upper);
|
|
304
|
+
this.model = solver.getModel();
|
|
305
|
+
const objective = solver.getSavedObjectiveValue(index);
|
|
306
|
+
this.updateLowerLex(index, objective);
|
|
307
|
+
if (manager.limit.isExhausted()) {
|
|
308
|
+
status = L_UNDEF;
|
|
309
|
+
break;
|
|
310
|
+
}
|
|
311
|
+
step.update(isInt && this.lower[index].isFinite());
|
|
312
|
+
// A real objective may improve forever without refuting an upper bound, so a streak of
|
|
313
|
+
// improvements tries to prove it unbounded, with a budget and retries that back off.
|
|
314
|
+
if (isInt || search.upper.isFinite()) climbRounds = 0;
|
|
315
|
+
else if (this.params.isNlsat && ++climbRounds >= unboundedCheckRounds) {
|
|
316
|
+
climbRounds = 0;
|
|
317
|
+
unboundedCheckRounds *= 2;
|
|
318
|
+
if (this.proveUnboundedAbove(index, unboundedCheckRlimit)) {
|
|
319
|
+
this.setBest(index, InfEps.infinity);
|
|
320
|
+
break;
|
|
321
|
+
}
|
|
322
|
+
if (unboundedCheckRlimit <= 0xffffffff / 2) unboundedCheckRlimit *= 2;
|
|
323
|
+
}
|
|
324
|
+
// An unvalidated hint gives a blocker beyond any model, so the model's value steps instead.
|
|
325
|
+
if (
|
|
326
|
+
!isLastBoundValid ||
|
|
327
|
+
step.value.compare(Rational.one) > 0 ||
|
|
328
|
+
(objective.equals(lastObjective) && isInt)
|
|
329
|
+
)
|
|
330
|
+
bound = enterRegion(objective);
|
|
331
|
+
lastObjective = objective;
|
|
332
|
+
if (bound === lastBound) {
|
|
333
|
+
// The model's value may beat the relaxation where nonlinear terms, mod or to_int hide
|
|
334
|
+
// part of the feasible region from it.
|
|
335
|
+
if (this.lower[index].isFinite() && this.getLower(index).compare(objective) > 0)
|
|
336
|
+
bound = solver.mkGe(index, this.getLower(index));
|
|
337
|
+
// An objective infinitesimally above the previous strict bound is not an optimum: the
|
|
338
|
+
// relaxation could not leave the bound, so the search steps beyond it.
|
|
339
|
+
if (bound === lastBound && objective.epsilon.isPositive()) bound = enterRegion(objective);
|
|
340
|
+
if (bound === lastBound) break;
|
|
341
|
+
}
|
|
342
|
+
search.excludeBelow(maxInfEps(objective, this.getLower(index)));
|
|
343
|
+
solver.assertExpr(bound);
|
|
344
|
+
lastBound = bound;
|
|
345
|
+
continue;
|
|
346
|
+
}
|
|
347
|
+
if (status === L_FALSE && step.value.compare(Rational.one) > 0) {
|
|
348
|
+
step.reset();
|
|
349
|
+
scopes.pop();
|
|
350
|
+
search.leaveRegion(status);
|
|
351
|
+
this.upper[index] = new ObjectiveValue(search.upper);
|
|
352
|
+
continue;
|
|
353
|
+
}
|
|
354
|
+
if (status === L_FALSE) {
|
|
355
|
+
search.refuteRegion();
|
|
356
|
+
this.upper[index] = new ObjectiveValue(search.upper);
|
|
357
|
+
}
|
|
358
|
+
// After the model-derived step, a refuted region does not make the model's value optimal.
|
|
359
|
+
if (
|
|
360
|
+
((status === L_FALSE && !isLastBoundValid) || status === L_UNDEF) &&
|
|
361
|
+
!isInt &&
|
|
362
|
+
this.lower[index].isFinite()
|
|
363
|
+
) {
|
|
364
|
+
const upper = search.upper;
|
|
365
|
+
if (this.getLower(index).compare(upper) < 0) {
|
|
366
|
+
scopes.reset();
|
|
367
|
+
search.resetRegions();
|
|
368
|
+
status = this.refineRealObjective(index, upper, status === L_UNDEF);
|
|
369
|
+
}
|
|
370
|
+
}
|
|
371
|
+
break;
|
|
372
|
+
}
|
|
373
|
+
scopes.reset();
|
|
374
|
+
if (status === L_FALSE && this.model === null) return L_FALSE;
|
|
375
|
+
if (!manager.limit.inc() || status === L_UNDEF) return L_UNDEF;
|
|
376
|
+
// Without a model value the lower bound is still -oo, which is no optimum.
|
|
377
|
+
if (!this.lower[index].isFinite() && this.getLower(index).isNegative()) return L_UNDEF;
|
|
378
|
+
if (this.lower[index].exact === null) this.upper[index] = this.lower[index];
|
|
379
|
+
return L_TRUE;
|
|
380
|
+
}
|
|
381
|
+
|
|
382
|
+
private getHard() {
|
|
383
|
+
return [...this.optSolver.getAssertions()];
|
|
384
|
+
}
|
|
385
|
+
|
|
386
|
+
// Projects the feasible nlsat regions onto the objective, within a resource budget; the bounds
|
|
387
|
+
// the climb pushed hold in the current model.
|
|
388
|
+
private proveUnboundedAbove(index: number, rlimit: number) {
|
|
389
|
+
if (!this.lower[index].isFinite()) return false;
|
|
390
|
+
const engine = new NlsatOpt(this.manager, this.environment);
|
|
391
|
+
const limit = this.manager.limit;
|
|
392
|
+
limit.push(rlimit);
|
|
393
|
+
try {
|
|
394
|
+
return (
|
|
395
|
+
engine.proveUnbounded(
|
|
396
|
+
this.getHard(),
|
|
397
|
+
this.objs.items[index],
|
|
398
|
+
this.getLower(index).value,
|
|
399
|
+
) === L_TRUE
|
|
400
|
+
);
|
|
401
|
+
} catch (error) {
|
|
402
|
+
if (!(error instanceof SmtCanceledError)) throw error;
|
|
403
|
+
return false;
|
|
404
|
+
} finally {
|
|
405
|
+
limit.pop();
|
|
406
|
+
}
|
|
407
|
+
}
|
|
408
|
+
|
|
409
|
+
private refineRealObjective(index: number, upper: InfEps, isSmtGivingUp: boolean) {
|
|
410
|
+
if (this.params.isNlsat) {
|
|
411
|
+
const outcome = (() => {
|
|
412
|
+
try {
|
|
413
|
+
return this.optimizeNlsatCells(index, upper);
|
|
414
|
+
} catch (error) {
|
|
415
|
+
if (!(error instanceof SmtCanceledError)) throw error;
|
|
416
|
+
return null;
|
|
417
|
+
}
|
|
418
|
+
})();
|
|
419
|
+
if (outcome === null || outcome === NLSAT_INCOMPLETE) return L_UNDEF;
|
|
420
|
+
if (outcome === NLSAT_CERTIFIED) return L_TRUE;
|
|
421
|
+
}
|
|
422
|
+
if (!upper.isFinite() || isSmtGivingUp) return L_UNDEF;
|
|
423
|
+
if (this.getLower(index).compare(upper) < 0) return this.bisect(index, upper);
|
|
424
|
+
return L_TRUE;
|
|
425
|
+
}
|
|
426
|
+
|
|
427
|
+
// Maximizes the objective over the nlsat cells of the assertions within [lower, upper]. An
|
|
428
|
+
// irrational optimum keeps its exact value with outward rational brackets, and an open limit
|
|
429
|
+
// is sup - epsilon.
|
|
430
|
+
private optimizeNlsatCells(index: number, upper: InfEps) {
|
|
431
|
+
if (!this.lower[index].isFinite()) return NLSAT_NO_RESULT;
|
|
432
|
+
const optimized = new NlsatOpt(this.manager, this.environment).maximize(
|
|
433
|
+
this.getHard(),
|
|
434
|
+
this.objs.items[index],
|
|
435
|
+
this.getLower(index).value,
|
|
436
|
+
upper.isFinite() ? upper.value : null,
|
|
437
|
+
this.params.bisectRounds,
|
|
438
|
+
this.params.supremumRlimit,
|
|
439
|
+
);
|
|
440
|
+
const result = optimized.result;
|
|
441
|
+
if (!result.hasModel) return NLSAT_NO_RESULT;
|
|
442
|
+
const model = result.model;
|
|
443
|
+
const certified = result.sup;
|
|
444
|
+
this.nlsatModels.push(model);
|
|
445
|
+
if (result.isUnbounded) {
|
|
446
|
+
this.model = model;
|
|
447
|
+
this.setBest(index, InfEps.infinity);
|
|
448
|
+
this.upper[index] = this.lower[index];
|
|
449
|
+
return NLSAT_CERTIFIED;
|
|
450
|
+
}
|
|
451
|
+
if (certified?.isOpen === true) {
|
|
452
|
+
// The model is a feasible witness below the limit.
|
|
453
|
+
this.model = model;
|
|
454
|
+
const lower = InfEps.of(certified.lower, Rational.minusOne);
|
|
455
|
+
this.setBest(index, lower);
|
|
456
|
+
this.lower[index] = new ObjectiveValue(lower, certified.value);
|
|
457
|
+
this.upper[index] = new ObjectiveValue(
|
|
458
|
+
InfEps.of(certified.upper, Rational.minusOne),
|
|
459
|
+
certified.value,
|
|
460
|
+
);
|
|
461
|
+
return NLSAT_CERTIFIED;
|
|
462
|
+
}
|
|
463
|
+
const value = InfEps.of(result.lower);
|
|
464
|
+
if (value.compare(this.getLower(index)) < 0) return NLSAT_NO_RESULT;
|
|
465
|
+
this.model = model;
|
|
466
|
+
this.setBest(index, value);
|
|
467
|
+
if (optimized.status === L_TRUE) {
|
|
468
|
+
this.lower[index] = new ObjectiveValue(value, result.value);
|
|
469
|
+
this.upper[index] = new ObjectiveValue(InfEps.of(result.upper), result.value);
|
|
470
|
+
return NLSAT_CERTIFIED;
|
|
471
|
+
}
|
|
472
|
+
const sup = certified === null ? upper : minInfEps(InfEps.of(certified.upper), upper);
|
|
473
|
+
this.upper[index] = new ObjectiveValue(
|
|
474
|
+
sup.compare(this.getLower(index)) < 0 ? this.getLower(index) : sup,
|
|
475
|
+
);
|
|
476
|
+
return NLSAT_INCOMPLETE;
|
|
477
|
+
}
|
|
478
|
+
|
|
479
|
+
// Searches [lower, upper] when the arithmetic cannot push a real objective: obj > lower proves
|
|
480
|
+
// lower optimal when unsatisfiable, and obj >= (lower + upper) / 2 halves the gap.
|
|
481
|
+
private bisect(index: number, initialUpper: InfEps) {
|
|
482
|
+
const manager = this.manager;
|
|
483
|
+
const solver = this.optSolver;
|
|
484
|
+
let lower = this.getLower(index);
|
|
485
|
+
let upper = initialUpper;
|
|
486
|
+
const search = new ObjectiveSearch(upper);
|
|
487
|
+
const epsilon = InfEps.of(Rational.zero, Rational.one);
|
|
488
|
+
let isStrict = true;
|
|
489
|
+
let result = L_UNDEF;
|
|
490
|
+
for (
|
|
491
|
+
let rounds = 0;
|
|
492
|
+
manager.limit.inc() && lower.compare(upper) < 0 && rounds < this.params.bisectRounds;
|
|
493
|
+
rounds++, isStrict = !isStrict
|
|
494
|
+
) {
|
|
495
|
+
const bound = isStrict
|
|
496
|
+
? lower.add(epsilon)
|
|
497
|
+
: new InfEps(
|
|
498
|
+
lower.infinity.add(upper.infinity).div(Rational.of(2n)),
|
|
499
|
+
lower.value.add(upper.value).div(Rational.of(2n)),
|
|
500
|
+
lower.epsilon.add(upper.epsilon).div(Rational.of(2n)),
|
|
501
|
+
);
|
|
502
|
+
solver.push();
|
|
503
|
+
search.enterRegion(isStrict ? lower : bound);
|
|
504
|
+
solver.assertExpr(solver.mkGe(index, bound));
|
|
505
|
+
const status = solver.check();
|
|
506
|
+
if (status === L_TRUE) this.model = solver.getModel();
|
|
507
|
+
solver.pop(1);
|
|
508
|
+
search.leaveRegion(status);
|
|
509
|
+
upper = search.upper;
|
|
510
|
+
this.upper[index] = new ObjectiveValue(upper);
|
|
511
|
+
if (status === L_TRUE) {
|
|
512
|
+
const model = this.model;
|
|
513
|
+
if (model === null) break;
|
|
514
|
+
// An algebraic model value is no numeral, so the bound it satisfies stands for it.
|
|
515
|
+
const evaluated = model.eval(this.objs.items[index], false);
|
|
516
|
+
const numeral = manager.isNumeral(evaluated) ? manager.getRationalValue(evaluated) : null;
|
|
517
|
+
manager.decRef(evaluated);
|
|
518
|
+
const isAboveBound = numeral !== null && InfEps.of(numeral).compare(bound) >= 0;
|
|
519
|
+
if (!isAboveBound && isStrict) continue;
|
|
520
|
+
const value = isAboveBound && numeral !== null ? InfEps.of(numeral) : bound;
|
|
521
|
+
if (value.compare(lower) > 0) {
|
|
522
|
+
lower = value;
|
|
523
|
+
this.setBest(index, value);
|
|
524
|
+
}
|
|
525
|
+
} else if (status === L_FALSE) {
|
|
526
|
+
if (isStrict) {
|
|
527
|
+
result = L_TRUE;
|
|
528
|
+
break;
|
|
529
|
+
}
|
|
530
|
+
} else break;
|
|
531
|
+
}
|
|
532
|
+
this.lower[index] = new ObjectiveValue(lower);
|
|
533
|
+
this.upper[index] = new ObjectiveValue(upper);
|
|
534
|
+
return result === L_TRUE || lower.equals(upper) ? L_TRUE : L_UNDEF;
|
|
535
|
+
}
|
|
536
|
+
|
|
537
|
+
// Whether objective index still has the supremum +oo under the current assertions, with a
|
|
538
|
+
// feasible witness from the search; all objective bounds are restored afterwards.
|
|
539
|
+
private reachesInfinity(index: number) {
|
|
540
|
+
const lower = [...this.lower];
|
|
541
|
+
const upper = [...this.upper];
|
|
542
|
+
const best = this.bestModel;
|
|
543
|
+
const model = this.model;
|
|
544
|
+
this.lower[index] = ObjectiveValue.minusInfinity;
|
|
545
|
+
this.upper[index] = ObjectiveValue.infinity;
|
|
546
|
+
// geometricSearch reports infeasibility only without a model.
|
|
547
|
+
this.model = null;
|
|
548
|
+
const solver = this.optSolver;
|
|
549
|
+
solver.push();
|
|
550
|
+
// The objective is known to be unbounded, so one climb round precedes the proof.
|
|
551
|
+
const status = this.geometricSearch(index, 1);
|
|
552
|
+
solver.pop(1);
|
|
553
|
+
const isUnbounded = status === L_TRUE && !this.upper[index].isFinite();
|
|
554
|
+
const witness = isUnbounded ? this.bestModel : null;
|
|
555
|
+
this.lower.splice(0, lower.length, ...lower);
|
|
556
|
+
this.upper.splice(0, upper.length, ...upper);
|
|
557
|
+
this.bestModel = best;
|
|
558
|
+
this.model = model;
|
|
559
|
+
return { status: status === L_UNDEF ? L_UNDEF : isUnbounded ? L_TRUE : L_FALSE, witness };
|
|
560
|
+
}
|
|
561
|
+
|
|
562
|
+
private getModelObjectiveValue(index: number, model: ProtoModel | null) {
|
|
563
|
+
if (model === null) return undefined;
|
|
564
|
+
const evaluated = model.eval(this.objs.items[index], false);
|
|
565
|
+
const value = getModelValueBound(this.manager, this.manager.am, evaluated, true);
|
|
566
|
+
this.manager.decRef(evaluated);
|
|
567
|
+
return value;
|
|
568
|
+
}
|
|
569
|
+
|
|
570
|
+
// Objective unbounded is +oo, so objective index takes L = lim_{c -> +oo} sup { f : F, u > c }.
|
|
571
|
+
// A threshold t with F, f >= t keeping u unbounded has t <= L; one with F, f > t leaving u
|
|
572
|
+
// bounded has L <= t. Thresholds come from model values and the relaxation's hints; a limit of
|
|
573
|
+
// +-oo is never certified, and without a deciding threshold f keeps the interval [lo, hi].
|
|
574
|
+
lexAfterUnbounded(unbounded: number, index: number) {
|
|
575
|
+
if (!this.params.isLexAfterUnbounded) return L_TRUE;
|
|
576
|
+
const manager = this.manager;
|
|
577
|
+
const solver = this.optSolver;
|
|
578
|
+
const objective = this.objs.items[index];
|
|
579
|
+
const isInt = manager.isInt(objective);
|
|
580
|
+
let lower = InfEps.minusInfinity;
|
|
581
|
+
let upper = InfEps.infinity;
|
|
582
|
+
let candidate: Rational | null = null;
|
|
583
|
+
// f > lower keeps u unbounded, so lower is no limit unless upper closes in.
|
|
584
|
+
let isAboveLowerFeasible = false;
|
|
585
|
+
let best: ProtoModel | null = null;
|
|
586
|
+
const step = new GeometricStep();
|
|
587
|
+
const scopes = new ScopedPushes(solver);
|
|
588
|
+
let result = L_UNDEF;
|
|
589
|
+
let isDecided = false;
|
|
590
|
+
let oneSidedRounds = 0;
|
|
591
|
+
for (let rounds = 0; manager.limit.inc() && rounds < this.params.bisectRounds; rounds++) {
|
|
592
|
+
if (
|
|
593
|
+
isInt &&
|
|
594
|
+
lower.isFinite() &&
|
|
595
|
+
upper.isFinite() &&
|
|
596
|
+
upper.value.compare(lower.value.add(Rational.one)) <= 0
|
|
597
|
+
) {
|
|
598
|
+
isDecided = true;
|
|
599
|
+
break;
|
|
600
|
+
}
|
|
601
|
+
if (
|
|
602
|
+
best !== null &&
|
|
603
|
+
(!lower.isFinite() || !upper.isFinite()) &&
|
|
604
|
+
++oneSidedRounds > MAX_ONE_SIDED_ROUNDS
|
|
605
|
+
)
|
|
606
|
+
break;
|
|
607
|
+
let hasTrial = true;
|
|
608
|
+
let isStrict = false;
|
|
609
|
+
let threshold = Rational.zero;
|
|
610
|
+
if (
|
|
611
|
+
candidate !== null &&
|
|
612
|
+
InfEps.of(candidate).compare(lower) > 0 &&
|
|
613
|
+
InfEps.of(candidate).compare(upper) < 0
|
|
614
|
+
)
|
|
615
|
+
threshold = candidate;
|
|
616
|
+
else if (best === null) hasTrial = false;
|
|
617
|
+
else if (!lower.isFinite()) threshold = upper.value.sub(step.value);
|
|
618
|
+
else if (!upper.isFinite()) threshold = lower.value.add(step.value);
|
|
619
|
+
else if (!isInt && !isAboveLowerFeasible) {
|
|
620
|
+
threshold = lower.value;
|
|
621
|
+
isStrict = true;
|
|
622
|
+
} else {
|
|
623
|
+
threshold = lower.value.add(upper.value).div(Rational.of(2n));
|
|
624
|
+
if (isInt) threshold = threshold.floor();
|
|
625
|
+
}
|
|
626
|
+
if (isInt && hasTrial) threshold = threshold.ceil();
|
|
627
|
+
candidate = null;
|
|
628
|
+
scopes.push();
|
|
629
|
+
if (hasTrial) {
|
|
630
|
+
const numeral = manager.mkNumeralOfSort(threshold, isInt ? SORT_INT : SORT_REAL);
|
|
631
|
+
const trial = manager.mkApp(isStrict ? OP_GT : OP_GE, [objective, numeral], SORT_BOOL);
|
|
632
|
+
this.pinned.push(trial);
|
|
633
|
+
solver.assertExpr(trial);
|
|
634
|
+
}
|
|
635
|
+
const reached = this.reachesInfinity(unbounded);
|
|
636
|
+
let hint: InfEps | null = null;
|
|
637
|
+
if (reached.status === L_TRUE && solver.check() === L_TRUE) {
|
|
638
|
+
// The relaxation's largest value of f under the trial is only a threshold to check.
|
|
639
|
+
const maximized = solver.maximizeObjective(index, false, false);
|
|
640
|
+
if (maximized.result.isBoundValid && maximized.result.hint.isFinite())
|
|
641
|
+
hint = maximized.result.hint;
|
|
642
|
+
}
|
|
643
|
+
scopes.pop();
|
|
644
|
+
if (reached.status === L_UNDEF) {
|
|
645
|
+
result = L_UNDEF;
|
|
646
|
+
break;
|
|
647
|
+
}
|
|
648
|
+
result = L_TRUE;
|
|
649
|
+
if (reached.status === L_TRUE) {
|
|
650
|
+
best = reached.witness;
|
|
651
|
+
if (hasTrial && isStrict) isAboveLowerFeasible = true;
|
|
652
|
+
else if (hasTrial) {
|
|
653
|
+
lower = InfEps.of(threshold);
|
|
654
|
+
isAboveLowerFeasible = false;
|
|
655
|
+
}
|
|
656
|
+
const value = this.getModelObjectiveValue(index, best);
|
|
657
|
+
if (value !== undefined && InfEps.of(value).compare(lower) > 0) candidate = value;
|
|
658
|
+
if (
|
|
659
|
+
hint !== null &&
|
|
660
|
+
hint.compare(lower) > 0 &&
|
|
661
|
+
(candidate === null || hint.value.compare(candidate) > 0)
|
|
662
|
+
)
|
|
663
|
+
candidate = hint.value;
|
|
664
|
+
step.update(true);
|
|
665
|
+
continue;
|
|
666
|
+
}
|
|
667
|
+
if (!hasTrial) break;
|
|
668
|
+
if (isStrict) {
|
|
669
|
+
isDecided = true;
|
|
670
|
+
break;
|
|
671
|
+
}
|
|
672
|
+
upper = InfEps.of(threshold);
|
|
673
|
+
step.reset();
|
|
674
|
+
}
|
|
675
|
+
scopes.reset();
|
|
676
|
+
this.lower[index] = new ObjectiveValue(lower);
|
|
677
|
+
this.upper[index] = new ObjectiveValue(isDecided ? lower : upper);
|
|
678
|
+
if (best !== null) {
|
|
679
|
+
this.model = best;
|
|
680
|
+
this.publishBestModel();
|
|
681
|
+
}
|
|
682
|
+
return result;
|
|
683
|
+
}
|
|
684
|
+
|
|
685
|
+
release() {
|
|
686
|
+
this.objs.reset();
|
|
687
|
+
this.pinned.reset();
|
|
688
|
+
for (const model of this.nlsatModels) model.decRef();
|
|
689
|
+
this.nlsatModels = [];
|
|
690
|
+
this.solver = null;
|
|
691
|
+
}
|
|
692
|
+
}
|