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,1200 @@
|
|
|
1
|
+
import { SmtInvariantError, SmtUnsupportedError } from "../../../errors";
|
|
2
|
+
import {
|
|
3
|
+
FAMILY_BV,
|
|
4
|
+
OP_ADD,
|
|
5
|
+
OP_BADD,
|
|
6
|
+
OP_BAND,
|
|
7
|
+
OP_BASHR,
|
|
8
|
+
OP_BCOMP,
|
|
9
|
+
OP_BIT2BOOL,
|
|
10
|
+
OP_BLSHR,
|
|
11
|
+
OP_BMUL,
|
|
12
|
+
OP_BNAND,
|
|
13
|
+
OP_BNEG,
|
|
14
|
+
OP_BNOR,
|
|
15
|
+
OP_BNOT,
|
|
16
|
+
OP_BOR,
|
|
17
|
+
OP_BREDAND,
|
|
18
|
+
OP_BREDOR,
|
|
19
|
+
OP_BSDIV0,
|
|
20
|
+
OP_BSDIV_I,
|
|
21
|
+
OP_BSHL,
|
|
22
|
+
OP_BSMOD,
|
|
23
|
+
OP_BSMOD0,
|
|
24
|
+
OP_BSMOD_I,
|
|
25
|
+
OP_BSMUL_NO_OVFL,
|
|
26
|
+
OP_BSMUL_NO_UDFL,
|
|
27
|
+
OP_BSREM,
|
|
28
|
+
OP_BSREM0,
|
|
29
|
+
OP_BSREM_I,
|
|
30
|
+
OP_BSUB,
|
|
31
|
+
OP_BUDIV0,
|
|
32
|
+
OP_BUDIV_I,
|
|
33
|
+
OP_BUMUL_NO_OVFL,
|
|
34
|
+
OP_BUREM,
|
|
35
|
+
OP_BUREM0,
|
|
36
|
+
OP_BUREM_I,
|
|
37
|
+
OP_BV_NUM,
|
|
38
|
+
OP_BXNOR,
|
|
39
|
+
OP_BXOR,
|
|
40
|
+
OP_CONCAT,
|
|
41
|
+
OP_EXT_ROTATE_LEFT,
|
|
42
|
+
OP_EXT_ROTATE_RIGHT,
|
|
43
|
+
OP_EXTRACT,
|
|
44
|
+
OP_GE,
|
|
45
|
+
OP_IDIV,
|
|
46
|
+
OP_INT2BV,
|
|
47
|
+
OP_ITE,
|
|
48
|
+
OP_MKBV,
|
|
49
|
+
OP_MOD,
|
|
50
|
+
OP_ROTATE_LEFT,
|
|
51
|
+
OP_ROTATE_RIGHT,
|
|
52
|
+
OP_SIGN_EXT,
|
|
53
|
+
OP_SLEQ,
|
|
54
|
+
OP_UBV2INT,
|
|
55
|
+
OP_ULEQ,
|
|
56
|
+
OP_ZERO_EXT,
|
|
57
|
+
SORT_BOOL,
|
|
58
|
+
SORT_INT,
|
|
59
|
+
} from "./ast";
|
|
60
|
+
import { BitBlaster } from "./bit-blaster";
|
|
61
|
+
import { mkBvApp } from "./bv-decl-plugin";
|
|
62
|
+
import type { Context } from "./context";
|
|
63
|
+
import { type Antecedents, Enode, Justification, TheoryJustification } from "./enode";
|
|
64
|
+
import { combineHash, hashU } from "./hash";
|
|
65
|
+
import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
|
|
66
|
+
import {
|
|
67
|
+
type BoolVar,
|
|
68
|
+
FALSE_LITERAL,
|
|
69
|
+
getVar,
|
|
70
|
+
isNegated,
|
|
71
|
+
type Literal,
|
|
72
|
+
mkLiteral,
|
|
73
|
+
negate,
|
|
74
|
+
TRUE_BOOL_VAR,
|
|
75
|
+
TRUE_LITERAL,
|
|
76
|
+
} from "./literal";
|
|
77
|
+
import { UnionFind } from "./lp/union-find";
|
|
78
|
+
import { Rewriter, TACTIC_REWRITER_OPTIONS } from "./rewriter";
|
|
79
|
+
import { Theory } from "./theory";
|
|
80
|
+
|
|
81
|
+
const NULL_THEORY_ID = -1;
|
|
82
|
+
|
|
83
|
+
interface VarPosOcc {
|
|
84
|
+
readonly thVar: number;
|
|
85
|
+
readonly index: number;
|
|
86
|
+
readonly next: VarPosOcc | null;
|
|
87
|
+
}
|
|
88
|
+
|
|
89
|
+
interface BitAtom {
|
|
90
|
+
readonly isBit: true;
|
|
91
|
+
occs: VarPosOcc | null;
|
|
92
|
+
}
|
|
93
|
+
|
|
94
|
+
interface LeAtom {
|
|
95
|
+
readonly isBit: false;
|
|
96
|
+
readonly literal: Literal;
|
|
97
|
+
readonly def: Literal;
|
|
98
|
+
}
|
|
99
|
+
|
|
100
|
+
interface ZeroOneBit {
|
|
101
|
+
readonly owner: number;
|
|
102
|
+
readonly index: number;
|
|
103
|
+
readonly isTrue: boolean;
|
|
104
|
+
}
|
|
105
|
+
|
|
106
|
+
interface BvDiseq {
|
|
107
|
+
readonly first: number;
|
|
108
|
+
readonly second: number;
|
|
109
|
+
readonly index: number;
|
|
110
|
+
}
|
|
111
|
+
|
|
112
|
+
export type Blast = (
|
|
113
|
+
blaster: BitBlaster,
|
|
114
|
+
bits: number[][],
|
|
115
|
+
parameter: number,
|
|
116
|
+
out: number[],
|
|
117
|
+
) => void;
|
|
118
|
+
|
|
119
|
+
export const UNARY_BLASTS = new Map<number, Blast>([
|
|
120
|
+
[OP_BNEG, (blaster, bits, _parameter, out) => blaster.mkNeg(bits[0], out)],
|
|
121
|
+
[OP_BNOT, (blaster, bits, _parameter, out) => blaster.mkNotBits(bits[0], out)],
|
|
122
|
+
[OP_BREDAND, (blaster, bits, _parameter, out) => blaster.mkRedand(bits[0], out)],
|
|
123
|
+
[OP_BREDOR, (blaster, bits, _parameter, out) => blaster.mkRedor(bits[0], out)],
|
|
124
|
+
[OP_SIGN_EXT, (blaster, bits, parameter, out) => blaster.mkSignExtend(bits[0], parameter, out)],
|
|
125
|
+
[OP_ZERO_EXT, (blaster, bits, parameter, out) => blaster.mkZeroExtend(bits[0], parameter, out)],
|
|
126
|
+
[
|
|
127
|
+
OP_ROTATE_LEFT,
|
|
128
|
+
(blaster, bits, parameter, out) => blaster.mkRotateLeft(bits[0], parameter, out),
|
|
129
|
+
],
|
|
130
|
+
[
|
|
131
|
+
OP_ROTATE_RIGHT,
|
|
132
|
+
(blaster, bits, parameter, out) => blaster.mkRotateRight(bits[0], parameter, out),
|
|
133
|
+
],
|
|
134
|
+
]);
|
|
135
|
+
|
|
136
|
+
export const BINARY_BLASTS = new Map<number, Blast>([
|
|
137
|
+
[OP_BUDIV_I, (blaster, bits, _parameter, out) => blaster.mkUdiv(bits[0], bits[1], out)],
|
|
138
|
+
[OP_BSDIV_I, (blaster, bits, _parameter, out) => blaster.mkSdiv(bits[0], bits[1], out)],
|
|
139
|
+
[OP_BUREM_I, (blaster, bits, _parameter, out) => blaster.mkUrem(bits[0], bits[1], out)],
|
|
140
|
+
[OP_BSREM_I, (blaster, bits, _parameter, out) => blaster.mkSrem(bits[0], bits[1], out)],
|
|
141
|
+
[OP_BSMOD_I, (blaster, bits, _parameter, out) => blaster.mkSmod(bits[0], bits[1], out)],
|
|
142
|
+
[OP_BSHL, (blaster, bits, _parameter, out) => blaster.mkShl(bits[0], bits[1], out)],
|
|
143
|
+
[OP_BLSHR, (blaster, bits, _parameter, out) => blaster.mkLshr(bits[0], bits[1], out)],
|
|
144
|
+
[OP_BASHR, (blaster, bits, _parameter, out) => blaster.mkAshr(bits[0], bits[1], out)],
|
|
145
|
+
[
|
|
146
|
+
OP_EXT_ROTATE_LEFT,
|
|
147
|
+
(blaster, bits, _parameter, out) => blaster.mkExtRotateLeft(bits[0], bits[1], out),
|
|
148
|
+
],
|
|
149
|
+
[
|
|
150
|
+
OP_EXT_ROTATE_RIGHT,
|
|
151
|
+
(blaster, bits, _parameter, out) => blaster.mkExtRotateRight(bits[0], bits[1], out),
|
|
152
|
+
],
|
|
153
|
+
[OP_BCOMP, (blaster, bits, _parameter, out) => blaster.mkComp(bits[0], bits[1], out)],
|
|
154
|
+
]);
|
|
155
|
+
|
|
156
|
+
// MK_AC_BINARY: folded from the last argument to the first.
|
|
157
|
+
export const AC_BLASTS = new Map<number, Blast>([
|
|
158
|
+
[OP_BADD, (blaster, bits, _parameter, out) => blaster.mkAdder(bits[0], bits[1], out)],
|
|
159
|
+
[OP_BMUL, (blaster, bits, _parameter, out) => blaster.mkMultiplier(bits[0], bits[1], out)],
|
|
160
|
+
[OP_BAND, (blaster, bits, _parameter, out) => blaster.mkAndBits(bits[0], bits[1], out)],
|
|
161
|
+
[OP_BOR, (blaster, bits, _parameter, out) => blaster.mkOrBits(bits[0], bits[1], out)],
|
|
162
|
+
[OP_BXOR, (blaster, bits, _parameter, out) => blaster.mkXorBits(bits[0], bits[1], out)],
|
|
163
|
+
[OP_BNAND, (blaster, bits, _parameter, out) => blaster.mkNandBits(bits[0], bits[1], out)],
|
|
164
|
+
[OP_BNOR, (blaster, bits, _parameter, out) => blaster.mkNorBits(bits[0], bits[1], out)],
|
|
165
|
+
[OP_BXNOR, (blaster, bits, _parameter, out) => blaster.mkXnorBits(bits[0], bits[1], out)],
|
|
166
|
+
]);
|
|
167
|
+
|
|
168
|
+
const DIVREM_OPS: ReadonlySet<number> = new Set([
|
|
169
|
+
OP_BUREM,
|
|
170
|
+
OP_BUREM_I,
|
|
171
|
+
OP_BSREM,
|
|
172
|
+
OP_BSREM_I,
|
|
173
|
+
OP_BSMOD,
|
|
174
|
+
OP_BSMOD_I,
|
|
175
|
+
OP_BUDIV_I,
|
|
176
|
+
OP_BSDIV_I,
|
|
177
|
+
]);
|
|
178
|
+
|
|
179
|
+
// The division by zero, which the model interprets, and the divisions that hi_div0 rewrote.
|
|
180
|
+
const UNINTERPRETED_OPS: ReadonlySet<number> = new Set([
|
|
181
|
+
OP_BSDIV0,
|
|
182
|
+
OP_BUDIV0,
|
|
183
|
+
OP_BSREM0,
|
|
184
|
+
OP_BUREM0,
|
|
185
|
+
OP_BSMOD0,
|
|
186
|
+
OP_BSREM,
|
|
187
|
+
OP_BUREM,
|
|
188
|
+
OP_BSMOD,
|
|
189
|
+
]);
|
|
190
|
+
|
|
191
|
+
const DIV0_OPS: ReadonlySet<number> = new Set([
|
|
192
|
+
OP_BSDIV0,
|
|
193
|
+
OP_BUDIV0,
|
|
194
|
+
OP_BSREM0,
|
|
195
|
+
OP_BUREM0,
|
|
196
|
+
OP_BSMOD0,
|
|
197
|
+
]);
|
|
198
|
+
|
|
199
|
+
class BitEqJustification extends Justification {
|
|
200
|
+
constructor(
|
|
201
|
+
readonly fromTheory: number,
|
|
202
|
+
private first: Enode,
|
|
203
|
+
private second: Enode,
|
|
204
|
+
private antecedent: Literal,
|
|
205
|
+
) {
|
|
206
|
+
super();
|
|
207
|
+
}
|
|
208
|
+
|
|
209
|
+
getAntecedents(antecedents: Antecedents) {
|
|
210
|
+
antecedents.markEq(this.first, this.second);
|
|
211
|
+
if (getVar(this.antecedent) !== TRUE_BOOL_VAR) antecedents.markLiteral(this.antecedent);
|
|
212
|
+
}
|
|
213
|
+
}
|
|
214
|
+
|
|
215
|
+
class FixedEqJustification extends Justification {
|
|
216
|
+
constructor(
|
|
217
|
+
readonly fromTheory: number,
|
|
218
|
+
private context: Context,
|
|
219
|
+
private firstBits: readonly Literal[],
|
|
220
|
+
private secondBits: readonly Literal[],
|
|
221
|
+
) {
|
|
222
|
+
super();
|
|
223
|
+
}
|
|
224
|
+
|
|
225
|
+
getAntecedents(antecedents: Antecedents) {
|
|
226
|
+
for (const bits of [this.firstBits, this.secondBits])
|
|
227
|
+
for (const bit of bits)
|
|
228
|
+
if (getVar(bit) !== TRUE_BOOL_VAR)
|
|
229
|
+
antecedents.markLiteral(this.context.getAssignment(bit) === L_TRUE ? bit : negate(bit));
|
|
230
|
+
}
|
|
231
|
+
}
|
|
232
|
+
|
|
233
|
+
export class TheoryBv extends Theory {
|
|
234
|
+
readonly name = "bit-vector";
|
|
235
|
+
private blaster: BitBlaster;
|
|
236
|
+
private trail: (() => void)[] = [];
|
|
237
|
+
private trailLimits: number[] = [];
|
|
238
|
+
private unionFind = new UnionFind(this.trail);
|
|
239
|
+
private bits: Literal[][] = [];
|
|
240
|
+
private wpos: number[] = [];
|
|
241
|
+
private zeroOneBits: ZeroOneBit[][] = [];
|
|
242
|
+
private atoms: (BitAtom | LeAtom | undefined)[] = [];
|
|
243
|
+
private fixedVars = new Map<string, number>();
|
|
244
|
+
private eqActivity = new Uint8Array(256);
|
|
245
|
+
private propDiseqs: BvDiseq[] = [];
|
|
246
|
+
private propDiseqsHead = 0;
|
|
247
|
+
private propQueue: number[] = [];
|
|
248
|
+
private mergeAux: [number[], number[]] = [[], []];
|
|
249
|
+
private bv2ints: Enode[] = [];
|
|
250
|
+
|
|
251
|
+
constructor(context: Context) {
|
|
252
|
+
super(context, FAMILY_BV);
|
|
253
|
+
this.blaster = new BitBlaster(context.manager);
|
|
254
|
+
this.unionFind.handler = {
|
|
255
|
+
mergeEh: (root, joining, second, first) => this.mergeEh(root, joining, second, first),
|
|
256
|
+
unmergeEh: (root) => this.unmergeEh(root),
|
|
257
|
+
};
|
|
258
|
+
}
|
|
259
|
+
|
|
260
|
+
private getBvSize(thVar: number) {
|
|
261
|
+
const manager = this.manager;
|
|
262
|
+
return manager.getBvSize(manager.sorts[this.getExpr(thVar)]);
|
|
263
|
+
}
|
|
264
|
+
|
|
265
|
+
private mkVar(node: Enode) {
|
|
266
|
+
const thVar = this.varEnodes.length;
|
|
267
|
+
this.varEnodes.push(node);
|
|
268
|
+
this.unionFind.mkVar();
|
|
269
|
+
this.bits.push([]);
|
|
270
|
+
this.wpos.push(0);
|
|
271
|
+
this.zeroOneBits.push([]);
|
|
272
|
+
this.context.attachThVar(node, this, thVar);
|
|
273
|
+
return thVar;
|
|
274
|
+
}
|
|
275
|
+
|
|
276
|
+
private insertAtom(boolVar: BoolVar, atom: BitAtom | LeAtom) {
|
|
277
|
+
this.atoms[boolVar] = atom;
|
|
278
|
+
this.trail.push(() => {
|
|
279
|
+
this.atoms[boolVar] = undefined;
|
|
280
|
+
});
|
|
281
|
+
}
|
|
282
|
+
|
|
283
|
+
private mkBits(thVar: number) {
|
|
284
|
+
const context = this.context;
|
|
285
|
+
const owner = this.getExpr(thVar);
|
|
286
|
+
const isRelevant = context.isRelevant(owner);
|
|
287
|
+
const bits = this.bits[thVar];
|
|
288
|
+
bits.length = 0;
|
|
289
|
+
const bitExprs = Array.from({ length: this.getBvSize(thVar) }, (_, index) =>
|
|
290
|
+
mkBvApp(this.manager, OP_BIT2BOOL, [owner], [index]),
|
|
291
|
+
);
|
|
292
|
+
context.internalizeAll(bitExprs, true);
|
|
293
|
+
for (const bitExpr of bitExprs) {
|
|
294
|
+
bits.push(mkLiteral(context.getBoolVar(bitExpr)));
|
|
295
|
+
if (isRelevant && !context.isRelevant(bitExpr)) context.markAsRelevant(bitExpr);
|
|
296
|
+
}
|
|
297
|
+
}
|
|
298
|
+
|
|
299
|
+
private mkBit2Bool(atom: number) {
|
|
300
|
+
const context = this.context;
|
|
301
|
+
const manager = this.manager;
|
|
302
|
+
const arg = manager.getArg(atom, 0);
|
|
303
|
+
if (!context.isEInternalized(arg)) {
|
|
304
|
+
context.internalize(arg, false);
|
|
305
|
+
this.getVar(this.getInternalizedEnode(arg));
|
|
306
|
+
}
|
|
307
|
+
const argVar = this.getInternalizedEnode(arg).getThVar(this.id);
|
|
308
|
+
const index = this.getParameter(atom, 0);
|
|
309
|
+
if (argVar < 0) this.getVar(this.getInternalizedEnode(arg));
|
|
310
|
+
else if (!context.isBInternalized(atom)) {
|
|
311
|
+
const boolVar = context.mkBoolVar(atom);
|
|
312
|
+
context.setVarTheory(boolVar, this.id);
|
|
313
|
+
this.insertAtom(boolVar, { isBit: true, occs: { thVar: argVar, index, next: null } });
|
|
314
|
+
const bit = this.bits[argVar][index];
|
|
315
|
+
if (bit !== undefined) {
|
|
316
|
+
context.mkThAxiom([bit, mkLiteral(boolVar, true)]);
|
|
317
|
+
context.mkThAxiom([negate(bit), mkLiteral(boolVar)]);
|
|
318
|
+
}
|
|
319
|
+
}
|
|
320
|
+
if (!manager.isBvNumeral(arg)) return;
|
|
321
|
+
const isOne = ((manager.getBvNumeralValue(arg) >> BigInt(index)) & 1n) === 1n;
|
|
322
|
+
const literal = context.getLiteral(atom);
|
|
323
|
+
context.markLiteralAsRelevant(literal);
|
|
324
|
+
context.mkThAxiom([isOne ? literal : negate(literal)]);
|
|
325
|
+
}
|
|
326
|
+
|
|
327
|
+
private getParameter(expr: number, index: number) {
|
|
328
|
+
const manager = this.manager;
|
|
329
|
+
return manager.funcDecls[manager.decls[expr]].parameters[index];
|
|
330
|
+
}
|
|
331
|
+
|
|
332
|
+
private getInternalizedEnode(expr: number) {
|
|
333
|
+
const node = this.context.getEnode(expr);
|
|
334
|
+
if (node === undefined) throw new SmtInvariantError("the term was not internalized");
|
|
335
|
+
return node;
|
|
336
|
+
}
|
|
337
|
+
|
|
338
|
+
private mkEnode(term: number) {
|
|
339
|
+
const context = this.context;
|
|
340
|
+
if (context.isEInternalized(term)) return this.getInternalizedEnode(term);
|
|
341
|
+
const node = context.mkEnode(term, false, false, false);
|
|
342
|
+
this.mkVar(node);
|
|
343
|
+
return node;
|
|
344
|
+
}
|
|
345
|
+
|
|
346
|
+
private getVar(node: Enode) {
|
|
347
|
+
const thVar = node.getThVar(this.id);
|
|
348
|
+
if (thVar >= 0) return thVar;
|
|
349
|
+
const created = this.mkVar(node);
|
|
350
|
+
this.mkBits(created);
|
|
351
|
+
return created;
|
|
352
|
+
}
|
|
353
|
+
|
|
354
|
+
private literalToExpr(literal: Literal) {
|
|
355
|
+
const manager = this.manager;
|
|
356
|
+
const atom = this.context.boolVar2Expr[getVar(literal)];
|
|
357
|
+
const expr =
|
|
358
|
+
literal === TRUE_LITERAL
|
|
359
|
+
? manager.trueExpr
|
|
360
|
+
: literal === FALSE_LITERAL
|
|
361
|
+
? manager.falseExpr
|
|
362
|
+
: isNegated(literal)
|
|
363
|
+
? manager.mkNot(atom)
|
|
364
|
+
: atom;
|
|
365
|
+
manager.incRef(expr);
|
|
366
|
+
return expr;
|
|
367
|
+
}
|
|
368
|
+
|
|
369
|
+
private getBits(thVar: number) {
|
|
370
|
+
return this.bits[thVar].map((bit) => this.literalToExpr(bit));
|
|
371
|
+
}
|
|
372
|
+
|
|
373
|
+
private dropAll(exprs: number[]) {
|
|
374
|
+
for (const expr of exprs) this.manager.decRef(expr);
|
|
375
|
+
}
|
|
376
|
+
|
|
377
|
+
private addNewDiseqAxiom(first: number, second: number, index: number) {
|
|
378
|
+
this.propDiseqs.push({ first, second, index });
|
|
379
|
+
this.context.pushTrail(() => {
|
|
380
|
+
this.propDiseqs.pop();
|
|
381
|
+
});
|
|
382
|
+
}
|
|
383
|
+
|
|
384
|
+
private assertNewDiseqAxiom(first: number, second: number) {
|
|
385
|
+
const context = this.context;
|
|
386
|
+
const manager = this.manager;
|
|
387
|
+
const firstExpr = this.getExpr(first);
|
|
388
|
+
const secondExpr = this.getExpr(second);
|
|
389
|
+
const eq = manager.mkEq(firstExpr, secondExpr);
|
|
390
|
+
manager.incRef(eq);
|
|
391
|
+
context.mkThAxiom([negate(this.mkLiteral(eq))]);
|
|
392
|
+
const relevancy = context.relevancy;
|
|
393
|
+
if (relevancy.isEnabled) {
|
|
394
|
+
const handler = () => {
|
|
395
|
+
if (relevancy.isRelevant(firstExpr) && relevancy.isRelevant(secondExpr))
|
|
396
|
+
relevancy.markAsRelevant(eq);
|
|
397
|
+
};
|
|
398
|
+
relevancy.addHandler(firstExpr, handler);
|
|
399
|
+
relevancy.addHandler(secondExpr, handler);
|
|
400
|
+
}
|
|
401
|
+
manager.decRef(eq);
|
|
402
|
+
}
|
|
403
|
+
|
|
404
|
+
private registerTrueFalseBit(thVar: number, index: number) {
|
|
405
|
+
this.zeroOneBits[thVar].push({
|
|
406
|
+
owner: thVar,
|
|
407
|
+
index,
|
|
408
|
+
isTrue: this.bits[thVar][index] === TRUE_LITERAL,
|
|
409
|
+
});
|
|
410
|
+
}
|
|
411
|
+
|
|
412
|
+
private addBit(thVar: number, literal: Literal) {
|
|
413
|
+
const context = this.context;
|
|
414
|
+
const bits = this.bits[thVar];
|
|
415
|
+
const index = bits.length;
|
|
416
|
+
bits.push(literal);
|
|
417
|
+
const boolVar = getVar(literal);
|
|
418
|
+
if (boolVar === TRUE_BOOL_VAR) {
|
|
419
|
+
this.registerTrueFalseBit(thVar, index);
|
|
420
|
+
return;
|
|
421
|
+
}
|
|
422
|
+
const thId = context.getBoolVarTheory(boolVar);
|
|
423
|
+
if (thId === this.id) {
|
|
424
|
+
const atom = this.atoms[boolVar];
|
|
425
|
+
if (atom === undefined || !atom.isBit) return;
|
|
426
|
+
const negated = negate(literal);
|
|
427
|
+
const size = this.getBvSize(thVar);
|
|
428
|
+
for (let occ = atom.occs; occ !== null; occ = occ.next)
|
|
429
|
+
if (
|
|
430
|
+
occ.index === index &&
|
|
431
|
+
this.bits[occ.thVar][occ.index] === negated &&
|
|
432
|
+
this.getBvSize(occ.thVar) === size
|
|
433
|
+
)
|
|
434
|
+
this.addNewDiseqAxiom(thVar, occ.thVar, index);
|
|
435
|
+
const previous = atom.occs;
|
|
436
|
+
this.trail.push(() => {
|
|
437
|
+
atom.occs = previous;
|
|
438
|
+
});
|
|
439
|
+
atom.occs = { thVar, index, next: previous };
|
|
440
|
+
} else if (thId === NULL_THEORY_ID) {
|
|
441
|
+
context.setVarTheory(boolVar, this.id);
|
|
442
|
+
this.insertAtom(boolVar, { isBit: true, occs: { thVar, index, next: null } });
|
|
443
|
+
}
|
|
444
|
+
}
|
|
445
|
+
|
|
446
|
+
private initBits(node: Enode, bitExprs: number[]) {
|
|
447
|
+
const context = this.context;
|
|
448
|
+
const thVar = node.getThVar(this.id);
|
|
449
|
+
this.bits[thVar].length = 0;
|
|
450
|
+
context.internalizeAll(bitExprs, true);
|
|
451
|
+
for (const bitExpr of bitExprs) this.addBit(thVar, context.getLiteral(bitExpr));
|
|
452
|
+
this.findWpos(thVar);
|
|
453
|
+
}
|
|
454
|
+
|
|
455
|
+
private findWpos(thVar: number) {
|
|
456
|
+
const context = this.context;
|
|
457
|
+
const bits = this.bits[thVar];
|
|
458
|
+
const start = this.wpos[thVar];
|
|
459
|
+
for (let offset = 0; offset < bits.length; offset++) {
|
|
460
|
+
const position = (start + offset) % bits.length;
|
|
461
|
+
if (context.getAssignment(bits[position]) === L_UNDEF) {
|
|
462
|
+
this.wpos[thVar] = position;
|
|
463
|
+
return;
|
|
464
|
+
}
|
|
465
|
+
}
|
|
466
|
+
this.fixedVarEh(thVar);
|
|
467
|
+
}
|
|
468
|
+
|
|
469
|
+
private addFixedEq(inputFirst: number, inputSecond: number) {
|
|
470
|
+
const first = Math.min(inputFirst, inputSecond);
|
|
471
|
+
const second = Math.max(inputFirst, inputSecond);
|
|
472
|
+
const slot = combineHash(hashU(first), hashU(second)) & 0xff;
|
|
473
|
+
const activity = this.eqActivity[slot]++;
|
|
474
|
+
if (activity !== 0xff) return;
|
|
475
|
+
const context = this.context;
|
|
476
|
+
const manager = this.manager;
|
|
477
|
+
const firstExpr = this.getExpr(first);
|
|
478
|
+
const secondExpr = this.getExpr(second);
|
|
479
|
+
const classEq = this.mkEq(firstExpr, secondExpr, true);
|
|
480
|
+
context.markLiteralAsRelevant(classEq);
|
|
481
|
+
const literals: Literal[] = [];
|
|
482
|
+
for (let index = 0; index < this.getBvSize(first); index++) {
|
|
483
|
+
const firstBit = this.bits[first][index];
|
|
484
|
+
const secondBit = this.bits[second][index];
|
|
485
|
+
const firstBitExpr = mkBvApp(manager, OP_BIT2BOOL, [firstExpr], [index]);
|
|
486
|
+
manager.incRef(firstBitExpr);
|
|
487
|
+
const secondBitExpr = mkBvApp(manager, OP_BIT2BOOL, [secondExpr], [index]);
|
|
488
|
+
manager.incRef(secondBitExpr);
|
|
489
|
+
const eq = this.mkEq(firstBitExpr, secondBitExpr, true);
|
|
490
|
+
context.mkThAxiom([firstBit, negate(secondBit), negate(eq)]);
|
|
491
|
+
context.mkThAxiom([negate(firstBit), secondBit, negate(eq)]);
|
|
492
|
+
context.mkThAxiom([firstBit, secondBit, eq]);
|
|
493
|
+
context.mkThAxiom([negate(firstBit), negate(secondBit), eq]);
|
|
494
|
+
context.mkThAxiom([eq, negate(classEq)]);
|
|
495
|
+
literals.push(negate(eq));
|
|
496
|
+
manager.decRef(secondBitExpr);
|
|
497
|
+
manager.decRef(firstBitExpr);
|
|
498
|
+
}
|
|
499
|
+
literals.push(classEq);
|
|
500
|
+
context.mkThAxiom(literals);
|
|
501
|
+
}
|
|
502
|
+
|
|
503
|
+
private getFixedValue(thVar: number) {
|
|
504
|
+
const context = this.context;
|
|
505
|
+
let value = 0n;
|
|
506
|
+
let isFixed = true;
|
|
507
|
+
const bits = this.bits[thVar];
|
|
508
|
+
for (let index = 0; index < bits.length; index++) {
|
|
509
|
+
const assignment = context.getAssignment(bits[index]);
|
|
510
|
+
if (assignment === L_UNDEF) {
|
|
511
|
+
isFixed = false;
|
|
512
|
+
break;
|
|
513
|
+
}
|
|
514
|
+
if (assignment === L_TRUE) value += 1n << BigInt(index);
|
|
515
|
+
}
|
|
516
|
+
return { value, isFixed };
|
|
517
|
+
}
|
|
518
|
+
|
|
519
|
+
private fixedVarEh(thVar: number) {
|
|
520
|
+
const value = this.getFixedValue(thVar).value;
|
|
521
|
+
const size = this.getBvSize(thVar);
|
|
522
|
+
const key = `${size}:${value}`;
|
|
523
|
+
const other = this.fixedVars.get(key);
|
|
524
|
+
if (other === undefined) {
|
|
525
|
+
this.fixedVars.set(key, thVar);
|
|
526
|
+
return;
|
|
527
|
+
}
|
|
528
|
+
const otherValue = other < this.getNumVars() ? this.getFixedValue(other) : undefined;
|
|
529
|
+
if (
|
|
530
|
+
otherValue === undefined ||
|
|
531
|
+
this.getBvSize(other) !== size ||
|
|
532
|
+
!otherValue.isFixed ||
|
|
533
|
+
otherValue.value !== value
|
|
534
|
+
) {
|
|
535
|
+
this.fixedVars.delete(key);
|
|
536
|
+
this.fixedVars.set(key, thVar);
|
|
537
|
+
return;
|
|
538
|
+
}
|
|
539
|
+
const node = this.getEnode(thVar);
|
|
540
|
+
const otherNode = this.getEnode(other);
|
|
541
|
+
if (node.root === otherNode.root) return;
|
|
542
|
+
this.addFixedEq(thVar, other);
|
|
543
|
+
const justification = new FixedEqJustification(
|
|
544
|
+
this.id,
|
|
545
|
+
this.context,
|
|
546
|
+
this.bits[thVar],
|
|
547
|
+
this.bits[other],
|
|
548
|
+
);
|
|
549
|
+
this.context.pushEq(node, otherNode, { kind: "justification", justification });
|
|
550
|
+
this.fixedVars.set(key, other);
|
|
551
|
+
}
|
|
552
|
+
|
|
553
|
+
private internalizeNum(term: number) {
|
|
554
|
+
const manager = this.manager;
|
|
555
|
+
const value = manager.getBvNumeralValue(term);
|
|
556
|
+
const size = manager.getBvSize(manager.sorts[term]);
|
|
557
|
+
const thVar = this.mkEnode(term).getThVar(this.id);
|
|
558
|
+
const bits = this.bits[thVar];
|
|
559
|
+
for (let index = 0; index < size; index++) {
|
|
560
|
+
bits.push(((value >> BigInt(index)) & 1n) === 1n ? TRUE_LITERAL : FALSE_LITERAL);
|
|
561
|
+
this.registerTrueFalseBit(thVar, index);
|
|
562
|
+
}
|
|
563
|
+
this.fixedVarEh(thVar);
|
|
564
|
+
}
|
|
565
|
+
|
|
566
|
+
private processArgs(term: number) {
|
|
567
|
+
const manager = this.manager;
|
|
568
|
+
this.context.internalizeAll(manager.getArgs(term), false);
|
|
569
|
+
}
|
|
570
|
+
|
|
571
|
+
private getArgBits(node: Enode, index: number) {
|
|
572
|
+
return this.getBits(this.getVar(node.getArg(index)));
|
|
573
|
+
}
|
|
574
|
+
|
|
575
|
+
private internalizeBlast(term: number, blast: Blast, isAssociative: boolean) {
|
|
576
|
+
this.processArgs(term);
|
|
577
|
+
const node = this.mkEnode(term);
|
|
578
|
+
const numArgs = node.numArgs;
|
|
579
|
+
const parameters = this.manager.funcDecls[this.manager.decls[term]].parameters;
|
|
580
|
+
if (!isAssociative) {
|
|
581
|
+
const args = Array.from({ length: numArgs }, (_, index) => this.getArgBits(node, index));
|
|
582
|
+
const bits: number[] = [];
|
|
583
|
+
blast(this.blaster, args, parameters[0], bits);
|
|
584
|
+
this.initBits(node, bits);
|
|
585
|
+
this.dropAll(bits);
|
|
586
|
+
for (let index = args.length - 1; index >= 0; index--) this.dropAll(args[index]);
|
|
587
|
+
return;
|
|
588
|
+
}
|
|
589
|
+
let argBits: number[] = [];
|
|
590
|
+
let bits = this.getArgBits(node, numArgs - 1);
|
|
591
|
+
let newBits: number[] = [];
|
|
592
|
+
for (let index = numArgs - 2; index >= 0; index--) {
|
|
593
|
+
this.dropAll(argBits);
|
|
594
|
+
argBits = this.getArgBits(node, index);
|
|
595
|
+
this.dropAll(newBits);
|
|
596
|
+
newBits = [];
|
|
597
|
+
blast(this.blaster, [argBits, bits], 0, newBits);
|
|
598
|
+
const swapped = bits;
|
|
599
|
+
bits = newBits;
|
|
600
|
+
newBits = swapped;
|
|
601
|
+
}
|
|
602
|
+
this.initBits(node, bits);
|
|
603
|
+
this.dropAll(newBits);
|
|
604
|
+
this.dropAll(bits);
|
|
605
|
+
this.dropAll(argBits);
|
|
606
|
+
}
|
|
607
|
+
|
|
608
|
+
private internalizeSub(term: number) {
|
|
609
|
+
this.processArgs(term);
|
|
610
|
+
const node = this.mkEnode(term);
|
|
611
|
+
const first = this.getArgBits(node, 0);
|
|
612
|
+
const second = this.getArgBits(node, 1);
|
|
613
|
+
const bits: number[] = [];
|
|
614
|
+
const carry = this.blaster.mkSubtracter(first, second, bits);
|
|
615
|
+
this.initBits(node, bits);
|
|
616
|
+
this.manager.decRef(carry);
|
|
617
|
+
this.dropAll(bits);
|
|
618
|
+
this.dropAll(second);
|
|
619
|
+
this.dropAll(first);
|
|
620
|
+
}
|
|
621
|
+
|
|
622
|
+
private internalizeConcat(term: number) {
|
|
623
|
+
this.processArgs(term);
|
|
624
|
+
const node = this.mkEnode(term);
|
|
625
|
+
const thVar = node.getThVar(this.id);
|
|
626
|
+
this.bits[thVar].length = 0;
|
|
627
|
+
for (let index = node.numArgs - 1; index >= 0; index--)
|
|
628
|
+
for (const bit of this.bits[this.getVar(node.getArg(index))]) this.addBit(thVar, bit);
|
|
629
|
+
this.findWpos(thVar);
|
|
630
|
+
}
|
|
631
|
+
|
|
632
|
+
private internalizeExtract(term: number) {
|
|
633
|
+
this.processArgs(term);
|
|
634
|
+
const node = this.mkEnode(term);
|
|
635
|
+
const thVar = node.getThVar(this.id);
|
|
636
|
+
const argBits = this.bits[this.getVar(node.getArg(0))];
|
|
637
|
+
this.bits[thVar].length = 0;
|
|
638
|
+
for (let index = this.getParameter(term, 1); index <= this.getParameter(term, 0); index++)
|
|
639
|
+
this.addBit(thVar, argBits[index]);
|
|
640
|
+
this.findWpos(thVar);
|
|
641
|
+
}
|
|
642
|
+
|
|
643
|
+
private internalizeMkbv(term: number) {
|
|
644
|
+
const manager = this.manager;
|
|
645
|
+
this.processArgs(term);
|
|
646
|
+
const node = this.mkEnode(term);
|
|
647
|
+
const bits = manager.getArgs(term);
|
|
648
|
+
for (const bit of bits) manager.incRef(bit);
|
|
649
|
+
this.initBits(node, bits);
|
|
650
|
+
this.dropAll(bits);
|
|
651
|
+
}
|
|
652
|
+
|
|
653
|
+
private internalizeBv2int(term: number) {
|
|
654
|
+
this.processArgs(term);
|
|
655
|
+
const node = this.mkEnode(term);
|
|
656
|
+
this.bv2ints.push(node);
|
|
657
|
+
this.context.pushTrail(() => {
|
|
658
|
+
this.bv2ints.pop();
|
|
659
|
+
});
|
|
660
|
+
if (!this.context.relevancy.isEnabled) this.assertBv2intAxiom(term);
|
|
661
|
+
}
|
|
662
|
+
|
|
663
|
+
private assertBv2intAxiom(term: number) {
|
|
664
|
+
const context = this.context;
|
|
665
|
+
const manager = this.manager;
|
|
666
|
+
const word = manager.getArg(term, 0);
|
|
667
|
+
const wordBits = this.getBits(this.getVar(this.getInternalizedEnode(word)));
|
|
668
|
+
const zero = manager.mkNumeral(0n);
|
|
669
|
+
const terms = wordBits.map((bit, index) =>
|
|
670
|
+
manager.mkApp(OP_ITE, [bit, manager.mkNumeral(1n << BigInt(index)), zero], SORT_INT),
|
|
671
|
+
);
|
|
672
|
+
const sum = terms.length === 1 ? terms[0] : manager.mkApp(OP_ADD, terms, SORT_INT);
|
|
673
|
+
manager.incRef(sum);
|
|
674
|
+
const rewritten = new Rewriter(manager, TACTIC_REWRITER_OPTIONS).rewrite(sum);
|
|
675
|
+
const literal = this.mkEq(term, rewritten, false);
|
|
676
|
+
context.markLiteralAsRelevant(literal);
|
|
677
|
+
context.mkThAxiom([literal]);
|
|
678
|
+
manager.decRef(rewritten);
|
|
679
|
+
manager.decRef(sum);
|
|
680
|
+
this.dropAll(wordBits);
|
|
681
|
+
}
|
|
682
|
+
|
|
683
|
+
private internalizeInt2bv(term: number) {
|
|
684
|
+
this.processArgs(term);
|
|
685
|
+
const node = this.mkEnode(term);
|
|
686
|
+
this.mkBits(node.getThVar(this.id));
|
|
687
|
+
const arg = node.getArg(0);
|
|
688
|
+
if (!this.isAttachedToVar(arg)) this.mkVar(arg);
|
|
689
|
+
if (!this.context.relevancy.isEnabled) this.assertInt2bvAxiom(term);
|
|
690
|
+
}
|
|
691
|
+
|
|
692
|
+
private assertInt2bvAxiom(term: number) {
|
|
693
|
+
const context = this.context;
|
|
694
|
+
const manager = this.manager;
|
|
695
|
+
const arg = manager.getArg(term, 0);
|
|
696
|
+
const size = manager.getBvSize(manager.sorts[term]);
|
|
697
|
+
const mkMod = (dividend: number, divisor: bigint) =>
|
|
698
|
+
manager.mkApp(OP_MOD, [dividend, manager.mkNumeral(divisor)], SORT_INT);
|
|
699
|
+
const value = mkBvApp(manager, OP_UBV2INT, [term]);
|
|
700
|
+
manager.incRef(value);
|
|
701
|
+
const remainder = mkMod(arg, 1n << BigInt(size));
|
|
702
|
+
manager.incRef(remainder);
|
|
703
|
+
const literal = this.mkEq(value, remainder, false);
|
|
704
|
+
context.markLiteralAsRelevant(literal);
|
|
705
|
+
context.mkThAxiom([literal]);
|
|
706
|
+
manager.decRef(remainder);
|
|
707
|
+
manager.decRef(value);
|
|
708
|
+
const termBits = this.getBits(this.getVar(this.getInternalizedEnode(term)));
|
|
709
|
+
for (let index = 0; index < size; index++) {
|
|
710
|
+
const divisor = 1n << BigInt(index);
|
|
711
|
+
const quotient =
|
|
712
|
+
index === 0 ? arg : manager.mkApp(OP_IDIV, [arg, manager.mkNumeral(divisor)], SORT_INT);
|
|
713
|
+
manager.incRef(quotient);
|
|
714
|
+
const isOne = context.mkEqAtom(mkMod(quotient, 2n), manager.mkNumeral(1n));
|
|
715
|
+
manager.incRef(isOne);
|
|
716
|
+
const bitLiteral = this.mkEq(termBits[index], isOne, false);
|
|
717
|
+
context.markLiteralAsRelevant(bitLiteral);
|
|
718
|
+
context.mkThAxiom([bitLiteral]);
|
|
719
|
+
manager.decRef(isOne);
|
|
720
|
+
const zero = manager.mkNumeral(0n);
|
|
721
|
+
manager.incRef(zero);
|
|
722
|
+
const isAbove = this.mkLiteral(
|
|
723
|
+
manager.mkApp(OP_GE, [arg, manager.mkNumeral(divisor)], SORT_BOOL),
|
|
724
|
+
);
|
|
725
|
+
const isNonNegative = this.mkLiteral(manager.mkApp(OP_GE, [arg, zero], SORT_BOOL));
|
|
726
|
+
const isZero = this.mkEq(quotient, zero, false);
|
|
727
|
+
for (const bound of [isAbove, isNonNegative, isZero]) context.markLiteralAsRelevant(bound);
|
|
728
|
+
context.mkThAxiom([isAbove, negate(isNonNegative), isZero]);
|
|
729
|
+
manager.decRef(zero);
|
|
730
|
+
manager.decRef(quotient);
|
|
731
|
+
}
|
|
732
|
+
this.dropAll(termBits);
|
|
733
|
+
}
|
|
734
|
+
|
|
735
|
+
internalizeTerm(term: number) {
|
|
736
|
+
const manager = this.manager;
|
|
737
|
+
const op = manager.getOp(term);
|
|
738
|
+
if (UNINTERPRETED_OPS.has(op)) return false;
|
|
739
|
+
// scoped_suspend_rlimit: the circuits count their steps but are never canceled.
|
|
740
|
+
const limit = manager.limit;
|
|
741
|
+
const wasSuspended = limit.isSuspended;
|
|
742
|
+
limit.isSuspended = true;
|
|
743
|
+
try {
|
|
744
|
+
this.internalizeTermCore(term, op);
|
|
745
|
+
if (DIVREM_OPS.has(op) && !this.context.relevancy.isEnabled)
|
|
746
|
+
this.assertDivremBoundAxiom(term);
|
|
747
|
+
} finally {
|
|
748
|
+
limit.isSuspended = wasSuspended;
|
|
749
|
+
}
|
|
750
|
+
return true;
|
|
751
|
+
}
|
|
752
|
+
|
|
753
|
+
private internalizeTermCore(term: number, op: number) {
|
|
754
|
+
if (op === OP_BV_NUM) this.internalizeNum(term);
|
|
755
|
+
else if (op === OP_BSUB) this.internalizeSub(term);
|
|
756
|
+
else if (op === OP_CONCAT) this.internalizeConcat(term);
|
|
757
|
+
else if (op === OP_EXTRACT) this.internalizeExtract(term);
|
|
758
|
+
else if (op === OP_MKBV) this.internalizeMkbv(term);
|
|
759
|
+
else if (op === OP_INT2BV) this.internalizeInt2bv(term);
|
|
760
|
+
else if (op === OP_UBV2INT) this.internalizeBv2int(term);
|
|
761
|
+
else {
|
|
762
|
+
const acBlast = AC_BLASTS.get(op);
|
|
763
|
+
const blast = acBlast ?? UNARY_BLASTS.get(op) ?? BINARY_BLASTS.get(op);
|
|
764
|
+
if (blast === undefined)
|
|
765
|
+
throw new SmtUnsupportedError(
|
|
766
|
+
`the bit-vector operator ${this.manager.funcDecls[this.manager.decls[term]].name}`,
|
|
767
|
+
);
|
|
768
|
+
this.internalizeBlast(term, blast, acBlast !== undefined);
|
|
769
|
+
}
|
|
770
|
+
}
|
|
771
|
+
|
|
772
|
+
internalizeAtom(atom: number) {
|
|
773
|
+
const op = this.manager.getOp(atom);
|
|
774
|
+
if (op === OP_BIT2BOOL) this.mkBit2Bool(atom);
|
|
775
|
+
else if (op === OP_ULEQ || op === OP_SLEQ) this.internalizeLe(atom, op === OP_SLEQ);
|
|
776
|
+
else if (op === OP_BUMUL_NO_OVFL || op === OP_BSMUL_NO_OVFL || op === OP_BSMUL_NO_UDFL)
|
|
777
|
+
this.internalizeNoOverflow(atom, op);
|
|
778
|
+
else
|
|
779
|
+
throw new SmtUnsupportedError(
|
|
780
|
+
`the bit-vector predicate ${this.manager.funcDecls[this.manager.decls[atom]].name}`,
|
|
781
|
+
);
|
|
782
|
+
return true;
|
|
783
|
+
}
|
|
784
|
+
|
|
785
|
+
private getAppArgBits(term: number, index: number) {
|
|
786
|
+
return this.getBits(this.getVar(this.getInternalizedEnode(this.manager.getArg(term, index))));
|
|
787
|
+
}
|
|
788
|
+
|
|
789
|
+
private mkDefinedAtom(atom: number, circuit: number) {
|
|
790
|
+
const context = this.context;
|
|
791
|
+
this.manager.incRef(circuit);
|
|
792
|
+
context.internalize(circuit, true);
|
|
793
|
+
const def = context.getLiteral(circuit);
|
|
794
|
+
const literal = mkLiteral(context.mkBoolVar(atom));
|
|
795
|
+
context.setVarTheory(getVar(literal), this.id);
|
|
796
|
+
this.insertAtom(getVar(literal), { isBit: false, literal, def });
|
|
797
|
+
context.mkThAxiom([literal, negate(def)]);
|
|
798
|
+
context.mkThAxiom([negate(literal), def]);
|
|
799
|
+
this.manager.decRef(circuit);
|
|
800
|
+
}
|
|
801
|
+
|
|
802
|
+
private internalizeNoOverflow(atom: number, op: number) {
|
|
803
|
+
this.processArgs(atom);
|
|
804
|
+
const first = this.getAppArgBits(atom, 0);
|
|
805
|
+
const second = this.getAppArgBits(atom, 1);
|
|
806
|
+
const blaster = this.blaster;
|
|
807
|
+
const circuit =
|
|
808
|
+
op === OP_BUMUL_NO_OVFL
|
|
809
|
+
? blaster.mkUmulNoOverflow(first, second)
|
|
810
|
+
: op === OP_BSMUL_NO_OVFL
|
|
811
|
+
? blaster.mkSmulNoOverflow(first, second)
|
|
812
|
+
: blaster.mkSmulNoUnderflow(first, second);
|
|
813
|
+
this.mkDefinedAtom(atom, circuit);
|
|
814
|
+
this.manager.decRef(circuit);
|
|
815
|
+
this.dropAll(second);
|
|
816
|
+
this.dropAll(first);
|
|
817
|
+
}
|
|
818
|
+
|
|
819
|
+
private internalizeLe(atom: number, isSigned: boolean) {
|
|
820
|
+
this.processArgs(atom);
|
|
821
|
+
const first = this.getAppArgBits(atom, 0);
|
|
822
|
+
const second = this.getAppArgBits(atom, 1);
|
|
823
|
+
if (!this.context.isBInternalized(atom)) {
|
|
824
|
+
const circuit = isSigned
|
|
825
|
+
? this.blaster.mkSle(first, second)
|
|
826
|
+
: this.blaster.mkUle(first, second);
|
|
827
|
+
this.mkDefinedAtom(atom, circuit);
|
|
828
|
+
this.manager.decRef(circuit);
|
|
829
|
+
}
|
|
830
|
+
this.dropAll(second);
|
|
831
|
+
this.dropAll(first);
|
|
832
|
+
}
|
|
833
|
+
|
|
834
|
+
applySortCnstr(node: Enode) {
|
|
835
|
+
if (this.isAttachedToVar(node)) return;
|
|
836
|
+
this.mkBits(this.mkVar(node));
|
|
837
|
+
if (this.context.isRelevant(node.owner)) this.relevantEh(node.owner);
|
|
838
|
+
}
|
|
839
|
+
|
|
840
|
+
newEqEh(first: number, second: number) {
|
|
841
|
+
this.unionFind.merge(first, second);
|
|
842
|
+
}
|
|
843
|
+
|
|
844
|
+
newDiseqEh(first: number, second: number) {
|
|
845
|
+
const manager = this.manager;
|
|
846
|
+
if (manager.isBvSort(manager.sorts[this.getExpr(first)])) this.expandDiseq(first, second);
|
|
847
|
+
}
|
|
848
|
+
|
|
849
|
+
private expandDiseq(inputFirst: number, inputSecond: number) {
|
|
850
|
+
const context = this.context;
|
|
851
|
+
const manager = this.manager;
|
|
852
|
+
const first = Math.min(inputFirst, inputSecond);
|
|
853
|
+
const second = Math.max(inputFirst, inputSecond);
|
|
854
|
+
const firstBits = this.bits[first];
|
|
855
|
+
const secondBits = this.bits[second];
|
|
856
|
+
for (let index = 0; index < firstBits.length; index++) {
|
|
857
|
+
if (firstBits[index] === negate(secondBits[index])) return;
|
|
858
|
+
const firstValue = context.getAssignment(firstBits[index]);
|
|
859
|
+
const secondValue = context.getAssignment(secondBits[index]);
|
|
860
|
+
if (firstValue !== L_UNDEF && secondValue !== L_UNDEF && firstValue !== secondValue) return;
|
|
861
|
+
}
|
|
862
|
+
const literals = [this.mkEq(this.getExpr(first), this.getExpr(second), true)];
|
|
863
|
+
for (let index = 0; index < firstBits.length; index++) {
|
|
864
|
+
const firstExpr = this.literalToExpr(firstBits[index]);
|
|
865
|
+
const secondExpr = this.literalToExpr(secondBits[index]);
|
|
866
|
+
const difference = this.blaster.mkXor(firstExpr, secondExpr);
|
|
867
|
+
context.internalize(difference, true);
|
|
868
|
+
literals.push(context.getLiteral(difference));
|
|
869
|
+
manager.decRef(difference);
|
|
870
|
+
manager.decRef(secondExpr);
|
|
871
|
+
manager.decRef(firstExpr);
|
|
872
|
+
}
|
|
873
|
+
context.mkThAxiom(literals);
|
|
874
|
+
}
|
|
875
|
+
|
|
876
|
+
assignEh(boolVar: BoolVar) {
|
|
877
|
+
const atom = this.atoms[boolVar];
|
|
878
|
+
if (atom === undefined || !atom.isBit) return;
|
|
879
|
+
const queue = this.propQueue;
|
|
880
|
+
queue.length = 0;
|
|
881
|
+
for (let occ = atom.occs; occ !== null; occ = occ.next) queue.push(occ.thVar, occ.index);
|
|
882
|
+
this.propagateBits();
|
|
883
|
+
}
|
|
884
|
+
|
|
885
|
+
private propagateBits() {
|
|
886
|
+
const context = this.context;
|
|
887
|
+
const unionFind = this.unionFind;
|
|
888
|
+
const queue = this.propQueue;
|
|
889
|
+
for (let entry = 0; entry < queue.length; entry += 2) {
|
|
890
|
+
const thVar = queue[entry];
|
|
891
|
+
const index = queue[entry + 1];
|
|
892
|
+
if (this.wpos[thVar] === index) this.findWpos(thVar);
|
|
893
|
+
const bit = this.bits[thVar][index];
|
|
894
|
+
const value = context.getAssignment(bit);
|
|
895
|
+
if (value === L_UNDEF) continue;
|
|
896
|
+
const antecedent = value === L_FALSE ? negate(bit) : bit;
|
|
897
|
+
for (let other = unionFind.next(thVar); other !== thVar; other = unionFind.next(other)) {
|
|
898
|
+
const otherBit = this.bits[other][index];
|
|
899
|
+
if (bit === negate(otherBit)) {
|
|
900
|
+
this.addNewDiseqAxiom(thVar, other, index);
|
|
901
|
+
return;
|
|
902
|
+
}
|
|
903
|
+
if (value === context.getAssignment(otherBit)) continue;
|
|
904
|
+
this.assignBit(
|
|
905
|
+
value === L_FALSE ? negate(otherBit) : otherBit,
|
|
906
|
+
thVar,
|
|
907
|
+
other,
|
|
908
|
+
index,
|
|
909
|
+
antecedent,
|
|
910
|
+
false,
|
|
911
|
+
);
|
|
912
|
+
if (context.isInconsistent()) {
|
|
913
|
+
queue.length = 0;
|
|
914
|
+
return;
|
|
915
|
+
}
|
|
916
|
+
}
|
|
917
|
+
}
|
|
918
|
+
queue.length = 0;
|
|
919
|
+
}
|
|
920
|
+
|
|
921
|
+
private assignBit(
|
|
922
|
+
consequent: Literal,
|
|
923
|
+
first: number,
|
|
924
|
+
second: number,
|
|
925
|
+
index: number,
|
|
926
|
+
antecedent: Literal,
|
|
927
|
+
isPropagatingClass: boolean,
|
|
928
|
+
) {
|
|
929
|
+
const context = this.context;
|
|
930
|
+
const justification = new BitEqJustification(
|
|
931
|
+
this.id,
|
|
932
|
+
this.getEnode(first),
|
|
933
|
+
this.getEnode(second),
|
|
934
|
+
antecedent,
|
|
935
|
+
);
|
|
936
|
+
if (consequent === FALSE_LITERAL) {
|
|
937
|
+
context.setConflict(justification, null);
|
|
938
|
+
return;
|
|
939
|
+
}
|
|
940
|
+
context.assign(consequent, justification);
|
|
941
|
+
const eq = this.mkEq(this.getExpr(first), this.getExpr(second), false);
|
|
942
|
+
const literals = [negate(consequent), antecedent, negate(eq)];
|
|
943
|
+
for (const literal of literals) context.markLiteralAsRelevant(literal);
|
|
944
|
+
context.mkThAxiom(literals);
|
|
945
|
+
if (this.wpos[second] === index) this.findWpos(second);
|
|
946
|
+
const atom = this.atoms[getVar(consequent)];
|
|
947
|
+
if (atom === undefined || !atom.isBit) return;
|
|
948
|
+
const root = this.unionFind.find(second);
|
|
949
|
+
for (let occ = atom.occs; occ !== null; occ = occ.next)
|
|
950
|
+
if (isPropagatingClass || this.unionFind.find(occ.thVar) !== root || occ.index !== index)
|
|
951
|
+
this.propQueue.push(occ.thVar, occ.index);
|
|
952
|
+
}
|
|
953
|
+
|
|
954
|
+
relevantEh(expr: number) {
|
|
955
|
+
const context = this.context;
|
|
956
|
+
const manager = this.manager;
|
|
957
|
+
if (context.relevancy.isEnabled && DIVREM_OPS.has(manager.getOp(expr))) {
|
|
958
|
+
context.markAsRelevant(manager.getArg(expr, 0));
|
|
959
|
+
context.markAsRelevant(manager.getArg(expr, 1));
|
|
960
|
+
this.assertDivremBoundAxiom(expr);
|
|
961
|
+
}
|
|
962
|
+
if (manager.isBool(expr)) {
|
|
963
|
+
if (!context.isBInternalized(expr)) return;
|
|
964
|
+
const atom = this.atoms[context.getBoolVar(expr)];
|
|
965
|
+
if (atom !== undefined && !atom.isBit) context.markLiteralAsRelevant(atom.def);
|
|
966
|
+
return;
|
|
967
|
+
}
|
|
968
|
+
const op = manager.getOp(expr);
|
|
969
|
+
if (op === OP_UBV2INT || op === OP_INT2BV) {
|
|
970
|
+
context.markAsRelevant(manager.getArg(expr, 0));
|
|
971
|
+
if (op === OP_UBV2INT) this.assertBv2intAxiom(expr);
|
|
972
|
+
else this.assertInt2bvAxiom(expr);
|
|
973
|
+
return;
|
|
974
|
+
}
|
|
975
|
+
if (!context.isEInternalized(expr)) return;
|
|
976
|
+
const thVar = this.getInternalizedEnode(expr).getThVar(this.id);
|
|
977
|
+
if (thVar < 0) return;
|
|
978
|
+
for (const bit of this.bits[thVar]) context.markLiteralAsRelevant(bit);
|
|
979
|
+
}
|
|
980
|
+
|
|
981
|
+
pushScopeEh() {
|
|
982
|
+
super.pushScopeEh();
|
|
983
|
+
this.trailLimits.push(this.trail.length);
|
|
984
|
+
}
|
|
985
|
+
|
|
986
|
+
popScopeEh(numScopes: number) {
|
|
987
|
+
const newLevel = this.trailLimits.length - numScopes;
|
|
988
|
+
const limit = this.trailLimits[newLevel];
|
|
989
|
+
for (let index = this.trail.length - 1; index >= limit; index--) this.trail[index]();
|
|
990
|
+
this.trail.length = limit;
|
|
991
|
+
this.trailLimits.length = newLevel;
|
|
992
|
+
const numOldVars = this.getOldNumVars(numScopes);
|
|
993
|
+
this.bits.length = numOldVars;
|
|
994
|
+
this.wpos.length = numOldVars;
|
|
995
|
+
this.zeroOneBits.length = numOldVars;
|
|
996
|
+
super.popScopeEh(numScopes);
|
|
997
|
+
}
|
|
998
|
+
|
|
999
|
+
includeFuncInterp(decl: number) {
|
|
1000
|
+
return DIV0_OPS.has(this.manager.funcDecls[decl].op);
|
|
1001
|
+
}
|
|
1002
|
+
|
|
1003
|
+
private mergeEh(firstRoot: number, secondRoot: number, first: number, second: number) {
|
|
1004
|
+
if (!this.mergeZeroOneBits(firstRoot, secondRoot)) return;
|
|
1005
|
+
const context = this.context;
|
|
1006
|
+
this.propQueue.length = 0;
|
|
1007
|
+
const size = this.bits[first].length;
|
|
1008
|
+
if (size === 0 && this.bv2ints.length > 0) this.propagateBv2int(firstRoot);
|
|
1009
|
+
let isChanged = true;
|
|
1010
|
+
while (isChanged) {
|
|
1011
|
+
isChanged = false;
|
|
1012
|
+
for (let index = 0; index < size; index++) {
|
|
1013
|
+
const firstBit = this.bits[first][index];
|
|
1014
|
+
const secondBit = this.bits[second][index];
|
|
1015
|
+
if (firstBit === negate(secondBit)) {
|
|
1016
|
+
this.addNewDiseqAxiom(first, second, index);
|
|
1017
|
+
return;
|
|
1018
|
+
}
|
|
1019
|
+
const firstValue = context.getAssignment(firstBit);
|
|
1020
|
+
const secondValue = context.getAssignment(secondBit);
|
|
1021
|
+
if (firstValue === L_UNDEF && !context.isRelevant(context.boolVar2Expr[getVar(firstBit)]))
|
|
1022
|
+
context.markLiteralAsRelevant(firstBit);
|
|
1023
|
+
if (secondValue === L_UNDEF && !context.isRelevant(context.boolVar2Expr[getVar(secondBit)]))
|
|
1024
|
+
context.markLiteralAsRelevant(secondBit);
|
|
1025
|
+
if (firstValue === secondValue) continue;
|
|
1026
|
+
isChanged = true;
|
|
1027
|
+
if (firstValue !== L_UNDEF && secondBit !== FALSE_LITERAL && secondBit !== TRUE_LITERAL)
|
|
1028
|
+
this.assignBit(
|
|
1029
|
+
firstValue === L_FALSE ? negate(secondBit) : secondBit,
|
|
1030
|
+
first,
|
|
1031
|
+
second,
|
|
1032
|
+
index,
|
|
1033
|
+
firstValue === L_FALSE ? negate(firstBit) : firstBit,
|
|
1034
|
+
true,
|
|
1035
|
+
);
|
|
1036
|
+
else if (secondValue !== L_UNDEF)
|
|
1037
|
+
this.assignBit(
|
|
1038
|
+
secondValue === L_FALSE ? negate(firstBit) : firstBit,
|
|
1039
|
+
second,
|
|
1040
|
+
first,
|
|
1041
|
+
index,
|
|
1042
|
+
secondValue === L_FALSE ? negate(secondBit) : secondBit,
|
|
1043
|
+
true,
|
|
1044
|
+
);
|
|
1045
|
+
if (context.isInconsistent()) return;
|
|
1046
|
+
}
|
|
1047
|
+
}
|
|
1048
|
+
this.propagateBits();
|
|
1049
|
+
}
|
|
1050
|
+
|
|
1051
|
+
// int2bv(bv2int(x)) = x when the int2bv has the sort of x.
|
|
1052
|
+
private propagateBv2int(rootVar: number) {
|
|
1053
|
+
const manager = this.manager;
|
|
1054
|
+
const node = this.getEnode(rootVar);
|
|
1055
|
+
const propagate = (bv2int: Enode) => {
|
|
1056
|
+
const word = bv2int.getArg(0);
|
|
1057
|
+
for (const parent of node.root.parents) {
|
|
1058
|
+
if (
|
|
1059
|
+
manager.getOp(parent.owner) !== OP_INT2BV ||
|
|
1060
|
+
parent.root === word.root ||
|
|
1061
|
+
manager.sorts[parent.owner] !== manager.sorts[word.owner]
|
|
1062
|
+
)
|
|
1063
|
+
continue;
|
|
1064
|
+
const justification = new TheoryJustification(
|
|
1065
|
+
this.id,
|
|
1066
|
+
[],
|
|
1067
|
+
[node, parent.getArg(0), node, bv2int],
|
|
1068
|
+
);
|
|
1069
|
+
this.context.pushEq(parent, word, { kind: "justification", justification });
|
|
1070
|
+
return;
|
|
1071
|
+
}
|
|
1072
|
+
};
|
|
1073
|
+
if (this.bv2ints.length < node.classSize) {
|
|
1074
|
+
for (const bv2int of this.bv2ints) if (bv2int.root === node.root) propagate(bv2int);
|
|
1075
|
+
return;
|
|
1076
|
+
}
|
|
1077
|
+
let member = node;
|
|
1078
|
+
do {
|
|
1079
|
+
if (manager.getOp(member.owner) === OP_UBV2INT) propagate(member);
|
|
1080
|
+
member = member.next;
|
|
1081
|
+
} while (member !== node);
|
|
1082
|
+
}
|
|
1083
|
+
|
|
1084
|
+
private mergeZeroOneBits(firstRoot: number, secondRoot: number) {
|
|
1085
|
+
const secondBits = this.zeroOneBits[secondRoot];
|
|
1086
|
+
if (secondBits.length === 0) return true;
|
|
1087
|
+
const firstBits = this.zeroOneBits[firstRoot];
|
|
1088
|
+
const aux = this.mergeAux;
|
|
1089
|
+
const resetAux = () => {
|
|
1090
|
+
for (const bit of firstBits) aux[bit.isTrue ? 1 : 0][bit.index] = -1;
|
|
1091
|
+
};
|
|
1092
|
+
for (const bit of firstBits) aux[bit.isTrue ? 1 : 0][bit.index] = bit.owner;
|
|
1093
|
+
for (const bit of secondBits) {
|
|
1094
|
+
const conflicting = aux[bit.isTrue ? 0 : 1][bit.index] ?? -1;
|
|
1095
|
+
if (conflicting !== -1) {
|
|
1096
|
+
this.addNewDiseqAxiom(conflicting, bit.owner, bit.index);
|
|
1097
|
+
resetAux();
|
|
1098
|
+
return false;
|
|
1099
|
+
}
|
|
1100
|
+
if ((aux[bit.isTrue ? 1 : 0][bit.index] ?? -1) === -1) firstBits.push(bit);
|
|
1101
|
+
}
|
|
1102
|
+
resetAux();
|
|
1103
|
+
return true;
|
|
1104
|
+
}
|
|
1105
|
+
|
|
1106
|
+
private unmergeEh(root: number) {
|
|
1107
|
+
const bits = this.zeroOneBits[root];
|
|
1108
|
+
for (let index = bits.length - 1; index >= 0; index--)
|
|
1109
|
+
if (this.unionFind.find(bits[index].owner) === root) {
|
|
1110
|
+
bits.length = index + 1;
|
|
1111
|
+
return;
|
|
1112
|
+
}
|
|
1113
|
+
bits.length = 0;
|
|
1114
|
+
}
|
|
1115
|
+
|
|
1116
|
+
canPropagate() {
|
|
1117
|
+
return this.propDiseqsHead < this.propDiseqs.length;
|
|
1118
|
+
}
|
|
1119
|
+
|
|
1120
|
+
propagate() {
|
|
1121
|
+
if (!this.canPropagate()) return;
|
|
1122
|
+
const context = this.context;
|
|
1123
|
+
const head = this.propDiseqsHead;
|
|
1124
|
+
context.pushTrail(() => {
|
|
1125
|
+
this.propDiseqsHead = head;
|
|
1126
|
+
});
|
|
1127
|
+
for (
|
|
1128
|
+
;
|
|
1129
|
+
this.propDiseqsHead < this.propDiseqs.length && !context.isInconsistent();
|
|
1130
|
+
this.propDiseqsHead++
|
|
1131
|
+
) {
|
|
1132
|
+
const diseq = this.propDiseqs[this.propDiseqsHead];
|
|
1133
|
+
this.assertNewDiseqAxiom(diseq.first, diseq.second);
|
|
1134
|
+
}
|
|
1135
|
+
}
|
|
1136
|
+
|
|
1137
|
+
private mkLiteral(expr: number) {
|
|
1138
|
+
const context = this.context;
|
|
1139
|
+
const manager = this.manager;
|
|
1140
|
+
manager.incRef(expr);
|
|
1141
|
+
const isNot = manager.isNot(expr);
|
|
1142
|
+
const atom = isNot ? manager.getArg(expr, 0) : expr;
|
|
1143
|
+
if (!context.isEInternalized(atom)) context.internalize(atom, false);
|
|
1144
|
+
const literal = context.getLiteral(atom);
|
|
1145
|
+
context.markLiteralAsRelevant(literal);
|
|
1146
|
+
manager.decRef(expr);
|
|
1147
|
+
return isNot ? negate(literal) : literal;
|
|
1148
|
+
}
|
|
1149
|
+
|
|
1150
|
+
private mkEq(first: number, second: number, isGateContext: boolean) {
|
|
1151
|
+
const context = this.context;
|
|
1152
|
+
const manager = this.manager;
|
|
1153
|
+
if (first === second) return TRUE_LITERAL;
|
|
1154
|
+
if (manager.areDistinct(first, second)) return FALSE_LITERAL;
|
|
1155
|
+
const eq = context.mkEqAtom(first, second);
|
|
1156
|
+
manager.incRef(eq);
|
|
1157
|
+
context.internalize(eq, isGateContext);
|
|
1158
|
+
const literal = context.getLiteral(eq);
|
|
1159
|
+
manager.decRef(eq);
|
|
1160
|
+
return literal;
|
|
1161
|
+
}
|
|
1162
|
+
|
|
1163
|
+
private assertDivremBoundAxiom(term: number) {
|
|
1164
|
+
const manager = this.manager;
|
|
1165
|
+
const op = manager.getOp(term);
|
|
1166
|
+
const dividend = manager.getArg(term, 0);
|
|
1167
|
+
const divisor = manager.getArg(term, 1);
|
|
1168
|
+
if (manager.isBvNumeral(divisor)) return;
|
|
1169
|
+
const sort = manager.sorts[term];
|
|
1170
|
+
const mkZero = () => manager.mkBvNumeral(0n, manager.getBvSize(sort));
|
|
1171
|
+
const mkAbs = (arg: number) => {
|
|
1172
|
+
const isNonNegative = mkBvApp(manager, OP_SLEQ, [mkZero(), arg]);
|
|
1173
|
+
manager.incRef(isNonNegative);
|
|
1174
|
+
const negation = mkBvApp(manager, OP_BNEG, [arg]);
|
|
1175
|
+
manager.incRef(negation);
|
|
1176
|
+
const result = manager.mkApp(OP_ITE, [isNonNegative, arg, negation], sort);
|
|
1177
|
+
manager.decRef(negation);
|
|
1178
|
+
manager.decRef(isNonNegative);
|
|
1179
|
+
return result;
|
|
1180
|
+
};
|
|
1181
|
+
const bound =
|
|
1182
|
+
op === OP_BUREM || op === OP_BUREM_I
|
|
1183
|
+
? manager.mkNot(mkBvApp(manager, OP_ULEQ, [divisor, term]))
|
|
1184
|
+
: op === OP_BUDIV_I
|
|
1185
|
+
? mkBvApp(manager, OP_ULEQ, [term, dividend])
|
|
1186
|
+
: op === OP_BSDIV_I
|
|
1187
|
+
? mkBvApp(manager, OP_ULEQ, [mkAbs(term), mkAbs(dividend)])
|
|
1188
|
+
: manager.mkNot(mkBvApp(manager, OP_ULEQ, [mkAbs(divisor), mkAbs(term)]));
|
|
1189
|
+
const clause = [manager.mkEq(divisor, mkZero()), bound];
|
|
1190
|
+
for (const expr of clause) manager.incRef(expr);
|
|
1191
|
+
const literals = clause.map((expr) => this.mkLiteral(expr));
|
|
1192
|
+
this.context.mkThAxiom(literals);
|
|
1193
|
+
this.dropAll(clause);
|
|
1194
|
+
}
|
|
1195
|
+
|
|
1196
|
+
mkValue(node: Enode) {
|
|
1197
|
+
const thVar = this.getThVar(node);
|
|
1198
|
+
return this.manager.mkBvNumeral(this.getFixedValue(thVar).value, this.getBvSize(thVar));
|
|
1199
|
+
}
|
|
1200
|
+
}
|