tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.6b2a6741a
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +2 -1
- package/dist/compile.cjs +3 -3
- package/dist/compile.js +1 -1
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +45 -41
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +5 -1
- package/dist/index.d.ts +5 -1
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +2682 -426
- package/dist/prove.js +2679 -423
- package/dist/run.cjs +43 -42
- package/dist/run.js +44 -43
- package/dist/tlapm.cjs +1 -1
- package/dist/tlapm.js +1 -1
- package/dist/transfer.cjs +43 -40
- package/dist/transfer.js +43 -40
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +4 -3
- package/src/bags.ts +46 -28
- package/src/check-trace.ts +2 -16
- package/src/check.ts +349 -91
- package/src/cli/runtime-invariants.ts +20 -56
- package/src/cli/tlapm.ts +424 -62
- package/src/cli/tlc-arguments.ts +2 -2
- package/src/cli/tlc-output.ts +4 -5
- package/src/cli/tlc-usage.ts +0 -1
- package/src/cli/tlc.ts +26 -7
- package/src/cli/xml-exporter.ts +1 -1
- package/src/codegen.ts +9 -5
- package/src/dependencies.ts +72 -11
- package/src/dfid.ts +9 -2
- package/src/environment.ts +65 -36
- package/src/errors.ts +38 -3
- package/src/evaluate.ts +92 -32
- package/src/exit-codes.ts +5 -2
- package/src/instances.ts +5 -5
- package/src/java-overrides.ts +2 -2
- package/src/levels.ts +138 -90
- package/src/lexer.ts +5 -3
- package/src/liveness-checker.ts +572 -204
- package/src/liveness.ts +47 -32
- package/src/obligations/action.ts +10 -6
- package/src/obligations/anonymize.ts +33 -14
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +18 -6
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +22 -17
- package/src/obligations/index.ts +37 -7
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +1 -3
- package/src/obligations/normalize.ts +25 -17
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +48 -18
- package/src/obligations/proof.ts +3 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +17 -7
- package/src/obligations/source.ts +71 -17
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +0 -2
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +8 -2
- package/src/parallel.ts +7 -2
- package/src/parser.ts +664 -287
- package/src/pretty-print.ts +1 -1
- package/src/prover/deciders.ts +11 -8
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +71 -41
- package/src/prover/isabelle/isar/attrib.ts +250 -0
- package/src/prover/isabelle/isar/context.ts +335 -0
- package/src/prover/isabelle/isar/induct.ts +382 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +149 -3
- package/src/prover/isabelle/isar/method.ts +506 -198
- package/src/prover/isabelle/isar/proof.ts +570 -14
- package/src/prover/isabelle/isar/rule-cases.ts +226 -0
- package/src/prover/isabelle/isar/theory.ts +479 -69
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +83 -8
- package/src/prover/isabelle/provers/blast/blast.ts +0 -2
- package/src/prover/isabelle/provers/blast/branch.ts +0 -2
- package/src/prover/isabelle/provers/blast/prove.ts +0 -2
- package/src/prover/isabelle/provers/blast/rules.ts +0 -2
- package/src/prover/isabelle/provers/blast/state.ts +0 -2
- package/src/prover/isabelle/provers/blast/term.ts +0 -2
- package/src/prover/isabelle/provers/clasimp.ts +1 -3
- package/src/prover/isabelle/provers/classical.ts +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +2 -4
- package/src/prover/isabelle/pure/bicompose.ts +0 -2
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +0 -2
- package/src/prover/isabelle/pure/drule.ts +63 -4
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +1 -3
- package/src/prover/isabelle/pure/logic.ts +0 -2
- package/src/prover/isabelle/pure/name.ts +0 -2
- package/src/prover/isabelle/pure/net.ts +0 -2
- package/src/prover/isabelle/pure/object-logic.ts +13 -7
- package/src/prover/isabelle/pure/pattern.ts +0 -2
- package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
- package/src/prover/isabelle/pure/rewriter.ts +4 -11
- package/src/prover/isabelle/pure/search.ts +0 -2
- package/src/prover/isabelle/pure/seq.ts +0 -2
- package/src/prover/isabelle/pure/simplifier.ts +26 -7
- package/src/prover/isabelle/pure/table.ts +0 -2
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +0 -2
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +3 -5
- package/src/prover/isabelle/pure/thm.ts +0 -2
- package/src/prover/isabelle/pure/type.ts +0 -2
- package/src/prover/isabelle/pure/unify.ts +0 -2
- package/src/prover/isabelle/pure/variable.ts +0 -2
- package/src/prover/isabelle/tla/classical-setup.ts +1 -2
- package/src/prover/isabelle/tla/context.ts +51 -9
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +40 -1
- package/src/prover/isabelle/tla/simpdata.ts +0 -2
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +19 -12
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/md5.ts +26 -29
- package/src/prover/prep/methods.ts +159 -50
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +343 -65
- package/src/prover/ptl/decide.ts +95 -50
- package/src/prover/ptl/encode.ts +2 -3
- package/src/prover/ptl/tableau.ts +28 -2
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -8
- package/src/prover/smt/context.ts +42 -6
- package/src/prover/smt/data.ts +191 -84
- package/src/prover/smt/encode.ts +122 -43
- package/src/prover/smt/extensionality.ts +5 -3
- package/src/prover/smt/flatten.ts +4 -6
- package/src/prover/smt/format.ts +28 -4
- package/src/prover/smt/instances.ts +7 -1
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +483 -116
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
- package/src/prover/smt/solver/ackr-helper.ts +179 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
- package/src/prover/smt/solver/act-cache.ts +0 -1
- package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
- package/src/prover/smt/solver/aig-tactic.ts +52 -0
- package/src/prover/smt/solver/aig.ts +889 -0
- package/src/prover/smt/solver/arith-rewriter.ts +613 -6
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +309 -0
- package/src/prover/smt/solver/asserted-formulas.ts +93 -15
- package/src/prover/smt/solver/ast-lt.ts +165 -11
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1449 -41
- package/src/prover/smt/solver/auf-solver.ts +0 -1
- package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +600 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +109 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -2
- package/src/prover/smt/solver/cg-table.ts +39 -25
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +533 -114
- package/src/prover/smt/solver/ctx-simplify.ts +21 -12
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
- package/src/prover/smt/solver/der.ts +38 -10
- package/src/prover/smt/solver/diff-neq.ts +205 -0
- package/src/prover/smt/solver/distribute-forall.ts +57 -0
- package/src/prover/smt/solver/dom-simplify.ts +511 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -1
- package/src/prover/smt/solver/e-matching.ts +6 -7
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
- package/src/prover/smt/solver/enode.ts +100 -3
- package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +901 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1046 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +328 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
- package/src/prover/smt/solver/expr2polynomial.ts +271 -0
- package/src/prover/smt/solver/factor.ts +163 -0
- package/src/prover/smt/solver/fd-solver.ts +267 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -15
- package/src/prover/smt/solver/fix-dl-var.ts +147 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +884 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +177 -15
- package/src/prover/smt/solver/goal2nlsat.ts +216 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -1
- package/src/prover/smt/solver/hashtable.ts +30 -16
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +109 -36
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -1
- package/src/prover/smt/solver/lia2card.ts +268 -0
- package/src/prover/smt/solver/lia2pb.ts +154 -0
- package/src/prover/smt/solver/literal.ts +0 -1
- package/src/prover/smt/solver/logic-tactics.ts +345 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
- package/src/prover/smt/solver/lp/constraints.ts +0 -1
- package/src/prover/smt/solver/lp/containers.ts +7 -2
- package/src/prover/smt/solver/lp/core-solver.ts +18 -3
- package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
- package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
- package/src/prover/smt/solver/lp/dependency.ts +0 -2
- package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
- package/src/prover/smt/solver/lp/explanation.ts +0 -1
- package/src/prover/smt/solver/lp/gomory.ts +0 -1
- package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
- package/src/prover/smt/solver/lp/hnf.ts +0 -3
- package/src/prover/smt/solver/lp/int-cube.ts +3 -4
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
- package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
- package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
- package/src/prover/smt/solver/lp/nex.ts +2 -2
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
- package/src/prover/smt/solver/lp/nla-core.ts +66 -11
- package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
- package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
- package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
- package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
- package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
- package/src/prover/smt/solver/lp/nla-order.ts +0 -2
- package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -2
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
- package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
- package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
- package/src/prover/smt/solver/lp/pdd.ts +725 -290
- package/src/prover/smt/solver/lp/random-updater.ts +0 -2
- package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
- package/src/prover/smt/solver/lp/union-find.ts +7 -2
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +118 -88
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +309 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +105 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +17 -26
- package/src/prover/smt/solver/model-evaluator.ts +188 -12
- package/src/prover/smt/solver/model-finder.ts +0 -1
- package/src/prover/smt/solver/model-generator.ts +59 -30
- package/src/prover/smt/solver/model-macro-solver.ts +38 -27
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +709 -0
- package/src/prover/smt/solver/mus.ts +50 -0
- package/src/prover/smt/solver/muz/dl-context.ts +410 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +305 -88
- package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +424 -211
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
- package/src/prover/smt/solver/nlsat/solver.ts +282 -69
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
- package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +105 -23
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +792 -0
- package/src/prover/smt/solver/opt-nlsat.ts +386 -0
- package/src/prover/smt/solver/opt-pareto.ts +282 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +311 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +19 -11
- package/src/prover/smt/solver/pb-rewriter.ts +281 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +202 -57
- package/src/prover/smt/solver/probes.ts +511 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +650 -17
- package/src/prover/smt/solver/pull-quant.ts +28 -12
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -3
- package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
- package/src/prover/smt/solver/qe-lite.ts +37 -17
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1499 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -1
- package/src/prover/smt/solver/qsat.ts +814 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +16 -56
- package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
- package/src/prover/smt/solver/quantifier-manager.ts +25 -24
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +45 -1
- package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -1
- package/src/prover/smt/solver/relevancy.ts +1 -2
- package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
- package/src/prover/smt/solver/rewriter.ts +475 -36
- package/src/prover/smt/solver/rlimit.ts +38 -2
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2105 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +995 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1298 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +730 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
- package/src/prover/smt/solver/seq-skolem.ts +294 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +90 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +544 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3228 -327
- package/src/prover/smt/solver/smtlib-script.ts +1843 -0
- package/src/prover/smt/solver/solve-eqs.ts +923 -0
- package/src/prover/smt/solver/solver.ts +113 -22
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +2012 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1200 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -5
- package/src/prover/smt/solver/theory-lra-final-check.ts +56 -71
- package/src/prover/smt/solver/theory-lra-internalize.ts +89 -11
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -28
- package/src/prover/smt/solver/theory-lra-state.ts +6 -22
- package/src/prover/smt/solver/theory-lra.ts +188 -2
- package/src/prover/smt/solver/theory-pb.ts +933 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +852 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
- package/src/prover/smt/solver/var-subst.ts +36 -14
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +37 -16
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +2 -0
- package/src/prover/zenon/decide.ts +10 -7
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +0 -2
- package/src/prover/zenon/equality-rules.ts +24 -2
- package/src/prover/zenon/expr.ts +21 -2
- package/src/prover/zenon/index-table.ts +7 -4
- package/src/prover/zenon/isar-case.ts +1 -3
- package/src/prover/zenon/isar.ts +2 -4
- package/src/prover/zenon/llproof.ts +0 -2
- package/src/prover/zenon/mltoll.ts +0 -2
- package/src/prover/zenon/node.ts +20 -5
- package/src/prover/zenon/parse.ts +6 -2
- package/src/prover/zenon/phrase.ts +1 -3
- package/src/prover/zenon/proof.ts +0 -2
- package/src/prover/zenon/propositional-rules.ts +0 -2
- package/src/prover/zenon/rules.ts +2 -3
- package/src/prover/zenon/search.ts +7 -5
- package/src/prover/zenon/tla/functions.ts +0 -2
- package/src/prover/zenon/tla/llproof.ts +0 -2
- package/src/prover/zenon/tla/records.ts +0 -2
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +7 -8
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +0 -2
- package/src/resolve.ts +625 -189
- package/src/runtime.ts +7 -1
- package/src/sany/builtins.ts +10 -10
- package/src/sany/generation.ts +2 -13
- package/src/sany/generator-definitions.ts +3 -1
- package/src/sany/generator-expressions.ts +36 -30
- package/src/sany/generator-proofs.ts +5 -3
- package/src/sany/generator.ts +2 -1
- package/src/sany/levels.ts +0 -2
- package/src/sany/lexer.ts +3 -3
- package/src/sany/linter.ts +0 -2
- package/src/sany/modules.ts +4 -2
- package/src/sany/nodes.ts +1 -1
- package/src/sany/selectors.ts +11 -6
- package/src/sany/xml.ts +2 -3
- package/src/search.ts +209 -56
- package/src/simulate.ts +3 -0
- package/src/spec-description.ts +2 -2
- package/src/standard-definitions.ts +4 -0
- package/src/state-graph.ts +0 -2
- package/src/subexpressions.ts +265 -94
- package/src/successors.ts +2 -1
- package/src/symmetry.ts +3 -3
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/jar-data.ts +10 -0
- package/src/tlc/messages.ts +3 -3
- package/src/tlc/order.ts +14 -3
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlc-operators.ts +3 -1
- package/src/tlc/tlcext-operators.ts +61 -16
- package/src/tlc/trace-spec.ts +5 -5
- package/src/typed-tier.ts +6541 -0
- package/src/typescript/types.ts +2 -2
- package/src/values.ts +46 -27
- 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
|
@@ -1,20 +1,72 @@
|
|
|
1
|
-
|
|
1
|
+
import { TermEnumeration } from "./term-enumeration";
|
|
2
2
|
import {
|
|
3
3
|
type AstManager,
|
|
4
|
+
FAMILY_ARRAY,
|
|
5
|
+
FAMILY_BV,
|
|
6
|
+
FAMILY_SEQ,
|
|
4
7
|
KIND_APP,
|
|
8
|
+
KIND_QUANTIFIER,
|
|
5
9
|
KIND_VAR,
|
|
6
10
|
OP_AND,
|
|
11
|
+
OP_ARRAY_MAP,
|
|
12
|
+
OP_AS_ARRAY,
|
|
13
|
+
OP_BIT2BOOL,
|
|
7
14
|
OP_EQ,
|
|
15
|
+
OP_EXTRACT,
|
|
16
|
+
OP_CONST_ARRAY,
|
|
8
17
|
OP_ITE,
|
|
18
|
+
OP_SEQ_TO_RE,
|
|
19
|
+
OP_STORE,
|
|
20
|
+
QUANTIFIER_LAMBDA,
|
|
9
21
|
SORT_BOOL,
|
|
10
22
|
isArithSort,
|
|
11
23
|
} from "./ast";
|
|
24
|
+
import {
|
|
25
|
+
getDatatypeConstructors,
|
|
26
|
+
getNonRecConstructor,
|
|
27
|
+
isRecursiveDatatype,
|
|
28
|
+
} from "./datatype-decl-plugin";
|
|
29
|
+
import { mkArrayApp, mkAsArray } from "./array-decl-plugin";
|
|
30
|
+
import { mkFpNumeral, mkRmNumeral } from "./fpa-decl-plugin";
|
|
31
|
+
import { MPF_ROUND_TOWARD_ZERO, mkZero } from "./mpf";
|
|
12
32
|
import { RandomGen } from "./random-gen";
|
|
33
|
+
import { mkEmptySeq, mkSeqApp } from "./seq-decl-plugin";
|
|
13
34
|
import { Rational } from "./rational";
|
|
14
35
|
import { ObjHashtable, ObjMap } from "./hashtable";
|
|
15
36
|
import { ModelEvaluator } from "./model-evaluator";
|
|
37
|
+
import { ExprSafeReplace } from "./expr-safe-replace";
|
|
16
38
|
import { RefVector } from "./ref-vector";
|
|
39
|
+
import { CharFactory, SeqFactory } from "./seq-factory";
|
|
17
40
|
import { Rewriter, TACTIC_REWRITER_OPTIONS } from "./rewriter";
|
|
41
|
+
import { VarSubst } from "./var-subst";
|
|
42
|
+
import { mkBvApp } from "./bv-decl-plugin";
|
|
43
|
+
|
|
44
|
+
export const getManagerSomeValue = (manager: AstManager, sort: number): number => {
|
|
45
|
+
if (sort === SORT_BOOL) return manager.falseExpr;
|
|
46
|
+
if (manager.isRmSort(sort)) return mkRmNumeral(manager, MPF_ROUND_TOWARD_ZERO);
|
|
47
|
+
if (manager.isFpSort(sort))
|
|
48
|
+
return mkFpNumeral(manager, mkZero(manager.getEbits(sort), manager.getSbits(sort), false));
|
|
49
|
+
if (isArithSort(sort)) return manager.mkNumeralOfSort(Rational.zero, sort);
|
|
50
|
+
if (manager.isBvSort(sort)) return manager.mkBvNumeral(0n, manager.getBvSize(sort));
|
|
51
|
+
if (manager.isArraySort(sort))
|
|
52
|
+
return mkArrayApp(
|
|
53
|
+
manager,
|
|
54
|
+
OP_CONST_ARRAY,
|
|
55
|
+
[getManagerSomeValue(manager, manager.getArrayRange(sort))],
|
|
56
|
+
[sort],
|
|
57
|
+
);
|
|
58
|
+
if (manager.isSeqSort(sort)) return mkEmptySeq(manager, sort);
|
|
59
|
+
if (manager.isReSort(sort))
|
|
60
|
+
return mkSeqApp(manager, OP_SEQ_TO_RE, [mkEmptySeq(manager, manager.getReSeqSort(sort))]);
|
|
61
|
+
if (manager.isCharSort(sort)) return manager.mkChar(65);
|
|
62
|
+
if (!manager.isDatatypeSort(sort)) return manager.mkModelValue(0, sort);
|
|
63
|
+
const constructor = getNonRecConstructor(manager, sort);
|
|
64
|
+
return manager.mkApp(
|
|
65
|
+
constructor,
|
|
66
|
+
manager.funcDecls[constructor].domain.map((argSort) => getManagerSomeValue(manager, argSort)),
|
|
67
|
+
sort,
|
|
68
|
+
);
|
|
69
|
+
};
|
|
18
70
|
|
|
19
71
|
interface FuncEntry {
|
|
20
72
|
args: number[];
|
|
@@ -50,6 +102,15 @@ export class FuncInterp {
|
|
|
50
102
|
this.entryTable.set(args.join(","), entry);
|
|
51
103
|
}
|
|
52
104
|
|
|
105
|
+
delEntry(index: number) {
|
|
106
|
+
this.resetInterpCache();
|
|
107
|
+
const entry = this.entries[index];
|
|
108
|
+
this.entries[index] = this.entries[this.entries.length - 1];
|
|
109
|
+
this.entries.pop();
|
|
110
|
+
this.entryTable.delete(entry.args.join(","));
|
|
111
|
+
this.releaseEntry(entry);
|
|
112
|
+
}
|
|
113
|
+
|
|
53
114
|
insertEntry(args: number[], result: number) {
|
|
54
115
|
this.resetInterpCache();
|
|
55
116
|
const entry = this.getEntry(args);
|
|
@@ -82,7 +143,7 @@ export class FuncInterp {
|
|
|
82
143
|
const manager = this.manager;
|
|
83
144
|
if (manager.getOp(expr) !== OP_ITE) return undefined;
|
|
84
145
|
const condition = manager.getArg(expr, 0);
|
|
85
|
-
if (!manager.
|
|
146
|
+
if (!manager.isGroundApp(manager.getArg(expr, 1)) || this.arity === 0) return undefined;
|
|
86
147
|
if (this.arity === 1 && manager.getOp(condition) !== OP_EQ) return undefined;
|
|
87
148
|
if (
|
|
88
149
|
this.arity > 1 &&
|
|
@@ -118,9 +179,16 @@ export class FuncInterp {
|
|
|
118
179
|
this.elseExpr = current;
|
|
119
180
|
}
|
|
120
181
|
|
|
182
|
+
copy() {
|
|
183
|
+
const copied = new FuncInterp(this.manager, this.arity);
|
|
184
|
+
for (const entry of this.entries) copied.insertNewEntry(entry.args, entry.result);
|
|
185
|
+
if (this.elseExpr !== null) copied.setElse(this.elseExpr);
|
|
186
|
+
return copied;
|
|
187
|
+
}
|
|
188
|
+
|
|
121
189
|
isConstant() {
|
|
122
190
|
const elseExpr = this.elseExpr;
|
|
123
|
-
if (elseExpr === null || !this.manager.
|
|
191
|
+
if (elseExpr === null || !this.manager.isGroundApp(elseExpr)) return false;
|
|
124
192
|
return this.entries.every((entry) => entry.result === elseExpr);
|
|
125
193
|
}
|
|
126
194
|
|
|
@@ -142,7 +210,7 @@ export class FuncInterp {
|
|
|
142
210
|
compress() {
|
|
143
211
|
const manager = this.manager;
|
|
144
212
|
const elseExpr = this.elseExpr;
|
|
145
|
-
if (elseExpr === null || this.entries.length === 0 || !manager.
|
|
213
|
+
if (elseExpr === null || this.entries.length === 0 || !manager.isGroundApp(elseExpr)) return;
|
|
146
214
|
const kept = this.entries.filter((entry) => {
|
|
147
215
|
if (entry.result !== elseExpr) return true;
|
|
148
216
|
this.releaseEntry(entry);
|
|
@@ -176,6 +244,49 @@ export class FuncInterp {
|
|
|
176
244
|
return this.entries.length + 1 === 2;
|
|
177
245
|
}
|
|
178
246
|
|
|
247
|
+
// get_array_interp: an interpretation that is not ground becomes a lambda.
|
|
248
|
+
getArrayInterp(decl: number) {
|
|
249
|
+
const manager = this.manager;
|
|
250
|
+
const elseExpr = this.elseExpr;
|
|
251
|
+
if (elseExpr === null) return undefined;
|
|
252
|
+
const domain = manager.funcDecls[decl].domain;
|
|
253
|
+
const isGround =
|
|
254
|
+
manager.isGroundApp(elseExpr) &&
|
|
255
|
+
this.entries.every(
|
|
256
|
+
(entry) =>
|
|
257
|
+
manager.isGroundApp(entry.result) && entry.args.every((arg) => manager.isGroundApp(arg)),
|
|
258
|
+
);
|
|
259
|
+
if (!isGround) {
|
|
260
|
+
const interp = this.getInterp();
|
|
261
|
+
if (interp === null) return undefined;
|
|
262
|
+
const subst = new VarSubst(manager, false);
|
|
263
|
+
const body = subst.apply(
|
|
264
|
+
interp,
|
|
265
|
+
domain.map((sort, index) => manager.mkVar(this.arity - index - 1, sort)),
|
|
266
|
+
);
|
|
267
|
+
const lambda = manager.mkQuantifier({
|
|
268
|
+
kind: QUANTIFIER_LAMBDA,
|
|
269
|
+
sorts: [...domain],
|
|
270
|
+
names: domain.map((_value, index) => index),
|
|
271
|
+
body,
|
|
272
|
+
patterns: [],
|
|
273
|
+
noPatterns: [],
|
|
274
|
+
weight: 0,
|
|
275
|
+
qid: "",
|
|
276
|
+
});
|
|
277
|
+
manager.decRef(body);
|
|
278
|
+
return lambda;
|
|
279
|
+
}
|
|
280
|
+
const sort = manager.mkArraySort([...domain, manager.sorts[elseExpr]]);
|
|
281
|
+
return this.entries.reduce(
|
|
282
|
+
(array, entry) =>
|
|
283
|
+
entry.result === elseExpr
|
|
284
|
+
? array
|
|
285
|
+
: mkArrayApp(manager, OP_STORE, [array, ...entry.args, entry.result]),
|
|
286
|
+
mkArrayApp(manager, OP_CONST_ARRAY, [elseExpr], [sort]),
|
|
287
|
+
);
|
|
288
|
+
}
|
|
289
|
+
|
|
179
290
|
getInterp() {
|
|
180
291
|
if (this.interp !== null) return this.interp;
|
|
181
292
|
const manager = this.manager;
|
|
@@ -213,12 +324,25 @@ export class ProtoModel {
|
|
|
213
324
|
private values = new Map<number, ObjHashtable>();
|
|
214
325
|
private userSortValues: RefVector;
|
|
215
326
|
private arithValues: RefVector;
|
|
327
|
+
private bvValues: RefVector;
|
|
328
|
+
private datatypeValues: RefVector;
|
|
329
|
+
private enumeratedTerms: RefVector;
|
|
330
|
+
private freshEnumerations = new Map<number, TermEnumeration>();
|
|
216
331
|
private nextValue = new Map<number, number>();
|
|
332
|
+
// array_factory::m_ranges: the ranges whose fresh value an array's fresh value is waiting for.
|
|
333
|
+
private freshArrayRanges: number[] = [];
|
|
217
334
|
private finiteSorts = new Set<number>();
|
|
335
|
+
// model::m_usort2universe, the universes registered in order.
|
|
336
|
+
private universes = new Map<number, RefVector>();
|
|
218
337
|
private boolRandom: RandomGen;
|
|
219
338
|
private evaluator: ModelEvaluator;
|
|
220
339
|
private rewriter: Rewriter;
|
|
221
340
|
private refCount = 0;
|
|
341
|
+
// A model, rather than the proto_model it was made from, takes its values from the manager.
|
|
342
|
+
private isFinal = false;
|
|
343
|
+
private isCompact = false;
|
|
344
|
+
private seqFactory: SeqFactory | undefined;
|
|
345
|
+
private charFactory: CharFactory | undefined;
|
|
222
346
|
|
|
223
347
|
constructor(readonly manager: AstManager) {
|
|
224
348
|
this.boolRandom = new RandomGen(manager.getNumAsts());
|
|
@@ -226,6 +350,9 @@ export class ProtoModel {
|
|
|
226
350
|
this.funcInterps = new ObjMap((decl) => manager.getDeclHash(decl));
|
|
227
351
|
this.userSortValues = new RefVector(manager);
|
|
228
352
|
this.arithValues = new RefVector(manager);
|
|
353
|
+
this.bvValues = new RefVector(manager);
|
|
354
|
+
this.datatypeValues = new RefVector(manager);
|
|
355
|
+
this.enumeratedTerms = new RefVector(manager);
|
|
229
356
|
this.auxDecls = new ObjHashtable((decl) => manager.getDeclHash(decl));
|
|
230
357
|
this.evaluator = new ModelEvaluator(manager, this);
|
|
231
358
|
this.rewriter = new Rewriter(manager, TACTIC_REWRITER_OPTIONS);
|
|
@@ -241,13 +368,45 @@ export class ProtoModel {
|
|
|
241
368
|
}
|
|
242
369
|
|
|
243
370
|
registerFunc(decl: number, interp: FuncInterp) {
|
|
371
|
+
this.updateFuncInterp(decl, interp)?.release();
|
|
372
|
+
}
|
|
373
|
+
|
|
374
|
+
// model_core::update_func_interp: the replaced interpretation goes to the caller.
|
|
375
|
+
updateFuncInterp(decl: number, interp: FuncInterp) {
|
|
244
376
|
const old = this.funcInterps.get(decl);
|
|
245
377
|
if (old === undefined) {
|
|
246
378
|
this.funcDecls.push(decl);
|
|
247
379
|
this.manager.incDeclRef(decl);
|
|
248
380
|
}
|
|
249
381
|
this.funcInterps.set(decl, interp);
|
|
250
|
-
old
|
|
382
|
+
return old;
|
|
383
|
+
}
|
|
384
|
+
|
|
385
|
+
// add_rec_funs: a recursive function without an interpretation takes its definition, whose
|
|
386
|
+
// variables a function interpretation numbers from the first argument.
|
|
387
|
+
addRecFuns() {
|
|
388
|
+
const manager = this.manager;
|
|
389
|
+
for (const entry of manager.macros)
|
|
390
|
+
if (!this.constInterps.has(entry[0])) this.registerConst(entry[0], entry[1]);
|
|
391
|
+
for (const def of manager.recFunDefs.values()) {
|
|
392
|
+
if (def.rhs === -1 || this.constInterps.has(def.decl) || this.funcInterps.has(def.decl))
|
|
393
|
+
continue;
|
|
394
|
+
const domain = manager.funcDecls[def.decl].domain;
|
|
395
|
+
if (domain.length === 0) {
|
|
396
|
+
this.registerConst(def.decl, def.rhs);
|
|
397
|
+
continue;
|
|
398
|
+
}
|
|
399
|
+
const subst = new ExprSafeReplace(manager);
|
|
400
|
+
domain.forEach((sort, index) =>
|
|
401
|
+
subst.insert(manager.mkVar(domain.length - index - 1, sort), manager.mkVar(index, sort)),
|
|
402
|
+
);
|
|
403
|
+
const body = subst.apply(def.rhs);
|
|
404
|
+
subst.release();
|
|
405
|
+
const interp = new FuncInterp(manager, domain.length);
|
|
406
|
+
interp.setElse(body);
|
|
407
|
+
manager.decRef(body);
|
|
408
|
+
this.registerFunc(def.decl, interp);
|
|
409
|
+
}
|
|
251
410
|
}
|
|
252
411
|
|
|
253
412
|
registerAuxDecl(decl: number, interp?: FuncInterp) {
|
|
@@ -271,6 +430,29 @@ export class ProtoModel {
|
|
|
271
430
|
return this.evaluator.rewrite(expr);
|
|
272
431
|
}
|
|
273
432
|
|
|
433
|
+
resetEvalCache() {
|
|
434
|
+
this.evaluator.reset();
|
|
435
|
+
}
|
|
436
|
+
|
|
437
|
+
// model::unfold_as_array: the array an as-array denotes, from its function's interpretation.
|
|
438
|
+
unfoldAsArray(expr: number) {
|
|
439
|
+
const manager = this.manager;
|
|
440
|
+
if (!manager.isApp(expr) || !isAsArray(manager, manager.decls[expr])) return expr;
|
|
441
|
+
const decl = manager.funcDecls[manager.decls[expr]].parameters[0];
|
|
442
|
+
return this.funcInterps.get(decl)?.getArrayInterp(decl) ?? expr;
|
|
443
|
+
}
|
|
444
|
+
|
|
445
|
+
registerUsort(sort: number, universe: readonly number[]) {
|
|
446
|
+
const values = new RefVector(this.manager);
|
|
447
|
+
for (const value of universe) values.push(value);
|
|
448
|
+
this.universes.get(sort)?.reset();
|
|
449
|
+
this.universes.set(sort, values);
|
|
450
|
+
}
|
|
451
|
+
|
|
452
|
+
getUniverse(sort: number): readonly number[] | undefined {
|
|
453
|
+
return this.universes.get(sort)?.items;
|
|
454
|
+
}
|
|
455
|
+
|
|
274
456
|
private getValueSet(sort: number) {
|
|
275
457
|
const existing = this.values.get(sort);
|
|
276
458
|
if (existing !== undefined) return existing;
|
|
@@ -280,15 +462,25 @@ export class ProtoModel {
|
|
|
280
462
|
}
|
|
281
463
|
|
|
282
464
|
private mkIndexedValue(index: number, sort: number) {
|
|
465
|
+
const manager = this.manager;
|
|
283
466
|
return isArithSort(sort)
|
|
284
|
-
?
|
|
285
|
-
:
|
|
467
|
+
? manager.mkNumeralOfSort(Rational.of(BigInt(index)), sort)
|
|
468
|
+
: manager.isBvSort(sort)
|
|
469
|
+
? manager.mkBvNumeral(BigInt(index), manager.getBvSize(sort))
|
|
470
|
+
: manager.mkModelValue(index, sort);
|
|
286
471
|
}
|
|
287
472
|
|
|
288
473
|
private addValue(sort: number, value: number) {
|
|
289
474
|
const set = this.getValueSet(sort);
|
|
290
475
|
if (set.has(value)) return;
|
|
291
|
-
(isArithSort(sort)
|
|
476
|
+
(isArithSort(sort)
|
|
477
|
+
? this.arithValues
|
|
478
|
+
: this.manager.isBvSort(sort)
|
|
479
|
+
? this.bvValues
|
|
480
|
+
: this.manager.isDatatypeSort(sort)
|
|
481
|
+
? this.datatypeValues
|
|
482
|
+
: this.userSortValues
|
|
483
|
+
).push(value);
|
|
292
484
|
set.add(value);
|
|
293
485
|
}
|
|
294
486
|
|
|
@@ -298,16 +490,65 @@ export class ProtoModel {
|
|
|
298
490
|
return value;
|
|
299
491
|
}
|
|
300
492
|
|
|
493
|
+
getSeqFactory() {
|
|
494
|
+
this.seqFactory ??= new SeqFactory(this.manager, this);
|
|
495
|
+
return this.seqFactory;
|
|
496
|
+
}
|
|
497
|
+
|
|
498
|
+
getCharFactory() {
|
|
499
|
+
this.charFactory ??= new CharFactory(this.manager);
|
|
500
|
+
return this.charFactory;
|
|
501
|
+
}
|
|
502
|
+
|
|
301
503
|
registerValue(value: number) {
|
|
302
|
-
const
|
|
504
|
+
const manager = this.manager;
|
|
505
|
+
const sort = manager.sorts[value];
|
|
506
|
+
if (this.charFactory !== undefined && manager.isCharSort(sort)) {
|
|
507
|
+
this.charFactory.registerValue(manager.getChar(value));
|
|
508
|
+
return;
|
|
509
|
+
}
|
|
510
|
+
if (this.seqFactory !== undefined && manager.getSortFamily(sort) === FAMILY_SEQ) {
|
|
511
|
+
this.seqFactory.registerValue(value);
|
|
512
|
+
return;
|
|
513
|
+
}
|
|
303
514
|
if (sort !== SORT_BOOL) this.addValue(sort, value);
|
|
304
515
|
}
|
|
305
516
|
|
|
306
517
|
getSomeValue(sort: number): number {
|
|
307
518
|
const manager = this.manager;
|
|
519
|
+
if (this.charFactory !== undefined && manager.isCharSort(sort))
|
|
520
|
+
return manager.mkChar(this.charFactory.getSomeValue());
|
|
521
|
+
if (
|
|
522
|
+
manager.isFpSort(sort) ||
|
|
523
|
+
manager.isRmSort(sort) ||
|
|
524
|
+
manager.getSortFamily(sort) === FAMILY_SEQ ||
|
|
525
|
+
manager.isCharSort(sort)
|
|
526
|
+
)
|
|
527
|
+
return getManagerSomeValue(manager, sort);
|
|
528
|
+
if (this.isFinal) {
|
|
529
|
+
const first = manager.isUninterpretedSort(sort)
|
|
530
|
+
? (this.universes.get(sort)?.items[0] ??
|
|
531
|
+
this.values.get(sort)?.[Symbol.iterator]().next().value)
|
|
532
|
+
: undefined;
|
|
533
|
+
return first ?? getManagerSomeValue(manager, sort);
|
|
534
|
+
}
|
|
308
535
|
if (sort === SORT_BOOL)
|
|
309
536
|
return this.boolRandom.next() % 2 === 0 ? manager.falseExpr : manager.trueExpr;
|
|
310
537
|
const set = this.values.get(sort);
|
|
538
|
+
if (manager.isDatatypeSort(sort)) {
|
|
539
|
+
if (set !== undefined && set.size > 0) {
|
|
540
|
+
const first = set[Symbol.iterator]().next();
|
|
541
|
+
if (first.done !== true) return first.value;
|
|
542
|
+
}
|
|
543
|
+
const constructor = getNonRecConstructor(manager, sort);
|
|
544
|
+
const value = manager.mkApp(
|
|
545
|
+
constructor,
|
|
546
|
+
manager.funcDecls[constructor].domain.map((argSort) => this.getSomeValue(argSort)),
|
|
547
|
+
sort,
|
|
548
|
+
);
|
|
549
|
+
this.addValue(sort, value);
|
|
550
|
+
return value;
|
|
551
|
+
}
|
|
311
552
|
if (this.finiteSorts.has(sort) && set !== undefined) {
|
|
312
553
|
const random = new RandomGen(manager.getNumAsts());
|
|
313
554
|
let count = 1;
|
|
@@ -320,21 +561,129 @@ export class ProtoModel {
|
|
|
320
561
|
}
|
|
321
562
|
if (set !== undefined && set.size > 0)
|
|
322
563
|
return set[Symbol.iterator]().next().value ?? this.mkValue(0, sort);
|
|
564
|
+
if (manager.isArraySort(sort)) {
|
|
565
|
+
const array = this.mkArrayInterp(sort);
|
|
566
|
+
array.interp.setElse(this.getSomeValue(manager.getArrayRange(sort)));
|
|
567
|
+
return array.value;
|
|
568
|
+
}
|
|
323
569
|
return this.mkValue(0, sort);
|
|
324
570
|
}
|
|
325
571
|
|
|
572
|
+
// array_factory::mk_array_interp: as-array of a fresh function, whose interpretation the caller
|
|
573
|
+
// fills in.
|
|
574
|
+
private mkArrayInterp(sort: number) {
|
|
575
|
+
const manager = this.manager;
|
|
576
|
+
const domain = manager.getSortParameters(sort).slice(0, -1);
|
|
577
|
+
const decl = manager.mkFreshFuncDecl(null, domain, manager.getArrayRange(sort));
|
|
578
|
+
const interp = new FuncInterp(manager, domain.length);
|
|
579
|
+
this.registerFunc(decl, interp);
|
|
580
|
+
const value = mkAsArray(manager, decl);
|
|
581
|
+
this.addValue(sort, value);
|
|
582
|
+
return { value, interp };
|
|
583
|
+
}
|
|
584
|
+
|
|
585
|
+
// array_factory::get_fresh_value. Z3 falls back to two fresh indexes when the range has no fresh
|
|
586
|
+
// value; that case is left to the caller as a failure.
|
|
587
|
+
private getFreshArrayValue(sort: number) {
|
|
588
|
+
const manager = this.manager;
|
|
589
|
+
if (this.getValueSet(sort).size === 0) return this.getSomeValue(sort);
|
|
590
|
+
const range = manager.getArrayRange(sort);
|
|
591
|
+
if (this.freshArrayRanges.includes(range)) return null;
|
|
592
|
+
this.freshArrayRanges.push(range);
|
|
593
|
+
const rangeValue = this.getFreshValue(range);
|
|
594
|
+
this.freshArrayRanges.pop();
|
|
595
|
+
if (rangeValue === null) return null;
|
|
596
|
+
const array = this.mkArrayInterp(sort);
|
|
597
|
+
array.interp.setElse(rangeValue);
|
|
598
|
+
return array.value;
|
|
599
|
+
}
|
|
600
|
+
|
|
601
|
+
private getFreshRecursiveValue(sort: number) {
|
|
602
|
+
const set = this.getValueSet(sort);
|
|
603
|
+
const enumeration = this.freshEnumerations.get(sort) ?? this.mkTermEnumeration(sort);
|
|
604
|
+
this.freshEnumerations.set(sort, enumeration);
|
|
605
|
+
for (let term = enumeration.current; term !== null; term = enumeration.current) {
|
|
606
|
+
enumeration.advance();
|
|
607
|
+
if (!set.has(term)) {
|
|
608
|
+
this.addValue(sort, term);
|
|
609
|
+
return term;
|
|
610
|
+
}
|
|
611
|
+
}
|
|
612
|
+
return null;
|
|
613
|
+
}
|
|
614
|
+
|
|
615
|
+
private mkTermEnumeration(sort: number) {
|
|
616
|
+
const manager = this.manager;
|
|
617
|
+
const constructors: number[] = [];
|
|
618
|
+
const visited = new Set([sort]);
|
|
619
|
+
const todo = [sort];
|
|
620
|
+
for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
|
|
621
|
+
const nested = manager.isDatatypeSort(current)
|
|
622
|
+
? getDatatypeConstructors(manager, current).flatMap((constructor) => {
|
|
623
|
+
constructors.push(constructor);
|
|
624
|
+
return manager.funcDecls[constructor].domain;
|
|
625
|
+
})
|
|
626
|
+
: [];
|
|
627
|
+
for (const next of [...nested, ...manager.getSortParameters(current)]) {
|
|
628
|
+
if (visited.has(next)) continue;
|
|
629
|
+
visited.add(next);
|
|
630
|
+
todo.push(next);
|
|
631
|
+
}
|
|
632
|
+
}
|
|
633
|
+
return new TermEnumeration(
|
|
634
|
+
manager,
|
|
635
|
+
[...new Set(constructors)],
|
|
636
|
+
sort,
|
|
637
|
+
(argSort) => this.getSomeValue(argSort),
|
|
638
|
+
(term) => this.enumeratedTerms.push(term),
|
|
639
|
+
);
|
|
640
|
+
}
|
|
641
|
+
|
|
642
|
+
private getFreshDatatypeValue(sort: number): number | null {
|
|
643
|
+
const manager = this.manager;
|
|
644
|
+
if (isRecursiveDatatype(manager, sort)) return this.getFreshRecursiveValue(sort);
|
|
645
|
+
const set = this.getValueSet(sort);
|
|
646
|
+
for (const constructor of getDatatypeConstructors(manager, sort)) {
|
|
647
|
+
let isFreshArgFound = false;
|
|
648
|
+
const args = manager.funcDecls[constructor].domain.map((argSort) => {
|
|
649
|
+
const fresh = isFreshArgFound ? null : this.getFreshValue(argSort);
|
|
650
|
+
if (fresh === null) return this.getSomeValue(argSort);
|
|
651
|
+
isFreshArgFound = true;
|
|
652
|
+
return fresh;
|
|
653
|
+
});
|
|
654
|
+
const value = manager.mkApp(constructor, args, sort);
|
|
655
|
+
if (!set.has(value)) {
|
|
656
|
+
this.addValue(sort, value);
|
|
657
|
+
return value;
|
|
658
|
+
}
|
|
659
|
+
}
|
|
660
|
+
return set.size === 0 ? this.getSomeValue(sort) : null;
|
|
661
|
+
}
|
|
662
|
+
|
|
326
663
|
getFreshValue(sort: number): number | null {
|
|
327
664
|
if (sort === SORT_BOOL || this.finiteSorts.has(sort)) return null;
|
|
665
|
+
if (this.charFactory !== undefined && this.manager.isCharSort(sort))
|
|
666
|
+
return this.manager.mkChar(this.charFactory.getFreshValue());
|
|
667
|
+
if (this.seqFactory !== undefined && this.manager.getSortFamily(sort) === FAMILY_SEQ)
|
|
668
|
+
return this.seqFactory.getFreshValue(sort);
|
|
669
|
+
if (this.manager.isFpSort(sort) || this.manager.isRmSort(sort))
|
|
670
|
+
return getManagerSomeValue(this.manager, sort);
|
|
671
|
+
if (this.manager.isDatatypeSort(sort)) return this.getFreshDatatypeValue(sort);
|
|
672
|
+
if (this.manager.isArraySort(sort)) return this.getFreshArrayValue(sort);
|
|
328
673
|
const set = this.getValueSet(sort);
|
|
329
|
-
|
|
674
|
+
const start = this.nextValue.get(sort) ?? 0;
|
|
675
|
+
const manager = this.manager;
|
|
676
|
+
const maxSize =
|
|
677
|
+
manager.isBvSort(sort) && manager.getBvSize(sort) < 32 ? 2 ** manager.getBvSize(sort) : -1;
|
|
678
|
+
let next = start;
|
|
330
679
|
for (;;) {
|
|
331
680
|
const value = this.mkIndexedValue(next, sort);
|
|
681
|
+
const isNew = !set.has(value);
|
|
682
|
+
if (isNew) this.addValue(sort, value);
|
|
332
683
|
next++;
|
|
333
|
-
|
|
334
|
-
|
|
335
|
-
|
|
336
|
-
return value;
|
|
337
|
-
}
|
|
684
|
+
this.nextValue.set(sort, next);
|
|
685
|
+
if (maxSize !== -1 && next > maxSize + start) return null;
|
|
686
|
+
if (isNew) return value;
|
|
338
687
|
}
|
|
339
688
|
}
|
|
340
689
|
|
|
@@ -349,14 +698,212 @@ export class ProtoModel {
|
|
|
349
698
|
return this.manager.isUninterpretedSort(sort) && this.finiteSorts.has(sort);
|
|
350
699
|
}
|
|
351
700
|
|
|
701
|
+
getConstDecls(): readonly number[] {
|
|
702
|
+
return this.constDecls;
|
|
703
|
+
}
|
|
704
|
+
|
|
705
|
+
getFuncDecls(): readonly number[] {
|
|
706
|
+
return this.funcDecls;
|
|
707
|
+
}
|
|
708
|
+
|
|
709
|
+
getUninterpretedSorts() {
|
|
710
|
+
return [...this.values.keys()].filter((sort) => this.manager.isUninterpretedSort(sort));
|
|
711
|
+
}
|
|
712
|
+
|
|
713
|
+
// A registered universe keeps its order, as model::get_universe does.
|
|
352
714
|
getKnownUniverse(sort: number): number[] {
|
|
353
|
-
return [...(this.values.get(sort) ?? [])];
|
|
715
|
+
return [...(this.universes.get(sort)?.items ?? this.values.get(sort) ?? [])];
|
|
354
716
|
}
|
|
355
717
|
|
|
356
718
|
compress() {
|
|
357
719
|
for (const decl of this.funcDecls) this.funcInterps.get(decl)?.compress();
|
|
358
720
|
}
|
|
359
721
|
|
|
722
|
+
// model::compress, which get-model and get-value apply, unlike the compress of a proto_model: it
|
|
723
|
+
// inlines the skolem functions and the arrays that the other interpretations use, and drops the
|
|
724
|
+
// skolem declarations that none uses.
|
|
725
|
+
compact() {
|
|
726
|
+
if (this.isCompact) return;
|
|
727
|
+
const manager = this.manager;
|
|
728
|
+
const getHash = (decl: number) => manager.getDeclHash(decl);
|
|
729
|
+
for (;;) {
|
|
730
|
+
const sort = new DeclTopSort();
|
|
731
|
+
const occurCounts = new Map<number, number>();
|
|
732
|
+
const collectDeps = (decl: number, exprs: number[]) => {
|
|
733
|
+
const deps = new ObjHashtable(getHash);
|
|
734
|
+
for (const expr of exprs)
|
|
735
|
+
forEachExpr(manager, expr, (term) => {
|
|
736
|
+
if (manager.kinds[term] !== KIND_APP) return;
|
|
737
|
+
const termDecl = manager.decls[term];
|
|
738
|
+
const used = isAsArray(manager, termDecl)
|
|
739
|
+
? manager.funcDecls[termDecl].parameters[0]
|
|
740
|
+
: termDecl;
|
|
741
|
+
if (!this.constInterps.has(used) && !this.funcInterps.has(used)) return;
|
|
742
|
+
deps.add(used);
|
|
743
|
+
occurCounts.set(used, (occurCounts.get(used) ?? 0) + 1);
|
|
744
|
+
});
|
|
745
|
+
sort.insert(decl, deps);
|
|
746
|
+
};
|
|
747
|
+
for (const [decl, interp] of this.funcInterps) {
|
|
748
|
+
if (manager.recFunDefs.has(decl)) continue;
|
|
749
|
+
interp.compress();
|
|
750
|
+
collectDeps(decl, [
|
|
751
|
+
...(interp.elseExpr === null ? [] : [interp.elseExpr]),
|
|
752
|
+
...interp.entries.flatMap((entry) => [...entry.args, entry.result]),
|
|
753
|
+
]);
|
|
754
|
+
}
|
|
755
|
+
for (const [decl, value] of this.constInterps)
|
|
756
|
+
if (!manager.recFunDefs.has(decl) && !manager.macros.has(decl)) collectDeps(decl, [value]);
|
|
757
|
+
sort.sort();
|
|
758
|
+
const rewriter = new Rewriter(manager, TACTIC_REWRITER_OPTIONS);
|
|
759
|
+
for (const decl of sort.sorted) {
|
|
760
|
+
const partition = sort.partitions.get(decl) as number;
|
|
761
|
+
const cleanup = (expr: number) =>
|
|
762
|
+
this.compactExpr(rewriter, expr, partition, sort.partitions, occurCounts);
|
|
763
|
+
const value = this.constInterps.get(decl);
|
|
764
|
+
if (value !== undefined) {
|
|
765
|
+
const cleaned = cleanup(value);
|
|
766
|
+
if (cleaned !== value) this.registerConst(decl, cleaned);
|
|
767
|
+
manager.decRef(cleaned);
|
|
768
|
+
continue;
|
|
769
|
+
}
|
|
770
|
+
const interp = this.funcInterps.get(decl);
|
|
771
|
+
if (interp === undefined) continue;
|
|
772
|
+
if (interp.elseExpr !== null) {
|
|
773
|
+
const cleaned = cleanup(interp.elseExpr);
|
|
774
|
+
interp.setElse(cleaned);
|
|
775
|
+
manager.decRef(cleaned);
|
|
776
|
+
}
|
|
777
|
+
for (const entry of interp.entries) {
|
|
778
|
+
const cleaned = cleanup(entry.result);
|
|
779
|
+
if (cleaned !== entry.result) interp.insertEntry(entry.args, cleaned);
|
|
780
|
+
manager.decRef(cleaned);
|
|
781
|
+
}
|
|
782
|
+
}
|
|
783
|
+
rewriter.release();
|
|
784
|
+
const occurrences = new Map<number, number>();
|
|
785
|
+
const collectOccs = (expr: number) => {
|
|
786
|
+
const decls = new Set<number>();
|
|
787
|
+
forEachExpr(manager, expr, (term) => {
|
|
788
|
+
if (manager.kinds[term] !== KIND_APP) return;
|
|
789
|
+
const termDecl = manager.decls[term];
|
|
790
|
+
decls.add(termDecl);
|
|
791
|
+
if (isAsArray(manager, termDecl) || isArrayMap(manager, termDecl))
|
|
792
|
+
decls.add(manager.funcDecls[termDecl].parameters[0]);
|
|
793
|
+
});
|
|
794
|
+
for (const decl of decls) occurrences.set(decl, (occurrences.get(decl) ?? 0) + 1);
|
|
795
|
+
};
|
|
796
|
+
for (const decl of sort.sorted) {
|
|
797
|
+
const value = this.constInterps.get(decl);
|
|
798
|
+
const interp = this.funcInterps.get(decl);
|
|
799
|
+
if (value !== undefined) collectOccs(value);
|
|
800
|
+
else if (interp !== undefined) {
|
|
801
|
+
if (interp.elseExpr !== null) collectOccs(interp.elseExpr);
|
|
802
|
+
for (const entry of interp.entries) {
|
|
803
|
+
collectOccs(entry.result);
|
|
804
|
+
for (const arg of entry.args) collectOccs(arg);
|
|
805
|
+
}
|
|
806
|
+
}
|
|
807
|
+
}
|
|
808
|
+
const removed = sort.sorted.filter(
|
|
809
|
+
(decl) => manager.funcDecls[decl].isSkolem && !occurrences.has(decl),
|
|
810
|
+
);
|
|
811
|
+
for (const decl of removed) this.unregisterDecl(decl);
|
|
812
|
+
if (removed.length === 0) break;
|
|
813
|
+
}
|
|
814
|
+
this.isCompact = true;
|
|
815
|
+
}
|
|
816
|
+
|
|
817
|
+
// can_inline_def: an interpretation that more than one other uses is inlined when it is small.
|
|
818
|
+
private canInlineDef(decl: number, occurCounts: Map<number, number>) {
|
|
819
|
+
if ((occurCounts.get(decl) ?? 0) <= 1) return true;
|
|
820
|
+
const interp = this.funcInterps.get(decl);
|
|
821
|
+
if (interp === undefined || interp.elseExpr === null) return false;
|
|
822
|
+
const subterms = new Set<number>();
|
|
823
|
+
const todo = [interp.elseExpr];
|
|
824
|
+
while (todo.length > 0) {
|
|
825
|
+
if (interp.entries.length + subterms.size > 8) return false;
|
|
826
|
+
const expr = todo.pop() as number;
|
|
827
|
+
if (subterms.has(expr)) continue;
|
|
828
|
+
subterms.add(expr);
|
|
829
|
+
if (this.manager.kinds[expr] === KIND_APP) todo.push(...this.manager.getArgs(expr));
|
|
830
|
+
else if (this.manager.kinds[expr] === KIND_QUANTIFIER)
|
|
831
|
+
todo.push(this.manager.getQuantifier(expr).body);
|
|
832
|
+
}
|
|
833
|
+
return true;
|
|
834
|
+
}
|
|
835
|
+
|
|
836
|
+
// model::cleanup_expr: the result comes with a reference, which the caller releases.
|
|
837
|
+
private compactExpr(
|
|
838
|
+
rewriter: Rewriter,
|
|
839
|
+
expr: number,
|
|
840
|
+
partition: number,
|
|
841
|
+
partitions: Map<number, number>,
|
|
842
|
+
occurCounts: Map<number, number>,
|
|
843
|
+
) {
|
|
844
|
+
const manager = this.manager;
|
|
845
|
+
const trail = new RefVector(manager);
|
|
846
|
+
const cache = new Map<number, number>();
|
|
847
|
+
const todo = [expr];
|
|
848
|
+
while (todo.length > 0) {
|
|
849
|
+
const current = todo[todo.length - 1];
|
|
850
|
+
// A numeral carries its value, so the rewriter keeps every constant as it is.
|
|
851
|
+
if (
|
|
852
|
+
manager.kinds[current] !== KIND_APP ||
|
|
853
|
+
(manager.getNumArgs(current) === 0 && !isAsArray(manager, manager.decls[current]))
|
|
854
|
+
) {
|
|
855
|
+
todo.pop();
|
|
856
|
+
cache.set(current, current);
|
|
857
|
+
continue;
|
|
858
|
+
}
|
|
859
|
+
const numTodo = todo.length;
|
|
860
|
+
for (let index = 0; index < manager.getNumArgs(current); index++) {
|
|
861
|
+
const arg = manager.getArg(current, index);
|
|
862
|
+
if (!cache.has(arg)) todo.push(arg);
|
|
863
|
+
}
|
|
864
|
+
if (todo.length > numTodo) continue;
|
|
865
|
+
todo.pop();
|
|
866
|
+
const decl = manager.decls[current];
|
|
867
|
+
const funcDecl = manager.funcDecls[decl];
|
|
868
|
+
const args = manager.mapArgs(current, (arg) => cache.get(arg) as number);
|
|
869
|
+
const arrayDecl = isAsArray(manager, decl) ? funcDecl.parameters[0] : -1;
|
|
870
|
+
const interp = this.funcInterps.get(arrayDecl === -1 ? decl : arrayDecl);
|
|
871
|
+
const result = manager.withTemporaries(() => {
|
|
872
|
+
if (arrayDecl !== -1 && interp !== undefined && this.canInlineDef(arrayDecl, occurCounts)) {
|
|
873
|
+
const arrayInterp = interp.getArrayInterp(arrayDecl);
|
|
874
|
+
if (arrayInterp !== undefined) return arrayInterp;
|
|
875
|
+
}
|
|
876
|
+
if (
|
|
877
|
+
arrayDecl === -1 &&
|
|
878
|
+
funcDecl.isSkolem &&
|
|
879
|
+
interp !== undefined &&
|
|
880
|
+
this.canInlineDef(decl, occurCounts) &&
|
|
881
|
+
interp.getInterp() !== null &&
|
|
882
|
+
partitions.get(decl) !== partition
|
|
883
|
+
) {
|
|
884
|
+
const subst = new VarSubst(manager, false);
|
|
885
|
+
const substituted = subst.apply(interp.getInterp() as number, args);
|
|
886
|
+
subst.release();
|
|
887
|
+
manager.releaseLater(substituted);
|
|
888
|
+
return substituted;
|
|
889
|
+
}
|
|
890
|
+
if (funcDecl.family === FAMILY_BV && funcDecl.op === OP_BIT2BOOL) {
|
|
891
|
+
const index = funcDecl.parameters[0];
|
|
892
|
+
return manager.mkEq(
|
|
893
|
+
mkBvApp(manager, OP_EXTRACT, [args[0]], [index, index]),
|
|
894
|
+
manager.mkBvNumeral(1n, 1),
|
|
895
|
+
);
|
|
896
|
+
}
|
|
897
|
+
return rewriter.mkApp(decl, args, manager.sorts[current]);
|
|
898
|
+
});
|
|
899
|
+
trail.pushOwned(result);
|
|
900
|
+
cache.set(current, result);
|
|
901
|
+
}
|
|
902
|
+
const result = rewriter.rewrite(cache.get(expr) as number);
|
|
903
|
+
trail.reset();
|
|
904
|
+
return result;
|
|
905
|
+
}
|
|
906
|
+
|
|
360
907
|
completePartialFunc(decl: number, isUsingFresh: boolean) {
|
|
361
908
|
const interp = this.funcInterps.get(decl);
|
|
362
909
|
if (interp === undefined || !interp.isPartial()) return;
|
|
@@ -438,7 +985,8 @@ export class ProtoModel {
|
|
|
438
985
|
trail.reset();
|
|
439
986
|
}
|
|
440
987
|
|
|
441
|
-
|
|
988
|
+
// The last constant takes the place of a removed one.
|
|
989
|
+
unregisterDecl(decl: number) {
|
|
442
990
|
const value = this.constInterps.get(decl);
|
|
443
991
|
if (value !== undefined) {
|
|
444
992
|
const index = this.constDecls.indexOf(decl);
|
|
@@ -470,8 +1018,12 @@ export class ProtoModel {
|
|
|
470
1018
|
private release() {
|
|
471
1019
|
this.rewriter.release();
|
|
472
1020
|
this.evaluator.release();
|
|
1021
|
+
for (const universe of this.universes.values()) universe.reset();
|
|
473
1022
|
this.userSortValues.reset();
|
|
474
1023
|
this.arithValues.reset();
|
|
1024
|
+
this.bvValues.reset();
|
|
1025
|
+
this.datatypeValues.reset();
|
|
1026
|
+
this.enumeratedTerms.reset();
|
|
475
1027
|
for (const entry of this.constInterps) {
|
|
476
1028
|
this.manager.decDeclRef(entry[0]);
|
|
477
1029
|
this.manager.decRef(entry[1]);
|
|
@@ -482,8 +1034,22 @@ export class ProtoModel {
|
|
|
482
1034
|
}
|
|
483
1035
|
}
|
|
484
1036
|
|
|
1037
|
+
copy() {
|
|
1038
|
+
const model = new ProtoModel(this.manager);
|
|
1039
|
+
model.isFinal = this.isFinal;
|
|
1040
|
+
for (const decl of this.constDecls)
|
|
1041
|
+
model.registerConst(decl, this.constInterps.get(decl) as number);
|
|
1042
|
+
for (const decl of this.funcDecls)
|
|
1043
|
+
model.registerFunc(decl, (this.funcInterps.get(decl) as FuncInterp).copy());
|
|
1044
|
+
for (const sort of this.getUninterpretedSorts())
|
|
1045
|
+
for (const value of this.getKnownUniverse(sort)) model.registerValue(value);
|
|
1046
|
+
for (const entry of this.universes) model.registerUsort(entry[0], entry[1].items);
|
|
1047
|
+
return model;
|
|
1048
|
+
}
|
|
1049
|
+
|
|
485
1050
|
mkModel() {
|
|
486
1051
|
const model = new ProtoModel(this.manager);
|
|
1052
|
+
model.isFinal = true;
|
|
487
1053
|
for (const entry of this.constInterps) model.registerConst(entry[0], entry[1]);
|
|
488
1054
|
for (const entry of this.funcInterps) {
|
|
489
1055
|
model.registerFunc(entry[0], entry[1]);
|
|
@@ -493,6 +1059,7 @@ export class ProtoModel {
|
|
|
493
1059
|
this.funcDecls = [];
|
|
494
1060
|
for (const entry of this.values)
|
|
495
1061
|
if (!isArithSort(entry[0])) for (const value of entry[1]) model.registerValue(value);
|
|
1062
|
+
for (const entry of this.universes) model.registerUsort(entry[0], entry[1].items);
|
|
496
1063
|
return model;
|
|
497
1064
|
}
|
|
498
1065
|
|
|
@@ -500,3 +1067,69 @@ export class ProtoModel {
|
|
|
500
1067
|
return this.constInterps.get(decl) ?? this.getSomeValue(this.manager.funcDecls[decl].range);
|
|
501
1068
|
}
|
|
502
1069
|
}
|
|
1070
|
+
|
|
1071
|
+
const isAsArray = (manager: AstManager, decl: number) =>
|
|
1072
|
+
manager.funcDecls[decl].family === FAMILY_ARRAY && manager.funcDecls[decl].op === OP_AS_ARRAY;
|
|
1073
|
+
|
|
1074
|
+
const isArrayMap = (manager: AstManager, decl: number) =>
|
|
1075
|
+
manager.funcDecls[decl].family === FAMILY_ARRAY && manager.funcDecls[decl].op === OP_ARRAY_MAP;
|
|
1076
|
+
|
|
1077
|
+
// for_each_expr: each distinct subterm, after its arguments.
|
|
1078
|
+
const forEachExpr = (manager: AstManager, expr: number, visit: (term: number) => void) => {
|
|
1079
|
+
const visited = new Set<number>();
|
|
1080
|
+
const walk = (term: number) => {
|
|
1081
|
+
if (visited.has(term)) return;
|
|
1082
|
+
visited.add(term);
|
|
1083
|
+
if (manager.kinds[term] === KIND_APP) for (const arg of manager.getArgs(term)) walk(arg);
|
|
1084
|
+
else if (manager.kinds[term] === KIND_QUANTIFIER) walk(manager.getQuantifier(term).body);
|
|
1085
|
+
visit(term);
|
|
1086
|
+
};
|
|
1087
|
+
walk(expr);
|
|
1088
|
+
};
|
|
1089
|
+
|
|
1090
|
+
// top_sort: each declaration comes after the ones its interpretation uses. Like Z3's, it never pops
|
|
1091
|
+
// the path stack, so the declarations of a cycle get partitions of their own.
|
|
1092
|
+
class DeclTopSort {
|
|
1093
|
+
readonly sorted: number[] = [];
|
|
1094
|
+
readonly partitions = new Map<number, number>();
|
|
1095
|
+
private deps = new Map<number, ObjHashtable>();
|
|
1096
|
+
private dfsNums = new Map<number, number>();
|
|
1097
|
+
private stackS: number[] = [];
|
|
1098
|
+
private stackP: number[] = [];
|
|
1099
|
+
|
|
1100
|
+
insert(decl: number, deps: ObjHashtable) {
|
|
1101
|
+
this.deps.set(decl, deps);
|
|
1102
|
+
}
|
|
1103
|
+
|
|
1104
|
+
sort() {
|
|
1105
|
+
for (const decl of this.deps.keys()) this.traverse(decl);
|
|
1106
|
+
}
|
|
1107
|
+
|
|
1108
|
+
private traverse(decl: number) {
|
|
1109
|
+
const dfsNum = this.dfsNums.get(decl);
|
|
1110
|
+
if (dfsNum !== undefined) {
|
|
1111
|
+
if (this.partitions.has(decl)) return;
|
|
1112
|
+
for (
|
|
1113
|
+
let top = this.stackP.at(-1);
|
|
1114
|
+
top !== undefined && (this.partitions.get(top) ?? -1) > dfsNum;
|
|
1115
|
+
top = this.stackP.at(-1)
|
|
1116
|
+
)
|
|
1117
|
+
this.stackP.pop();
|
|
1118
|
+
return;
|
|
1119
|
+
}
|
|
1120
|
+
const deps = this.deps.get(decl);
|
|
1121
|
+
if (deps === undefined) return;
|
|
1122
|
+
this.dfsNums.set(decl, this.dfsNums.size);
|
|
1123
|
+
this.stackS.push(decl);
|
|
1124
|
+
this.stackP.push(decl);
|
|
1125
|
+
for (const dep of deps) this.traverse(dep);
|
|
1126
|
+
if (decl !== this.stackP.at(-1)) return;
|
|
1127
|
+
const partition = this.sorted.length;
|
|
1128
|
+
for (let top = this.stackS.pop(); top !== undefined; top = this.stackS.pop()) {
|
|
1129
|
+
this.sorted.push(top);
|
|
1130
|
+
this.partitions.set(top, partition);
|
|
1131
|
+
if (top === decl) break;
|
|
1132
|
+
}
|
|
1133
|
+
this.stackP.pop();
|
|
1134
|
+
}
|
|
1135
|
+
}
|