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,299 @@
|
|
|
1
|
+
import { SmtTacticError } from "../../../errors";
|
|
2
|
+
import { type AstManager, OP_AND, OP_EQ, OP_ITE, OP_OR } from "./ast";
|
|
3
|
+
import { mkNot } from "./ast-util";
|
|
4
|
+
import { AssertedFormulas } from "./asserted-formulas";
|
|
5
|
+
import type { Context } from "./context";
|
|
6
|
+
import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
|
|
7
|
+
import { getVar, isNegated, toBoolVar } from "./literal";
|
|
8
|
+
import type { ProtoModel } from "./proto-model";
|
|
9
|
+
import { RandomGen } from "./random-gen";
|
|
10
|
+
import { RefVector } from "./ref-vector";
|
|
11
|
+
import { isAncestor, isPathContaining, type SearchNode, SearchTree } from "./search-tree";
|
|
12
|
+
import { SmtKernel } from "./smt-kernel";
|
|
13
|
+
import type { KernelParams } from "./solver";
|
|
14
|
+
|
|
15
|
+
export interface ParallelParams {
|
|
16
|
+
threadsMax: number;
|
|
17
|
+
numBbThreads: number;
|
|
18
|
+
isAblatingBacktracking: boolean;
|
|
19
|
+
}
|
|
20
|
+
|
|
21
|
+
interface ParallelResult {
|
|
22
|
+
status: number;
|
|
23
|
+
model: ProtoModel | undefined;
|
|
24
|
+
core: number[];
|
|
25
|
+
}
|
|
26
|
+
|
|
27
|
+
const INITIAL_MAX_THREAD_CONFLICTS = 1000;
|
|
28
|
+
const MAX_CONFLICT_MUL = 1.5;
|
|
29
|
+
const MAX_CUBE_DEPTH = 20;
|
|
30
|
+
const UINT_MAX = 4294967295;
|
|
31
|
+
|
|
32
|
+
const STATE_RUNNING = 0;
|
|
33
|
+
const STATE_SAT = 1;
|
|
34
|
+
const STATE_UNSAT = 2;
|
|
35
|
+
const STATE_UNKNOWN = 3;
|
|
36
|
+
|
|
37
|
+
const isConnective = (manager: AstManager, atom: number) => {
|
|
38
|
+
const op = manager.getOp(atom);
|
|
39
|
+
return (
|
|
40
|
+
op === OP_AND ||
|
|
41
|
+
op === OP_OR ||
|
|
42
|
+
op === OP_ITE ||
|
|
43
|
+
(op === OP_EQ && manager.isBool(manager.getArg(atom, 0)))
|
|
44
|
+
);
|
|
45
|
+
};
|
|
46
|
+
|
|
47
|
+
// The batch manager and its only worker. Shared clauses never reach the worker that shares them,
|
|
48
|
+
// and the backbone candidates and core minimization jobs only feed workers that one hardware
|
|
49
|
+
// thread leaves out, so those are not ported.
|
|
50
|
+
class ParallelSolver {
|
|
51
|
+
private state = STATE_RUNNING;
|
|
52
|
+
private readonly tree: SearchTree;
|
|
53
|
+
// Holds the literals of the tree, the cores and the global backbones.
|
|
54
|
+
private readonly literals: RefVector;
|
|
55
|
+
private readonly globalBackbones = new Set<number>();
|
|
56
|
+
private readonly knownUnits = new Set<number>();
|
|
57
|
+
// smt_solver's random_gen, which cube_vsids draws from.
|
|
58
|
+
private readonly random = new RandomGen(0);
|
|
59
|
+
private readonly context: Context;
|
|
60
|
+
private readonly numInitialAtoms: number;
|
|
61
|
+
private sharedUnitsPrefix: number;
|
|
62
|
+
private threadsMaxConflicts = INITIAL_MAX_THREAD_CONFLICTS;
|
|
63
|
+
private model: ProtoModel | undefined;
|
|
64
|
+
private core: number[] = [];
|
|
65
|
+
|
|
66
|
+
constructor(
|
|
67
|
+
private readonly manager: AstManager,
|
|
68
|
+
private readonly kernel: SmtKernel,
|
|
69
|
+
private readonly assumptions: number[],
|
|
70
|
+
private readonly params: ParallelParams,
|
|
71
|
+
) {
|
|
72
|
+
this.tree = new SearchTree(manager);
|
|
73
|
+
this.tree.setEffortUnit(INITIAL_MAX_THREAD_CONFLICTS);
|
|
74
|
+
this.literals = new RefVector(manager);
|
|
75
|
+
this.context = kernel.context;
|
|
76
|
+
this.context.popToBaseLevel();
|
|
77
|
+
this.sharedUnitsPrefix = this.context.assignedLiterals.length;
|
|
78
|
+
this.numInitialAtoms = this.context.numBoolVars;
|
|
79
|
+
kernel.setPreprocess(false);
|
|
80
|
+
}
|
|
81
|
+
|
|
82
|
+
solve(): ParallelResult {
|
|
83
|
+
for (let lease = this.getCube(true); lease !== undefined; lease = this.getCube(false)) {
|
|
84
|
+
if (!this.conquer(lease, this.getCubeLiterals(lease))) break;
|
|
85
|
+
this.shareUnits();
|
|
86
|
+
}
|
|
87
|
+
this.literals.reset();
|
|
88
|
+
if (this.state === STATE_RUNNING) throw new SmtTacticError("par2: inconsistent end state");
|
|
89
|
+
const status =
|
|
90
|
+
this.state === STATE_SAT ? L_TRUE : this.state === STATE_UNSAT ? L_FALSE : L_UNDEF;
|
|
91
|
+
return { status, model: this.model, core: this.core };
|
|
92
|
+
}
|
|
93
|
+
|
|
94
|
+
private getCube(isFirstRun: boolean) {
|
|
95
|
+
if (this.tree.isClosed || this.state !== STATE_RUNNING) return undefined;
|
|
96
|
+
return isFirstRun ? this.tree.activateRoot() : this.tree.activateBestNode();
|
|
97
|
+
}
|
|
98
|
+
|
|
99
|
+
private getCubeLiterals(lease: SearchNode) {
|
|
100
|
+
const cube: number[] = [];
|
|
101
|
+
for (
|
|
102
|
+
let node: SearchNode | undefined = lease;
|
|
103
|
+
node !== undefined && node.literal !== -1;
|
|
104
|
+
node = node.parent
|
|
105
|
+
)
|
|
106
|
+
cube.push(node.literal);
|
|
107
|
+
return cube;
|
|
108
|
+
}
|
|
109
|
+
|
|
110
|
+
// The worker's loop over one cube, which answers whether the worker goes on to the next cube.
|
|
111
|
+
private conquer(lease: SearchNode, cube: number[]) {
|
|
112
|
+
for (;;) {
|
|
113
|
+
this.context.maxConflicts = this.threadsMaxConflicts;
|
|
114
|
+
const result = this.kernel.check([...this.assumptions, ...cube]);
|
|
115
|
+
if (result === L_TRUE) {
|
|
116
|
+
this.setSat(this.context.getModel());
|
|
117
|
+
return false;
|
|
118
|
+
}
|
|
119
|
+
if (result === L_FALSE) {
|
|
120
|
+
const core = this.context.unsatCore;
|
|
121
|
+
if (core.every((literal) => this.assumptions.includes(literal))) {
|
|
122
|
+
this.setUnsat(core);
|
|
123
|
+
return false;
|
|
124
|
+
}
|
|
125
|
+
this.backtrack(this.params.isAblatingBacktracking ? cube : core, lease);
|
|
126
|
+
return true;
|
|
127
|
+
}
|
|
128
|
+
// Only a cube that ran out of conflicts gets more conflicts or a split.
|
|
129
|
+
const reason = this.context.getLastFailureMessage();
|
|
130
|
+
if (reason !== "max-conflicts-reached") {
|
|
131
|
+
this.setUnknown();
|
|
132
|
+
return false;
|
|
133
|
+
}
|
|
134
|
+
const next = MAX_CONFLICT_MUL * this.threadsMaxConflicts;
|
|
135
|
+
this.threadsMaxConflicts = next >= UINT_MAX ? UINT_MAX : Math.trunc(next);
|
|
136
|
+
if (cube.length >= MAX_CUBE_DEPTH) continue;
|
|
137
|
+
const atom = this.getSplitAtom(cube);
|
|
138
|
+
if (atom === -1) continue;
|
|
139
|
+
this.trySplit(lease, atom);
|
|
140
|
+
return true;
|
|
141
|
+
}
|
|
142
|
+
}
|
|
143
|
+
|
|
144
|
+
private setSat(model: ProtoModel) {
|
|
145
|
+
if (this.state !== STATE_RUNNING && this.state !== STATE_UNKNOWN) return;
|
|
146
|
+
this.state = STATE_SAT;
|
|
147
|
+
this.model = model;
|
|
148
|
+
}
|
|
149
|
+
|
|
150
|
+
private setUnsat(core: number[]) {
|
|
151
|
+
if (this.state !== STATE_RUNNING && this.state !== STATE_UNKNOWN) return;
|
|
152
|
+
this.state = STATE_UNSAT;
|
|
153
|
+
this.core = core;
|
|
154
|
+
}
|
|
155
|
+
|
|
156
|
+
private setUnknown() {
|
|
157
|
+
if (this.state === STATE_RUNNING) this.state = STATE_UNKNOWN;
|
|
158
|
+
}
|
|
159
|
+
|
|
160
|
+
// cube_vsids: the unassigned atom of the highest activity, ties broken at random.
|
|
161
|
+
private getSplitAtom(cube: number[]) {
|
|
162
|
+
const manager = this.manager;
|
|
163
|
+
const context = this.context;
|
|
164
|
+
const invalid = new Set(
|
|
165
|
+
[...cube, ...(this.params.numBbThreads > 0 ? this.globalBackbones : [])].map((literal) =>
|
|
166
|
+
manager.isNot(literal) ? manager.getArg(literal, 0) : literal,
|
|
167
|
+
),
|
|
168
|
+
);
|
|
169
|
+
let result = -1;
|
|
170
|
+
let score = 0;
|
|
171
|
+
let numTies = 0;
|
|
172
|
+
context.popToSearchLevel();
|
|
173
|
+
for (let boolVar = 0; boolVar < context.numBoolVars; boolVar++) {
|
|
174
|
+
if (context.getBoolVarAssignment(toBoolVar(boolVar)) !== L_UNDEF) continue;
|
|
175
|
+
const expr = context.boolVar2Expr[boolVar];
|
|
176
|
+
if (invalid.has(manager.isNot(expr) ? manager.getArg(expr, 0) : expr)) continue;
|
|
177
|
+
const newScore = context.activity[boolVar];
|
|
178
|
+
if (
|
|
179
|
+
newScore > score ||
|
|
180
|
+
result === -1 ||
|
|
181
|
+
(newScore === score && this.random.next() % ++numTies === 0)
|
|
182
|
+
) {
|
|
183
|
+
score = newScore;
|
|
184
|
+
result = expr;
|
|
185
|
+
}
|
|
186
|
+
}
|
|
187
|
+
return result;
|
|
188
|
+
}
|
|
189
|
+
|
|
190
|
+
private trySplit(lease: SearchNode, atom: number) {
|
|
191
|
+
if (this.state !== STATE_RUNNING) return;
|
|
192
|
+
if (!this.tree.isLeaseCanceled(lease)) {
|
|
193
|
+
const negation = mkNot(this.manager, atom);
|
|
194
|
+
this.literals.push(atom);
|
|
195
|
+
this.literals.push(negation);
|
|
196
|
+
this.tree.trySplit(lease, atom, negation, this.threadsMaxConflicts);
|
|
197
|
+
}
|
|
198
|
+
lease.decActiveWorkers();
|
|
199
|
+
}
|
|
200
|
+
|
|
201
|
+
private collectMatchingTargets(source: SearchNode | undefined, literal: number, core: number[]) {
|
|
202
|
+
const targets: SearchNode[] = [];
|
|
203
|
+
for (const node of this.tree.findNonclosedNodesWithLiteral(literal)) {
|
|
204
|
+
if (node === source) continue;
|
|
205
|
+
// Another branch's node can only take the conflict when its path has the whole core.
|
|
206
|
+
if (source !== undefined && (isAncestor(source, node) || isAncestor(node, source))) continue;
|
|
207
|
+
if (!core.every((coreLiteral) => isPathContaining(node, coreLiteral))) continue;
|
|
208
|
+
if (node.parent !== undefined && targets.some((target) => isAncestor(target, node.parent)))
|
|
209
|
+
continue;
|
|
210
|
+
targets.push(node);
|
|
211
|
+
}
|
|
212
|
+
return targets;
|
|
213
|
+
}
|
|
214
|
+
|
|
215
|
+
private backtrack(core: number[], lease: SearchNode) {
|
|
216
|
+
if (this.state !== STATE_RUNNING) return;
|
|
217
|
+
this.backtrackNodes(core, lease, this.collectMatchingTargets(lease, lease.literal, core));
|
|
218
|
+
}
|
|
219
|
+
|
|
220
|
+
private backtrackNodes(core: number[], lease: SearchNode | undefined, targets: SearchNode[]) {
|
|
221
|
+
if (this.state !== STATE_RUNNING) return;
|
|
222
|
+
let isBacktracked = false;
|
|
223
|
+
if (lease !== undefined) {
|
|
224
|
+
lease.decActiveWorkers();
|
|
225
|
+
if (!this.tree.isLeaseCanceled(lease)) {
|
|
226
|
+
isBacktracked = true;
|
|
227
|
+
this.tree.backtrack(lease, core);
|
|
228
|
+
}
|
|
229
|
+
}
|
|
230
|
+
for (const target of targets) {
|
|
231
|
+
if (this.tree.isLeaseCanceled(target)) continue;
|
|
232
|
+
isBacktracked = true;
|
|
233
|
+
this.tree.backtrack(target, core);
|
|
234
|
+
}
|
|
235
|
+
if (isBacktracked && this.tree.isClosed) {
|
|
236
|
+
this.state = STATE_UNSAT;
|
|
237
|
+
this.core = this.tree.root.core;
|
|
238
|
+
}
|
|
239
|
+
}
|
|
240
|
+
|
|
241
|
+
private collectGlobalBackbone(backbone: number) {
|
|
242
|
+
if (this.globalBackbones.has(backbone)) return;
|
|
243
|
+
this.globalBackbones.add(backbone);
|
|
244
|
+
const negation = mkNot(this.manager, backbone);
|
|
245
|
+
this.literals.push(backbone);
|
|
246
|
+
this.literals.push(negation);
|
|
247
|
+
const targets = this.collectMatchingTargets(undefined, negation, [negation]);
|
|
248
|
+
if (targets.length > 0) this.backtrackNodes([negation], undefined, targets);
|
|
249
|
+
}
|
|
250
|
+
|
|
251
|
+
// Shares the new units of the base level among the initial atoms, skipping the trail's prefix of
|
|
252
|
+
// base-level literals that it already went through.
|
|
253
|
+
private shareUnits() {
|
|
254
|
+
const manager = this.manager;
|
|
255
|
+
const context = this.context;
|
|
256
|
+
const trail = context.assignedLiterals;
|
|
257
|
+
let prefix = Math.min(this.sharedUnitsPrefix, trail.length);
|
|
258
|
+
let isAtPrefix = true;
|
|
259
|
+
for (let index = this.sharedUnitsPrefix; index < trail.length; index++) {
|
|
260
|
+
const literal = trail[index];
|
|
261
|
+
const boolVar = getVar(literal);
|
|
262
|
+
if (context.getLevel(boolVar) > 0) {
|
|
263
|
+
isAtPrefix = false;
|
|
264
|
+
continue;
|
|
265
|
+
}
|
|
266
|
+
if (isAtPrefix) prefix++;
|
|
267
|
+
const atom = context.boolVar2Expr[boolVar];
|
|
268
|
+
if (isConnective(manager, atom) || this.knownUnits.has(boolVar)) continue;
|
|
269
|
+
this.knownUnits.add(boolVar);
|
|
270
|
+
if (!context.isRelevant(atom) || boolVar >= this.numInitialAtoms) continue;
|
|
271
|
+
this.collectGlobalBackbone(isNegated(literal) ? manager.mkNot(atom) : atom);
|
|
272
|
+
}
|
|
273
|
+
this.sharedUnitsPrefix = prefix;
|
|
274
|
+
}
|
|
275
|
+
}
|
|
276
|
+
|
|
277
|
+
// parallel_tactic over mk_smt_solver. Z3 runs a worker for each hardware thread, but the port runs
|
|
278
|
+
// the schedule of one hardware thread, where neither backbone nor core minimizer workers run.
|
|
279
|
+
// threads.max caps the threads, so that schedule is Z3's with parallel.threads.max=1.
|
|
280
|
+
export const solveParallel = (
|
|
281
|
+
manager: AstManager,
|
|
282
|
+
kernelParams: KernelParams,
|
|
283
|
+
params: ParallelParams,
|
|
284
|
+
clauses: number[],
|
|
285
|
+
assumptions: number[],
|
|
286
|
+
) => {
|
|
287
|
+
if (params.numBbThreads > 2)
|
|
288
|
+
throw new SmtTacticError("parallel.num_bb_threads must be 0, 1, or 2");
|
|
289
|
+
if (params.threadsMax === 0) throw new SmtTacticError("par2: inconsistent end state");
|
|
290
|
+
// The tactic's solver keeps the asserted formulas, and its worker copies them.
|
|
291
|
+
const source = new AssertedFormulas(manager, kernelParams.isFindingMacros);
|
|
292
|
+
for (const clause of clauses) source.assertExpr(clause);
|
|
293
|
+
const kernel = new SmtKernel(manager, kernelParams);
|
|
294
|
+
for (const formula of source.getFormulas()) kernel.assertExpr(formula);
|
|
295
|
+
kernel.internalize();
|
|
296
|
+
const result = new ParallelSolver(manager, kernel, assumptions, params).solve();
|
|
297
|
+
manager.limit.release();
|
|
298
|
+
return result;
|
|
299
|
+
};
|
|
@@ -1,4 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/ast/pattern/pattern_inference.cpp), MIT license, see z3-license.txt.
|
|
2
1
|
import {
|
|
3
2
|
AstManager,
|
|
4
3
|
FAMILY_ARITH,
|
|
@@ -9,6 +8,7 @@ import {
|
|
|
9
8
|
OP_FALSE,
|
|
10
9
|
OP_IDIV,
|
|
11
10
|
OP_MOD,
|
|
11
|
+
OP_REM,
|
|
12
12
|
OP_MUL,
|
|
13
13
|
OP_TRUE,
|
|
14
14
|
} from "./ast";
|
|
@@ -41,6 +41,7 @@ export class PatternInference {
|
|
|
41
41
|
private candidates: RefVector;
|
|
42
42
|
private candidateInfos = new Map<number, CandidateInfo>();
|
|
43
43
|
private numBindings = 0;
|
|
44
|
+
private noPatterns: number[] = [];
|
|
44
45
|
private isArithForbidden = true;
|
|
45
46
|
private isNestedArithOnly = true;
|
|
46
47
|
private isBlockingLoopPatterns = true;
|
|
@@ -51,7 +52,7 @@ export class PatternInference {
|
|
|
51
52
|
|
|
52
53
|
private isForbidden(expr: number) {
|
|
53
54
|
const manager = this.manager;
|
|
54
|
-
if (manager.
|
|
55
|
+
if (manager.isGroundApp(expr)) return false;
|
|
55
56
|
const decl = manager.funcDecls[manager.decls[expr]];
|
|
56
57
|
if (decl.isSkolem) return true;
|
|
57
58
|
if (decl.family === FAMILY_BASIC) return decl.op !== OP_TRUE && decl.op !== OP_FALSE;
|
|
@@ -92,7 +93,7 @@ export class PatternInference {
|
|
|
92
93
|
const decl = manager.funcDecls[manager.decls[expr]];
|
|
93
94
|
const isArithCandidate =
|
|
94
95
|
!this.isNestedArithOnly &&
|
|
95
|
-
(decl.op === OP_IDIV || decl.op === OP_MOD || decl.op === OP_MUL);
|
|
96
|
+
(decl.op === OP_IDIV || decl.op === OP_MOD || decl.op === OP_REM || decl.op === OP_MUL);
|
|
96
97
|
if (
|
|
97
98
|
freeVars.size > 0 &&
|
|
98
99
|
boundVars.size === 0 &&
|
|
@@ -124,7 +125,7 @@ export class PatternInference {
|
|
|
124
125
|
}
|
|
125
126
|
|
|
126
127
|
private addCandidate(expr: number, freeVars: Set<number>, size: number) {
|
|
127
|
-
if (this.candidateInfos.has(expr)) return;
|
|
128
|
+
if (this.noPatterns.includes(expr) || this.candidateInfos.has(expr)) return;
|
|
128
129
|
this.candidateInfos.set(expr, { freeVars, boundVars: new Set(), size });
|
|
129
130
|
this.candidates.push(expr);
|
|
130
131
|
}
|
|
@@ -225,7 +226,7 @@ export class PatternInference {
|
|
|
225
226
|
args[index] = args[args.length - 1];
|
|
226
227
|
index--;
|
|
227
228
|
args.pop();
|
|
228
|
-
if (manager.
|
|
229
|
+
if (manager.isGroundApp(arg)) continue;
|
|
229
230
|
for (let argIndex = 0; argIndex < manager.getNumArgs(arg); argIndex++) {
|
|
230
231
|
const innerArg = manager.getArg(arg, argIndex);
|
|
231
232
|
if (manager.kinds[innerArg] !== KIND_APP) return manager.mkPattern([candidate]);
|
|
@@ -268,8 +269,9 @@ export class PatternInference {
|
|
|
268
269
|
}
|
|
269
270
|
}
|
|
270
271
|
|
|
271
|
-
private mkPatterns(numBindings: number, body: number) {
|
|
272
|
+
private mkPatterns(numBindings: number, body: number, noPatterns: number[]) {
|
|
272
273
|
this.numBindings = numBindings;
|
|
274
|
+
this.noPatterns = noPatterns;
|
|
273
275
|
this.collect(body);
|
|
274
276
|
const result: number[] = [];
|
|
275
277
|
if (this.candidates.size > 0) {
|
|
@@ -305,19 +307,25 @@ export class PatternInference {
|
|
|
305
307
|
return result;
|
|
306
308
|
}
|
|
307
309
|
|
|
308
|
-
|
|
310
|
+
// Arithmetic, then looping and non-nested arithmetic patterns, are allowed when no pattern is
|
|
311
|
+
// found without them. The no-patterns are ignored only when they leave no other pattern.
|
|
312
|
+
infer(numBindings: number, body: number, weight: number, noPatterns: number[]): InferredPatterns {
|
|
309
313
|
this.isArithForbidden = true;
|
|
310
314
|
this.isNestedArithOnly = true;
|
|
311
315
|
this.isBlockingLoopPatterns = true;
|
|
312
|
-
const patterns = this.mkPatterns(numBindings, body);
|
|
316
|
+
const patterns = this.mkPatterns(numBindings, body, noPatterns);
|
|
313
317
|
if (patterns.length > 0) return { patterns, weight };
|
|
318
|
+
if (noPatterns.length > 0) {
|
|
319
|
+
const ignoringPatterns = this.mkPatterns(numBindings, body, []);
|
|
320
|
+
if (ignoringPatterns.length > 0) return { patterns: ignoringPatterns, weight };
|
|
321
|
+
}
|
|
314
322
|
this.isArithForbidden = false;
|
|
315
323
|
this.isBlockingLoopPatterns = false;
|
|
316
|
-
const arithPatterns = this.mkPatterns(numBindings, body);
|
|
324
|
+
const arithPatterns = this.mkPatterns(numBindings, body, noPatterns);
|
|
317
325
|
if (arithPatterns.length > 0)
|
|
318
326
|
return { patterns: arithPatterns, weight: Math.max(weight, PI_ARITH_WEIGHT) };
|
|
319
327
|
this.isNestedArithOnly = false;
|
|
320
|
-
const nonNestedPatterns = this.mkPatterns(numBindings, body);
|
|
328
|
+
const nonNestedPatterns = this.mkPatterns(numBindings, body, noPatterns);
|
|
321
329
|
return {
|
|
322
330
|
patterns: nonNestedPatterns,
|
|
323
331
|
weight: nonNestedPatterns.length > 0 ? Math.max(weight, PI_NON_NESTED_ARITH_WEIGHT) : weight,
|
|
@@ -328,7 +336,7 @@ export class PatternInference {
|
|
|
328
336
|
this.isArithForbidden = false;
|
|
329
337
|
this.isNestedArithOnly = true;
|
|
330
338
|
this.isBlockingLoopPatterns = true;
|
|
331
|
-
return this.mkPatterns(numBindings, body);
|
|
339
|
+
return this.mkPatterns(numBindings, body, []);
|
|
332
340
|
}
|
|
333
341
|
}
|
|
334
342
|
|
|
@@ -0,0 +1,281 @@
|
|
|
1
|
+
import {
|
|
2
|
+
type AstManager,
|
|
3
|
+
OP_AT_LEAST_K,
|
|
4
|
+
OP_AT_MOST_K,
|
|
5
|
+
OP_PB_EQ,
|
|
6
|
+
OP_PB_GE,
|
|
7
|
+
OP_PB_LE,
|
|
8
|
+
SORT_BOOL,
|
|
9
|
+
} from "./ast";
|
|
10
|
+
import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
|
|
11
|
+
import { getGcd, getLcm, Rational } from "./rational";
|
|
12
|
+
import type { Rewrite } from "./rewriter-tpl";
|
|
13
|
+
|
|
14
|
+
const INT32_LIMIT = 2n ** 31n;
|
|
15
|
+
|
|
16
|
+
interface PbArg {
|
|
17
|
+
expr: number;
|
|
18
|
+
coeff: Rational;
|
|
19
|
+
}
|
|
20
|
+
|
|
21
|
+
export const getPbK = (manager: AstManager, decl: number) => manager.getPbParameters(decl)[0];
|
|
22
|
+
|
|
23
|
+
export const getPbCoeff = (manager: AstManager, decl: number, index: number) => {
|
|
24
|
+
const op = manager.funcDecls[decl].op;
|
|
25
|
+
return op === OP_AT_MOST_K || op === OP_AT_LEAST_K
|
|
26
|
+
? Rational.one
|
|
27
|
+
: manager.getPbParameters(decl)[index + 1];
|
|
28
|
+
};
|
|
29
|
+
|
|
30
|
+
export const hasUnitCoefficients = (manager: AstManager, decl: number) =>
|
|
31
|
+
manager.funcDecls[decl].domain.every((_value, index) =>
|
|
32
|
+
getPbCoeff(manager, decl, index).equals(Rational.one),
|
|
33
|
+
);
|
|
34
|
+
|
|
35
|
+
const isUnsigned = (value: Rational) =>
|
|
36
|
+
value.isInt() && value.num >= 0n && value.num < 2n * INT32_LIMIT;
|
|
37
|
+
|
|
38
|
+
const isInt32 = (value: Rational) =>
|
|
39
|
+
value.isInt() && value.num >= -INT32_LIMIT && value.num < INT32_LIMIT;
|
|
40
|
+
|
|
41
|
+
const mkPbApp = (manager: AstManager, op: number, parameters: Rational[], args: number[]) =>
|
|
42
|
+
manager.mkApp(
|
|
43
|
+
manager.mkPbDecl(
|
|
44
|
+
op,
|
|
45
|
+
parameters,
|
|
46
|
+
args.map(() => SORT_BOOL),
|
|
47
|
+
),
|
|
48
|
+
args,
|
|
49
|
+
SORT_BOOL,
|
|
50
|
+
);
|
|
51
|
+
|
|
52
|
+
const normalize = (coeffs: readonly Rational[], k: Rational) => {
|
|
53
|
+
if (coeffs.every((coeff) => coeff.isInt())) return { coeffs: [...coeffs], k };
|
|
54
|
+
const scale = Rational.of(coeffs.reduce((lcm, coeff) => getLcm(lcm, coeff.den), 1n));
|
|
55
|
+
return { coeffs: coeffs.map((coeff) => coeff.mul(scale)), k: k.mul(scale) };
|
|
56
|
+
};
|
|
57
|
+
|
|
58
|
+
export const mkPbLe = (
|
|
59
|
+
manager: AstManager,
|
|
60
|
+
coeffs: readonly Rational[],
|
|
61
|
+
args: number[],
|
|
62
|
+
k: Rational,
|
|
63
|
+
) => {
|
|
64
|
+
const normalized = normalize(coeffs, k);
|
|
65
|
+
const bound = normalized.k.floor();
|
|
66
|
+
const isAllOnes = normalized.coeffs.every((coeff) => coeff.equals(Rational.one));
|
|
67
|
+
return isAllOnes && isUnsigned(k) && isInt32(bound)
|
|
68
|
+
? mkPbApp(manager, OP_AT_MOST_K, [bound], args)
|
|
69
|
+
: mkPbApp(manager, OP_PB_LE, [bound, ...normalized.coeffs], args);
|
|
70
|
+
};
|
|
71
|
+
|
|
72
|
+
export const mkPbGe = (
|
|
73
|
+
manager: AstManager,
|
|
74
|
+
coeffs: readonly Rational[],
|
|
75
|
+
args: number[],
|
|
76
|
+
k: Rational,
|
|
77
|
+
) => {
|
|
78
|
+
const normalized = normalize(coeffs, k);
|
|
79
|
+
const bound = normalized.k.ceil();
|
|
80
|
+
const isAllOnes = normalized.coeffs.every((coeff) => coeff.equals(Rational.one));
|
|
81
|
+
return isAllOnes && isUnsigned(k)
|
|
82
|
+
? mkPbApp(manager, OP_AT_LEAST_K, [bound], args)
|
|
83
|
+
: mkPbApp(manager, OP_PB_GE, [bound, ...normalized.coeffs], args);
|
|
84
|
+
};
|
|
85
|
+
|
|
86
|
+
export const mkPbEq = (
|
|
87
|
+
manager: AstManager,
|
|
88
|
+
coeffs: readonly Rational[],
|
|
89
|
+
args: number[],
|
|
90
|
+
k: Rational,
|
|
91
|
+
) => {
|
|
92
|
+
const normalized = normalize(coeffs, k);
|
|
93
|
+
if (!normalized.k.isInt()) return manager.falseExpr;
|
|
94
|
+
if (args.length === 0) return normalized.k.isZero() ? manager.trueExpr : manager.falseExpr;
|
|
95
|
+
return mkPbApp(manager, OP_PB_EQ, [normalized.k, ...normalized.coeffs], args);
|
|
96
|
+
};
|
|
97
|
+
|
|
98
|
+
// ast_util's mk_not and pb_util's negate.
|
|
99
|
+
const negate = (manager: AstManager, expr: number) =>
|
|
100
|
+
expr === manager.trueExpr
|
|
101
|
+
? manager.falseExpr
|
|
102
|
+
: expr === manager.falseExpr
|
|
103
|
+
? manager.trueExpr
|
|
104
|
+
: manager.isNot(expr)
|
|
105
|
+
? manager.getArg(expr, 0)
|
|
106
|
+
: manager.mkNot(expr);
|
|
107
|
+
|
|
108
|
+
const mkAnd = (manager: AstManager, args: number[]) =>
|
|
109
|
+
args.length === 0 ? manager.trueExpr : manager.mkAnd(args);
|
|
110
|
+
|
|
111
|
+
const unique = (manager: AstManager, args: PbArg[], bound: { k: Rational }) => {
|
|
112
|
+
for (const arg of args)
|
|
113
|
+
if (manager.isNot(arg.expr)) {
|
|
114
|
+
arg.expr = negate(manager, arg.expr);
|
|
115
|
+
bound.k = bound.k.sub(arg.coeff);
|
|
116
|
+
arg.coeff = arg.coeff.neg();
|
|
117
|
+
}
|
|
118
|
+
const kept = args.filter((arg) => {
|
|
119
|
+
if (arg.expr === manager.trueExpr) bound.k = bound.k.sub(arg.coeff);
|
|
120
|
+
return arg.expr !== manager.trueExpr && arg.expr !== manager.falseExpr;
|
|
121
|
+
});
|
|
122
|
+
const ids = manager.ids;
|
|
123
|
+
kept.sort((first, second) => ids[first.expr] - ids[second.expr]);
|
|
124
|
+
const coalesced: PbArg[] = [];
|
|
125
|
+
for (const arg of kept) {
|
|
126
|
+
const last = coalesced[coalesced.length - 1];
|
|
127
|
+
if (last !== undefined && last.expr === arg.expr) last.coeff = last.coeff.add(arg.coeff);
|
|
128
|
+
else coalesced.push({ ...arg });
|
|
129
|
+
}
|
|
130
|
+
args.splice(0, args.length, ...coalesced.filter((arg) => !arg.coeff.isZero()));
|
|
131
|
+
};
|
|
132
|
+
|
|
133
|
+
const normalizePb = (manager: AstManager, args: PbArg[], bound: { k: Rational }, isEq: boolean) => {
|
|
134
|
+
let sum = Rational.zero;
|
|
135
|
+
for (const arg of args) {
|
|
136
|
+
if (arg.coeff.isNegative()) {
|
|
137
|
+
bound.k = bound.k.sub(arg.coeff);
|
|
138
|
+
arg.coeff = arg.coeff.neg();
|
|
139
|
+
arg.expr = negate(manager, arg.expr);
|
|
140
|
+
}
|
|
141
|
+
sum = sum.add(arg.coeff);
|
|
142
|
+
}
|
|
143
|
+
if (!isEq && bound.k.compare(Rational.zero) <= 0) {
|
|
144
|
+
args.length = 0;
|
|
145
|
+
bound.k = Rational.zero;
|
|
146
|
+
return L_TRUE;
|
|
147
|
+
}
|
|
148
|
+
if (isEq && bound.k.isZero() && args.length === 0) return L_TRUE;
|
|
149
|
+
if (sum.compare(bound.k) < 0) {
|
|
150
|
+
args.length = 0;
|
|
151
|
+
bound.k = Rational.one;
|
|
152
|
+
return L_FALSE;
|
|
153
|
+
}
|
|
154
|
+
if (isEq && bound.k.equals(sum)) {
|
|
155
|
+
for (const arg of args) arg.coeff = Rational.one;
|
|
156
|
+
bound.k = Rational.fromNumber(args.length);
|
|
157
|
+
return L_UNDEF;
|
|
158
|
+
}
|
|
159
|
+
if (!args.every((arg) => arg.coeff.isInt())) {
|
|
160
|
+
const scale = Rational.of(args.reduce((lcm, arg) => getLcm(lcm, arg.coeff.den), bound.k.den));
|
|
161
|
+
bound.k = bound.k.mul(scale);
|
|
162
|
+
for (const arg of args) arg.coeff = arg.coeff.mul(scale);
|
|
163
|
+
}
|
|
164
|
+
if (isEq && bound.k.isNegative()) return L_FALSE;
|
|
165
|
+
if (isEq) return L_UNDEF;
|
|
166
|
+
sum = Rational.zero;
|
|
167
|
+
for (const arg of args) {
|
|
168
|
+
if (arg.coeff.compare(bound.k) > 0) arg.coeff = bound.k;
|
|
169
|
+
sum = sum.add(arg.coeff);
|
|
170
|
+
}
|
|
171
|
+
if (sum.equals(bound.k)) {
|
|
172
|
+
for (const arg of args) arg.coeff = Rational.one;
|
|
173
|
+
bound.k = Rational.fromNumber(args.length);
|
|
174
|
+
}
|
|
175
|
+
let gcd = 0n;
|
|
176
|
+
for (let index = 0; gcd !== 1n && index < args.length; index++) {
|
|
177
|
+
const coeff = args[index].coeff;
|
|
178
|
+
if (!coeff.equals(bound.k)) gcd = gcd === 0n ? coeff.num : getGcd(gcd, coeff.num);
|
|
179
|
+
}
|
|
180
|
+
if (gcd === 0n) {
|
|
181
|
+
for (const arg of args) arg.coeff = Rational.one;
|
|
182
|
+
bound.k = Rational.one;
|
|
183
|
+
} else if (gcd > 1n) {
|
|
184
|
+
const k = bound.k.num;
|
|
185
|
+
const newK = k / gcd + (k % gcd === 0n ? 0n : 1n);
|
|
186
|
+
for (const arg of args)
|
|
187
|
+
arg.coeff = Rational.of(arg.coeff.equals(bound.k) ? newK : arg.coeff.num / gcd);
|
|
188
|
+
bound.k = Rational.of(newK);
|
|
189
|
+
}
|
|
190
|
+
if (!bound.k.equals(Rational.one)) {
|
|
191
|
+
let min = args[0].coeff;
|
|
192
|
+
let max = args[0].coeff;
|
|
193
|
+
for (const arg of args.slice(1)) {
|
|
194
|
+
if (arg.coeff.compare(min) < 0) min = arg.coeff;
|
|
195
|
+
if (arg.coeff.compare(max) > 0) max = arg.coeff;
|
|
196
|
+
}
|
|
197
|
+
const n0 = bound.k.div(max);
|
|
198
|
+
const n1 = n0.floor();
|
|
199
|
+
const n2 = bound.k.div(min).ceil().sub(Rational.one);
|
|
200
|
+
if (n1.equals(n2) && !n0.isInt()) {
|
|
201
|
+
for (const arg of args) arg.coeff = Rational.one;
|
|
202
|
+
bound.k = n1.add(Rational.one);
|
|
203
|
+
}
|
|
204
|
+
}
|
|
205
|
+
return L_UNDEF;
|
|
206
|
+
};
|
|
207
|
+
|
|
208
|
+
const prune = (manager: AstManager, args: PbArg[], bound: { k: Rational }, isEq: boolean) => {
|
|
209
|
+
if (isEq) return;
|
|
210
|
+
let nlt = Rational.zero;
|
|
211
|
+
let occ = 0;
|
|
212
|
+
for (let index = 0; nlt.compare(bound.k) < 0 && index < args.length; index++)
|
|
213
|
+
if (args[index].coeff.compare(bound.k) < 0) {
|
|
214
|
+
nlt = nlt.add(args[index].coeff);
|
|
215
|
+
occ++;
|
|
216
|
+
}
|
|
217
|
+
if (occ === 0 || nlt.compare(bound.k) >= 0) return;
|
|
218
|
+
for (let index = 0; index < args.length; index++)
|
|
219
|
+
if (args[index].coeff.compare(bound.k) < 0) {
|
|
220
|
+
args[index] = args[args.length - 1];
|
|
221
|
+
args.pop();
|
|
222
|
+
index--;
|
|
223
|
+
}
|
|
224
|
+
unique(manager, args, bound);
|
|
225
|
+
normalizePb(manager, args, bound, isEq);
|
|
226
|
+
};
|
|
227
|
+
|
|
228
|
+
// pb_rewriter::mk_app_core.
|
|
229
|
+
export const mkPbAppCore = (
|
|
230
|
+
manager: AstManager,
|
|
231
|
+
decl: number,
|
|
232
|
+
args: readonly number[],
|
|
233
|
+
): number | Rewrite => {
|
|
234
|
+
const op = manager.funcDecls[decl].op;
|
|
235
|
+
const isNegated = op === OP_AT_MOST_K || op === OP_PB_LE;
|
|
236
|
+
const vec = args.map((expr, index) => {
|
|
237
|
+
const coeff = getPbCoeff(manager, decl, index);
|
|
238
|
+
return { expr, coeff: isNegated ? coeff.neg() : coeff };
|
|
239
|
+
});
|
|
240
|
+
const bound = { k: isNegated ? getPbK(manager, decl).neg() : getPbK(manager, decl) };
|
|
241
|
+
const isEq = op === OP_PB_EQ;
|
|
242
|
+
unique(manager, vec, bound);
|
|
243
|
+
const isSat = normalizePb(manager, vec, bound, isEq);
|
|
244
|
+
prune(manager, vec, bound, isEq);
|
|
245
|
+
if (isSat === L_TRUE) return manager.trueExpr;
|
|
246
|
+
if (isSat === L_FALSE) return manager.falseExpr;
|
|
247
|
+
const isAllUnit = vec.every((arg) => arg.coeff.equals(Rational.one));
|
|
248
|
+
const exprs = vec.map((arg) => arg.expr);
|
|
249
|
+
const coeffs = vec.map((arg) => arg.coeff);
|
|
250
|
+
let slack = coeffs.reduce((sum, coeff) => sum.add(coeff), Rational.zero);
|
|
251
|
+
let k = bound.k;
|
|
252
|
+
const size = vec.length;
|
|
253
|
+
if (isEq) {
|
|
254
|
+
if (size === 0) return k.isZero() ? manager.trueExpr : manager.falseExpr;
|
|
255
|
+
if (k.isZero()) return negate(manager, manager.mkOr(exprs));
|
|
256
|
+
if (k.equals(Rational.one) && isAllUnit && size === 1) return exprs[0];
|
|
257
|
+
if (slack.equals(k)) return mkAnd(manager, exprs);
|
|
258
|
+
return mkPbEq(manager, coeffs, exprs, k);
|
|
259
|
+
}
|
|
260
|
+
if (isAllUnit && k.equals(Rational.one) && size < 10) return manager.mkOr(exprs);
|
|
261
|
+
if (isAllUnit && k.equals(Rational.fromNumber(size))) return mkAnd(manager, exprs);
|
|
262
|
+
const conj: number[] = [];
|
|
263
|
+
const disj: number[] = [];
|
|
264
|
+
const restArgs: number[] = [];
|
|
265
|
+
const restCoeffs: Rational[] = [];
|
|
266
|
+
for (const [index, coeff] of coeffs.entries()) {
|
|
267
|
+
if (slack.compare(coeff.add(k)) < 0) {
|
|
268
|
+
conj.push(exprs[index]);
|
|
269
|
+
slack = slack.sub(coeff);
|
|
270
|
+
k = k.sub(coeff);
|
|
271
|
+
} else if (coeff.compare(k) >= 0 && k.isPositive()) disj.push(exprs[index]);
|
|
272
|
+
else {
|
|
273
|
+
restArgs.push(exprs[index]);
|
|
274
|
+
restCoeffs.push(coeff);
|
|
275
|
+
}
|
|
276
|
+
}
|
|
277
|
+
if (restArgs.length > 0) disj.push(mkPbGe(manager, restCoeffs, restArgs, k));
|
|
278
|
+
if (disj.length > 0) conj.push(manager.mkOr(disj));
|
|
279
|
+
const result = mkAnd(manager, conj);
|
|
280
|
+
return disj.length > 1 || conj.length > 1 ? { expr: result, depth: 3 } : result;
|
|
281
|
+
};
|