tla-ts 0.0.10-dev.b4a856304 → 0.0.10-dev.c92e6a4ea
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 +37 -0
- package/dist/index.d.ts +37 -0
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove.cjs +2683 -427
- package/dist/prove.js +2681 -425
- package/dist/run.cjs +45 -44
- package/dist/run.js +45 -44
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +44 -41
- package/dist/transfer.js +45 -42
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +41 -41
- package/src/bags.ts +2 -5
- package/src/builtins.ts +5 -21
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +268 -0
- package/src/check.ts +578 -757
- package/src/cli/options.ts +6 -31
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +27 -62
- package/src/cli/shared.ts +1 -5
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +246 -240
- package/src/cli/tlc-output.ts +686 -0
- package/src/cli/tlc-usage.ts +3 -5
- package/src/cli/tlc.ts +59 -707
- package/src/cli/xml-exporter.ts +23 -33
- package/src/codegen.ts +5 -10
- package/src/coverage.ts +3 -10
- package/src/dependencies.ts +30 -14
- package/src/dfid.ts +16 -16
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +73 -338
- package/src/errors.ts +33 -5
- package/src/evaluate.ts +34 -107
- package/src/exit-codes.ts +3 -0
- package/src/fingerprints.ts +65 -1
- package/src/instances.ts +47 -10
- package/src/java-hash.ts +7 -0
- package/src/java-overrides.ts +4 -9
- package/src/json-reader.ts +1 -2
- package/src/json.ts +8 -18
- package/src/levels.ts +46 -57
- package/src/lexer.ts +76 -85
- package/src/liveness-checker.ts +634 -306
- package/src/liveness.ts +104 -120
- 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 +17 -31
- package/src/parallel.ts +55 -80
- package/src/parser.ts +722 -385
- package/src/pcal/ast.ts +53 -65
- package/src/pcal/parse.ts +144 -191
- package/src/pcal/tokenize.ts +91 -115
- package/src/pcal/translate.ts +83 -98
- package/src/pcal/validate.ts +48 -50
- package/src/pretty-print.ts +7 -7
- 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 +908 -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 +7 -2
- package/src/prover/smt/solver/lp/core-solver.ts +18 -3
- package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
- package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
- package/src/prover/smt/solver/lp/dependency.ts +0 -2
- package/src/prover/smt/solver/lp/dioph-eq.ts +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 +3 -3
- package/src/prover/smt/solver/lp/nex.ts +2 -2
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
- package/src/prover/smt/solver/lp/nla-core.ts +67 -16
- 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 +165 -83
- 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 +122 -64
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
- package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
- package/src/prover/smt/solver/lp/pdd.ts +725 -289
- 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 +236 -45
- 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 +38 -2
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +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 +1298 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +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 +94 -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 +24 -2
- package/src/prover/zenon/expr.ts +28 -2
- package/src/prover/zenon/index-table.ts +11 -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 +2 -3
- 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/randomization.ts +1 -4
- package/src/resolve.ts +67 -143
- package/src/runtime.ts +17 -18
- package/src/sany/builtins.ts +1 -3
- 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 +160 -2683
- package/src/sany/levels.ts +5 -11
- package/src/sany/lexer.ts +57 -60
- package/src/sany/linter.ts +0 -3
- package/src/sany/nodes.ts +6 -13
- package/src/sany/report.ts +3 -6
- package/src/sany/selectors.ts +35 -38
- package/src/sany/xml.ts +23 -55
- package/src/search.ts +244 -53
- package/src/simulate.ts +202 -184
- package/src/spec-description.ts +56 -82
- package/src/standard-definitions.ts +4 -3
- package/src/standard-modules.ts +17 -44
- package/src/state-graph.ts +3 -17
- package/src/subexpressions.ts +38 -47
- package/src/substitution-levels.ts +5 -4
- package/src/successors.ts +20 -43
- package/src/symmetry.ts +6 -21
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +96 -30
- package/src/tlc/jar-data.ts +0 -1
- package/src/tlc/messages.ts +22 -36
- package/src/tlc/order.ts +36 -50
- package/src/tlc/random.ts +22 -34
- package/src/tlc/replay.ts +21 -48
- package/src/tlc/summary.ts +64 -58
- package/src/tlc/tlc-operators.ts +6 -17
- package/src/tlc/tlcext-operators.ts +70 -29
- package/src/tlc/trace-spec.ts +26 -51
- package/src/tlc/value-stream.ts +9 -13
- package/src/tlc/version.ts +0 -1
- 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 +136 -338
- 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,348 @@
|
|
|
1
|
+
import { SmtUnsupportedError } from "../../../errors";
|
|
2
|
+
import {
|
|
3
|
+
type AstManager,
|
|
4
|
+
FAMILY_FPA,
|
|
5
|
+
FAMILY_BASIC,
|
|
6
|
+
FAMILY_USER,
|
|
7
|
+
KIND_QUANTIFIER,
|
|
8
|
+
KIND_VAR,
|
|
9
|
+
OP_DISTINCT,
|
|
10
|
+
OP_EQ,
|
|
11
|
+
OP_FPA_ABS,
|
|
12
|
+
OP_FPA_ADD,
|
|
13
|
+
OP_FPA_DIV,
|
|
14
|
+
OP_FPA_EQ,
|
|
15
|
+
OP_FPA_FMA,
|
|
16
|
+
OP_FPA_FP,
|
|
17
|
+
OP_FPA_GE,
|
|
18
|
+
OP_FPA_GT,
|
|
19
|
+
OP_FPA_IS_INF,
|
|
20
|
+
OP_FPA_IS_NAN,
|
|
21
|
+
OP_FPA_IS_NEGATIVE,
|
|
22
|
+
OP_FPA_IS_NORMAL,
|
|
23
|
+
OP_FPA_IS_POSITIVE,
|
|
24
|
+
OP_FPA_IS_SUBNORMAL,
|
|
25
|
+
OP_FPA_IS_ZERO,
|
|
26
|
+
OP_FPA_LE,
|
|
27
|
+
OP_FPA_LT,
|
|
28
|
+
OP_FPA_MAX,
|
|
29
|
+
OP_FPA_MAX_I,
|
|
30
|
+
OP_FPA_MIN,
|
|
31
|
+
OP_FPA_MIN_I,
|
|
32
|
+
OP_FPA_MINUS_INF,
|
|
33
|
+
OP_FPA_MINUS_ZERO,
|
|
34
|
+
OP_FPA_MUL,
|
|
35
|
+
OP_FPA_NAN,
|
|
36
|
+
OP_FPA_NEG,
|
|
37
|
+
OP_FPA_NUM,
|
|
38
|
+
OP_FPA_PLUS_INF,
|
|
39
|
+
OP_FPA_PLUS_ZERO,
|
|
40
|
+
OP_FPA_REM,
|
|
41
|
+
OP_FPA_RM_NEAREST_TIES_TO_AWAY,
|
|
42
|
+
OP_FPA_RM_NEAREST_TIES_TO_EVEN,
|
|
43
|
+
OP_FPA_RM_TOWARD_NEGATIVE,
|
|
44
|
+
OP_FPA_RM_TOWARD_POSITIVE,
|
|
45
|
+
OP_FPA_RM_TOWARD_ZERO,
|
|
46
|
+
OP_FPA_ROUND_TO_INTEGRAL,
|
|
47
|
+
OP_FPA_SQRT,
|
|
48
|
+
OP_FPA_SUB,
|
|
49
|
+
OP_FPA_TO_FP,
|
|
50
|
+
OP_FPA_TO_FP_UNSIGNED,
|
|
51
|
+
OP_FPA_TO_IEEE_BV,
|
|
52
|
+
OP_FPA_TO_IEEE_BV_I,
|
|
53
|
+
OP_FPA_TO_REAL,
|
|
54
|
+
OP_FPA_TO_REAL_I,
|
|
55
|
+
OP_FPA_TO_SBV,
|
|
56
|
+
OP_FPA_TO_SBV_I,
|
|
57
|
+
OP_FPA_TO_UBV,
|
|
58
|
+
OP_FPA_TO_UBV_I,
|
|
59
|
+
OP_EXTRACT,
|
|
60
|
+
OP_ITE,
|
|
61
|
+
getSymbolName,
|
|
62
|
+
} from "./ast";
|
|
63
|
+
import { mkBvApp } from "./bv-decl-plugin";
|
|
64
|
+
import {
|
|
65
|
+
BV_RM_TIES_TO_AWAY,
|
|
66
|
+
BV_RM_TIES_TO_EVEN,
|
|
67
|
+
BV_RM_TO_NEGATIVE,
|
|
68
|
+
BV_RM_TO_POSITIVE,
|
|
69
|
+
BV_RM_TO_ZERO,
|
|
70
|
+
getFpaSignature,
|
|
71
|
+
} from "./fpa-decl-plugin";
|
|
72
|
+
import type { Fpa2BvConverter } from "./fpa2bv-converter";
|
|
73
|
+
import type { Rewriter } from "./rewriter";
|
|
74
|
+
import { RewriterTpl } from "./rewriter-tpl";
|
|
75
|
+
|
|
76
|
+
const RM_VALUES = new Map([
|
|
77
|
+
[OP_FPA_RM_NEAREST_TIES_TO_EVEN, BV_RM_TIES_TO_EVEN],
|
|
78
|
+
[OP_FPA_RM_NEAREST_TIES_TO_AWAY, BV_RM_TIES_TO_AWAY],
|
|
79
|
+
[OP_FPA_RM_TOWARD_POSITIVE, BV_RM_TO_POSITIVE],
|
|
80
|
+
[OP_FPA_RM_TOWARD_NEGATIVE, BV_RM_TO_NEGATIVE],
|
|
81
|
+
[OP_FPA_RM_TOWARD_ZERO, BV_RM_TO_ZERO],
|
|
82
|
+
]);
|
|
83
|
+
|
|
84
|
+
export class Fpa2BvRewriter extends RewriterTpl {
|
|
85
|
+
private numBindings = 0;
|
|
86
|
+
|
|
87
|
+
constructor(
|
|
88
|
+
manager: AstManager,
|
|
89
|
+
readonly converter: Fpa2BvConverter,
|
|
90
|
+
) {
|
|
91
|
+
super(manager);
|
|
92
|
+
}
|
|
93
|
+
|
|
94
|
+
private isFloat(sort: number) {
|
|
95
|
+
return this.manager.isFpSort(sort) || this.manager.isRmSort(sort);
|
|
96
|
+
}
|
|
97
|
+
|
|
98
|
+
preVisit(expr: number) {
|
|
99
|
+
if (this.manager.kinds[expr] === KIND_QUANTIFIER)
|
|
100
|
+
this.numBindings += this.manager.getQuantifier(expr).sorts.length;
|
|
101
|
+
return true;
|
|
102
|
+
}
|
|
103
|
+
|
|
104
|
+
reduceQuantifier(expr: number, body: number, patterns: number[]) {
|
|
105
|
+
const manager = this.manager;
|
|
106
|
+
const data = manager.getQuantifier(expr);
|
|
107
|
+
this.numBindings -= data.sorts.length;
|
|
108
|
+
const result = manager.mkQuantifier({
|
|
109
|
+
...data,
|
|
110
|
+
sorts: data.sorts.map((sort) =>
|
|
111
|
+
manager.isFpSort(sort)
|
|
112
|
+
? manager.mkBvSort(manager.getEbits(sort) + manager.getSbits(sort))
|
|
113
|
+
: manager.isRmSort(sort)
|
|
114
|
+
? manager.mkBvSort(3)
|
|
115
|
+
: sort,
|
|
116
|
+
),
|
|
117
|
+
names: data.names.map((name, index) =>
|
|
118
|
+
this.isFloat(data.sorts[index]) ? `${getSymbolName(name)}.bv` : name,
|
|
119
|
+
),
|
|
120
|
+
body,
|
|
121
|
+
patterns,
|
|
122
|
+
noPatterns: [],
|
|
123
|
+
});
|
|
124
|
+
manager.incRef(result);
|
|
125
|
+
return result;
|
|
126
|
+
}
|
|
127
|
+
|
|
128
|
+
reduceVar(variable: number) {
|
|
129
|
+
const manager = this.manager;
|
|
130
|
+
const index = manager.values[variable];
|
|
131
|
+
const sort = manager.sorts[variable];
|
|
132
|
+
if (index >= this.numBindings || !this.isFloat(sort)) return -1;
|
|
133
|
+
return manager.withTemporaries(() => {
|
|
134
|
+
if (manager.isRmSort(sort))
|
|
135
|
+
return this.converter.mkBv2Rm(manager.mkVar(index, manager.mkBvSort(3)));
|
|
136
|
+
const ebits = manager.getEbits(sort);
|
|
137
|
+
const size = ebits + manager.getSbits(sort);
|
|
138
|
+
const bv = manager.mkVar(index, manager.mkBvSort(size));
|
|
139
|
+
const extract = (high: number, low: number) =>
|
|
140
|
+
mkBvApp(manager, OP_EXTRACT, [bv], [high, low]);
|
|
141
|
+
return this.converter.mkFp(
|
|
142
|
+
extract(size - 1, size - 1),
|
|
143
|
+
extract(ebits - 1, 0),
|
|
144
|
+
extract(size - 2, ebits),
|
|
145
|
+
);
|
|
146
|
+
});
|
|
147
|
+
}
|
|
148
|
+
|
|
149
|
+
reduceApp(decl: number, args: number[], sort: number) {
|
|
150
|
+
const manager = this.manager;
|
|
151
|
+
const info = manager.funcDecls[decl];
|
|
152
|
+
if (args.some((arg) => manager.kinds[arg] === KIND_VAR && this.isFloat(manager.sorts[arg])))
|
|
153
|
+
throw new SmtUnsupportedError("floating-point quantifiers");
|
|
154
|
+
const isFloatUf =
|
|
155
|
+
info.family !== FAMILY_BASIC &&
|
|
156
|
+
(this.containsFloats(info.range) ||
|
|
157
|
+
info.domain.some((domain) => this.containsFloats(domain)));
|
|
158
|
+
if (info.family !== FAMILY_FPA && !isFloatUf && !this.isFloatBasic(info.op, args)) return -1;
|
|
159
|
+
return manager.withTemporaries(() => this.reduceFloat(decl, args, sort));
|
|
160
|
+
}
|
|
161
|
+
|
|
162
|
+
private containsFloats(sort: number): boolean {
|
|
163
|
+
return (
|
|
164
|
+
this.isFloat(sort) ||
|
|
165
|
+
this.manager.getSortParameters(sort).some((parameter) => this.containsFloats(parameter))
|
|
166
|
+
);
|
|
167
|
+
}
|
|
168
|
+
|
|
169
|
+
private isFloatBasic(op: number, args: number[]) {
|
|
170
|
+
const manager = this.manager;
|
|
171
|
+
if (op === OP_EQ || op === OP_DISTINCT) return this.isFloat(manager.sorts[args[0]]);
|
|
172
|
+
return op === OP_ITE && this.isFloat(manager.sorts[args[1]]);
|
|
173
|
+
}
|
|
174
|
+
|
|
175
|
+
private reduceFloat(decl: number, args: number[], sort: number): number {
|
|
176
|
+
const manager = this.manager;
|
|
177
|
+
const converter = this.converter;
|
|
178
|
+
const info = manager.funcDecls[decl];
|
|
179
|
+
const getRm = () => manager.getArg(args[0], 0);
|
|
180
|
+
if (args.length === 0 && info.family === FAMILY_USER && this.isFloat(sort))
|
|
181
|
+
return manager.isFpSort(sort) ? converter.mkConst(decl) : converter.mkRmConst(decl);
|
|
182
|
+
switch (info.op) {
|
|
183
|
+
case OP_EQ:
|
|
184
|
+
return manager.isFpSort(manager.sorts[args[0]])
|
|
185
|
+
? converter.mkEq(args[0], args[1])
|
|
186
|
+
: manager.mkEq(args[0], args[1]);
|
|
187
|
+
case OP_ITE:
|
|
188
|
+
return converter.mkIte(args[0], args[1], args[2]);
|
|
189
|
+
case OP_DISTINCT:
|
|
190
|
+
return converter.mkDistinct(args);
|
|
191
|
+
}
|
|
192
|
+
if (info.family !== FAMILY_FPA) return converter.mkUf(decl, args);
|
|
193
|
+
const rm = RM_VALUES.get(info.op);
|
|
194
|
+
if (rm !== undefined) return converter.mkRoundingMode(rm);
|
|
195
|
+
switch (info.op) {
|
|
196
|
+
case OP_FPA_NUM:
|
|
197
|
+
return converter.mkNumeralOf(manager.mkApp(decl, args, sort));
|
|
198
|
+
case OP_FPA_PLUS_INF:
|
|
199
|
+
return converter.mkPinf(sort);
|
|
200
|
+
case OP_FPA_MINUS_INF:
|
|
201
|
+
return converter.mkNinf(sort);
|
|
202
|
+
case OP_FPA_PLUS_ZERO:
|
|
203
|
+
return converter.mkPzero(sort);
|
|
204
|
+
case OP_FPA_MINUS_ZERO:
|
|
205
|
+
return converter.mkNzero(sort);
|
|
206
|
+
case OP_FPA_NAN:
|
|
207
|
+
return converter.mkNan(sort);
|
|
208
|
+
case OP_FPA_ADD: {
|
|
209
|
+
const isSwapped = manager.ids[args[2]] < manager.ids[args[1]];
|
|
210
|
+
return converter.mkAdd(
|
|
211
|
+
sort,
|
|
212
|
+
getRm(),
|
|
213
|
+
isSwapped ? args[2] : args[1],
|
|
214
|
+
isSwapped ? args[1] : args[2],
|
|
215
|
+
);
|
|
216
|
+
}
|
|
217
|
+
case OP_FPA_SUB:
|
|
218
|
+
return converter.mkSub(sort, getRm(), args[1], args[2]);
|
|
219
|
+
case OP_FPA_NEG:
|
|
220
|
+
return converter.mkNeg(args[0]);
|
|
221
|
+
case OP_FPA_MUL:
|
|
222
|
+
return converter.mkMul(sort, getRm(), args[1], args[2]);
|
|
223
|
+
case OP_FPA_DIV:
|
|
224
|
+
return converter.mkDiv(sort, getRm(), args[1], args[2]);
|
|
225
|
+
case OP_FPA_REM:
|
|
226
|
+
return converter.mkRem(sort, args[0], args[1]);
|
|
227
|
+
case OP_FPA_ABS:
|
|
228
|
+
return converter.mkAbs(args[0]);
|
|
229
|
+
case OP_FPA_MIN:
|
|
230
|
+
return converter.mkMinMax(decl, args, false);
|
|
231
|
+
case OP_FPA_MAX:
|
|
232
|
+
return converter.mkMinMax(decl, args, true);
|
|
233
|
+
case OP_FPA_MIN_I:
|
|
234
|
+
return converter.mkMinMaxI(OP_FPA_MIN, args);
|
|
235
|
+
case OP_FPA_MAX_I:
|
|
236
|
+
return converter.mkMinMaxI(OP_FPA_MAX, args);
|
|
237
|
+
case OP_FPA_FMA:
|
|
238
|
+
return converter.mkFma(sort, getRm(), args[1], args[2], args[3]);
|
|
239
|
+
case OP_FPA_SQRT:
|
|
240
|
+
return converter.mkSqrt(sort, getRm(), args[1]);
|
|
241
|
+
case OP_FPA_ROUND_TO_INTEGRAL:
|
|
242
|
+
return converter.mkRoundToIntegral(sort, getRm(), args[1]);
|
|
243
|
+
case OP_FPA_EQ:
|
|
244
|
+
return converter.mkFloatEq(args[0], args[1]);
|
|
245
|
+
case OP_FPA_LT:
|
|
246
|
+
return converter.mkFloatLt(args[0], args[1]);
|
|
247
|
+
case OP_FPA_GT:
|
|
248
|
+
return converter.mkFloatGt(args[0], args[1]);
|
|
249
|
+
case OP_FPA_LE:
|
|
250
|
+
return converter.mkFloatLe(args[0], args[1]);
|
|
251
|
+
case OP_FPA_GE:
|
|
252
|
+
return converter.mkFloatGe(args[0], args[1]);
|
|
253
|
+
case OP_FPA_IS_ZERO:
|
|
254
|
+
return converter.mkIsZero(args[0]);
|
|
255
|
+
case OP_FPA_IS_NAN:
|
|
256
|
+
return converter.mkIsNan(args[0]);
|
|
257
|
+
case OP_FPA_IS_INF:
|
|
258
|
+
return converter.mkIsInf(args[0]);
|
|
259
|
+
case OP_FPA_IS_NORMAL:
|
|
260
|
+
return converter.mkIsNormal(args[0]);
|
|
261
|
+
case OP_FPA_IS_SUBNORMAL:
|
|
262
|
+
return converter.mkIsDenormal(args[0]);
|
|
263
|
+
case OP_FPA_IS_POSITIVE:
|
|
264
|
+
return converter.mkIsPositive(args[0]);
|
|
265
|
+
case OP_FPA_IS_NEGATIVE:
|
|
266
|
+
return converter.mkIsNegative(args[0]);
|
|
267
|
+
case OP_FPA_TO_FP:
|
|
268
|
+
return converter.mkToFp(sort, args);
|
|
269
|
+
case OP_FPA_TO_FP_UNSIGNED:
|
|
270
|
+
return converter.mkToFpUnsigned(sort, getRm(), args[1]);
|
|
271
|
+
case OP_FPA_FP:
|
|
272
|
+
return converter.mkFp(args[0], args[1], args[2]);
|
|
273
|
+
case OP_FPA_TO_UBV:
|
|
274
|
+
case OP_FPA_TO_SBV:
|
|
275
|
+
return converter.mkToBv(decl, args[0], args[1], info.op === OP_FPA_TO_SBV);
|
|
276
|
+
case OP_FPA_TO_UBV_I:
|
|
277
|
+
case OP_FPA_TO_SBV_I: {
|
|
278
|
+
const op = info.op === OP_FPA_TO_SBV_I ? OP_FPA_TO_SBV : OP_FPA_TO_UBV;
|
|
279
|
+
return converter.mkToBv(
|
|
280
|
+
this.getDecl(op, info.parameters, args),
|
|
281
|
+
args[0],
|
|
282
|
+
args[1],
|
|
283
|
+
op === OP_FPA_TO_SBV,
|
|
284
|
+
);
|
|
285
|
+
}
|
|
286
|
+
case OP_FPA_TO_REAL:
|
|
287
|
+
return converter.mkToReal(decl, args[0]);
|
|
288
|
+
case OP_FPA_TO_REAL_I:
|
|
289
|
+
return converter.mkToReal(this.getDecl(OP_FPA_TO_REAL, [], args), args[0]);
|
|
290
|
+
case OP_FPA_TO_IEEE_BV:
|
|
291
|
+
return converter.mkToIeeeBv(decl, args[0]);
|
|
292
|
+
case OP_FPA_TO_IEEE_BV_I:
|
|
293
|
+
return converter.mkToIeeeBv(this.getDecl(OP_FPA_TO_IEEE_BV, [], args), args[0]);
|
|
294
|
+
default:
|
|
295
|
+
return -1;
|
|
296
|
+
}
|
|
297
|
+
}
|
|
298
|
+
|
|
299
|
+
private getDecl(op: number, parameters: number[], args: number[]) {
|
|
300
|
+
const manager = this.manager;
|
|
301
|
+
const signature = getFpaSignature(
|
|
302
|
+
manager,
|
|
303
|
+
op,
|
|
304
|
+
parameters,
|
|
305
|
+
args.map((arg) => manager.sorts[arg]),
|
|
306
|
+
);
|
|
307
|
+
if (typeof signature === "string") throw new SmtUnsupportedError(signature);
|
|
308
|
+
return manager.mkFpaDecl(
|
|
309
|
+
signature.op,
|
|
310
|
+
signature.name,
|
|
311
|
+
signature.parameters,
|
|
312
|
+
signature.domain,
|
|
313
|
+
signature.range,
|
|
314
|
+
);
|
|
315
|
+
}
|
|
316
|
+
|
|
317
|
+
// The result comes with a reference, which the caller releases.
|
|
318
|
+
convert(theoryRewriter: Rewriter, expr: number) {
|
|
319
|
+
const manager = this.manager;
|
|
320
|
+
const sort = manager.sorts[expr];
|
|
321
|
+
if (manager.getOp(expr) === OP_FPA_FP) {
|
|
322
|
+
manager.incRef(expr);
|
|
323
|
+
return expr;
|
|
324
|
+
}
|
|
325
|
+
if (!manager.isFpSort(sort) && !manager.isRmSort(sort)) {
|
|
326
|
+
const converted = this.rewrite(expr);
|
|
327
|
+
const result = theoryRewriter.rewrite(converted);
|
|
328
|
+
manager.decRef(converted);
|
|
329
|
+
return result;
|
|
330
|
+
}
|
|
331
|
+
const converted = this.rewrite(expr);
|
|
332
|
+
const result = manager.withTemporaries(() => {
|
|
333
|
+
if (manager.isRmSort(sort)) {
|
|
334
|
+
const bvRm = theoryRewriter.rewrite(manager.getArg(converted, 0));
|
|
335
|
+
manager.releaseLater(bvRm);
|
|
336
|
+
return this.converter.mkBv2Rm(bvRm);
|
|
337
|
+
}
|
|
338
|
+
const parts = this.converter.splitFp(converted).map((part) => {
|
|
339
|
+
const rewritten = theoryRewriter.rewrite(part);
|
|
340
|
+
manager.releaseLater(rewritten);
|
|
341
|
+
return rewritten;
|
|
342
|
+
});
|
|
343
|
+
return this.converter.mkFp(parts[0], parts[1], parts[2]);
|
|
344
|
+
});
|
|
345
|
+
manager.decRef(converted);
|
|
346
|
+
return result;
|
|
347
|
+
}
|
|
348
|
+
}
|
|
@@ -0,0 +1,73 @@
|
|
|
1
|
+
import type { AstManager } from "./ast";
|
|
2
|
+
import { TACTIC_ARITH_OPTIONS } from "./arith-rewriter";
|
|
3
|
+
import { convertMinMaxSpecials, convertUf2BvUf } from "./bv2fpa-converter";
|
|
4
|
+
import { BV_RM_TO_ZERO, mkFpNumeralOfBits, mkRmNumeral } from "./fpa-decl-plugin";
|
|
5
|
+
import { Fpa2BvConverter } from "./fpa2bv-converter";
|
|
6
|
+
import { Fpa2BvRewriter } from "./fpa2bv-rewriter";
|
|
7
|
+
import type { Goal } from "./goal";
|
|
8
|
+
import { ObjHashtable } from "./hashtable";
|
|
9
|
+
import { FuncInterp, ProtoModel } from "./proto-model";
|
|
10
|
+
import { Rewriter } from "./rewriter";
|
|
11
|
+
|
|
12
|
+
const getConstValue = (model: ProtoModel, expr: number) =>
|
|
13
|
+
model.constInterps.get(model.manager.decls[expr]);
|
|
14
|
+
|
|
15
|
+
const convertModel = (converter: Fpa2BvConverter, source: ProtoModel) => {
|
|
16
|
+
const manager = source.manager;
|
|
17
|
+
const target = new ProtoModel(manager).mkModel();
|
|
18
|
+
const seen = new ObjHashtable((decl) => manager.getDeclHash(decl));
|
|
19
|
+
for (const entry of converter.constants) {
|
|
20
|
+
const sort = manager.funcDecls[entry[0]].range;
|
|
21
|
+
const bv = manager.getArg(manager.getArg(entry[1], 0), 0);
|
|
22
|
+
const value = getConstValue(source, bv);
|
|
23
|
+
seen.add(manager.decls[bv]);
|
|
24
|
+
target.registerConst(
|
|
25
|
+
entry[0],
|
|
26
|
+
mkFpNumeralOfBits(manager, sort, value === undefined ? 0n : manager.getBvNumeralValue(value)),
|
|
27
|
+
);
|
|
28
|
+
}
|
|
29
|
+
for (const entry of converter.rmConstants) {
|
|
30
|
+
const bv = manager.getArg(entry[1], 0);
|
|
31
|
+
const value = getConstValue(source, bv);
|
|
32
|
+
const rm = value === undefined ? BV_RM_TO_ZERO : Number(manager.getBvNumeralValue(value));
|
|
33
|
+
seen.add(manager.decls[bv]);
|
|
34
|
+
target.registerConst(entry[0], mkRmNumeral(manager, rm <= 3 ? rm : BV_RM_TO_ZERO));
|
|
35
|
+
}
|
|
36
|
+
convertMinMaxSpecials(converter, source, target, seen);
|
|
37
|
+
convertUf2BvUf(converter, source, target, seen);
|
|
38
|
+
for (const decl of source.getConstDecls())
|
|
39
|
+
if (!seen.has(decl)) target.registerConst(decl, source.constInterps.get(decl) as number);
|
|
40
|
+
for (const decl of source.getFuncDecls()) {
|
|
41
|
+
if (seen.has(decl)) continue;
|
|
42
|
+
const interp = source.funcInterps.get(decl) as FuncInterp;
|
|
43
|
+
const copied = new FuncInterp(manager, interp.arity);
|
|
44
|
+
for (const entry of interp.entries) copied.insertNewEntry(entry.args, entry.result);
|
|
45
|
+
if (interp.elseExpr !== null) copied.setElse(interp.elseExpr);
|
|
46
|
+
target.registerFunc(decl, copied);
|
|
47
|
+
}
|
|
48
|
+
for (const sort of source.getUninterpretedSorts())
|
|
49
|
+
for (const value of source.getKnownUniverse(sort)) target.registerValue(value);
|
|
50
|
+
return target;
|
|
51
|
+
};
|
|
52
|
+
|
|
53
|
+
export const runFpa2Bv = (manager: AstManager) => (goal: Goal) => {
|
|
54
|
+
if (goal.isInconsistent) return [goal];
|
|
55
|
+
const simp = new Rewriter(manager, {
|
|
56
|
+
isEliminatingAnd: false,
|
|
57
|
+
arith: TACTIC_ARITH_OPTIONS,
|
|
58
|
+
isRewritingPatterns: false,
|
|
59
|
+
});
|
|
60
|
+
const converter = new Fpa2BvConverter(manager, simp);
|
|
61
|
+
const rewriter = new Fpa2BvRewriter(manager, converter);
|
|
62
|
+
const size = goal.forms.size;
|
|
63
|
+
for (let index = 0; !goal.isInconsistent && index < size; index++) {
|
|
64
|
+
const result = rewriter.rewrite(goal.forms.items[index]);
|
|
65
|
+
goal.update(index, result, goal.getDependency(index));
|
|
66
|
+
manager.decRef(result);
|
|
67
|
+
}
|
|
68
|
+
goal.addModelConversion((model) => convertModel(converter, model));
|
|
69
|
+
goal.depth++;
|
|
70
|
+
for (const assertion of converter.extraAssertions.items) goal.assert(assertion);
|
|
71
|
+
rewriter.release();
|
|
72
|
+
return [goal];
|
|
73
|
+
};
|
|
@@ -1,38 +1,182 @@
|
|
|
1
|
-
// Ported from Z3 (src/tactic/goal.cpp), MIT license, see z3-license.txt.
|
|
2
1
|
import { OP_AND, OP_NOT, OP_OR, SORT_BOOL, type AstManager } from "./ast";
|
|
2
|
+
import type { ProtoModel } from "./proto-model";
|
|
3
3
|
import { RefVector } from "./ref-vector";
|
|
4
4
|
|
|
5
|
+
// A dependency is a leaf, which holds an expression, or the join of two dependencies.
|
|
6
|
+
export interface Dependency {
|
|
7
|
+
value: number;
|
|
8
|
+
children: Dependency[];
|
|
9
|
+
}
|
|
10
|
+
|
|
11
|
+
export const mkDependencyLeaf = (value: number): Dependency => ({ value, children: [] });
|
|
12
|
+
|
|
13
|
+
export const joinDependencies = (
|
|
14
|
+
first: Dependency | undefined,
|
|
15
|
+
second: Dependency | undefined,
|
|
16
|
+
): Dependency | undefined =>
|
|
17
|
+
first === undefined
|
|
18
|
+
? second
|
|
19
|
+
: second === undefined || first === second
|
|
20
|
+
? first
|
|
21
|
+
: { value: -1, children: [first, second] };
|
|
22
|
+
|
|
23
|
+
// Breadth first and once per node, so a value that two leaves hold is listed twice.
|
|
24
|
+
export const getDependencyValues = (dependency: Dependency | undefined) => {
|
|
25
|
+
if (dependency === undefined) return [];
|
|
26
|
+
const todo = [dependency];
|
|
27
|
+
const marked = new Set(todo);
|
|
28
|
+
const values: number[] = [];
|
|
29
|
+
for (let head = 0; head < todo.length; head++) {
|
|
30
|
+
const current = todo[head];
|
|
31
|
+
if (current.children.length === 0) values.push(current.value);
|
|
32
|
+
for (const child of current.children)
|
|
33
|
+
if (!marked.has(child)) {
|
|
34
|
+
marked.add(child);
|
|
35
|
+
todo.push(child);
|
|
36
|
+
}
|
|
37
|
+
}
|
|
38
|
+
return values;
|
|
39
|
+
};
|
|
40
|
+
|
|
5
41
|
interface Polarized {
|
|
6
42
|
expr: number;
|
|
7
43
|
isPositive: boolean;
|
|
8
44
|
}
|
|
9
45
|
|
|
46
|
+
export const PRECISE = 0;
|
|
47
|
+
export const UNDER = 1;
|
|
48
|
+
export const OVER = 2;
|
|
49
|
+
const UNDER_OVER = 3;
|
|
50
|
+
|
|
51
|
+
export const PRECISION_NAMES = ["precise", "under", "over", "under-over"];
|
|
52
|
+
|
|
53
|
+
const getPrecisionUnion = (first: number, second: number) =>
|
|
54
|
+
first === PRECISE ? second : second === PRECISE || first === second ? first : UNDER_OVER;
|
|
55
|
+
|
|
56
|
+
// A definition of -1 hides the declaration.
|
|
57
|
+
export interface Definition {
|
|
58
|
+
decl: number;
|
|
59
|
+
def: number;
|
|
60
|
+
}
|
|
61
|
+
|
|
62
|
+
interface HiddenDecl {
|
|
63
|
+
decl: number;
|
|
64
|
+
}
|
|
65
|
+
|
|
66
|
+
interface Definitions {
|
|
67
|
+
definitions: Definition[];
|
|
68
|
+
}
|
|
69
|
+
|
|
70
|
+
interface ModelConversion {
|
|
71
|
+
convert: (model: ProtoModel) => ProtoModel;
|
|
72
|
+
}
|
|
73
|
+
|
|
10
74
|
export class Goal {
|
|
11
75
|
readonly forms: RefVector;
|
|
76
|
+
// Kept only while unsat cores are enabled.
|
|
77
|
+
dependencies: (Dependency | undefined)[] = [];
|
|
12
78
|
isInconsistent = false;
|
|
79
|
+
depth = 0;
|
|
80
|
+
precision = PRECISE;
|
|
81
|
+
converters: (HiddenDecl | Definitions | ModelConversion)[] = [];
|
|
82
|
+
model: ProtoModel | undefined;
|
|
83
|
+
isProofsEnabled = false;
|
|
84
|
+
isCoresEnabled = false;
|
|
13
85
|
|
|
14
|
-
constructor(
|
|
86
|
+
constructor(readonly manager: AstManager) {
|
|
15
87
|
this.forms = new RefVector(manager);
|
|
16
88
|
}
|
|
17
89
|
|
|
18
|
-
|
|
90
|
+
copy() {
|
|
91
|
+
const copied = new Goal(this.manager);
|
|
92
|
+
copied.copyFrom(this);
|
|
93
|
+
return copied;
|
|
94
|
+
}
|
|
95
|
+
|
|
96
|
+
copyFrom(source: Goal) {
|
|
97
|
+
if (source === this) return;
|
|
98
|
+
this.forms.reset();
|
|
99
|
+
for (const form of source.forms.items) this.forms.push(form);
|
|
100
|
+
this.dependencies = [...source.dependencies];
|
|
101
|
+
this.depth = Math.max(this.depth, source.depth);
|
|
102
|
+
this.isInconsistent = source.isInconsistent;
|
|
103
|
+
this.precision = getPrecisionUnion(source.precision, this.precision);
|
|
104
|
+
this.converters = source.converters;
|
|
105
|
+
this.isProofsEnabled = source.isProofsEnabled;
|
|
106
|
+
this.isCoresEnabled = source.isCoresEnabled;
|
|
107
|
+
}
|
|
108
|
+
|
|
109
|
+
reset() {
|
|
110
|
+
this.forms.reset();
|
|
111
|
+
this.dependencies = [];
|
|
112
|
+
this.isInconsistent = false;
|
|
113
|
+
}
|
|
114
|
+
|
|
115
|
+
resetAll() {
|
|
116
|
+
this.reset();
|
|
117
|
+
this.depth = 0;
|
|
118
|
+
this.precision = PRECISE;
|
|
119
|
+
}
|
|
120
|
+
|
|
121
|
+
updatePrecision(precision: number) {
|
|
122
|
+
this.precision = getPrecisionUnion(this.precision, precision);
|
|
123
|
+
}
|
|
124
|
+
|
|
125
|
+
addConverter(decl: number) {
|
|
126
|
+
this.manager.incDeclRef(decl);
|
|
127
|
+
this.converters = [...this.converters, { decl }];
|
|
128
|
+
}
|
|
129
|
+
|
|
130
|
+
addDefinitions(definitions: Definition[]) {
|
|
131
|
+
for (const definition of definitions) {
|
|
132
|
+
this.manager.incDeclRef(definition.decl);
|
|
133
|
+
if (definition.def !== -1) this.manager.incRef(definition.def);
|
|
134
|
+
}
|
|
135
|
+
this.converters = [...this.converters, { definitions }];
|
|
136
|
+
}
|
|
137
|
+
|
|
138
|
+
addModelConversion(convert: (model: ProtoModel) => ProtoModel) {
|
|
139
|
+
this.converters = [...this.converters, { convert }];
|
|
140
|
+
}
|
|
141
|
+
|
|
142
|
+
getDependency(index: number) {
|
|
143
|
+
return this.dependencies[index];
|
|
144
|
+
}
|
|
145
|
+
|
|
146
|
+
isDecidedSat() {
|
|
147
|
+
return this.forms.size === 0 && (this.precision === PRECISE || this.precision === UNDER);
|
|
148
|
+
}
|
|
149
|
+
|
|
150
|
+
isDecidedUnsat() {
|
|
151
|
+
return this.isInconsistent && (this.precision === PRECISE || this.precision === OVER);
|
|
152
|
+
}
|
|
153
|
+
|
|
154
|
+
isDecided() {
|
|
155
|
+
return this.isDecidedSat() || this.isDecidedUnsat();
|
|
156
|
+
}
|
|
157
|
+
|
|
158
|
+
private pushBack(form: number, dependency: Dependency | undefined) {
|
|
19
159
|
const manager = this.manager;
|
|
20
160
|
if (manager.isTrue(form)) return;
|
|
21
161
|
if (manager.isFalse(form)) {
|
|
22
162
|
this.forms.reset();
|
|
163
|
+
this.dependencies = [];
|
|
23
164
|
this.isInconsistent = true;
|
|
24
165
|
}
|
|
25
166
|
this.forms.push(form);
|
|
167
|
+
if (this.isCoresEnabled) this.dependencies.push(dependency);
|
|
26
168
|
}
|
|
27
169
|
|
|
28
|
-
|
|
170
|
+
// The formula comes with a reference, and so does the result. The negations it creates are held
|
|
171
|
+
// until it returns.
|
|
172
|
+
private quickProcess(form: number, isSavingFirst: boolean, dependency: Dependency | undefined) {
|
|
29
173
|
const manager = this.manager;
|
|
30
174
|
const op = manager.getOp(form);
|
|
31
175
|
if (
|
|
32
176
|
op !== OP_AND &&
|
|
33
177
|
!(manager.isNot(form) && manager.getOp(manager.getArg(form, 0)) === OP_OR)
|
|
34
178
|
) {
|
|
35
|
-
if (!isSavingFirst) this.pushBack(form);
|
|
179
|
+
if (!isSavingFirst) this.pushBack(form, dependency);
|
|
36
180
|
return form;
|
|
37
181
|
}
|
|
38
182
|
let first = form;
|
|
@@ -54,38 +198,42 @@ export class Goal {
|
|
|
54
198
|
manager.decRef(first);
|
|
55
199
|
first = leaf;
|
|
56
200
|
isSaving = false;
|
|
57
|
-
} else this.pushBack(leaf);
|
|
201
|
+
} else this.pushBack(leaf, dependency);
|
|
58
202
|
}
|
|
59
203
|
}
|
|
60
204
|
created.reset();
|
|
61
205
|
return first;
|
|
62
206
|
}
|
|
63
207
|
|
|
64
|
-
assert(form: number) {
|
|
208
|
+
assert(form: number, dependency?: Dependency) {
|
|
65
209
|
const manager = this.manager;
|
|
66
210
|
manager.incRef(form);
|
|
67
211
|
if (!this.isInconsistent) {
|
|
68
212
|
manager.incRef(form);
|
|
69
|
-
manager.decRef(this.quickProcess(form, false));
|
|
213
|
+
manager.decRef(this.quickProcess(form, false, dependency));
|
|
70
214
|
}
|
|
71
215
|
manager.decRef(form);
|
|
72
216
|
}
|
|
73
217
|
|
|
74
218
|
// When the first conjunct is false, Z3 adds the whole formula (goal.cpp:312), where this adds false.
|
|
75
|
-
update(index: number, form: number) {
|
|
219
|
+
update(index: number, form: number, dependency?: Dependency) {
|
|
76
220
|
const manager = this.manager;
|
|
77
221
|
if (this.isInconsistent) return;
|
|
78
222
|
manager.incRef(form);
|
|
79
|
-
const first = this.quickProcess(form, true);
|
|
223
|
+
const first = this.quickProcess(form, true, dependency);
|
|
80
224
|
if (!this.isInconsistent) {
|
|
81
|
-
if (manager.isFalse(first)) this.pushBack(first);
|
|
82
|
-
else
|
|
225
|
+
if (manager.isFalse(first)) this.pushBack(first, dependency);
|
|
226
|
+
else {
|
|
227
|
+
this.forms.set(index, first);
|
|
228
|
+
if (this.isCoresEnabled) this.dependencies[index] = dependency;
|
|
229
|
+
}
|
|
83
230
|
}
|
|
84
231
|
manager.decRef(first);
|
|
85
232
|
}
|
|
86
233
|
|
|
87
234
|
private shrink(size: number) {
|
|
88
235
|
while (this.forms.size > size) this.forms.pop();
|
|
236
|
+
this.dependencies.length = Math.min(this.dependencies.length, size);
|
|
89
237
|
}
|
|
90
238
|
|
|
91
239
|
elimTrue() {
|
|
@@ -93,12 +241,18 @@ export class Goal {
|
|
|
93
241
|
let kept = 0;
|
|
94
242
|
for (const [index, form] of [...this.forms.items].entries()) {
|
|
95
243
|
if (manager.isTrue(form)) continue;
|
|
96
|
-
if (index !== kept) this.
|
|
244
|
+
if (index !== kept) this.move(index, kept, form);
|
|
97
245
|
kept++;
|
|
98
246
|
}
|
|
99
247
|
this.shrink(kept);
|
|
100
248
|
}
|
|
101
249
|
|
|
250
|
+
private move(from: number, to: number, form: number) {
|
|
251
|
+
this.forms.set(to, form);
|
|
252
|
+
if (this.isCoresEnabled) this.dependencies[to] = this.dependencies[from];
|
|
253
|
+
}
|
|
254
|
+
|
|
255
|
+
// The marks hold the literals until it returns.
|
|
102
256
|
elimRedundancies() {
|
|
103
257
|
const manager = this.manager;
|
|
104
258
|
if (this.isInconsistent) return;
|
|
@@ -112,11 +266,17 @@ export class Goal {
|
|
|
112
266
|
const same = isNegated ? negatives : positives;
|
|
113
267
|
if (same.items.includes(atom)) continue;
|
|
114
268
|
if ((isNegated ? positives : negatives).items.includes(atom)) {
|
|
115
|
-
this.
|
|
269
|
+
const complement = this.forms.items.findIndex((other) =>
|
|
270
|
+
isNegated ? other === atom : manager.isNot(other) && manager.getArg(other, 0) === atom,
|
|
271
|
+
);
|
|
272
|
+
this.pushBack(
|
|
273
|
+
manager.falseExpr,
|
|
274
|
+
joinDependencies(this.dependencies[complement], this.dependencies[index]),
|
|
275
|
+
);
|
|
116
276
|
break;
|
|
117
277
|
}
|
|
118
278
|
same.push(atom);
|
|
119
|
-
if (index !== kept) this.
|
|
279
|
+
if (index !== kept) this.move(index, kept, form);
|
|
120
280
|
kept++;
|
|
121
281
|
}
|
|
122
282
|
if (!this.isInconsistent) this.shrink(kept);
|