tla-ts 0.0.10-dev.28c823e4b → 0.0.10-dev.3a85c3a9e
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +2 -1
- package/dist/compile.cjs +6 -6
- package/dist/compile.js +10 -10
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +57 -53
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +3 -0
- package/dist/index.d.ts +3 -0
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove.cjs +2683 -427
- package/dist/prove.js +2681 -425
- package/dist/run.cjs +45 -42
- package/dist/run.js +47 -44
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +42 -39
- package/dist/transfer.js +44 -41
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +41 -36
- package/src/builtins.ts +4 -13
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +282 -0
- package/src/check.ts +353 -549
- package/src/cli/options.ts +6 -31
- package/src/cli/shared.ts +1 -1
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +222 -210
- package/src/cli/tlc-output.ts +687 -0
- package/src/cli/tlc-usage.ts +1 -2
- package/src/cli/tlc.ts +34 -701
- package/src/cli/xml-exporter.ts +23 -33
- package/src/codegen.ts +5 -10
- package/src/coverage.ts +3 -10
- package/src/dependencies.ts +30 -14
- package/src/dfid.ts +16 -16
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +45 -333
- package/src/errors.ts +33 -5
- package/src/evaluate.ts +5 -4
- package/src/exit-codes.ts +1 -0
- package/src/fingerprints.ts +65 -1
- package/src/instances.ts +47 -10
- package/src/java-hash.ts +7 -0
- package/src/json.ts +4 -7
- package/src/levels.ts +39 -42
- package/src/lexer.ts +5 -3
- package/src/liveness-checker.ts +553 -237
- package/src/liveness.ts +94 -86
- package/src/obligations/action.ts +14 -17
- package/src/obligations/anonymize.ts +37 -16
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +36 -8
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +66 -54
- package/src/obligations/index.ts +38 -8
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +28 -41
- package/src/obligations/normalize.ts +26 -14
- 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 +55 -50
- package/src/obligations/source.ts +118 -74
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +5 -7
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +10 -30
- package/src/parallel.ts +24 -47
- package/src/parser.ts +580 -180
- package/src/pretty-print.ts +1 -1
- package/src/prover/decide-pool.ts +3 -3
- package/src/prover/deciders.ts +12 -9
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +72 -42
- package/src/prover/isabelle/isar/attrib.ts +250 -0
- package/src/prover/isabelle/isar/context.ts +335 -0
- package/src/prover/isabelle/isar/induct.ts +382 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
- package/src/prover/isabelle/isar/method.ts +509 -212
- package/src/prover/isabelle/isar/proof.ts +570 -14
- package/src/prover/isabelle/isar/rule-cases.ts +224 -0
- package/src/prover/isabelle/isar/theory.ts +487 -76
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +89 -14
- package/src/prover/isabelle/provers/blast/blast.ts +7 -65
- package/src/prover/isabelle/provers/blast/branch.ts +0 -2
- package/src/prover/isabelle/provers/blast/prove.ts +0 -2
- package/src/prover/isabelle/provers/blast/rules.ts +0 -2
- package/src/prover/isabelle/provers/blast/state.ts +0 -2
- package/src/prover/isabelle/provers/blast/term.ts +0 -2
- package/src/prover/isabelle/provers/clasimp.ts +0 -2
- package/src/prover/isabelle/provers/classical.ts +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +17 -28
- package/src/prover/isabelle/pure/bicompose.ts +9 -27
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +2 -10
- package/src/prover/isabelle/pure/drule.ts +72 -6
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +1 -3
- package/src/prover/isabelle/pure/logic.ts +1 -3
- package/src/prover/isabelle/pure/name.ts +0 -2
- package/src/prover/isabelle/pure/net.ts +0 -2
- package/src/prover/isabelle/pure/object-logic.ts +13 -7
- package/src/prover/isabelle/pure/pattern.ts +0 -2
- package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
- package/src/prover/isabelle/pure/rewriter.ts +6 -17
- package/src/prover/isabelle/pure/search.ts +0 -2
- package/src/prover/isabelle/pure/seq.ts +0 -2
- package/src/prover/isabelle/pure/simplifier.ts +26 -7
- package/src/prover/isabelle/pure/table.ts +2 -3
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +42 -37
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +0 -2
- package/src/prover/isabelle/pure/thm.ts +14 -13
- package/src/prover/isabelle/pure/type.ts +0 -2
- package/src/prover/isabelle/pure/unify.ts +0 -2
- package/src/prover/isabelle/pure/variable.ts +0 -2
- package/src/prover/isabelle/tla/classical-setup.ts +18 -16
- package/src/prover/isabelle/tla/context.ts +58 -11
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +49 -21
- package/src/prover/isabelle/tla/simpdata.ts +1 -12
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +30 -31
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/fingerprint.ts +2 -5
- package/src/prover/prep/methods.ts +181 -51
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +395 -94
- package/src/prover/ptl/decide.ts +95 -50
- package/src/prover/ptl/encode.ts +2 -3
- package/src/prover/ptl/tableau.ts +28 -2
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -8
- package/src/prover/smt/context.ts +43 -8
- package/src/prover/smt/data.ts +498 -379
- package/src/prover/smt/encode.ts +148 -57
- package/src/prover/smt/extensionality.ts +5 -3
- package/src/prover/smt/flatten.ts +4 -6
- package/src/prover/smt/format.ts +28 -4
- package/src/prover/smt/instances.ts +7 -1
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1021 -618
- 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 +87 -16
- package/src/prover/smt/solver/ast-lt.ts +166 -12
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1427 -41
- package/src/prover/smt/solver/auf-solver.ts +2 -6
- package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +600 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +110 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -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 +516 -115
- package/src/prover/smt/solver/ctx-simplify.ts +20 -10
- 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 +206 -0
- package/src/prover/smt/solver/distribute-forall.ts +57 -0
- package/src/prover/smt/solver/dom-simplify.ts +511 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -1
- package/src/prover/smt/solver/e-matching.ts +7 -8
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
- package/src/prover/smt/solver/enode.ts +100 -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 +907 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1050 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +335 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
- package/src/prover/smt/solver/expr2polynomial.ts +146 -0
- package/src/prover/smt/solver/factor.ts +141 -0
- package/src/prover/smt/solver/fd-solver.ts +265 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -15
- package/src/prover/smt/solver/fix-dl-var.ts +148 -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 +640 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +175 -15
- package/src/prover/smt/solver/goal2nlsat.ts +189 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -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 +110 -38
- 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 +0 -1
- package/src/prover/smt/solver/lp/core-solver.ts +18 -3
- package/src/prover/smt/solver/lp/cross-nested.ts +0 -1
- package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
- package/src/prover/smt/solver/lp/dependency.ts +0 -2
- package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
- package/src/prover/smt/solver/lp/explanation.ts +0 -1
- package/src/prover/smt/solver/lp/gomory.ts +0 -1
- package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
- package/src/prover/smt/solver/lp/hnf.ts +0 -3
- package/src/prover/smt/solver/lp/int-cube.ts +3 -4
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +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 +0 -1
- package/src/prover/smt/solver/lp/nex.ts +0 -1
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +0 -2
- package/src/prover/smt/solver/lp/nla-core.ts +42 -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 +9 -4
- 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 +25 -4
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
- package/src/prover/smt/solver/lp/pdd.ts +2 -2
- package/src/prover/smt/solver/lp/random-updater.ts +0 -2
- package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
- package/src/prover/smt/solver/lp/union-find.ts +7 -2
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +122 -90
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +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 +18 -27
- package/src/prover/smt/solver/model-evaluator.ts +188 -12
- package/src/prover/smt/solver/model-finder.ts +12 -18
- package/src/prover/smt/solver/model-generator.ts +56 -29
- package/src/prover/smt/solver/model-macro-solver.ts +49 -46
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +711 -0
- package/src/prover/smt/solver/mus.ts +51 -0
- package/src/prover/smt/solver/muz/dl-context.ts +404 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
- package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +63 -23
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
- package/src/prover/smt/solver/nlsat/solver.ts +234 -36
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
- package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
- 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 +787 -0
- package/src/prover/smt/solver/opt-nlsat.ts +375 -0
- package/src/prover/smt/solver/opt-pareto.ts +282 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +308 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +19 -11
- package/src/prover/smt/solver/pb-rewriter.ts +284 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +202 -57
- package/src/prover/smt/solver/probes.ts +512 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +648 -19
- package/src/prover/smt/solver/pull-quant.ts +28 -12
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -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 +1498 -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 +19 -20
- package/src/prover/smt/solver/quantifier-manager.ts +8 -16
- 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 +261 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -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 +25 -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 +43 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2127 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +1010 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1301 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +728 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
- package/src/prover/smt/solver/seq-skolem.ts +317 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +83 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +496 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
- package/src/prover/smt/solver/smtlib-script.ts +1631 -0
- package/src/prover/smt/solver/solve-eqs.ts +929 -0
- package/src/prover/smt/solver/solver.ts +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 +1986 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1200 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
- package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
- package/src/prover/smt/solver/theory-lra-internalize.ts +86 -27
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
- package/src/prover/smt/solver/theory-lra-state.ts +6 -22
- package/src/prover/smt/solver/theory-lra.ts +188 -1
- package/src/prover/smt/solver/theory-pb.ts +934 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +871 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
- package/src/prover/smt/solver/var-subst.ts +36 -14
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +50 -19
- package/src/prover/tlapm/tlapm.ts +15 -9
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -0
- package/src/prover/zenon/check/check.ts +1 -2
- package/src/prover/zenon/check/records.ts +1 -1
- package/src/prover/zenon/check/relations.ts +2 -1
- package/src/prover/zenon/check/rewrites.ts +2 -15
- package/src/prover/zenon/check/sets.ts +40 -58
- package/src/prover/zenon/check/terms.ts +1 -2
- package/src/prover/zenon/decide.ts +10 -7
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +2 -2
- package/src/prover/zenon/equality-rules.ts +0 -2
- package/src/prover/zenon/expr.ts +7 -2
- package/src/prover/zenon/index-table.ts +9 -21
- package/src/prover/zenon/isar-case.ts +0 -2
- package/src/prover/zenon/isar.ts +35 -37
- package/src/prover/zenon/llproof.ts +2 -13
- package/src/prover/zenon/mltoll.ts +12 -30
- package/src/prover/zenon/node.ts +20 -5
- package/src/prover/zenon/parse.ts +9 -8
- package/src/prover/zenon/phrase.ts +0 -2
- package/src/prover/zenon/proof.ts +0 -2
- package/src/prover/zenon/propositional-rules.ts +0 -2
- package/src/prover/zenon/rules.ts +0 -2
- package/src/prover/zenon/search.ts +11 -19
- package/src/prover/zenon/tla/functions.ts +2 -4
- package/src/prover/zenon/tla/llproof.ts +9 -13
- package/src/prover/zenon/tla/records.ts +1 -8
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +22 -22
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +7 -8
- package/src/resolve.ts +55 -72
- package/src/sany/generation.ts +394 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1100 -0
- package/src/sany/generator-proofs.ts +662 -0
- package/src/sany/generator.ts +155 -2625
- package/src/sany/levels.ts +0 -2
- package/src/sany/lexer.ts +17 -16
- package/src/sany/linter.ts +0 -2
- package/src/sany/nodes.ts +6 -13
- package/src/sany/report.ts +3 -6
- package/src/sany/selectors.ts +35 -38
- package/src/sany/xml.ts +23 -55
- package/src/search.ts +196 -43
- package/src/simulate.ts +157 -133
- package/src/spec-description.ts +33 -48
- package/src/standard-modules.ts +16 -32
- package/src/state-graph.ts +2 -9
- package/src/substitution-levels.ts +5 -4
- package/src/successors.ts +6 -8
- package/src/symmetry.ts +2 -2
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/messages.ts +20 -15
- package/src/tlc/order.ts +2 -9
- package/src/tlc/random.ts +4 -4
- package/src/tlc/replay.ts +8 -15
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlc-operators.ts +2 -3
- package/src/tlc/trace-spec.ts +25 -45
- package/src/typed-tier.ts +6535 -0
- package/src/typescript/actions.ts +2 -4
- package/src/typescript/collections.ts +34 -20
- package/src/typescript/compile.ts +1 -3
- package/src/typescript/formula.ts +5 -3
- package/src/typescript/model.ts +4 -5
- package/src/typescript/steps.ts +20 -18
- package/src/values.ts +63 -158
- 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,889 @@
|
|
|
1
|
+
import { mkBoundAtom, mkTermEqSides } from "../arith-terms";
|
|
2
|
+
import {
|
|
3
|
+
FAMILY_ARITH,
|
|
4
|
+
OP_ADD,
|
|
5
|
+
OP_DIV,
|
|
6
|
+
OP_GE,
|
|
7
|
+
OP_GT,
|
|
8
|
+
OP_IDIV,
|
|
9
|
+
OP_IS_INT,
|
|
10
|
+
OP_ITE,
|
|
11
|
+
OP_LE,
|
|
12
|
+
OP_LT,
|
|
13
|
+
OP_MOD,
|
|
14
|
+
OP_MUL,
|
|
15
|
+
OP_NUM,
|
|
16
|
+
OP_POWER,
|
|
17
|
+
OP_REM,
|
|
18
|
+
OP_SUB,
|
|
19
|
+
OP_TO_INT,
|
|
20
|
+
OP_TO_REAL,
|
|
21
|
+
OP_UMINUS,
|
|
22
|
+
} from "../ast";
|
|
23
|
+
import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
|
|
24
|
+
import { getImpliedKind, BoundPropagator, type ImpliedBound } from "../lp/bound-propagator";
|
|
25
|
+
import {
|
|
26
|
+
type ConstraintKind,
|
|
27
|
+
KIND_EQ,
|
|
28
|
+
KIND_GE,
|
|
29
|
+
KIND_GT,
|
|
30
|
+
KIND_LE,
|
|
31
|
+
KIND_LT,
|
|
32
|
+
KIND_NE,
|
|
33
|
+
} from "../lp/constraints";
|
|
34
|
+
import { LP_FEASIBLE, LP_INFEASIBLE, LP_OPTIMAL, LP_UNBOUNDED } from "../lp/core-solver";
|
|
35
|
+
import { type Dependency, linearize, mkJoin, mkLeaf } from "../lp/dependency";
|
|
36
|
+
import type { Explanation } from "../lp/explanation";
|
|
37
|
+
import { IntSolver } from "../lp/int-solver";
|
|
38
|
+
import { NULL_LPVAR } from "../lp/lar-solver";
|
|
39
|
+
import type { LarTerm } from "../lp/lar-term";
|
|
40
|
+
import type { Ineq, Lemma } from "../lp/nla-types";
|
|
41
|
+
import { Impq } from "../lp/numeric-pair";
|
|
42
|
+
import { randomUpdate } from "../lp/random-updater";
|
|
43
|
+
import { Anum } from "../nlsat/algebraic";
|
|
44
|
+
import type { ProtoModel } from "../proto-model";
|
|
45
|
+
import { Rational } from "../rational";
|
|
46
|
+
import { CR_CONTINUE, CR_DONE, CR_GIVEUP } from "../sat/solver";
|
|
47
|
+
import type { ArithBound } from "./arith-internalize";
|
|
48
|
+
import { ArithAxioms } from "./arith-axioms";
|
|
49
|
+
import { type Enode, NULL_THEORY_VAR } from "./egraph";
|
|
50
|
+
import { addDependency, type Dependencies } from "./th-solver";
|
|
51
|
+
|
|
52
|
+
const SMALL_LEMMA_SIZE = 16;
|
|
53
|
+
|
|
54
|
+
interface TermBound {
|
|
55
|
+
readonly constraint: number;
|
|
56
|
+
readonly value: Rational;
|
|
57
|
+
}
|
|
58
|
+
|
|
59
|
+
// lp_api::bound::get_value: the value the bound asserts when its atom has the polarity isTrue.
|
|
60
|
+
const getBoundValue = (bound: ArithBound, isTrue: boolean) => {
|
|
61
|
+
if (isTrue !== ((bound.lit & 1) === 1)) return new Impq(bound.value);
|
|
62
|
+
if (bound.isInt)
|
|
63
|
+
return new Impq(bound.isLower ? bound.value.sub(Rational.one) : bound.value.add(Rational.one));
|
|
64
|
+
return new Impq(bound.value, bound.isLower ? Rational.minusOne : Rational.one);
|
|
65
|
+
};
|
|
66
|
+
|
|
67
|
+
const compareToRational = (value: Impq, rational: Rational) => value.compare(new Impq(rational));
|
|
68
|
+
|
|
69
|
+
export class ArithSolver extends ArithAxioms {
|
|
70
|
+
private assertedLits: number[] = [];
|
|
71
|
+
private assertedQhead = 0;
|
|
72
|
+
private lia = new IntSolver(this.solver);
|
|
73
|
+
private bp = new BoundPropagator(this.solver, {
|
|
74
|
+
columnIsInteresting: (column) => this.columnIsInteresting(column),
|
|
75
|
+
boundIsInteresting: (column, kind, value) => this.boundIsInteresting(column, kind, value),
|
|
76
|
+
isEqual: (first, second) => this.isEqual(first, second),
|
|
77
|
+
addEq: (first, second, explanation, isFixed) => this.addEq(first, second, explanation, isFixed),
|
|
78
|
+
});
|
|
79
|
+
private lowerTerms: (TermBound | undefined)[] = [];
|
|
80
|
+
private upperTerms: (TermBound | undefined)[] = [];
|
|
81
|
+
private isModelInitialized = false;
|
|
82
|
+
private isUsingNraModel = false;
|
|
83
|
+
private assumeEqCandidates: [number, number][] = [];
|
|
84
|
+
private assumeEqHead = 0;
|
|
85
|
+
|
|
86
|
+
override asserted(lit: number) {
|
|
87
|
+
this.forcePush();
|
|
88
|
+
this.assertedLits.push(lit);
|
|
89
|
+
const bound = this.boolVar2bound.get(lit >> 1);
|
|
90
|
+
if (bound !== undefined) this.updateUnassignedBounds(bound.thVar, -1);
|
|
91
|
+
}
|
|
92
|
+
|
|
93
|
+
override unitPropagate() {
|
|
94
|
+
this.isModelInitialized = false;
|
|
95
|
+
if (
|
|
96
|
+
this.solver.columnsWithChangedBounds.size === 0 &&
|
|
97
|
+
!this.isNewEq &&
|
|
98
|
+
this.newBounds.length === 0 &&
|
|
99
|
+
this.assertedQhead === this.assertedLits.length
|
|
100
|
+
)
|
|
101
|
+
return false;
|
|
102
|
+
this.isNewEq = false;
|
|
103
|
+
this.flushBoundAxioms();
|
|
104
|
+
this.propagateNla();
|
|
105
|
+
const s = this.s;
|
|
106
|
+
const limit = this.manager.limit;
|
|
107
|
+
const qhead = this.assertedQhead;
|
|
108
|
+
while (this.assertedQhead < this.assertedLits.length && !s.isInconsistent && limit.inc()) {
|
|
109
|
+
const lit = this.assertedLits[this.assertedQhead];
|
|
110
|
+
const bound = this.boolVar2bound.get(lit >> 1);
|
|
111
|
+
if (bound !== undefined) this.assertBound((lit & 1) === (bound.lit & 1), bound);
|
|
112
|
+
this.assertedQhead++;
|
|
113
|
+
}
|
|
114
|
+
if (s.isInconsistent) return true;
|
|
115
|
+
const status = this.makeFeasible();
|
|
116
|
+
if (!limit.inc()) return false;
|
|
117
|
+
if (status === L_FALSE) this.setInfeasibilityConflict();
|
|
118
|
+
else if (status === L_TRUE) {
|
|
119
|
+
this.propagateBasicBounds(qhead);
|
|
120
|
+
this.propagateBoundsWithLpSolver();
|
|
121
|
+
}
|
|
122
|
+
return true;
|
|
123
|
+
}
|
|
124
|
+
|
|
125
|
+
private propagateBasicBounds(start: number) {
|
|
126
|
+
for (let qhead = start; qhead < this.assertedQhead && !this.s.isInconsistent; qhead++) {
|
|
127
|
+
const lit = this.assertedLits[qhead];
|
|
128
|
+
const bound = this.boolVar2bound.get(lit >> 1);
|
|
129
|
+
if (bound !== undefined) this.propagateBound(lit, bound);
|
|
130
|
+
}
|
|
131
|
+
}
|
|
132
|
+
|
|
133
|
+
private propagateBound(lit1: number, bound: ArithBound) {
|
|
134
|
+
const isTrue = (lit1 & 1) === 0;
|
|
135
|
+
const thVar = bound.thVar;
|
|
136
|
+
const value = getBoundValue(bound, isTrue);
|
|
137
|
+
const isSamePolarity = (bound.lit & 1) === (lit1 & 1);
|
|
138
|
+
const bounds = this.bounds[thVar];
|
|
139
|
+
if (bounds.length === 1 || this.unassignedBounds[thVar] === 0) return;
|
|
140
|
+
const isStrict = isSamePolarity || bound.isInt;
|
|
141
|
+
let lit2: number;
|
|
142
|
+
if (isSamePolarity === bound.isLower) {
|
|
143
|
+
let glb: ArithBound | undefined;
|
|
144
|
+
for (const other of bounds) {
|
|
145
|
+
if (other === bound) continue;
|
|
146
|
+
if (glb !== undefined && glb.value.compare(other.value) >= 0) continue;
|
|
147
|
+
const comparison = compareToRational(value, other.value);
|
|
148
|
+
if (isStrict ? comparison > 0 : comparison >= 0) glb = other;
|
|
149
|
+
}
|
|
150
|
+
if (glb === undefined) return;
|
|
151
|
+
lit2 = glb.isLower ? glb.lit : glb.lit ^ 1;
|
|
152
|
+
} else {
|
|
153
|
+
let lub: ArithBound | undefined;
|
|
154
|
+
for (const other of bounds) {
|
|
155
|
+
if (other === bound) continue;
|
|
156
|
+
if (lub !== undefined && other.value.compare(lub.value) >= 0) continue;
|
|
157
|
+
const comparison = compareToRational(value, other.value);
|
|
158
|
+
if (isStrict ? comparison < 0 : comparison <= 0) lub = other;
|
|
159
|
+
}
|
|
160
|
+
if (lub === undefined) return;
|
|
161
|
+
lit2 = lub.isLower ? lub.lit ^ 1 : lub.lit;
|
|
162
|
+
}
|
|
163
|
+
this.resetEvidence();
|
|
164
|
+
this.core.push(lit1);
|
|
165
|
+
this.assign(lit2, this.core, this.eqs);
|
|
166
|
+
}
|
|
167
|
+
|
|
168
|
+
private propagateBoundsWithLpSolver() {
|
|
169
|
+
this.bp.init();
|
|
170
|
+
this.bp.propagateBoundsForTouchedRows();
|
|
171
|
+
const limit = this.manager.limit;
|
|
172
|
+
if (!limit.inc()) return;
|
|
173
|
+
if (this.solver.status === LP_INFEASIBLE) {
|
|
174
|
+
this.setInfeasibilityConflict();
|
|
175
|
+
return;
|
|
176
|
+
}
|
|
177
|
+
for (const implied of this.bp.ibounds)
|
|
178
|
+
if (limit.inc() && !this.s.isInconsistent) this.propagateLpSolverBound(implied);
|
|
179
|
+
}
|
|
180
|
+
|
|
181
|
+
private propagateLpSolverBound(implied: ImpliedBound) {
|
|
182
|
+
const thVar = this.solver.getExternal(implied.column);
|
|
183
|
+
if (thVar === NULL_THEORY_VAR) return;
|
|
184
|
+
this.reserveBounds(thVar);
|
|
185
|
+
if (this.unassignedBounds[thVar] === 0) return;
|
|
186
|
+
const kind = getImpliedKind(implied);
|
|
187
|
+
let isFirst = true;
|
|
188
|
+
for (const bound of this.bounds[thVar]) {
|
|
189
|
+
if (this.s.value(bound.lit) !== L_UNDEF) continue;
|
|
190
|
+
const lit = this.isBoundImplied(kind, implied.bound, bound);
|
|
191
|
+
if (lit === undefined) continue;
|
|
192
|
+
if (isFirst) {
|
|
193
|
+
isFirst = false;
|
|
194
|
+
this.resetEvidence();
|
|
195
|
+
this.explanation.clear();
|
|
196
|
+
for (const entry of implied.explain())
|
|
197
|
+
for (const constraint of linearize([entry[1]])) this.consume(entry[0], constraint);
|
|
198
|
+
}
|
|
199
|
+
this.assign(lit, this.core, this.eqs);
|
|
200
|
+
}
|
|
201
|
+
}
|
|
202
|
+
|
|
203
|
+
private isBoundImplied(kind: ConstraintKind, value: Rational, bound: ArithBound) {
|
|
204
|
+
const comparison = value.compare(bound.value);
|
|
205
|
+
if ((kind === KIND_LE || kind === KIND_LT) && !bound.isLower && comparison <= 0)
|
|
206
|
+
return bound.lit;
|
|
207
|
+
if ((kind === KIND_GE || kind === KIND_GT) && bound.isLower && comparison >= 0)
|
|
208
|
+
return bound.lit;
|
|
209
|
+
if (kind === KIND_LE && bound.isLower && comparison < 0) return bound.lit ^ 1;
|
|
210
|
+
if (kind === KIND_LT && bound.isLower && comparison <= 0) return bound.lit ^ 1;
|
|
211
|
+
if (kind === KIND_GE && !bound.isLower && comparison > 0) return bound.lit ^ 1;
|
|
212
|
+
if (kind === KIND_GT && !bound.isLower && comparison >= 0) return bound.lit ^ 1;
|
|
213
|
+
return undefined;
|
|
214
|
+
}
|
|
215
|
+
|
|
216
|
+
private addEquality(column: number, value: Rational, explanation: Explanation) {
|
|
217
|
+
const thVar = value.equals(Rational.one)
|
|
218
|
+
? this.oneVar
|
|
219
|
+
: value.isZero()
|
|
220
|
+
? this.zeroVar
|
|
221
|
+
: this.value2var.get(value.toString());
|
|
222
|
+
if (thVar === undefined) return;
|
|
223
|
+
if (this.solver.getExternal(column) < 0) return;
|
|
224
|
+
this.addEq(this.registerVar(thVar), column, explanation, true);
|
|
225
|
+
}
|
|
226
|
+
|
|
227
|
+
private addEq(first: number, second: number, explanation: Explanation, isFixed: boolean) {
|
|
228
|
+
if (this.s.isInconsistent) return false;
|
|
229
|
+
const solver = this.solver;
|
|
230
|
+
const v1 = solver.getExternal(first);
|
|
231
|
+
const v2 = solver.getExternal(second);
|
|
232
|
+
if (v1 === NULL_THEORY_VAR || v2 === NULL_THEORY_VAR) return false;
|
|
233
|
+
if (this.isEqual(v1, v2)) return false;
|
|
234
|
+
const manager = this.manager;
|
|
235
|
+
const n1 = this.var2enodeOf(v1);
|
|
236
|
+
const n2 = this.var2enodeOf(v2);
|
|
237
|
+
const e1 = n1.owner;
|
|
238
|
+
const e2 = n2.owner;
|
|
239
|
+
if (
|
|
240
|
+
!isFixed &&
|
|
241
|
+
!manager.isNumeral(e1) &&
|
|
242
|
+
!manager.isNumeral(e2) &&
|
|
243
|
+
(manager.getOp(e1) === OP_ITE || manager.getOp(e2) === OP_ITE)
|
|
244
|
+
)
|
|
245
|
+
return false;
|
|
246
|
+
if (manager.sorts[e1] !== manager.sorts[e2]) return false;
|
|
247
|
+
this.resetEvidence();
|
|
248
|
+
for (const constraint of explanation) this.setEvidence(constraint);
|
|
249
|
+
this.propagateEq(this.core, this.eqs, n1, n2);
|
|
250
|
+
return true;
|
|
251
|
+
}
|
|
252
|
+
|
|
253
|
+
private columnIsInteresting(column: number) {
|
|
254
|
+
const thVar = this.solver.getExternal(column);
|
|
255
|
+
if (thVar === NULL_THEORY_VAR) return false;
|
|
256
|
+
return thVar < this.unassignedBounds.length && this.unassignedBounds[thVar] > 0;
|
|
257
|
+
}
|
|
258
|
+
|
|
259
|
+
private boundIsInteresting(column: number, kind: ConstraintKind, value: Rational) {
|
|
260
|
+
const thVar = this.solver.getExternal(column);
|
|
261
|
+
if (thVar === NULL_THEORY_VAR) return false;
|
|
262
|
+
if (this.bounds.length <= thVar || this.unassignedBounds[thVar] === 0) return false;
|
|
263
|
+
return this.bounds[thVar].some(
|
|
264
|
+
(bound) =>
|
|
265
|
+
this.s.value(bound.lit) === L_UNDEF &&
|
|
266
|
+
this.isBoundImplied(kind, value, bound) !== undefined,
|
|
267
|
+
);
|
|
268
|
+
}
|
|
269
|
+
|
|
270
|
+
private assertBound(isTrue: boolean, bound: ArithBound) {
|
|
271
|
+
const solver = this.solver;
|
|
272
|
+
const constraint = isTrue ? bound.constraintTrue : bound.constraintFalse;
|
|
273
|
+
if (solver.constraintIsRedundant(constraint)) return;
|
|
274
|
+
solver.activate(constraint);
|
|
275
|
+
if (solver.status === LP_INFEASIBLE) return;
|
|
276
|
+
const kind = this.boundToConstraintKind(bound.isInt, bound.isLower, isTrue);
|
|
277
|
+
const value = getBoundValue(bound, isTrue);
|
|
278
|
+
if (value.y.isZero()) this.propagateEqs(bound.column, constraint, kind, bound, value.x);
|
|
279
|
+
}
|
|
280
|
+
|
|
281
|
+
private propagateEqs(
|
|
282
|
+
column: number,
|
|
283
|
+
constraint: number,
|
|
284
|
+
kind: ConstraintKind,
|
|
285
|
+
bound: ArithBound,
|
|
286
|
+
value: Rational,
|
|
287
|
+
) {
|
|
288
|
+
if (kind !== KIND_GE && kind !== KIND_LE) return;
|
|
289
|
+
const isLower = kind === KIND_GE;
|
|
290
|
+
if (!this.setBound(column, constraint, value, isLower)) return;
|
|
291
|
+
const dep = this.hasBound(column, value, !isLower);
|
|
292
|
+
if (dep === undefined) return;
|
|
293
|
+
this.fixedVarEh(bound.thVar, mkJoin(mkLeaf(constraint), dep), value);
|
|
294
|
+
}
|
|
295
|
+
|
|
296
|
+
private setBound(column: number, constraint: number, value: Rational, isLower: boolean) {
|
|
297
|
+
const solver = this.solver;
|
|
298
|
+
if (!solver.hasTerm(column)) {
|
|
299
|
+
const bound = solver.getBound(column, !isLower);
|
|
300
|
+
return bound !== undefined && !bound.isStrict && bound.value.equals(value);
|
|
301
|
+
}
|
|
302
|
+
const terms = isLower ? this.lowerTerms : this.upperTerms;
|
|
303
|
+
const existing = terms[column];
|
|
304
|
+
if (
|
|
305
|
+
existing === undefined ||
|
|
306
|
+
(isLower ? existing.value.compare(value) < 0 : existing.value.compare(value) > 0)
|
|
307
|
+
) {
|
|
308
|
+
this.ctx.trail.push(() => {
|
|
309
|
+
terms[column] = existing;
|
|
310
|
+
});
|
|
311
|
+
terms[column] = { constraint, value };
|
|
312
|
+
}
|
|
313
|
+
return true;
|
|
314
|
+
}
|
|
315
|
+
|
|
316
|
+
// has_bound: the dependency of a bound of the column at the value, or undefined if it has none.
|
|
317
|
+
private hasBound(column: number, value: Rational, isLower: boolean): Dependency | undefined {
|
|
318
|
+
const solver = this.solver;
|
|
319
|
+
if (solver.hasTerm(column)) {
|
|
320
|
+
const thVar = solver.getExternal(column);
|
|
321
|
+
if (thVar !== NULL_THEORY_VAR) {
|
|
322
|
+
const expr = this.var2expr(thVar);
|
|
323
|
+
if (this.manager.isNumeral(expr) && this.manager.getRationalValue(expr).equals(value))
|
|
324
|
+
return null;
|
|
325
|
+
}
|
|
326
|
+
const termBound = (isLower ? this.lowerTerms : this.upperTerms)[column];
|
|
327
|
+
if (termBound === undefined || !termBound.value.equals(value)) return undefined;
|
|
328
|
+
return mkLeaf(termBound.constraint);
|
|
329
|
+
}
|
|
330
|
+
const bound = solver.getBound(column, !isLower);
|
|
331
|
+
if (bound === undefined || !bound.value.equals(value) || bound.isStrict) return undefined;
|
|
332
|
+
return bound.dep;
|
|
333
|
+
}
|
|
334
|
+
|
|
335
|
+
protected flushBoundAxioms() {
|
|
336
|
+
const newBounds = this.newBounds;
|
|
337
|
+
while (newBounds.length > 0) {
|
|
338
|
+
const atoms = [newBounds.pop() as ArithBound];
|
|
339
|
+
const thVar = atoms[0].thVar;
|
|
340
|
+
for (let index = 0; index < newBounds.length; index++) {
|
|
341
|
+
if (newBounds[index].thVar !== thVar) continue;
|
|
342
|
+
atoms.push(newBounds[index]);
|
|
343
|
+
newBounds[index] = newBounds[newBounds.length - 1];
|
|
344
|
+
newBounds.pop();
|
|
345
|
+
index--;
|
|
346
|
+
}
|
|
347
|
+
const byValue = (first: ArithBound, second: ArithBound) => first.value.compare(second.value);
|
|
348
|
+
atoms.sort(byValue);
|
|
349
|
+
const occs = this.bounds[thVar].slice().sort(byValue);
|
|
350
|
+
const end = occs.length;
|
|
351
|
+
const getFirst = (isLower: boolean) => {
|
|
352
|
+
const position = occs.findIndex((bound) => bound.isLower === isLower);
|
|
353
|
+
return position === -1 ? end : position;
|
|
354
|
+
};
|
|
355
|
+
const nextInf = (atom: ArithBound, isLower: boolean, start: number) => {
|
|
356
|
+
let result = end;
|
|
357
|
+
let isFound = false;
|
|
358
|
+
for (let position = start; position < end; position++) {
|
|
359
|
+
const other = occs[position];
|
|
360
|
+
if (other === atom || other.isLower !== isLower) continue;
|
|
361
|
+
isFound = true;
|
|
362
|
+
if (other.value.compare(atom.value) <= 0) result = position;
|
|
363
|
+
else break;
|
|
364
|
+
}
|
|
365
|
+
return { result, isFound };
|
|
366
|
+
};
|
|
367
|
+
const nextSup = (atom: ArithBound, isLower: boolean, start: number) => {
|
|
368
|
+
let isFound = false;
|
|
369
|
+
for (let position = start; position < end; position++) {
|
|
370
|
+
const other = occs[position];
|
|
371
|
+
if (other === atom || other.isLower !== isLower) continue;
|
|
372
|
+
isFound = true;
|
|
373
|
+
if (atom.value.compare(other.value) < 0) return { result: position, isFound };
|
|
374
|
+
}
|
|
375
|
+
return { result: end, isFound };
|
|
376
|
+
};
|
|
377
|
+
let loInf = getFirst(true);
|
|
378
|
+
let loSup = loInf;
|
|
379
|
+
let hiInf = getFirst(false);
|
|
380
|
+
let hiSup = hiInf;
|
|
381
|
+
const visited = new Set<ArithBound>();
|
|
382
|
+
for (const atom of atoms) {
|
|
383
|
+
const loInf1 = nextInf(atom, true, loInf);
|
|
384
|
+
const hiInf1 = nextInf(atom, false, hiInf);
|
|
385
|
+
const loSup1 = nextSup(atom, true, loSup);
|
|
386
|
+
const hiSup1 = nextSup(atom, false, hiSup);
|
|
387
|
+
if (loInf1.result !== end) loInf = loInf1.result;
|
|
388
|
+
if (loSup1.result !== end) loSup = loSup1.result;
|
|
389
|
+
if (hiInf1.result !== end) hiInf = hiInf1.result;
|
|
390
|
+
if (hiSup1.result !== end) hiSup = hiSup1.result;
|
|
391
|
+
if (!loInf1.isFound) loInf = end;
|
|
392
|
+
if (!hiInf1.isFound) hiInf = end;
|
|
393
|
+
if (!loSup1.isFound) loSup = end;
|
|
394
|
+
if (!hiSup1.isFound) hiSup = end;
|
|
395
|
+
visited.add(atom);
|
|
396
|
+
const tryAxiom = (found: number, position: number) => {
|
|
397
|
+
if (found !== end && position !== end && !visited.has(occs[position]))
|
|
398
|
+
this.mkBoundAxiom(atom, occs[position]);
|
|
399
|
+
};
|
|
400
|
+
tryAxiom(loInf1.result, loInf);
|
|
401
|
+
tryAxiom(loSup1.result, loSup);
|
|
402
|
+
tryAxiom(hiInf1.result, hiInf);
|
|
403
|
+
tryAxiom(hiSup1.result, hiSup);
|
|
404
|
+
}
|
|
405
|
+
}
|
|
406
|
+
}
|
|
407
|
+
|
|
408
|
+
private getExprValue(node: Enode): number | undefined {
|
|
409
|
+
const manager = this.manager;
|
|
410
|
+
const thVar = node.getThVar(this.id);
|
|
411
|
+
const expr = node.owner;
|
|
412
|
+
const root = node.root.owner;
|
|
413
|
+
if (manager.isValue(root)) return root;
|
|
414
|
+
const nla = this.nla;
|
|
415
|
+
if (
|
|
416
|
+
this.useNraModel() &&
|
|
417
|
+
nla !== undefined &&
|
|
418
|
+
this.solver.externalToLocalColumn(thVar) !== NULL_LPVAR
|
|
419
|
+
) {
|
|
420
|
+
const value = this.getNlValue(thVar);
|
|
421
|
+
if (manager.isInt(expr) && !nla.nra.am.isInt(value)) return manager.mkNumeral(0n);
|
|
422
|
+
return manager.mkAlgebraicNumeral(value, manager.sorts[expr]);
|
|
423
|
+
}
|
|
424
|
+
if (thVar === NULL_THEORY_VAR) return undefined;
|
|
425
|
+
const value = this.getRationalValue(thVar);
|
|
426
|
+
return manager.mkNumeralOfSort(
|
|
427
|
+
manager.isInt(expr) && !value.isInt() ? value.floor() : value,
|
|
428
|
+
manager.sorts[expr],
|
|
429
|
+
);
|
|
430
|
+
}
|
|
431
|
+
|
|
432
|
+
override addValue(node: Enode, model: ProtoModel, values: (number | undefined)[]) {
|
|
433
|
+
const manager = this.manager;
|
|
434
|
+
const expr = node.owner;
|
|
435
|
+
const value =
|
|
436
|
+
this.getExprValue(node) ??
|
|
437
|
+
(manager.getFamily(expr) === FAMILY_ARITH
|
|
438
|
+
? this.rewrite(
|
|
439
|
+
manager.mkApp(
|
|
440
|
+
manager.decls[expr],
|
|
441
|
+
manager.mapArgs(expr, (arg) =>
|
|
442
|
+
manager.isValue(arg)
|
|
443
|
+
? arg
|
|
444
|
+
: (values[(this.expr2enode(arg) as Enode).root.owner] as number),
|
|
445
|
+
),
|
|
446
|
+
manager.sorts[expr],
|
|
447
|
+
),
|
|
448
|
+
)
|
|
449
|
+
: model.getFreshValue(manager.sorts[expr]));
|
|
450
|
+
if (value === null) return;
|
|
451
|
+
model.registerValue(value);
|
|
452
|
+
values[node.root.owner] = value;
|
|
453
|
+
}
|
|
454
|
+
|
|
455
|
+
override addDep(node: Enode, deps: Dependencies) {
|
|
456
|
+
const manager = this.manager;
|
|
457
|
+
const expr = node.owner;
|
|
458
|
+
const isArith = manager.getFamily(expr) === FAMILY_ARITH;
|
|
459
|
+
if (node.getThVar(this.id) === NULL_THEORY_VAR && !isArith) return false;
|
|
460
|
+
if (isArith && manager.getNumArgs(expr) > 0) {
|
|
461
|
+
for (const arg of manager.getArgs(expr)) {
|
|
462
|
+
const argNode = this.expr2enode(arg);
|
|
463
|
+
if (argNode !== undefined) addDependency(deps, node, argNode);
|
|
464
|
+
}
|
|
465
|
+
} else deps.set(node, null);
|
|
466
|
+
return true;
|
|
467
|
+
}
|
|
468
|
+
|
|
469
|
+
protected override pushCore() {
|
|
470
|
+
this.scopes.push({
|
|
471
|
+
boundsLim: this.boundsTrail.length,
|
|
472
|
+
assertedQhead: this.assertedQhead,
|
|
473
|
+
assertedLim: this.assertedLits.length,
|
|
474
|
+
});
|
|
475
|
+
this.solver.push();
|
|
476
|
+
this.nla?.push();
|
|
477
|
+
super.pushCore();
|
|
478
|
+
}
|
|
479
|
+
|
|
480
|
+
protected override popCore(numScopes: number) {
|
|
481
|
+
const oldSize = this.scopes.length - numScopes;
|
|
482
|
+
const scope = this.scopes[oldSize];
|
|
483
|
+
this.delBounds(scope.boundsLim);
|
|
484
|
+
this.assertedLits.length = scope.assertedLim;
|
|
485
|
+
this.assertedQhead = scope.assertedQhead;
|
|
486
|
+
this.scopes.length = oldSize;
|
|
487
|
+
this.solver.pop(numScopes);
|
|
488
|
+
this.newBounds.length = 0;
|
|
489
|
+
this.nla?.pop(numScopes);
|
|
490
|
+
super.popCore(numScopes);
|
|
491
|
+
}
|
|
492
|
+
|
|
493
|
+
private delBounds(oldSize: number) {
|
|
494
|
+
for (let index = this.boundsTrail.length; index-- > oldSize;) {
|
|
495
|
+
const thVar = this.boundsTrail[index];
|
|
496
|
+
const bound = this.bounds[thVar].pop() as ArithBound;
|
|
497
|
+
this.boolVar2bound.delete(bound.lit >> 1);
|
|
498
|
+
}
|
|
499
|
+
this.boundsTrail.length = oldSize;
|
|
500
|
+
}
|
|
501
|
+
|
|
502
|
+
protected reportEqualityOfFixedVars(first: number, second: number) {
|
|
503
|
+
const solver = this.solver;
|
|
504
|
+
const v1 = solver.getExternal(first);
|
|
505
|
+
const v2 = solver.getExternal(second);
|
|
506
|
+
if (this.isEqual(v1, v2) || this.isIntVar(v1) !== this.isIntVar(v2)) return;
|
|
507
|
+
const value = Rational.zero;
|
|
508
|
+
const firstLower = this.hasBound(first, value, true);
|
|
509
|
+
if (firstLower === undefined) return;
|
|
510
|
+
const firstUpper = this.hasBound(first, value, false);
|
|
511
|
+
if (firstUpper === undefined) return;
|
|
512
|
+
const secondLower = this.hasBound(second, value, true);
|
|
513
|
+
if (secondLower === undefined) return;
|
|
514
|
+
const secondUpper = this.hasBound(second, value, false);
|
|
515
|
+
if (secondUpper === undefined) return;
|
|
516
|
+
this.resetEvidence();
|
|
517
|
+
this.explanation.clear();
|
|
518
|
+
const dep = mkJoin(mkJoin(firstLower, firstUpper), mkJoin(secondLower, secondUpper));
|
|
519
|
+
for (const constraint of linearize([dep])) this.consume(Rational.one, constraint);
|
|
520
|
+
this.propagateEq(this.core, this.eqs, this.var2enodeOf(v1), this.var2enodeOf(v2));
|
|
521
|
+
}
|
|
522
|
+
|
|
523
|
+
private isEqual(first: number, second: number) {
|
|
524
|
+
return first === second || this.var2enodeOf(first).root === this.var2enodeOf(second).root;
|
|
525
|
+
}
|
|
526
|
+
|
|
527
|
+
override initModel() {
|
|
528
|
+
if (!this.manager.limit.inc() || this.numVars === 0) return;
|
|
529
|
+
const saved = this.isModelInitialized;
|
|
530
|
+
this.ctx.trail.push(() => {
|
|
531
|
+
this.isModelInitialized = saved;
|
|
532
|
+
});
|
|
533
|
+
this.isModelInitialized = true;
|
|
534
|
+
this.solver.initModel();
|
|
535
|
+
}
|
|
536
|
+
|
|
537
|
+
override getPhase(boolVar: number) {
|
|
538
|
+
const bound = this.boolVar2bound.get(boolVar);
|
|
539
|
+
if (bound === undefined) return L_UNDEF;
|
|
540
|
+
const column = this.registerVar(bound.thVar);
|
|
541
|
+
const comparison = compareToRational(this.solver.getValue(column), bound.value);
|
|
542
|
+
return (bound.isLower ? comparison >= 0 : comparison <= 0) ? L_TRUE : L_FALSE;
|
|
543
|
+
}
|
|
544
|
+
|
|
545
|
+
private isRegisteredVar(thVar: number) {
|
|
546
|
+
return thVar !== NULL_THEORY_VAR && this.solver.externalToLocalColumn(thVar) !== NULL_LPVAR;
|
|
547
|
+
}
|
|
548
|
+
|
|
549
|
+
private getRationalValue(thVar: number) {
|
|
550
|
+
return this.isRegisteredVar(thVar)
|
|
551
|
+
? this.solver.getModelValue(this.solver.externalToLocalColumn(thVar))
|
|
552
|
+
: Rational.zero;
|
|
553
|
+
}
|
|
554
|
+
|
|
555
|
+
// m_model_eqs: the first variable inserted whose value equals that of thVar, after inserting it.
|
|
556
|
+
private mkModelEqs() {
|
|
557
|
+
const byValue = new Map<string, number>();
|
|
558
|
+
const inserted: number[] = [];
|
|
559
|
+
return (thVar: number) => {
|
|
560
|
+
if (this.useNraModel()) {
|
|
561
|
+
const other = inserted.find(
|
|
562
|
+
(candidate) =>
|
|
563
|
+
this.isIntVar(candidate) === this.isIntVar(thVar) && this.isEq(candidate, thVar),
|
|
564
|
+
);
|
|
565
|
+
if (other !== undefined) return other;
|
|
566
|
+
inserted.push(thVar);
|
|
567
|
+
return thVar;
|
|
568
|
+
}
|
|
569
|
+
const key = `${this.isIntVar(thVar)}:${this.getIvalue(thVar)}`;
|
|
570
|
+
const other = byValue.get(key);
|
|
571
|
+
if (other !== undefined) return other;
|
|
572
|
+
byValue.set(key, thVar);
|
|
573
|
+
return thVar;
|
|
574
|
+
};
|
|
575
|
+
}
|
|
576
|
+
|
|
577
|
+
private randomUpdate() {
|
|
578
|
+
if (this.nla !== undefined) return;
|
|
579
|
+
const solver = this.solver;
|
|
580
|
+
const tmpVarSet = new Set<number>();
|
|
581
|
+
const insertIfNotThere = this.mkModelEqs();
|
|
582
|
+
const columns: number[] = [];
|
|
583
|
+
for (let thVar = 0; thVar < this.numVars; thVar++) {
|
|
584
|
+
if (this.isBoolVar(thVar)) continue;
|
|
585
|
+
this.ensureColumn(thVar);
|
|
586
|
+
const column = solver.externalToLocalColumn(thVar);
|
|
587
|
+
const other = insertIfNotThere(thVar);
|
|
588
|
+
if (this.isEqual(thVar, other)) continue;
|
|
589
|
+
if (!solver.isFixed(column)) columns.push(column);
|
|
590
|
+
else if (!tmpVarSet.has(other)) {
|
|
591
|
+
const otherColumn = solver.externalToLocalColumn(other);
|
|
592
|
+
if (!solver.isFixed(otherColumn)) {
|
|
593
|
+
tmpVarSet.add(other);
|
|
594
|
+
columns.push(otherColumn);
|
|
595
|
+
}
|
|
596
|
+
}
|
|
597
|
+
}
|
|
598
|
+
if (columns.length > 0) randomUpdate(solver, columns);
|
|
599
|
+
}
|
|
600
|
+
|
|
601
|
+
override hasUnhandled() {
|
|
602
|
+
return this.notHandled !== null;
|
|
603
|
+
}
|
|
604
|
+
|
|
605
|
+
override includeFuncInterp(decl: number) {
|
|
606
|
+
switch (this.manager.funcDecls[decl].op) {
|
|
607
|
+
case OP_ADD:
|
|
608
|
+
case OP_SUB:
|
|
609
|
+
case OP_UMINUS:
|
|
610
|
+
case OP_MUL:
|
|
611
|
+
case OP_LE:
|
|
612
|
+
case OP_LT:
|
|
613
|
+
case OP_GE:
|
|
614
|
+
case OP_GT:
|
|
615
|
+
case OP_MOD:
|
|
616
|
+
case OP_REM:
|
|
617
|
+
case OP_DIV:
|
|
618
|
+
case OP_IDIV:
|
|
619
|
+
case OP_POWER:
|
|
620
|
+
case OP_IS_INT:
|
|
621
|
+
case OP_TO_INT:
|
|
622
|
+
case OP_TO_REAL:
|
|
623
|
+
case OP_NUM:
|
|
624
|
+
return false;
|
|
625
|
+
default:
|
|
626
|
+
return true;
|
|
627
|
+
}
|
|
628
|
+
}
|
|
629
|
+
|
|
630
|
+
private assumeEqs() {
|
|
631
|
+
if (this.delayedAssumeEqs()) return true;
|
|
632
|
+
this.randomUpdate();
|
|
633
|
+
const numVars = this.numVars;
|
|
634
|
+
const oldSize = this.assumeEqCandidates.length;
|
|
635
|
+
const start = this.random();
|
|
636
|
+
const insertIfNotThere = this.mkModelEqs();
|
|
637
|
+
for (let index = 0; index < numVars; index++) {
|
|
638
|
+
const thVar = (index + start) % numVars;
|
|
639
|
+
if (this.isBoolVar(thVar)) continue;
|
|
640
|
+
if (!this.ctx.isShared(this.var2enodeOf(thVar))) continue;
|
|
641
|
+
this.ensureColumn(thVar);
|
|
642
|
+
if (!this.isRegisteredVar(thVar)) continue;
|
|
643
|
+
const other = insertIfNotThere(thVar);
|
|
644
|
+
if (!this.isEqual(other, thVar)) this.assumeEqCandidates.push([thVar, other]);
|
|
645
|
+
}
|
|
646
|
+
if (this.assumeEqCandidates.length > oldSize)
|
|
647
|
+
this.ctx.trail.push(() => {
|
|
648
|
+
this.assumeEqCandidates.length = oldSize;
|
|
649
|
+
});
|
|
650
|
+
return this.delayedAssumeEqs();
|
|
651
|
+
}
|
|
652
|
+
|
|
653
|
+
private delayedAssumeEqs() {
|
|
654
|
+
if (this.assumeEqHead === this.assumeEqCandidates.length) return false;
|
|
655
|
+
const saved = this.assumeEqHead;
|
|
656
|
+
this.ctx.trail.push(() => {
|
|
657
|
+
this.assumeEqHead = saved;
|
|
658
|
+
});
|
|
659
|
+
while (this.assumeEqHead < this.assumeEqCandidates.length) {
|
|
660
|
+
const candidate = this.assumeEqCandidates[this.assumeEqHead];
|
|
661
|
+
const v1 = candidate[0];
|
|
662
|
+
const v2 = candidate[1];
|
|
663
|
+
const n1 = this.var2enodeOf(v1);
|
|
664
|
+
const n2 = this.var2enodeOf(v2);
|
|
665
|
+
this.assumeEqHead++;
|
|
666
|
+
if (!this.isEq(v1, v2) || n1.root === n2.root) continue;
|
|
667
|
+
const eq = this.eqInternalize(n1.owner, n2.owner);
|
|
668
|
+
const value = this.s.value(eq);
|
|
669
|
+
if (value === L_TRUE) continue;
|
|
670
|
+
if (value === L_FALSE) this.mkDiseqAxiom(v1, v2);
|
|
671
|
+
return true;
|
|
672
|
+
}
|
|
673
|
+
return false;
|
|
674
|
+
}
|
|
675
|
+
|
|
676
|
+
private useNraModel() {
|
|
677
|
+
return this.nla !== undefined && this.isUsingNraModel && this.nla.isUsingNraModel;
|
|
678
|
+
}
|
|
679
|
+
|
|
680
|
+
private isEq(first: number, second: number) {
|
|
681
|
+
if (this.useNraModel())
|
|
682
|
+
return (
|
|
683
|
+
(this.nla as NonNullable<typeof this.nla>).nra.am.compare(
|
|
684
|
+
this.getNlValue(first),
|
|
685
|
+
this.getNlValue(second),
|
|
686
|
+
) === 0
|
|
687
|
+
);
|
|
688
|
+
return this.getIvalue(first).equals(this.getIvalue(second));
|
|
689
|
+
}
|
|
690
|
+
|
|
691
|
+
override check() {
|
|
692
|
+
this.forcePush();
|
|
693
|
+
this.isModelInitialized = false;
|
|
694
|
+
this.isUsingNraModel = false;
|
|
695
|
+
const solver = this.solver;
|
|
696
|
+
if (!solver.isFeasible() || solver.columnsWithChangedBounds.size > 0) {
|
|
697
|
+
const status = this.makeFeasible();
|
|
698
|
+
if (status === L_FALSE) {
|
|
699
|
+
this.setInfeasibilityConflict();
|
|
700
|
+
return CR_CONTINUE;
|
|
701
|
+
}
|
|
702
|
+
if (status === L_UNDEF) return CR_CONTINUE;
|
|
703
|
+
}
|
|
704
|
+
const liaStatus = this.checkLia();
|
|
705
|
+
if (liaStatus === L_FALSE) return CR_CONTINUE;
|
|
706
|
+
let result = liaStatus === L_UNDEF ? CR_CONTINUE : CR_DONE;
|
|
707
|
+
if (!this.checkDelayedEqs()) return CR_CONTINUE;
|
|
708
|
+
const nlaStatus = this.checkNla(2);
|
|
709
|
+
if (nlaStatus === L_TRUE) this.isUsingNraModel = true;
|
|
710
|
+
else if (nlaStatus === L_FALSE) return CR_CONTINUE;
|
|
711
|
+
else result = CR_GIVEUP;
|
|
712
|
+
if (this.assumeEqs()) return CR_CONTINUE;
|
|
713
|
+
if (!this.checkDelayedEqs()) return CR_CONTINUE;
|
|
714
|
+
return this.notHandled !== null ? CR_GIVEUP : result;
|
|
715
|
+
}
|
|
716
|
+
|
|
717
|
+
private getNlValue(thVar: number) {
|
|
718
|
+
const nla = this.nla as NonNullable<typeof this.nla>;
|
|
719
|
+
const solver = this.solver;
|
|
720
|
+
const am = nla.nra.am;
|
|
721
|
+
const column = solver.externalToLocalColumn(thVar);
|
|
722
|
+
if (!solver.hasTerm(column)) return nla.nra.value(column);
|
|
723
|
+
let result = new Anum(Rational.zero);
|
|
724
|
+
const todo: [number, Rational][] = [[column, Rational.one]];
|
|
725
|
+
for (let pending = todo.pop(); pending !== undefined; pending = todo.pop()) {
|
|
726
|
+
for (const entry of solver.getTerm(pending[0]).coeffs) {
|
|
727
|
+
const coeff = entry[1].mul(pending[1]);
|
|
728
|
+
if (solver.hasTerm(entry[0])) todo.push([entry[0], coeff]);
|
|
729
|
+
else result = am.add(am.mul(nla.nra.value(entry[0]), new Anum(coeff)), result);
|
|
730
|
+
}
|
|
731
|
+
}
|
|
732
|
+
return result;
|
|
733
|
+
}
|
|
734
|
+
|
|
735
|
+
private makeFeasible() {
|
|
736
|
+
const status = this.solver.findFeasibleSolution();
|
|
737
|
+
if (status === LP_INFEASIBLE) return L_FALSE;
|
|
738
|
+
return status === LP_FEASIBLE || status === LP_OPTIMAL || status === LP_UNBOUNDED
|
|
739
|
+
? L_TRUE
|
|
740
|
+
: L_UNDEF;
|
|
741
|
+
}
|
|
742
|
+
|
|
743
|
+
private checkDelayedEqs() {
|
|
744
|
+
if (this.delayedEqs.length === 0) return true;
|
|
745
|
+
this.forcePush();
|
|
746
|
+
for (const delayed of this.delayedEqs) {
|
|
747
|
+
if (delayed.isEq) this.newEqEh(delayed.eq);
|
|
748
|
+
else if (this.isEq(delayed.eq.v1, delayed.eq.v2)) {
|
|
749
|
+
this.mkDiseqAxiom(delayed.eq.v1, delayed.eq.v2);
|
|
750
|
+
return false;
|
|
751
|
+
}
|
|
752
|
+
}
|
|
753
|
+
return true;
|
|
754
|
+
}
|
|
755
|
+
|
|
756
|
+
private checkLia() {
|
|
757
|
+
if (!this.manager.limit.inc()) return L_UNDEF;
|
|
758
|
+
if (!this.checkIdivBounds()) return L_FALSE;
|
|
759
|
+
const lia = this.lia;
|
|
760
|
+
const move = lia.check();
|
|
761
|
+
this.explanation.clear();
|
|
762
|
+
this.explanation.addExplanation(lia.explanation);
|
|
763
|
+
switch (move.kind) {
|
|
764
|
+
case "sat":
|
|
765
|
+
return L_TRUE;
|
|
766
|
+
case "branch":
|
|
767
|
+
this.mkBound(lia.term, move.offset, !move.isUpper);
|
|
768
|
+
return L_FALSE;
|
|
769
|
+
case "cut": {
|
|
770
|
+
this.resetEvidence();
|
|
771
|
+
for (const constraint of this.explanation) this.setEvidence(constraint);
|
|
772
|
+
const atom = this.mkBound(lia.term, move.offset, !move.isUpper);
|
|
773
|
+
this.assign(this.expr2literal(atom), this.core, this.eqs);
|
|
774
|
+
return L_FALSE;
|
|
775
|
+
}
|
|
776
|
+
case "conflict":
|
|
777
|
+
this.setArithConflict();
|
|
778
|
+
return L_FALSE;
|
|
779
|
+
case "continue":
|
|
780
|
+
return L_FALSE;
|
|
781
|
+
default:
|
|
782
|
+
return L_UNDEF;
|
|
783
|
+
}
|
|
784
|
+
}
|
|
785
|
+
|
|
786
|
+
private assign(lit: number, core: number[], eqs: [Enode, Enode][]) {
|
|
787
|
+
if (core.length < SMALL_LEMMA_SIZE && eqs.length === 0) {
|
|
788
|
+
this.addClause([...core.map((other) => other ^ 1), lit], true);
|
|
789
|
+
return;
|
|
790
|
+
}
|
|
791
|
+
this.propagateLit(core, eqs, lit);
|
|
792
|
+
}
|
|
793
|
+
|
|
794
|
+
private setInfeasibilityConflict() {
|
|
795
|
+
this.explanation.clear();
|
|
796
|
+
this.solver.getInfeasibilityExplanation(this.explanation);
|
|
797
|
+
this.setArithConflict();
|
|
798
|
+
}
|
|
799
|
+
|
|
800
|
+
private setArithConflict() {
|
|
801
|
+
this.setConflictOrLemma([], true);
|
|
802
|
+
}
|
|
803
|
+
|
|
804
|
+
private setConflictOrLemma(core: number[], isConflict: boolean) {
|
|
805
|
+
this.resetEvidence();
|
|
806
|
+
this.core.push(...core);
|
|
807
|
+
for (const constraint of this.explanation) this.setEvidence(constraint);
|
|
808
|
+
if (isConflict) {
|
|
809
|
+
this.setConflict(this.core, this.eqs);
|
|
810
|
+
return;
|
|
811
|
+
}
|
|
812
|
+
const manager = this.manager;
|
|
813
|
+
for (const eq of this.eqs)
|
|
814
|
+
this.core.push(this.mkLiteral(manager.mkEq(eq[0].owner, eq[1].owner)));
|
|
815
|
+
const clause = this.core.map((lit) => lit ^ 1);
|
|
816
|
+
if (clause.some((lit) => this.s.value(lit) === L_TRUE)) return;
|
|
817
|
+
this.addClause(clause, true);
|
|
818
|
+
}
|
|
819
|
+
|
|
820
|
+
private mkTermEq(term: LarTerm, offset: Rational) {
|
|
821
|
+
const sides = mkTermEqSides(this.manager, this.solver, term, offset, (thVar) =>
|
|
822
|
+
this.var2expr(thVar),
|
|
823
|
+
);
|
|
824
|
+
return this.eqInternalize(sides[0], sides[1]);
|
|
825
|
+
}
|
|
826
|
+
|
|
827
|
+
private mkBound(term: LarTerm, offset: Rational, isLower: boolean) {
|
|
828
|
+
const atom = mkBoundAtom(this.manager, this.solver, term, offset, isLower, (thVar) =>
|
|
829
|
+
this.var2expr(thVar),
|
|
830
|
+
);
|
|
831
|
+
this.mkLiteral(atom);
|
|
832
|
+
return atom;
|
|
833
|
+
}
|
|
834
|
+
|
|
835
|
+
private falseCaseOfCheckNla(lemma: Lemma) {
|
|
836
|
+
this.explanation.clear();
|
|
837
|
+
this.explanation.addExplanation(lemma.expl);
|
|
838
|
+
const core = lemma.ineqs.map((ineq) => this.mkIneqLiteral(ineq) ^ 1);
|
|
839
|
+
this.setConflictOrLemma(core, false);
|
|
840
|
+
}
|
|
841
|
+
|
|
842
|
+
private mkIneqLiteral(ineq: Ineq) {
|
|
843
|
+
const constraints = this.solver.constraints;
|
|
844
|
+
constraints.isAuxiliaryMode = true;
|
|
845
|
+
const kind = ineq.cmp;
|
|
846
|
+
const isSign = kind === KIND_LT || kind === KIND_GT || kind === KIND_NE;
|
|
847
|
+
const lit =
|
|
848
|
+
kind === KIND_EQ || kind === KIND_NE
|
|
849
|
+
? this.mkTermEq(ineq.term, ineq.rs)
|
|
850
|
+
: this.expr2literal(this.mkBound(ineq.term, ineq.rs, kind === KIND_LT || kind === KIND_GE));
|
|
851
|
+
constraints.isAuxiliaryMode = false;
|
|
852
|
+
return isSign ? lit ^ 1 : lit;
|
|
853
|
+
}
|
|
854
|
+
|
|
855
|
+
private checkNla(level: number) {
|
|
856
|
+
if (!this.manager.limit.inc()) return L_UNDEF;
|
|
857
|
+
const nla = this.nla;
|
|
858
|
+
if (nla === undefined || !nla.hasRelevantMonomial()) return L_TRUE;
|
|
859
|
+
const status = nla.check(level);
|
|
860
|
+
if (status === L_FALSE) this.addLemmas();
|
|
861
|
+
return status;
|
|
862
|
+
}
|
|
863
|
+
|
|
864
|
+
private addLemmas() {
|
|
865
|
+
const nla = this.nla as NonNullable<typeof this.nla>;
|
|
866
|
+
if (nla.isCheckFeasible && this.makeFeasible() === L_FALSE) {
|
|
867
|
+
this.setInfeasibilityConflict();
|
|
868
|
+
return;
|
|
869
|
+
}
|
|
870
|
+
for (const ineq of nla.literals) {
|
|
871
|
+
const lit = this.mkIneqLiteral(ineq);
|
|
872
|
+
if (this.s.value(lit) === L_TRUE) continue;
|
|
873
|
+
this.s.setPhaseLiteral(lit);
|
|
874
|
+
}
|
|
875
|
+
for (const lemma of nla.lemmas) this.falseCaseOfCheckNla(lemma);
|
|
876
|
+
for (const equality of nla.fixedEqualities)
|
|
877
|
+
this.addEquality(equality.lpVar, equality.value, equality.explanation);
|
|
878
|
+
for (const equality of nla.equalities)
|
|
879
|
+
this.addEq(equality.first, equality.second, equality.explanation, false);
|
|
880
|
+
}
|
|
881
|
+
|
|
882
|
+
private propagateNla() {
|
|
883
|
+
const nla = this.nla;
|
|
884
|
+
if (nla === undefined) return;
|
|
885
|
+
nla.propagate();
|
|
886
|
+
this.addLemmas();
|
|
887
|
+
this.solver.collectMoreRowsForLpPropagation();
|
|
888
|
+
}
|
|
889
|
+
}
|