tla-ts 0.0.10-dev.f16792fed → 0.0.10-dev.f57f64938
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 +2682 -426
- 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 +42 -39
- 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 +49 -702
- package/src/cli/xml-exporter.ts +23 -33
- package/src/codegen.ts +5 -10
- package/src/coverage.ts +0 -2
- package/src/dependencies.ts +30 -14
- package/src/dfid.ts +16 -16
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +55 -338
- 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/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 +56 -74
- package/src/runtime.ts +4 -0
- 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 +2 -3
- 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 +205 -43
- package/src/simulate.ts +157 -133
- package/src/spec-description.ts +33 -48
- package/src/standard-definitions.ts +4 -0
- package/src/standard-modules.ts +16 -32
- package/src/state-graph.ts +0 -2
- 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/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/tlcext-operators.ts +44 -12
- package/src/tlc/trace-spec.ts +21 -40
- 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 +62 -152
- 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,449 @@
|
|
|
1
|
+
import { OP_INT2BV, OP_UBV2INT } from "../ast";
|
|
2
|
+
import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
|
|
3
|
+
import type { ProtoModel } from "../proto-model";
|
|
4
|
+
import { CR_DONE } from "../sat/solver";
|
|
5
|
+
import { type BvAtom, BvInternalize, type EqOccurs } from "./bv-internalize";
|
|
6
|
+
import { type Enode, getClass, type ThEq } from "./egraph";
|
|
7
|
+
import type { EufSolver } from "./euf-solver";
|
|
8
|
+
|
|
9
|
+
const K_EQ2BIT = 0;
|
|
10
|
+
const K_NE2BIT = 1;
|
|
11
|
+
const K_BIT2EQ = 2;
|
|
12
|
+
const K_BIT2NE = 3;
|
|
13
|
+
const K_BV2INT = 4;
|
|
14
|
+
|
|
15
|
+
interface BvJustification {
|
|
16
|
+
readonly kind: number;
|
|
17
|
+
readonly index: number;
|
|
18
|
+
readonly v1: number;
|
|
19
|
+
readonly v2: number;
|
|
20
|
+
readonly consequent: number;
|
|
21
|
+
readonly antecedent: number;
|
|
22
|
+
readonly nodes: readonly Enode[];
|
|
23
|
+
}
|
|
24
|
+
|
|
25
|
+
interface PropagationItem {
|
|
26
|
+
readonly thVar: number;
|
|
27
|
+
readonly index: number;
|
|
28
|
+
readonly atom: BvAtom | null;
|
|
29
|
+
}
|
|
30
|
+
|
|
31
|
+
export class BvSolver extends BvInternalize {
|
|
32
|
+
private fixedVarTable = new Map<string, number>();
|
|
33
|
+
private propQueue: PropagationItem[] = [];
|
|
34
|
+
private propQueueLim: number[] = [];
|
|
35
|
+
private propQueueHead = 0;
|
|
36
|
+
|
|
37
|
+
constructor(ctx: EufSolver, id: number) {
|
|
38
|
+
super(ctx, id);
|
|
39
|
+
this.find.handler = {
|
|
40
|
+
mergeEh: (r2, r1, v2, v1) => this.mergeEh(r2, r1, v2, v1),
|
|
41
|
+
unmergeEh: (r2, r1) => this.unmergeEh(r2, r1),
|
|
42
|
+
};
|
|
43
|
+
}
|
|
44
|
+
|
|
45
|
+
private mkJustification(
|
|
46
|
+
kind: number,
|
|
47
|
+
index: number,
|
|
48
|
+
v1: number,
|
|
49
|
+
v2: number,
|
|
50
|
+
consequent: number,
|
|
51
|
+
antecedent: number,
|
|
52
|
+
nodes: readonly Enode[] = [],
|
|
53
|
+
) {
|
|
54
|
+
const justification: BvJustification = { kind, index, v1, v2, consequent, antecedent, nodes };
|
|
55
|
+
return this.ctx.mkConstraint(this, justification);
|
|
56
|
+
}
|
|
57
|
+
|
|
58
|
+
protected fixedVarEh(v1: number) {
|
|
59
|
+
const value = this.getFixedValue(v1) as bigint;
|
|
60
|
+
const node = this.var2enodeOf(v1);
|
|
61
|
+
const size = this.bits[v1].length;
|
|
62
|
+
const key = `${value}:${size}`;
|
|
63
|
+
const v2 = this.fixedVarTable.get(key);
|
|
64
|
+
const isCurrent =
|
|
65
|
+
v2 !== undefined &&
|
|
66
|
+
v2 < this.numVars &&
|
|
67
|
+
this.isBv(v2) &&
|
|
68
|
+
this.bits[v2].length === size &&
|
|
69
|
+
this.getFixedValue(v2) === value;
|
|
70
|
+
if (!isCurrent) this.fixedVarTable.set(key, v1);
|
|
71
|
+
else if (node.root !== this.var2enodeOf(v2).root) {
|
|
72
|
+
this.ackerman.usedEqEh(v1, v2);
|
|
73
|
+
this.ctx.propagateEq(
|
|
74
|
+
node,
|
|
75
|
+
this.var2enodeOf(v2),
|
|
76
|
+
this.mkJustification(K_BIT2EQ, -1, v1, v2, -1, -1),
|
|
77
|
+
);
|
|
78
|
+
}
|
|
79
|
+
}
|
|
80
|
+
|
|
81
|
+
private getFixedValue(thVar: number) {
|
|
82
|
+
const trueLit = this.trueLit;
|
|
83
|
+
let result = 0n;
|
|
84
|
+
const bits = this.bits[thVar];
|
|
85
|
+
for (let index = 0; index < bits.length; index++) {
|
|
86
|
+
const bit = bits[index];
|
|
87
|
+
if (bit === (trueLit ^ 1)) continue;
|
|
88
|
+
if (bit === trueLit) {
|
|
89
|
+
result += 1n << BigInt(index);
|
|
90
|
+
continue;
|
|
91
|
+
}
|
|
92
|
+
const value = this.s.value(bit);
|
|
93
|
+
if (value === L_UNDEF) return undefined;
|
|
94
|
+
if (value === L_TRUE) result += 1n << BigInt(index);
|
|
95
|
+
}
|
|
96
|
+
return result;
|
|
97
|
+
}
|
|
98
|
+
|
|
99
|
+
protected findWpos(thVar: number) {
|
|
100
|
+
const bits = this.bits[thVar];
|
|
101
|
+
const size = bits.length;
|
|
102
|
+
for (let offset = 0; offset < size; offset++) {
|
|
103
|
+
const index = (offset + this.wpos[thVar]) % size;
|
|
104
|
+
if (this.s.value(bits[index]) === L_UNDEF) {
|
|
105
|
+
this.wpos[thVar] = index;
|
|
106
|
+
return false;
|
|
107
|
+
}
|
|
108
|
+
}
|
|
109
|
+
this.fixedVarEh(thVar);
|
|
110
|
+
return true;
|
|
111
|
+
}
|
|
112
|
+
|
|
113
|
+
protected findNewDiseqAxioms(atom: BvAtom, thVar: number, index: number) {
|
|
114
|
+
const lit = this.bits[thVar][index] ^ 1;
|
|
115
|
+
for (let occ = atom.occs; occ !== null; occ = occ.next)
|
|
116
|
+
if (
|
|
117
|
+
index === occ.index &&
|
|
118
|
+
this.bits[occ.thVar].length === this.bits[thVar].length &&
|
|
119
|
+
this.bits[occ.thVar][occ.index] === lit
|
|
120
|
+
)
|
|
121
|
+
this.mkNewDiseqAxiom(thVar, occ.thVar, index);
|
|
122
|
+
}
|
|
123
|
+
|
|
124
|
+
// v1[idx] = ~v2[idx], so v1 /= v2 is a theory axiom.
|
|
125
|
+
private mkNewDiseqAxiom(v1: number, v2: number, _index: number) {
|
|
126
|
+
const eq = this.manager.mkEq(this.var2expr(v1), this.var2expr(v2));
|
|
127
|
+
this.addUnit(this.ctx.internalize(eq, false, false) ^ 1);
|
|
128
|
+
}
|
|
129
|
+
|
|
130
|
+
override newEqEh(eq: ThEq) {
|
|
131
|
+
this.forcePush();
|
|
132
|
+
if (this.isBv(eq.v1)) {
|
|
133
|
+
this.find.merge(eq.v1, eq.v2);
|
|
134
|
+
return;
|
|
135
|
+
}
|
|
136
|
+
const manager = this.manager;
|
|
137
|
+
const node = this.var2enodeOf(eq.v1);
|
|
138
|
+
const propagateBv2int = (bv2int: Enode) => {
|
|
139
|
+
const arg = bv2int.getArg(0);
|
|
140
|
+
for (const parent of node.root.parents) {
|
|
141
|
+
if (
|
|
142
|
+
manager.getFamily(parent.owner) === this.id &&
|
|
143
|
+
manager.getOp(parent.owner) === OP_INT2BV &&
|
|
144
|
+
manager.sorts[parent.owner] === manager.sorts[arg.owner] &&
|
|
145
|
+
parent.root !== arg.root
|
|
146
|
+
) {
|
|
147
|
+
const v1 = parent.getThVar(this.id);
|
|
148
|
+
const v2 = arg.getThVar(this.id);
|
|
149
|
+
this.ctx.propagateEq(
|
|
150
|
+
parent,
|
|
151
|
+
arg,
|
|
152
|
+
this.mkJustification(K_BV2INT, -1, v1, v2, -1, -1, [node, parent.getArg(0), bv2int]),
|
|
153
|
+
);
|
|
154
|
+
break;
|
|
155
|
+
}
|
|
156
|
+
}
|
|
157
|
+
};
|
|
158
|
+
if (this.bv2ints.length < node.classSize) {
|
|
159
|
+
for (const bv2int of this.bv2ints) if (bv2int.root === node.root) propagateBv2int(bv2int);
|
|
160
|
+
return;
|
|
161
|
+
}
|
|
162
|
+
for (const bv2int of getClass(node))
|
|
163
|
+
if (manager.getFamily(bv2int.owner) === this.id && manager.getOp(bv2int.owner) === OP_UBV2INT)
|
|
164
|
+
propagateBv2int(bv2int);
|
|
165
|
+
}
|
|
166
|
+
|
|
167
|
+
override useDiseqs() {
|
|
168
|
+
return true;
|
|
169
|
+
}
|
|
170
|
+
|
|
171
|
+
override newDiseqEh(ne: ThEq) {
|
|
172
|
+
const s = this.s;
|
|
173
|
+
let v1 = ne.v1;
|
|
174
|
+
let v2 = ne.v2;
|
|
175
|
+
if (!this.isBv(v1) || s.isProbing) return;
|
|
176
|
+
const size = this.bits[v1].length;
|
|
177
|
+
if (size === 1) return;
|
|
178
|
+
let numUndef = 0;
|
|
179
|
+
let undefIndex = 0;
|
|
180
|
+
for (let index = 0; index < size; index++) {
|
|
181
|
+
const first = this.bits[v1][index];
|
|
182
|
+
const second = this.bits[v2][index];
|
|
183
|
+
if (first === (second ^ 1)) return;
|
|
184
|
+
const firstValue = s.value(first);
|
|
185
|
+
const secondValue = s.value(second);
|
|
186
|
+
if (firstValue !== L_UNDEF && secondValue !== L_UNDEF && firstValue !== secondValue) return;
|
|
187
|
+
if (firstValue === L_UNDEF) {
|
|
188
|
+
numUndef++;
|
|
189
|
+
undefIndex = index + 1;
|
|
190
|
+
}
|
|
191
|
+
if (secondValue === L_UNDEF) {
|
|
192
|
+
numUndef++;
|
|
193
|
+
undefIndex = -(index + 1);
|
|
194
|
+
}
|
|
195
|
+
if (numUndef > 1) return;
|
|
196
|
+
}
|
|
197
|
+
if (numUndef === 0) return;
|
|
198
|
+
if (undefIndex < 0) {
|
|
199
|
+
undefIndex = -undefIndex;
|
|
200
|
+
[v1, v2] = [v2, v1];
|
|
201
|
+
}
|
|
202
|
+
undefIndex--;
|
|
203
|
+
const bit = this.bits[v2][undefIndex];
|
|
204
|
+
const consequent =
|
|
205
|
+
s.value(bit) === L_TRUE ? this.bits[v1][undefIndex] ^ 1 : this.bits[v1][undefIndex];
|
|
206
|
+
const antecedent = this.expr2literal(ne.child.owner) ^ 1;
|
|
207
|
+
this.ctx.propagate(
|
|
208
|
+
consequent,
|
|
209
|
+
this.mkJustification(K_NE2BIT, undefIndex, v1, v2, consequent, antecedent),
|
|
210
|
+
);
|
|
211
|
+
}
|
|
212
|
+
|
|
213
|
+
override isExternal() {
|
|
214
|
+
return true;
|
|
215
|
+
}
|
|
216
|
+
|
|
217
|
+
override getAntecedents(_lit: number, data: unknown, antecedents: number[]) {
|
|
218
|
+
const justification = data as BvJustification;
|
|
219
|
+
const s = this.s;
|
|
220
|
+
const ctx = this.ctx;
|
|
221
|
+
const pushPair = (first: number, second: number) => {
|
|
222
|
+
const isFalse = s.value(first) === L_FALSE;
|
|
223
|
+
antecedents.push(isFalse ? first ^ 1 : first, isFalse ? second ^ 1 : second);
|
|
224
|
+
};
|
|
225
|
+
const kind = justification.kind;
|
|
226
|
+
if (kind === K_EQ2BIT) {
|
|
227
|
+
antecedents.push(justification.antecedent);
|
|
228
|
+
ctx.addEqAntecedent(this.var2enodeOf(justification.v1), this.var2enodeOf(justification.v2));
|
|
229
|
+
} else if (kind === K_NE2BIT || kind === K_BIT2EQ) {
|
|
230
|
+
if (kind === K_NE2BIT) antecedents.push(justification.antecedent);
|
|
231
|
+
const firstBits = this.bits[justification.v1];
|
|
232
|
+
const secondBits = this.bits[justification.v2];
|
|
233
|
+
for (let index = firstBits.length - 1; index >= 0; index--) {
|
|
234
|
+
const first = firstBits[index];
|
|
235
|
+
const second = secondBits[index];
|
|
236
|
+
if (first === second) continue;
|
|
237
|
+
if (kind === K_NE2BIT && index === justification.index)
|
|
238
|
+
antecedents.push(s.value(second) === L_FALSE ? second ^ 1 : second);
|
|
239
|
+
else pushPair(first, second);
|
|
240
|
+
}
|
|
241
|
+
} else if (kind === K_BIT2NE) {
|
|
242
|
+
const node = this.expr2enode(
|
|
243
|
+
this.boolVar2expr(justification.consequent >> 1) as number,
|
|
244
|
+
) as Enode;
|
|
245
|
+
const first = this.bits[node.getArg(0).getThVar(this.id)][justification.index];
|
|
246
|
+
const second = this.bits[node.getArg(1).getThVar(this.id)][justification.index];
|
|
247
|
+
antecedents.push(
|
|
248
|
+
s.value(first) === L_FALSE ? first ^ 1 : first,
|
|
249
|
+
s.value(second) === L_FALSE ? second ^ 1 : second,
|
|
250
|
+
);
|
|
251
|
+
} else {
|
|
252
|
+
const [first, second, third] = justification.nodes;
|
|
253
|
+
ctx.addEqAntecedent(first, second);
|
|
254
|
+
ctx.addEqAntecedent(first, third);
|
|
255
|
+
}
|
|
256
|
+
}
|
|
257
|
+
|
|
258
|
+
override asserted(lit: number) {
|
|
259
|
+
const atom = this.getBv2a(lit >> 1);
|
|
260
|
+
if (atom === undefined) return;
|
|
261
|
+
this.forcePush();
|
|
262
|
+
this.propQueue.push({ thVar: 0, index: 0, atom });
|
|
263
|
+
}
|
|
264
|
+
|
|
265
|
+
override unitPropagate() {
|
|
266
|
+
if (this.propQueueHead === this.propQueue.length) return false;
|
|
267
|
+
this.forcePush();
|
|
268
|
+
const head = this.propQueueHead;
|
|
269
|
+
this.ctx.trail.push(() => {
|
|
270
|
+
this.propQueueHead = head;
|
|
271
|
+
});
|
|
272
|
+
const s = this.s;
|
|
273
|
+
for (; this.propQueueHead < this.propQueue.length && !s.isInconsistent; this.propQueueHead++) {
|
|
274
|
+
const item = this.propQueue[this.propQueueHead];
|
|
275
|
+
const atom = item.atom;
|
|
276
|
+
if (atom === null) {
|
|
277
|
+
this.propagateBits(item.thVar, item.index);
|
|
278
|
+
continue;
|
|
279
|
+
}
|
|
280
|
+
for (let occ = atom.occs; occ !== null; occ = occ.next)
|
|
281
|
+
this.propagateBits(occ.thVar, occ.index);
|
|
282
|
+
for (let eq = atom.eqs; eq !== null; eq = eq.next) this.propagateEqOccurs(eq);
|
|
283
|
+
}
|
|
284
|
+
return true;
|
|
285
|
+
}
|
|
286
|
+
|
|
287
|
+
private propagateEqOccurs(occ: EqOccurs) {
|
|
288
|
+
const s = this.s;
|
|
289
|
+
const lit = occ.lit;
|
|
290
|
+
if (s.value(lit) !== L_UNDEF) return false;
|
|
291
|
+
const bit1 = this.bits[occ.v1][occ.index];
|
|
292
|
+
const bit2 = this.bits[occ.v2][occ.index];
|
|
293
|
+
const value2 = s.value(bit2);
|
|
294
|
+
if (value2 === L_UNDEF) {
|
|
295
|
+
this.addEqOccurs(occ.bv2, occ.bv1, occ.index, occ.v2, occ.v1, lit, occ.node);
|
|
296
|
+
return false;
|
|
297
|
+
}
|
|
298
|
+
if (s.value(bit1) === value2) return false;
|
|
299
|
+
this.ctx.propagate(lit ^ 1, this.mkJustification(K_BIT2NE, occ.index, -1, -1, lit ^ 1, -1));
|
|
300
|
+
return true;
|
|
301
|
+
}
|
|
302
|
+
|
|
303
|
+
private propagateBits(v1: number, index: number) {
|
|
304
|
+
const s = this.s;
|
|
305
|
+
if (this.wpos[v1] === index) this.findWpos(v1);
|
|
306
|
+
const value = s.value(this.bits[v1][index]);
|
|
307
|
+
if (value === L_UNDEF) return false;
|
|
308
|
+
const bit1 = value === L_FALSE ? this.bits[v1][index] ^ 1 : this.bits[v1][index];
|
|
309
|
+
let numBits = 0;
|
|
310
|
+
let numAssigned = 0;
|
|
311
|
+
for (let v2 = this.find.next(v1); v2 !== v1; v2 = this.find.next(v2)) {
|
|
312
|
+
const bit2 = value === L_FALSE ? this.bits[v2][index] ^ 1 : this.bits[v2][index];
|
|
313
|
+
numBits++;
|
|
314
|
+
if (numBits > 3 && numAssigned === 0) break;
|
|
315
|
+
if (s.value(bit2) === L_TRUE) continue;
|
|
316
|
+
numAssigned++;
|
|
317
|
+
if (!this.assignBit(bit2, v1, v2, index, bit1, false)) break;
|
|
318
|
+
}
|
|
319
|
+
if (s.value(this.bits[v1][this.wpos[v1]]) !== L_UNDEF) this.findWpos(v1);
|
|
320
|
+
return numAssigned > 0;
|
|
321
|
+
}
|
|
322
|
+
|
|
323
|
+
override check() {
|
|
324
|
+
this.forcePush();
|
|
325
|
+
return CR_DONE;
|
|
326
|
+
}
|
|
327
|
+
|
|
328
|
+
protected override pushCore() {
|
|
329
|
+
super.pushCore();
|
|
330
|
+
this.propQueueLim.push(this.propQueue.length);
|
|
331
|
+
}
|
|
332
|
+
|
|
333
|
+
protected override popCore(numScopes: number) {
|
|
334
|
+
const size = this.propQueueLim.length - numScopes;
|
|
335
|
+
this.propQueue.length = this.propQueueLim[size];
|
|
336
|
+
this.propQueueLim.length = size;
|
|
337
|
+
super.popCore(numScopes);
|
|
338
|
+
const numVars = this.numVars;
|
|
339
|
+
this.bits.length = numVars;
|
|
340
|
+
this.wpos.length = numVars;
|
|
341
|
+
this.zeroOneBits.length = numVars;
|
|
342
|
+
}
|
|
343
|
+
|
|
344
|
+
override simplify() {
|
|
345
|
+
this.ackerman.propagate();
|
|
346
|
+
}
|
|
347
|
+
|
|
348
|
+
override flushRoots() {
|
|
349
|
+
const table = new Map<string, number>();
|
|
350
|
+
for (let thVar = 0; thVar < this.numVars; thVar++) {
|
|
351
|
+
const bits = this.bits[thVar];
|
|
352
|
+
if (bits.length === 0) continue;
|
|
353
|
+
const key = bits.join(",");
|
|
354
|
+
const other = table.get(key);
|
|
355
|
+
if (other === undefined) table.set(key, thVar);
|
|
356
|
+
else if (this.find.find(thVar) !== this.find.find(other)) this.assertAckerman(thVar, other);
|
|
357
|
+
}
|
|
358
|
+
}
|
|
359
|
+
|
|
360
|
+
override addValue(node: Enode, _model: ProtoModel, values: (number | undefined)[]) {
|
|
361
|
+
const manager = this.manager;
|
|
362
|
+
if (manager.isBvNumeral(node.owner)) {
|
|
363
|
+
values[node.root.owner] = node.owner;
|
|
364
|
+
return;
|
|
365
|
+
}
|
|
366
|
+
const bits = this.bits[node.getThVar(this.id)];
|
|
367
|
+
let value = 0n;
|
|
368
|
+
for (let index = 0; index < bits.length; index++)
|
|
369
|
+
if (this.s.value(bits[index]) === L_TRUE) value += 1n << BigInt(index);
|
|
370
|
+
values[node.root.owner] = manager.mkBvNumeral(value, bits.length);
|
|
371
|
+
}
|
|
372
|
+
|
|
373
|
+
private mergeEh(r1: number, r2: number, v1: number, v2: number) {
|
|
374
|
+
if (!this.mergeZeroOneBits(r1, r2)) return;
|
|
375
|
+
const s = this.s;
|
|
376
|
+
const size = this.bits[v1].length;
|
|
377
|
+
if (size === 1) return;
|
|
378
|
+
for (let index = 0; !s.isInconsistent && index < size; index++) {
|
|
379
|
+
const bit1 = this.bits[v1][index];
|
|
380
|
+
const bit2 = this.bits[v2][index];
|
|
381
|
+
if (bit1 === (bit2 ^ 1)) {
|
|
382
|
+
this.mkNewDiseqAxiom(v1, v2, index);
|
|
383
|
+
return;
|
|
384
|
+
}
|
|
385
|
+
const value1 = s.value(bit1);
|
|
386
|
+
const value2 = s.value(bit2);
|
|
387
|
+
if (value1 === value2) continue;
|
|
388
|
+
if (value1 === L_FALSE) this.assignBit(bit2 ^ 1, v1, v2, index, bit1 ^ 1, true);
|
|
389
|
+
else if (value1 === L_TRUE) this.assignBit(bit2, v1, v2, index, bit1, true);
|
|
390
|
+
else if (value2 === L_FALSE) this.assignBit(bit1 ^ 1, v2, v1, index, bit2 ^ 1, true);
|
|
391
|
+
else if (value2 === L_TRUE) this.assignBit(bit1, v2, v1, index, bit2, true);
|
|
392
|
+
}
|
|
393
|
+
}
|
|
394
|
+
|
|
395
|
+
private assignBit(
|
|
396
|
+
consequent: number,
|
|
397
|
+
v1: number,
|
|
398
|
+
v2: number,
|
|
399
|
+
index: number,
|
|
400
|
+
antecedent: number,
|
|
401
|
+
isPropagatingEqc: boolean,
|
|
402
|
+
) {
|
|
403
|
+
const s = this.s;
|
|
404
|
+
this.ctx.propagate(
|
|
405
|
+
consequent,
|
|
406
|
+
this.mkJustification(K_EQ2BIT, -1, v1, v2, consequent, antecedent),
|
|
407
|
+
);
|
|
408
|
+
if (s.value(consequent) === L_FALSE) return false;
|
|
409
|
+
if (this.wpos[v2] === index) this.findWpos(v2);
|
|
410
|
+
const atom = this.getBv2a(consequent >> 1);
|
|
411
|
+
this.forcePush();
|
|
412
|
+
if (atom !== undefined)
|
|
413
|
+
for (let occ = atom.occs; occ !== null; occ = occ.next)
|
|
414
|
+
if (
|
|
415
|
+
isPropagatingEqc ||
|
|
416
|
+
this.find.find(occ.thVar) !== this.find.find(v2) ||
|
|
417
|
+
occ.index !== index
|
|
418
|
+
)
|
|
419
|
+
this.propQueue.push({ thVar: occ.thVar, index: occ.index, atom: null });
|
|
420
|
+
return true;
|
|
421
|
+
}
|
|
422
|
+
|
|
423
|
+
private unmergeEh(v1: number, _v2: number) {
|
|
424
|
+
const bits = this.zeroOneBits[v1];
|
|
425
|
+
for (let index = bits.length - 1; index >= 0; index--)
|
|
426
|
+
if (this.find.find(bits[index].owner) === v1) {
|
|
427
|
+
bits.length = index + 1;
|
|
428
|
+
return;
|
|
429
|
+
}
|
|
430
|
+
bits.length = 0;
|
|
431
|
+
}
|
|
432
|
+
|
|
433
|
+
private mergeZeroOneBits(r1: number, r2: number) {
|
|
434
|
+
const bits2 = this.zeroOneBits[r2];
|
|
435
|
+
if (bits2.length === 0) return true;
|
|
436
|
+
const bits1 = this.zeroOneBits[r1];
|
|
437
|
+
const owners: number[][] = [[], []];
|
|
438
|
+
for (const bit of bits1) owners[bit.isTrue ? 1 : 0][bit.index] = bit.owner;
|
|
439
|
+
for (const bit of bits2) {
|
|
440
|
+
const v1 = owners[bit.isTrue ? 0 : 1][bit.index];
|
|
441
|
+
if (v1 !== undefined) {
|
|
442
|
+
this.mkNewDiseqAxiom(v1, bit.owner, bit.index);
|
|
443
|
+
return false;
|
|
444
|
+
}
|
|
445
|
+
if (owners[bit.isTrue ? 1 : 0][bit.index] === undefined) bits1.push(bit);
|
|
446
|
+
}
|
|
447
|
+
return true;
|
|
448
|
+
}
|
|
449
|
+
}
|