tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.7a3bb1545
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 +3 -3
- package/dist/compile.js +1 -1
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +58 -54
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +4 -1
- package/dist/index.d.ts +4 -1
- 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 +2682 -426
- package/dist/prove.js +2679 -423
- package/dist/run.cjs +43 -42
- package/dist/run.js +45 -44
- package/dist/tlapm.cjs +1 -1
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +43 -40
- package/dist/transfer.js +43 -40
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +3 -3
- package/src/bags.ts +46 -28
- package/src/check-trace.ts +2 -16
- package/src/check.ts +336 -88
- package/src/cli/runtime-invariants.ts +20 -56
- package/src/cli/tlapm.ts +424 -62
- package/src/cli/tlc-arguments.ts +2 -2
- package/src/cli/tlc-output.ts +4 -5
- package/src/cli/tlc-usage.ts +0 -1
- package/src/cli/tlc.ts +26 -7
- package/src/dependencies.ts +23 -2
- package/src/dfid.ts +9 -2
- package/src/environment.ts +27 -5
- package/src/errors.ts +30 -3
- package/src/evaluate.ts +9 -3
- package/src/exit-codes.ts +5 -2
- package/src/instances.ts +1 -1
- package/src/levels.ts +3 -2
- package/src/lexer.ts +5 -3
- package/src/liveness-checker.ts +572 -204
- package/src/liveness.ts +47 -32
- package/src/obligations/action.ts +10 -6
- package/src/obligations/anonymize.ts +33 -14
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +18 -6
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +22 -17
- package/src/obligations/index.ts +36 -6
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +1 -3
- package/src/obligations/normalize.ts +24 -13
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +43 -13
- package/src/obligations/proof.ts +3 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +17 -7
- package/src/obligations/source.ts +71 -17
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +0 -2
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +8 -2
- package/src/parallel.ts +7 -2
- package/src/parser.ts +633 -186
- package/src/pretty-print.ts +1 -1
- package/src/prover/deciders.ts +11 -8
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +71 -41
- 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 +149 -3
- package/src/prover/isabelle/isar/method.ts +506 -198
- 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 +479 -69
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +83 -8
- package/src/prover/isabelle/provers/blast/blast.ts +0 -2
- 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 +2 -4
- package/src/prover/isabelle/pure/bicompose.ts +0 -2
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +0 -2
- package/src/prover/isabelle/pure/drule.ts +63 -4
- 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 +0 -2
- 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 +0 -2
- package/src/prover/isabelle/pure/rewriter.ts +1 -8
- 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 +0 -2
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +0 -2
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +0 -2
- package/src/prover/isabelle/pure/thm.ts +0 -2
- 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 +1 -2
- package/src/prover/isabelle/tla/context.ts +51 -9
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +40 -1
- package/src/prover/isabelle/tla/simpdata.ts +0 -2
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +19 -12
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/methods.ts +159 -50
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +343 -65
- 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 +42 -6
- package/src/prover/smt/data.ts +191 -84
- package/src/prover/smt/encode.ts +122 -43
- 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 +483 -116
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
- package/src/prover/smt/solver/ackr-helper.ts +179 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
- package/src/prover/smt/solver/act-cache.ts +0 -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 +613 -6
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +309 -0
- package/src/prover/smt/solver/asserted-formulas.ts +93 -15
- 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 +1448 -41
- package/src/prover/smt/solver/auf-solver.ts +0 -1
- package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +600 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +109 -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 +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +533 -114
- package/src/prover/smt/solver/ctx-simplify.ts +21 -12
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
- package/src/prover/smt/solver/der.ts +38 -10
- package/src/prover/smt/solver/diff-neq.ts +205 -0
- package/src/prover/smt/solver/distribute-forall.ts +57 -0
- package/src/prover/smt/solver/dom-simplify.ts +511 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -1
- package/src/prover/smt/solver/e-matching.ts +6 -7
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
- package/src/prover/smt/solver/enode.ts +100 -3
- package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +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 +267 -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 +884 -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 +348 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +177 -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 +30 -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 +109 -36
- 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 +345 -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 +18 -3
- 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 +0 -2
- 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 +0 -1
- 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 +40 -4
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
- 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 +66 -11
- 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 +118 -88
- 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 +309 -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 +105 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +17 -26
- package/src/prover/smt/solver/model-evaluator.ts +188 -12
- package/src/prover/smt/solver/model-finder.ts +0 -1
- package/src/prover/smt/solver/model-generator.ts +59 -30
- package/src/prover/smt/solver/model-macro-solver.ts +38 -27
- 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 +410 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +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 +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +305 -88
- package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +424 -211
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
- package/src/prover/smt/solver/nlsat/solver.ts +282 -69
- 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 +8 -7
- 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 +105 -23
- 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 +792 -0
- package/src/prover/smt/solver/opt-nlsat.ts +386 -0
- package/src/prover/smt/solver/opt-pareto.ts +282 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +311 -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 +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +202 -57
- package/src/prover/smt/solver/probes.ts +511 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +650 -17
- package/src/prover/smt/solver/pull-quant.ts +28 -12
- package/src/prover/smt/solver/purify-arith.ts +632 -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 +37 -17
- 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 +814 -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 +9 -10
- package/src/prover/smt/solver/quantifier-manager.ts +25 -24
- 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 +77 -10
- package/src/prover/smt/solver/rewriter.ts +475 -36
- package/src/prover/smt/solver/rlimit.ts +38 -2
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2105 -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 +90 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +496 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3154 -326
- package/src/prover/smt/solver/smtlib-script.ts +1702 -0
- package/src/prover/smt/solver/solve-eqs.ts +923 -0
- package/src/prover/smt/solver/solver.ts +113 -22
- 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 +1995 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1200 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -5
- package/src/prover/smt/solver/theory-lra-final-check.ts +56 -71
- package/src/prover/smt/solver/theory-lra-internalize.ts +89 -11
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -28
- package/src/prover/smt/solver/theory-lra-state.ts +6 -22
- package/src/prover/smt/solver/theory-lra.ts +188 -2
- package/src/prover/smt/solver/theory-pb.ts +933 -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.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +485 -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 +29 -8
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +2 -0
- package/src/prover/zenon/decide.ts +10 -7
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +0 -2
- package/src/prover/zenon/equality-rules.ts +24 -2
- package/src/prover/zenon/expr.ts +21 -2
- package/src/prover/zenon/index-table.ts +7 -4
- package/src/prover/zenon/isar-case.ts +1 -3
- package/src/prover/zenon/isar.ts +2 -4
- package/src/prover/zenon/llproof.ts +0 -2
- package/src/prover/zenon/mltoll.ts +0 -2
- package/src/prover/zenon/node.ts +20 -5
- package/src/prover/zenon/parse.ts +6 -2
- 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 +7 -5
- package/src/prover/zenon/tla/functions.ts +0 -2
- package/src/prover/zenon/tla/llproof.ts +0 -2
- package/src/prover/zenon/tla/records.ts +0 -2
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +7 -8
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +0 -2
- package/src/resolve.ts +72 -36
- package/src/runtime.ts +6 -0
- package/src/sany/generation.ts +1 -13
- package/src/sany/generator-definitions.ts +1 -1
- package/src/sany/generator-expressions.ts +9 -17
- package/src/sany/generator-proofs.ts +1 -1
- package/src/sany/generator.ts +1 -1
- package/src/sany/levels.ts +0 -2
- package/src/sany/linter.ts +0 -2
- package/src/search.ts +198 -45
- package/src/simulate.ts +3 -0
- package/src/standard-definitions.ts +4 -0
- package/src/state-graph.ts +0 -2
- package/src/subexpressions.ts +4 -2
- package/src/successors.ts +1 -1
- package/src/symmetry.ts +2 -2
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/jar-data.ts +12 -0
- package/src/tlc/order.ts +14 -3
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlcext-operators.ts +61 -16
- package/src/tlc/trace-spec.ts +2 -3
- package/src/typed-tier.ts +6541 -0
- package/src/typescript/types.ts +2 -2
- package/src/values.ts +1 -1
- 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,386 @@
|
|
|
1
|
+
import { SmtCanceledError, SmtTacticError } from "../../../errors";
|
|
2
|
+
import {
|
|
3
|
+
type AstManager,
|
|
4
|
+
FAMILY_ARITH,
|
|
5
|
+
FAMILY_BASIC,
|
|
6
|
+
FAMILY_USER,
|
|
7
|
+
KIND_APP,
|
|
8
|
+
OP_ADD,
|
|
9
|
+
OP_AND,
|
|
10
|
+
OP_EQ,
|
|
11
|
+
OP_GE,
|
|
12
|
+
OP_LE,
|
|
13
|
+
OP_MUL,
|
|
14
|
+
OP_TO_INT,
|
|
15
|
+
SORT_BOOL,
|
|
16
|
+
SORT_INT,
|
|
17
|
+
SORT_REAL,
|
|
18
|
+
} from "./ast";
|
|
19
|
+
import { Goal } from "./goal";
|
|
20
|
+
import { goal2nlsat } from "./goal2nlsat";
|
|
21
|
+
import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
|
|
22
|
+
import type { AlgebraicManager, Anum } from "./nlsat/algebraic";
|
|
23
|
+
import { PolynomialManager, PolynomialRef } from "./nlsat/polynomial";
|
|
24
|
+
import { NlsatSolver } from "./nlsat/solver";
|
|
25
|
+
import { ProtoModel } from "./proto-model";
|
|
26
|
+
import { Rational } from "./rational";
|
|
27
|
+
import { RefVector } from "./ref-vector";
|
|
28
|
+
import { compileInternalTactic, convertModel, type TacticEnvironment } from "./tactic";
|
|
29
|
+
|
|
30
|
+
const PREPROCESSOR =
|
|
31
|
+
"(and-then (using-params simplify :elim_and true :blast_distinct true) " +
|
|
32
|
+
"(using-params purify-arith :complete false) propagate-values elim-term-ite " +
|
|
33
|
+
"(using-params purify-arith :complete false) " +
|
|
34
|
+
"(using-params simplify :elim_and true :blast_distinct true) tseitin-cnf-core " +
|
|
35
|
+
"(using-params simplify :elim_and true :blast_distinct true))";
|
|
36
|
+
|
|
37
|
+
interface NlsatSupremum {
|
|
38
|
+
value: Anum;
|
|
39
|
+
lower: Rational;
|
|
40
|
+
upper: Rational;
|
|
41
|
+
isOpen: boolean;
|
|
42
|
+
}
|
|
43
|
+
|
|
44
|
+
interface NlsatNoModel {
|
|
45
|
+
hasModel: false;
|
|
46
|
+
}
|
|
47
|
+
|
|
48
|
+
interface NlsatOptimum {
|
|
49
|
+
hasModel: true;
|
|
50
|
+
model: ProtoModel;
|
|
51
|
+
value: Anum;
|
|
52
|
+
lower: Rational;
|
|
53
|
+
upper: Rational;
|
|
54
|
+
isUnbounded: boolean;
|
|
55
|
+
sup: NlsatSupremum | null;
|
|
56
|
+
}
|
|
57
|
+
|
|
58
|
+
interface NlsatOptOutcome {
|
|
59
|
+
status: number;
|
|
60
|
+
result: NlsatNoModel | NlsatOptimum;
|
|
61
|
+
}
|
|
62
|
+
|
|
63
|
+
interface PreprocessedGoal {
|
|
64
|
+
status: typeof L_TRUE;
|
|
65
|
+
goal: Goal;
|
|
66
|
+
objective: number;
|
|
67
|
+
}
|
|
68
|
+
|
|
69
|
+
interface PreprocessedNothing {
|
|
70
|
+
status: typeof L_FALSE | typeof L_UNDEF;
|
|
71
|
+
}
|
|
72
|
+
|
|
73
|
+
const NO_MODEL: NlsatNoModel = { hasModel: false };
|
|
74
|
+
|
|
75
|
+
interface Loaded {
|
|
76
|
+
solver: NlsatSolver;
|
|
77
|
+
variable: number;
|
|
78
|
+
x2t: Map<number, number>;
|
|
79
|
+
a2b: Map<number, number>;
|
|
80
|
+
}
|
|
81
|
+
|
|
82
|
+
export const isInNraFragment = (manager: AstManager, exprs: readonly number[]) => {
|
|
83
|
+
const seen = new Set<number>();
|
|
84
|
+
const todo = [...exprs];
|
|
85
|
+
for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
|
|
86
|
+
if (seen.has(expr)) continue;
|
|
87
|
+
seen.add(expr);
|
|
88
|
+
if (manager.kinds[expr] !== KIND_APP) return false;
|
|
89
|
+
const family = manager.getFamily(expr);
|
|
90
|
+
const isAllowed =
|
|
91
|
+
family === FAMILY_BASIC ||
|
|
92
|
+
family === FAMILY_ARITH ||
|
|
93
|
+
(family === FAMILY_USER && manager.getNumArgs(expr) === 0);
|
|
94
|
+
const sort = manager.sorts[expr];
|
|
95
|
+
if (!isAllowed || (sort !== SORT_BOOL && sort !== SORT_INT && sort !== SORT_REAL)) return false;
|
|
96
|
+
manager.pushArgs(expr, todo);
|
|
97
|
+
}
|
|
98
|
+
return true;
|
|
99
|
+
};
|
|
100
|
+
|
|
101
|
+
const getCoarseInterval = (
|
|
102
|
+
manager: AstManager,
|
|
103
|
+
am: AlgebraicManager,
|
|
104
|
+
value: Anum,
|
|
105
|
+
): [Rational, Rational] => {
|
|
106
|
+
const pm = new PolynomialManager(manager.limit);
|
|
107
|
+
const p = new PolynomialRef(pm);
|
|
108
|
+
p.set(pm.toPolynomial(am.getPolynomial(value), 0));
|
|
109
|
+
const roots = am.isolateRoots(pm, p.get(), []);
|
|
110
|
+
p.reset();
|
|
111
|
+
const index = roots.findIndex((root) => am.compare(root, value) === 0);
|
|
112
|
+
const lower = index === 0 ? am.intLt(value) : am.select(roots[index - 1], value);
|
|
113
|
+
const upper = index + 1 === roots.length ? am.intGt(value) : am.select(value, roots[index + 1]);
|
|
114
|
+
return [am.toRational(lower), am.toRational(upper)];
|
|
115
|
+
};
|
|
116
|
+
|
|
117
|
+
export const mkAlgebraicEq = (manager: AstManager, term: number, value: Anum) => {
|
|
118
|
+
const am = manager.am;
|
|
119
|
+
if (am.isRational(value))
|
|
120
|
+
return manager.mkApp(OP_EQ, [term, manager.mkRealNumeral(am.toRational(value))], SORT_BOOL);
|
|
121
|
+
const coeffs = am.getPolynomial(value);
|
|
122
|
+
let polynomial = -1;
|
|
123
|
+
for (let index = coeffs.length - 1; index >= 0; index--) {
|
|
124
|
+
const coeff = manager.mkRealNumeral(Rational.of(coeffs[index]));
|
|
125
|
+
polynomial =
|
|
126
|
+
polynomial === -1
|
|
127
|
+
? coeff
|
|
128
|
+
: manager.mkApp(
|
|
129
|
+
OP_ADD,
|
|
130
|
+
[manager.mkApp(OP_MUL, [polynomial, term], SORT_REAL), coeff],
|
|
131
|
+
SORT_REAL,
|
|
132
|
+
);
|
|
133
|
+
}
|
|
134
|
+
const [lower, upper] = getCoarseInterval(manager, am, value);
|
|
135
|
+
return manager.mkApp(
|
|
136
|
+
OP_AND,
|
|
137
|
+
[
|
|
138
|
+
manager.mkApp(OP_EQ, [polynomial, manager.mkRealNumeral(Rational.zero)], SORT_BOOL),
|
|
139
|
+
manager.mkApp(OP_GE, [term, manager.mkRealNumeral(lower)], SORT_BOOL),
|
|
140
|
+
manager.mkApp(OP_LE, [term, manager.mkRealNumeral(upper)], SORT_BOOL),
|
|
141
|
+
],
|
|
142
|
+
SORT_BOOL,
|
|
143
|
+
);
|
|
144
|
+
};
|
|
145
|
+
|
|
146
|
+
const isOccurring = (manager: AstManager, target: number, expr: number) => {
|
|
147
|
+
const seen = new Set<number>();
|
|
148
|
+
const todo = [expr];
|
|
149
|
+
for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
|
|
150
|
+
if (current === target) return true;
|
|
151
|
+
if (seen.has(current) || manager.kinds[current] !== KIND_APP) continue;
|
|
152
|
+
seen.add(current);
|
|
153
|
+
manager.pushArgs(current, todo);
|
|
154
|
+
}
|
|
155
|
+
return false;
|
|
156
|
+
};
|
|
157
|
+
|
|
158
|
+
const mkLowerBound = (solver: NlsatSolver, variable: number, value: Anum, isStrict: boolean) => {
|
|
159
|
+
const am = solver.am;
|
|
160
|
+
const pm = solver.pm;
|
|
161
|
+
const p = new PolynomialRef(pm);
|
|
162
|
+
if (am.isRational(value)) {
|
|
163
|
+
const rational = am.toRational(value);
|
|
164
|
+
p.set(pm.mkLinear([rational.den], [variable], -rational.num));
|
|
165
|
+
const literal = isStrict
|
|
166
|
+
? solver.mkIneqLiteral("GT", [p.get()], [false])
|
|
167
|
+
: solver.mkIneqLiteral("LT", [p.get()], [false]) ^ 1;
|
|
168
|
+
p.reset();
|
|
169
|
+
return literal;
|
|
170
|
+
}
|
|
171
|
+
p.set(pm.toPolynomial(am.getPolynomial(value), variable));
|
|
172
|
+
const index = am.isolateRoots(pm, p.get(), []).findIndex((root) => am.compare(root, value) === 0);
|
|
173
|
+
const literal =
|
|
174
|
+
index === -1
|
|
175
|
+
? null
|
|
176
|
+
: 2 * solver.mkRootAtom(isStrict ? "ROOT_GT" : "ROOT_GE", variable, index + 1, p.get());
|
|
177
|
+
p.reset();
|
|
178
|
+
return literal;
|
|
179
|
+
};
|
|
180
|
+
|
|
181
|
+
const getBracket = (solver: NlsatSolver, value: Anum): [Rational, Rational] => {
|
|
182
|
+
const am = solver.am;
|
|
183
|
+
if (!am.isRational(value)) return am.getInterval(value, 40);
|
|
184
|
+
const rational = am.toRational(value);
|
|
185
|
+
return [rational, rational];
|
|
186
|
+
};
|
|
187
|
+
|
|
188
|
+
export class NlsatOpt {
|
|
189
|
+
constructor(
|
|
190
|
+
private manager: AstManager,
|
|
191
|
+
private environment: TacticEnvironment,
|
|
192
|
+
) {}
|
|
193
|
+
|
|
194
|
+
// hard, T = objective, lower <= T <= upper, normalized for goal2nlsat. T only occurs in these
|
|
195
|
+
// assertions, so preprocessing can only lose it by eliminating the objective.
|
|
196
|
+
private preprocess(
|
|
197
|
+
hard: readonly number[],
|
|
198
|
+
objective: number,
|
|
199
|
+
lower: Rational,
|
|
200
|
+
upper: Rational | null,
|
|
201
|
+
): PreprocessedGoal | PreprocessedNothing {
|
|
202
|
+
const manager = this.manager;
|
|
203
|
+
const pinned = new RefVector(manager);
|
|
204
|
+
const pin = (expr: number) => {
|
|
205
|
+
pinned.push(expr);
|
|
206
|
+
return expr;
|
|
207
|
+
};
|
|
208
|
+
const target = pin(manager.mkFreshConst("opt.nlsat.obj", SORT_REAL));
|
|
209
|
+
const goal = new Goal(manager);
|
|
210
|
+
for (const form of hard) goal.assert(form);
|
|
211
|
+
goal.assert(pin(manager.mkApp(OP_EQ, [target, objective], SORT_BOOL)));
|
|
212
|
+
goal.assert(pin(manager.mkApp(OP_GE, [target, manager.mkRealNumeral(lower)], SORT_BOOL)));
|
|
213
|
+
if (upper !== null)
|
|
214
|
+
goal.assert(pin(manager.mkApp(OP_LE, [target, manager.mkRealNumeral(upper)], SORT_BOOL)));
|
|
215
|
+
const goals = (() => {
|
|
216
|
+
try {
|
|
217
|
+
return compileInternalTactic(this.environment, PREPROCESSOR)(goal);
|
|
218
|
+
} catch (error) {
|
|
219
|
+
if (!(error instanceof SmtTacticError)) throw error;
|
|
220
|
+
return null;
|
|
221
|
+
}
|
|
222
|
+
})();
|
|
223
|
+
pinned.reset();
|
|
224
|
+
const result = goals?.length === 1 ? goals[0] : null;
|
|
225
|
+
if (result === null) return { status: L_UNDEF };
|
|
226
|
+
if (result.isInconsistent) return { status: L_FALSE };
|
|
227
|
+
return result.forms.items.some((form) => isOccurring(manager, target, form))
|
|
228
|
+
? { status: L_TRUE, goal: result, objective: target }
|
|
229
|
+
: { status: L_UNDEF };
|
|
230
|
+
}
|
|
231
|
+
|
|
232
|
+
// The objective is nlsat's first variable and its maximization target.
|
|
233
|
+
private load(goal: Goal, objective: number): Loaded | null {
|
|
234
|
+
const solver = new NlsatSolver(this.manager.limit);
|
|
235
|
+
const variable = solver.mkVar(false);
|
|
236
|
+
const x2t = new Map([[objective, variable]]);
|
|
237
|
+
const a2b = new Map<number, number>();
|
|
238
|
+
try {
|
|
239
|
+
goal2nlsat(this.manager, goal.forms.items, solver, x2t, a2b, null);
|
|
240
|
+
} catch (error) {
|
|
241
|
+
if (!(error instanceof SmtTacticError)) throw error;
|
|
242
|
+
return null;
|
|
243
|
+
}
|
|
244
|
+
solver.setMaxVar(variable);
|
|
245
|
+
return { solver, variable, x2t, a2b };
|
|
246
|
+
}
|
|
247
|
+
|
|
248
|
+
private extractModel(loaded: Loaded, goal: Goal, objective: number) {
|
|
249
|
+
const manager = this.manager;
|
|
250
|
+
const model = new ProtoModel(manager);
|
|
251
|
+
for (const [term, variable] of loaded.x2t) {
|
|
252
|
+
if (term === objective || !manager.isUninterpretedConst(term)) continue;
|
|
253
|
+
const value = loaded.solver.getValue(variable);
|
|
254
|
+
const isInt = manager.sorts[term] === SORT_INT;
|
|
255
|
+
const numeral =
|
|
256
|
+
isInt && !loaded.solver.am.isInt(value)
|
|
257
|
+
? manager.mkApp(OP_TO_INT, [manager.mkAlgebraicNumeral(value)], SORT_INT)
|
|
258
|
+
: manager.mkAlgebraicNumeral(value, isInt ? SORT_INT : SORT_REAL);
|
|
259
|
+
model.registerConst(manager.decls[term], numeral);
|
|
260
|
+
}
|
|
261
|
+
for (const [atom, boolVar] of loaded.a2b) {
|
|
262
|
+
if (!manager.isUninterpretedConst(atom)) continue;
|
|
263
|
+
const value = loaded.solver.getBoolValue(boolVar);
|
|
264
|
+
if (value === L_UNDEF) continue;
|
|
265
|
+
model.registerConst(
|
|
266
|
+
manager.decls[atom],
|
|
267
|
+
value === L_TRUE ? manager.trueExpr : manager.falseExpr,
|
|
268
|
+
);
|
|
269
|
+
}
|
|
270
|
+
return convertModel(goal, model);
|
|
271
|
+
}
|
|
272
|
+
|
|
273
|
+
private getBoundedLimit(ticks: number, query: () => number) {
|
|
274
|
+
const limit = this.manager.limit;
|
|
275
|
+
if (ticks === 0 || !limit.inc()) return L_UNDEF;
|
|
276
|
+
limit.push(ticks);
|
|
277
|
+
try {
|
|
278
|
+
return query();
|
|
279
|
+
} catch (error) {
|
|
280
|
+
if (!(error instanceof SmtTacticError || error instanceof SmtCanceledError)) throw error;
|
|
281
|
+
return L_UNDEF;
|
|
282
|
+
} finally {
|
|
283
|
+
limit.pop();
|
|
284
|
+
}
|
|
285
|
+
}
|
|
286
|
+
|
|
287
|
+
private checkLimit(goal: Goal, objective: number, bound: Anum | null) {
|
|
288
|
+
const loaded = this.load(goal, objective);
|
|
289
|
+
if (loaded === null) return L_UNDEF;
|
|
290
|
+
return loaded.solver.checkLimit(loaded.variable, bound);
|
|
291
|
+
}
|
|
292
|
+
|
|
293
|
+
// Whether the objective is unbounded above over the assertions with objective >= lower.
|
|
294
|
+
proveUnbounded(hard: readonly number[], objective: number, lower: Rational) {
|
|
295
|
+
if (!isInNraFragment(this.manager, [...hard, objective])) return L_UNDEF;
|
|
296
|
+
const preprocessed = this.preprocess(hard, objective, lower, null);
|
|
297
|
+
if (preprocessed.status !== L_TRUE) return preprocessed.status;
|
|
298
|
+
return this.checkLimit(preprocessed.goal, preprocessed.objective, null);
|
|
299
|
+
}
|
|
300
|
+
|
|
301
|
+
// Refuting T >= sup, at a model below an open candidate supremum, proves a strict upper bound,
|
|
302
|
+
// but not that feasible values approach it.
|
|
303
|
+
private proveStrictUpperBound(loaded: Loaded, sup: Anum, best: Anum): NlsatSupremum | null {
|
|
304
|
+
const solver = loaded.solver;
|
|
305
|
+
if (solver.am.compare(sup, best) <= 0) return null;
|
|
306
|
+
const literal = mkLowerBound(solver, loaded.variable, sup, false);
|
|
307
|
+
if (literal === null) return null;
|
|
308
|
+
solver.mkExternalClause([literal], null);
|
|
309
|
+
if (solver.check() !== L_FALSE) return null;
|
|
310
|
+
const value = solver.am.copy(sup);
|
|
311
|
+
const bracket = getBracket(solver, value);
|
|
312
|
+
return { value, lower: bracket[0], upper: bracket[1], isOpen: false };
|
|
313
|
+
}
|
|
314
|
+
|
|
315
|
+
maximize(
|
|
316
|
+
hard: readonly number[],
|
|
317
|
+
objective: number,
|
|
318
|
+
lower: Rational,
|
|
319
|
+
upper: Rational | null,
|
|
320
|
+
maxRounds: number,
|
|
321
|
+
supremumRlimit: number,
|
|
322
|
+
): NlsatOptOutcome {
|
|
323
|
+
if (!isInNraFragment(this.manager, [...hard, objective]))
|
|
324
|
+
return { status: L_UNDEF, result: NO_MODEL };
|
|
325
|
+
const preprocessed = this.preprocess(hard, objective, lower, upper);
|
|
326
|
+
if (preprocessed.status !== L_TRUE) return { status: preprocessed.status, result: NO_MODEL };
|
|
327
|
+
const goal = preprocessed.goal;
|
|
328
|
+
const loaded = this.load(goal, preprocessed.objective);
|
|
329
|
+
if (loaded === null) return { status: L_UNDEF, result: NO_MODEL };
|
|
330
|
+
const solver = loaded.solver;
|
|
331
|
+
const am = solver.am;
|
|
332
|
+
let status = L_UNDEF;
|
|
333
|
+
let best: Anum | null = null;
|
|
334
|
+
let sup: Anum | null = null;
|
|
335
|
+
let model: ProtoModel | null = null;
|
|
336
|
+
let isUnbounded = false;
|
|
337
|
+
let unboundedRounds = 0;
|
|
338
|
+
// A round without a candidate supremum is inconclusive, since bounds through later variables
|
|
339
|
+
// reach the objective only through conflicts, so five in a row probe for a feasible ray.
|
|
340
|
+
for (let round = 0; round < maxRounds && this.manager.limit.inc(); round++) {
|
|
341
|
+
status = solver.check();
|
|
342
|
+
if (status !== L_TRUE) break;
|
|
343
|
+
best = am.copy(solver.getValue(loaded.variable));
|
|
344
|
+
const found = solver.getMaxVarSup();
|
|
345
|
+
sup = found === null ? null : found.sup;
|
|
346
|
+
model?.decRef();
|
|
347
|
+
model = this.extractModel(loaded, goal, preprocessed.objective);
|
|
348
|
+
model.incRef();
|
|
349
|
+
if (sup === null) {
|
|
350
|
+
if (++unboundedRounds > 4) {
|
|
351
|
+
if (upper === null && this.checkLimit(goal, preprocessed.objective, null) === L_TRUE)
|
|
352
|
+
isUnbounded = true;
|
|
353
|
+
break;
|
|
354
|
+
}
|
|
355
|
+
} else unboundedRounds = 0;
|
|
356
|
+
const literal = mkLowerBound(solver, loaded.variable, best, true);
|
|
357
|
+
if (literal === null) {
|
|
358
|
+
status = L_UNDEF;
|
|
359
|
+
break;
|
|
360
|
+
}
|
|
361
|
+
solver.mkExternalClause([literal], null);
|
|
362
|
+
}
|
|
363
|
+
if (best === null || model === null)
|
|
364
|
+
return { status: status === L_FALSE ? L_FALSE : L_UNDEF, result: NO_MODEL };
|
|
365
|
+
const bracket = getBracket(solver, best);
|
|
366
|
+
const certified =
|
|
367
|
+
status === L_TRUE && sup !== null ? this.proveStrictUpperBound(loaded, sup, best) : null;
|
|
368
|
+
if (certified !== null)
|
|
369
|
+
certified.isOpen =
|
|
370
|
+
this.getBoundedLimit(supremumRlimit, () =>
|
|
371
|
+
this.checkLimit(goal, preprocessed.objective, certified.value),
|
|
372
|
+
) === L_TRUE;
|
|
373
|
+
return {
|
|
374
|
+
status: status === L_FALSE || isUnbounded || certified?.isOpen === true ? L_TRUE : L_UNDEF,
|
|
375
|
+
result: {
|
|
376
|
+
hasModel: true,
|
|
377
|
+
model,
|
|
378
|
+
value: best,
|
|
379
|
+
lower: bracket[0],
|
|
380
|
+
upper: bracket[1],
|
|
381
|
+
isUnbounded,
|
|
382
|
+
sup: certified,
|
|
383
|
+
},
|
|
384
|
+
};
|
|
385
|
+
}
|
|
386
|
+
}
|
|
@@ -0,0 +1,282 @@
|
|
|
1
|
+
import { SmtTacticError } from "../../../errors";
|
|
2
|
+
import {
|
|
3
|
+
type AstManager,
|
|
4
|
+
FAMILY_ARITH,
|
|
5
|
+
FAMILY_BASIC,
|
|
6
|
+
KIND_APP,
|
|
7
|
+
OP_ADD,
|
|
8
|
+
OP_ALGEBRAIC_NUM,
|
|
9
|
+
OP_AND,
|
|
10
|
+
OP_DIV,
|
|
11
|
+
OP_GE,
|
|
12
|
+
OP_GT,
|
|
13
|
+
OP_LE,
|
|
14
|
+
OP_LT,
|
|
15
|
+
OP_MUL,
|
|
16
|
+
OP_NOT,
|
|
17
|
+
OP_NUM,
|
|
18
|
+
OP_OR,
|
|
19
|
+
OP_POWER,
|
|
20
|
+
OP_SUB,
|
|
21
|
+
OP_UMINUS,
|
|
22
|
+
SORT_BOOL,
|
|
23
|
+
SORT_REAL,
|
|
24
|
+
} from "./ast";
|
|
25
|
+
import { Goal } from "./goal";
|
|
26
|
+
import { goal2nlsat } from "./goal2nlsat";
|
|
27
|
+
import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
|
|
28
|
+
import { NlsatSolver } from "./nlsat/solver";
|
|
29
|
+
import { getModelValueBound } from "./opt-solver";
|
|
30
|
+
import { ProtoModel } from "./proto-model";
|
|
31
|
+
import { RefVector } from "./ref-vector";
|
|
32
|
+
import { compileInternalTactic, type TacticEnvironment } from "./tactic";
|
|
33
|
+
|
|
34
|
+
const SIMPLIFY = "(using-params simplify :elim_and true :blast_distinct true :expand_power true)";
|
|
35
|
+
|
|
36
|
+
const PREPROCESSOR =
|
|
37
|
+
`(and-then ${SIMPLIFY} (using-params purify-arith :complete false) elim-term-ite ` +
|
|
38
|
+
`(using-params purify-arith :complete false) ${SIMPLIFY} tseitin-cnf-core ${SIMPLIFY})`;
|
|
39
|
+
|
|
40
|
+
const REUSABLE_OPS = new Set([
|
|
41
|
+
OP_NUM,
|
|
42
|
+
OP_ALGEBRAIC_NUM,
|
|
43
|
+
OP_LE,
|
|
44
|
+
OP_GE,
|
|
45
|
+
OP_LT,
|
|
46
|
+
OP_GT,
|
|
47
|
+
OP_ADD,
|
|
48
|
+
OP_SUB,
|
|
49
|
+
OP_UMINUS,
|
|
50
|
+
OP_MUL,
|
|
51
|
+
]);
|
|
52
|
+
|
|
53
|
+
export interface ParetoObjective {
|
|
54
|
+
term: number;
|
|
55
|
+
isMax: boolean;
|
|
56
|
+
}
|
|
57
|
+
|
|
58
|
+
export const canReuseNlsatSolver = (manager: AstManager, terms: readonly number[]) => {
|
|
59
|
+
const seen = new Set<number>();
|
|
60
|
+
const todo = [...terms];
|
|
61
|
+
for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
|
|
62
|
+
if (seen.has(expr)) continue;
|
|
63
|
+
seen.add(expr);
|
|
64
|
+
if (manager.kinds[expr] !== KIND_APP) return false;
|
|
65
|
+
manager.pushArgs(expr, todo);
|
|
66
|
+
const sort = manager.sorts[expr];
|
|
67
|
+
if (sort !== SORT_BOOL && sort !== SORT_REAL && !manager.isNumeral(expr)) return false;
|
|
68
|
+
if (manager.isUninterpretedConst(expr) || manager.getFamily(expr) === FAMILY_BASIC) continue;
|
|
69
|
+
if (manager.getFamily(expr) !== FAMILY_ARITH) return false;
|
|
70
|
+
const op = manager.getOp(expr);
|
|
71
|
+
if (REUSABLE_OPS.has(op)) continue;
|
|
72
|
+
if (op !== OP_DIV && op !== OP_POWER) return false;
|
|
73
|
+
const second = manager.getArg(expr, 1);
|
|
74
|
+
if (!manager.isNumeral(second)) return false;
|
|
75
|
+
const value = manager.getRationalValue(second);
|
|
76
|
+
if (value.isZero()) return false;
|
|
77
|
+
if (op === OP_POWER && (!value.isInt() || value.num < 0n || value.num > 0xffffffffn))
|
|
78
|
+
return false;
|
|
79
|
+
}
|
|
80
|
+
return true;
|
|
81
|
+
};
|
|
82
|
+
|
|
83
|
+
export interface ParetoSolver {
|
|
84
|
+
readonly model: ProtoModel | null;
|
|
85
|
+
reasonUnknown: string;
|
|
86
|
+
check(): number;
|
|
87
|
+
assert(expr: number): void;
|
|
88
|
+
push(): void;
|
|
89
|
+
pop(): void;
|
|
90
|
+
release(): void;
|
|
91
|
+
}
|
|
92
|
+
|
|
93
|
+
export class ParetoNlsatSolver implements ParetoSolver {
|
|
94
|
+
private assertions: RefVector;
|
|
95
|
+
private pinned: RefVector;
|
|
96
|
+
private tags: (number | null)[] = [];
|
|
97
|
+
private scopeTags: number[] = [];
|
|
98
|
+
private limits: number[] = [];
|
|
99
|
+
private head = 0;
|
|
100
|
+
private nextTag = 0;
|
|
101
|
+
private nlsat: NlsatSolver;
|
|
102
|
+
private t2x = new Map<number, number>();
|
|
103
|
+
private a2b = new Map<number, number>();
|
|
104
|
+
private preprocessor: (goal: Goal) => Goal[];
|
|
105
|
+
model: ProtoModel | null = null;
|
|
106
|
+
reasonUnknown = "";
|
|
107
|
+
|
|
108
|
+
constructor(
|
|
109
|
+
private manager: AstManager,
|
|
110
|
+
environment: TacticEnvironment,
|
|
111
|
+
private maxLemmas: number,
|
|
112
|
+
) {
|
|
113
|
+
this.assertions = new RefVector(manager);
|
|
114
|
+
this.pinned = new RefVector(manager);
|
|
115
|
+
this.nlsat = new NlsatSolver(manager.limit);
|
|
116
|
+
this.nlsat.isReordering = false;
|
|
117
|
+
this.preprocessor = compileInternalTactic(environment, PREPROCESSOR);
|
|
118
|
+
}
|
|
119
|
+
|
|
120
|
+
private setModel(model: ProtoModel | null) {
|
|
121
|
+
model?.incRef();
|
|
122
|
+
this.model?.decRef();
|
|
123
|
+
this.model = model;
|
|
124
|
+
}
|
|
125
|
+
|
|
126
|
+
private internalize() {
|
|
127
|
+
const manager = this.manager;
|
|
128
|
+
while (this.head < this.assertions.size) {
|
|
129
|
+
const tag = this.tags[this.head];
|
|
130
|
+
let end = this.head + 1;
|
|
131
|
+
while (end < this.assertions.size && this.tags[end] === tag) end++;
|
|
132
|
+
const goal = new Goal(manager);
|
|
133
|
+
for (let index = this.head; index < end; index++) goal.assert(this.assertions.items[index]);
|
|
134
|
+
const goals = this.preprocessor(goal);
|
|
135
|
+
if (goals.length !== 1)
|
|
136
|
+
throw new SmtTacticError("Pareto nlsat preprocessing requires a single goal");
|
|
137
|
+
if (goals[0].isInconsistent) this.nlsat.mkExternalClause([], tag);
|
|
138
|
+
else {
|
|
139
|
+
const termCount = this.t2x.size;
|
|
140
|
+
const atomCount = this.a2b.size;
|
|
141
|
+
goal2nlsat(manager, goals[0].forms.items, this.nlsat, this.t2x, this.a2b, tag);
|
|
142
|
+
for (const term of [...this.t2x.keys()].slice(termCount)) this.pinned.push(term);
|
|
143
|
+
for (const atom of [...this.a2b.keys()].slice(atomCount)) this.pinned.push(atom);
|
|
144
|
+
}
|
|
145
|
+
goals[0].forms.reset();
|
|
146
|
+
this.head = end;
|
|
147
|
+
}
|
|
148
|
+
}
|
|
149
|
+
|
|
150
|
+
private extractModel() {
|
|
151
|
+
const manager = this.manager;
|
|
152
|
+
const model = new ProtoModel(manager);
|
|
153
|
+
const seen = new Set<number>();
|
|
154
|
+
const todo = this.assertions.items.toReversed();
|
|
155
|
+
for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
|
|
156
|
+
if (seen.has(expr)) continue;
|
|
157
|
+
seen.add(expr);
|
|
158
|
+
todo.push(...manager.getArgs(expr).toReversed());
|
|
159
|
+
if (!manager.isUninterpretedConst(expr)) continue;
|
|
160
|
+
const variable = this.t2x.get(expr);
|
|
161
|
+
const boolVar = this.a2b.get(expr);
|
|
162
|
+
if (variable !== undefined)
|
|
163
|
+
model.registerConst(
|
|
164
|
+
manager.decls[expr],
|
|
165
|
+
manager.mkAlgebraicNumeral(this.nlsat.getValue(variable)),
|
|
166
|
+
);
|
|
167
|
+
else if (boolVar !== undefined && this.nlsat.getBoolValue(boolVar) !== L_UNDEF)
|
|
168
|
+
model.registerConst(
|
|
169
|
+
manager.decls[expr],
|
|
170
|
+
this.nlsat.getBoolValue(boolVar) === L_TRUE ? manager.trueExpr : manager.falseExpr,
|
|
171
|
+
);
|
|
172
|
+
}
|
|
173
|
+
this.setModel(model);
|
|
174
|
+
}
|
|
175
|
+
|
|
176
|
+
check() {
|
|
177
|
+
this.setModel(null);
|
|
178
|
+
this.reasonUnknown = "";
|
|
179
|
+
try {
|
|
180
|
+
this.internalize();
|
|
181
|
+
const status = this.nlsat.check();
|
|
182
|
+
if (status === L_TRUE) this.extractModel();
|
|
183
|
+
if (status === L_UNDEF) this.reasonUnknown = "incomplete nlsat search";
|
|
184
|
+
return status;
|
|
185
|
+
} catch (error) {
|
|
186
|
+
if (!(error instanceof SmtTacticError)) throw error;
|
|
187
|
+
this.reasonUnknown = error.message;
|
|
188
|
+
return L_UNDEF;
|
|
189
|
+
}
|
|
190
|
+
}
|
|
191
|
+
|
|
192
|
+
assert(expr: number) {
|
|
193
|
+
this.assertions.push(expr);
|
|
194
|
+
this.tags.push(this.scopeTags.at(-1) ?? null);
|
|
195
|
+
this.setModel(null);
|
|
196
|
+
}
|
|
197
|
+
|
|
198
|
+
push() {
|
|
199
|
+
this.limits.push(this.assertions.size);
|
|
200
|
+
this.scopeTags.push(++this.nextTag);
|
|
201
|
+
this.setModel(null);
|
|
202
|
+
}
|
|
203
|
+
|
|
204
|
+
pop() {
|
|
205
|
+
const limit = this.limits.pop();
|
|
206
|
+
const tag = this.scopeTags.pop();
|
|
207
|
+
if (limit === undefined || tag === undefined) return;
|
|
208
|
+
this.nlsat.retract(tag, this.maxLemmas);
|
|
209
|
+
while (this.assertions.size > limit) this.assertions.pop();
|
|
210
|
+
this.tags.length = limit;
|
|
211
|
+
this.head = Math.min(this.head, limit);
|
|
212
|
+
this.setModel(null);
|
|
213
|
+
}
|
|
214
|
+
|
|
215
|
+
release() {
|
|
216
|
+
this.setModel(null);
|
|
217
|
+
this.assertions.reset();
|
|
218
|
+
this.pinned.reset();
|
|
219
|
+
}
|
|
220
|
+
}
|
|
221
|
+
|
|
222
|
+
export const giaPareto = (
|
|
223
|
+
manager: AstManager,
|
|
224
|
+
solver: ParetoSolver,
|
|
225
|
+
objectives: readonly ParetoObjective[],
|
|
226
|
+
isExact: boolean,
|
|
227
|
+
) => {
|
|
228
|
+
const pinned = new RefVector(manager);
|
|
229
|
+
const pin = (expr: number) => {
|
|
230
|
+
pinned.push(expr);
|
|
231
|
+
return expr;
|
|
232
|
+
};
|
|
233
|
+
// Without exact comparison, an irrational value becomes the endpoint of an isolating interval
|
|
234
|
+
// on the side that keeps the atom true in the model, since the SMT core does not internalize it.
|
|
235
|
+
const getComparable = (value: number, isGreater: boolean) => {
|
|
236
|
+
if (manager.isNumeral(value) || (isExact && manager.isAlgebraicNumeral(value))) return value;
|
|
237
|
+
const bound = getModelValueBound(manager, manager.am, value, isGreater);
|
|
238
|
+
return bound === undefined ? -1 : pin(manager.mkRealNumeral(bound));
|
|
239
|
+
};
|
|
240
|
+
const mkCmp = (isGe: boolean, model: ProtoModel, objective: ParetoObjective) => {
|
|
241
|
+
const isGreater = objective.isMax ? isGe : !isGe;
|
|
242
|
+
const evaluated = model.eval(objective.term, true);
|
|
243
|
+
pin(evaluated);
|
|
244
|
+
manager.decRef(evaluated);
|
|
245
|
+
const value = getComparable(evaluated, isGreater);
|
|
246
|
+
const pair = isGreater ? [objective.term, value] : [value, objective.term];
|
|
247
|
+
return value === -1 ? manager.trueExpr : pin(manager.mkApp(OP_GE, pair, SORT_BOOL));
|
|
248
|
+
};
|
|
249
|
+
const mkAnd = (args: number[]) =>
|
|
250
|
+
args.length === 1 ? args[0] : pin(manager.mkApp(OP_AND, args, SORT_BOOL));
|
|
251
|
+
const mkOr = (args: number[]) =>
|
|
252
|
+
args.length === 1 ? args[0] : pin(manager.mkApp(OP_OR, args, SORT_BOOL));
|
|
253
|
+
const mkNot = (expr: number) =>
|
|
254
|
+
manager.isNot(expr) ? manager.getArg(expr, 0) : pin(manager.mkNot(expr));
|
|
255
|
+
let status = solver.check();
|
|
256
|
+
if (status !== L_TRUE) return { status, model: null };
|
|
257
|
+
let model = solver.model;
|
|
258
|
+
model?.incRef();
|
|
259
|
+
solver.push();
|
|
260
|
+
while (status === L_TRUE && model !== null && manager.limit.inc()) {
|
|
261
|
+
const current = model;
|
|
262
|
+
const dominating = objectives.map((objective) => mkCmp(true, current, objective));
|
|
263
|
+
const improving = objectives.map((objective) => mkNot(mkCmp(false, current, objective)));
|
|
264
|
+
solver.assert(mkAnd([...dominating, mkOr(improving)]));
|
|
265
|
+
status = solver.check();
|
|
266
|
+
if (status !== L_TRUE) break;
|
|
267
|
+
current.decRef();
|
|
268
|
+
model = solver.model;
|
|
269
|
+
model?.incRef();
|
|
270
|
+
}
|
|
271
|
+
solver.pop();
|
|
272
|
+
const dominant = model;
|
|
273
|
+
if (status !== L_FALSE || dominant === null) {
|
|
274
|
+
dominant?.decRef();
|
|
275
|
+
pinned.reset();
|
|
276
|
+
return { status: L_UNDEF, model: null };
|
|
277
|
+
}
|
|
278
|
+
const bounded = objectives.map((objective) => mkCmp(false, dominant, objective));
|
|
279
|
+
solver.assert(pin(manager.mkApp(OP_NOT, [mkAnd(bounded)], SORT_BOOL)));
|
|
280
|
+
pinned.reset();
|
|
281
|
+
return { status: L_TRUE, model: dominant };
|
|
282
|
+
};
|