tla-ts 0.0.9 → 0.0.10-dev.06b481ee0
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 +30 -1
- package/dist/compile.cjs +23 -0
- package/dist/compile.js +23 -0
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +48 -44
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +122 -12
- package/dist/index.d.ts +122 -12
- 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 +2746 -410
- package/dist/prove.js +2745 -409
- package/dist/run.cjs +144 -31
- package/dist/run.js +144 -31
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +134 -104
- package/dist/transfer.js +134 -104
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +3 -1
- package/src/ast.ts +56 -60
- package/src/bags.ts +128 -110
- package/src/builtins.ts +31 -77
- package/src/bundled-modules.ts +1 -8
- package/src/check-failure.ts +118 -0
- package/src/check-trace.ts +320 -0
- package/src/check.ts +1156 -888
- package/src/cli/options.ts +12 -32
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +100 -0
- package/src/cli/shared.ts +19 -12
- package/src/cli/tlapm.ts +433 -82
- package/src/cli/tlc-arguments.ts +652 -0
- package/src/cli/tlc-output.ts +701 -0
- package/src/cli/tlc-usage.ts +360 -0
- package/src/cli/tlc.ts +330 -659
- package/src/cli/typescript.ts +23 -0
- package/src/cli/xml-exporter.ts +27 -49
- package/src/cli.ts +0 -1
- package/src/codegen.ts +217 -82
- package/src/config.ts +140 -109
- package/src/coverage.ts +1019 -0
- package/src/dependencies.ts +101 -66
- package/src/dfid.ts +683 -0
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +263 -370
- package/src/errors.ts +107 -57
- package/src/evaluate.ts +898 -369
- package/src/exit-codes.ts +63 -13
- package/src/fingerprints.ts +75 -11
- package/src/index.ts +3 -0
- package/src/instances.ts +137 -22
- package/src/java-hash.ts +21 -0
- package/src/java-overrides.ts +6 -21
- package/src/json-reader.ts +455 -0
- package/src/json.ts +252 -139
- package/src/levels.ts +231 -154
- package/src/lexer.ts +83 -101
- package/src/liveness-checker.ts +743 -322
- package/src/liveness.ts +230 -133
- package/src/obligations/action.ts +17 -44
- package/src/obligations/anonymize.ts +120 -95
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +37 -26
- package/src/obligations/format.ts +0 -10
- package/src/obligations/generate.ts +66 -64
- package/src/obligations/index.ts +39 -20
- package/src/obligations/levels.ts +27 -18
- package/src/obligations/module.ts +28 -55
- package/src/obligations/normalize.ts +31 -41
- package/src/obligations/operators.ts +0 -3
- package/src/obligations/pragma.ts +52 -24
- package/src/obligations/printer.ts +94 -63
- package/src/obligations/proof.ts +3 -6
- package/src/obligations/regroup.ts +0 -5
- package/src/obligations/simplify.ts +57 -63
- package/src/obligations/source.ts +121 -95
- package/src/obligations/subexpression.ts +49 -28
- package/src/obligations/substitution.ts +1 -5
- package/src/obligations/temporal.ts +12 -20
- package/src/obligations/tuples.ts +2 -10
- package/src/parallel-worker.ts +36 -60
- package/src/parallel.ts +64 -73
- package/src/parser.ts +1184 -531
- package/src/pcal/ast.ts +53 -86
- package/src/pcal/parse.ts +144 -219
- package/src/pcal/tokenize.ts +91 -131
- package/src/pcal/translate.ts +83 -130
- package/src/pcal/validate.ts +48 -68
- package/src/pretty-print.ts +7 -8
- package/src/prover/decide-pool.ts +8 -13
- package/src/prover/deciders.ts +12 -13
- package/src/prover/first-order.ts +0 -11
- package/src/prover/isabelle/decide.ts +3 -31
- package/src/prover/isabelle/encode.ts +82 -64
- 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 +262 -117
- package/src/prover/isabelle/isar/method.ts +510 -226
- package/src/prover/isabelle/isar/proof.ts +570 -23
- package/src/prover/isabelle/isar/rule-cases.ts +226 -0
- package/src/prover/isabelle/isar/theory.ts +488 -88
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +99 -38
- package/src/prover/isabelle/provers/blast/blast.ts +16 -105
- package/src/prover/isabelle/provers/blast/branch.ts +0 -33
- package/src/prover/isabelle/provers/blast/prove.ts +0 -36
- package/src/prover/isabelle/provers/blast/rules.ts +5 -45
- package/src/prover/isabelle/provers/blast/state.ts +1 -29
- package/src/prover/isabelle/provers/blast/term.ts +8 -37
- package/src/prover/isabelle/provers/clasimp.ts +1 -15
- package/src/prover/isabelle/provers/classical.ts +58 -61
- package/src/prover/isabelle/provers/hypsubst.ts +29 -54
- package/src/prover/isabelle/pure/bicompose.ts +24 -39
- package/src/prover/isabelle/pure/consts.ts +0 -8
- package/src/prover/isabelle/pure/conv.ts +2 -18
- package/src/prover/isabelle/pure/drule.ts +95 -45
- package/src/prover/isabelle/pure/envir.ts +2 -53
- package/src/prover/isabelle/pure/goal.ts +1 -9
- package/src/prover/isabelle/pure/interrupt.ts +0 -5
- package/src/prover/isabelle/pure/list.ts +0 -3
- package/src/prover/isabelle/pure/logic.ts +1 -16
- package/src/prover/isabelle/pure/name.ts +1 -10
- package/src/prover/isabelle/pure/net.ts +2 -60
- package/src/prover/isabelle/pure/object-logic.ts +15 -16
- package/src/prover/isabelle/pure/pattern.ts +1 -20
- package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
- package/src/prover/isabelle/pure/rewriter.ts +34 -77
- package/src/prover/isabelle/pure/search.ts +2 -11
- package/src/prover/isabelle/pure/seq.ts +0 -11
- package/src/prover/isabelle/pure/simplifier.ts +27 -16
- package/src/prover/isabelle/pure/table.ts +2 -33
- package/src/prover/isabelle/pure/tactic.ts +11 -23
- package/src/prover/isabelle/pure/tactical.ts +47 -48
- package/src/prover/isabelle/pure/term-ord.ts +1 -7
- package/src/prover/isabelle/pure/term.ts +4 -47
- package/src/prover/isabelle/pure/thm.ts +26 -48
- package/src/prover/isabelle/pure/type.ts +1 -16
- package/src/prover/isabelle/pure/unify.ts +19 -31
- package/src/prover/isabelle/pure/variable.ts +2 -8
- package/src/prover/isabelle/tla/classical-setup.ts +17 -25
- package/src/prover/isabelle/tla/context.ts +65 -26
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +53 -32
- package/src/prover/isabelle/tla/simpdata.ts +45 -44
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
- package/src/prover/ocaml.ts +4 -7
- package/src/prover/prep/action.ts +33 -66
- package/src/prover/prep/enabled-axioms.ts +22 -20
- package/src/prover/prep/fingerprint.ts +2 -21
- package/src/prover/prep/level-comparison.ts +8 -12
- package/src/prover/prep/md5.ts +26 -31
- package/src/prover/prep/methods.ts +189 -86
- package/src/prover/prep/normalize.ts +42 -37
- package/src/prover/prove-worker.ts +0 -2
- package/src/prover/prove.ts +398 -133
- package/src/prover/ptl/decide.ts +96 -56
- package/src/prover/ptl/encode.ts +15 -38
- package/src/prover/ptl/sat.ts +24 -32
- package/src/prover/ptl/tableau.ts +40 -28
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -15
- package/src/prover/smt/context.ts +60 -32
- package/src/prover/smt/data.ts +517 -401
- package/src/prover/smt/encode.ts +155 -85
- package/src/prover/smt/extensionality.ts +5 -13
- package/src/prover/smt/flatten.ts +7 -28
- package/src/prover/smt/format.ts +33 -14
- package/src/prover/smt/instances.ts +7 -11
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1021 -658
- 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 -16
- 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 +626 -56
- 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 +319 -0
- package/src/prover/smt/solver/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +241 -99
- package/src/prover/smt/solver/ast-lt.ts +165 -21
- package/src/prover/smt/solver/ast-util.ts +160 -7
- package/src/prover/smt/solver/ast.ts +1480 -184
- package/src/prover/smt/solver/auf-solver.ts +30 -56
- package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/blast-term-ite.ts +47 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +598 -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 +127 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -10
- package/src/prover/smt/solver/cg-table.ts +39 -42
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -27
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -11
- package/src/prover/smt/solver/context.ts +600 -187
- package/src/prover/smt/solver/ctx-simplify.ts +34 -52
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -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 +93 -0
- package/src/prover/smt/solver/der.ts +39 -30
- 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 +296 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -11
- package/src/prover/smt/solver/e-matching.ts +9 -41
- package/src/prover/smt/solver/elim-bounds.ts +89 -0
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
- package/src/prover/smt/solver/enode.ts +100 -23
- 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 -5
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
- 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 +734 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -26
- package/src/prover/smt/solver/fix-dl-var.ts +147 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -9
- 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 +179 -28
- 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 -9
- package/src/prover/smt/solver/hashtable.ts +30 -23
- 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 +113 -133
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -2
- 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 -4
- package/src/prover/smt/solver/logic-tactics.ts +355 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
- package/src/prover/smt/solver/lp/constraints.ts +1 -8
- package/src/prover/smt/solver/lp/containers.ts +18 -31
- package/src/prover/smt/solver/lp/core-solver.ts +35 -37
- package/src/prover/smt/solver/lp/cross-nested.ts +4 -21
- package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
- package/src/prover/smt/solver/lp/dependency.ts +0 -5
- package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
- package/src/prover/smt/solver/lp/explanation.ts +0 -6
- package/src/prover/smt/solver/lp/gomory.ts +8 -22
- package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
- package/src/prover/smt/solver/lp/hnf.ts +10 -28
- package/src/prover/smt/solver/lp/int-cube.ts +17 -39
- package/src/prover/smt/solver/lp/int-solver.ts +3 -35
- package/src/prover/smt/solver/lp/lar-solver.ts +70 -83
- package/src/prover/smt/solver/lp/lar-term.ts +0 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +6 -16
- package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
- package/src/prover/smt/solver/lp/nex-creator.ts +7 -30
- package/src/prover/smt/solver/lp/nex.ts +2 -7
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
- package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
- package/src/prover/smt/solver/lp/nla-core.ts +92 -136
- package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
- package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
- package/src/prover/smt/solver/lp/nla-grobner.ts +177 -149
- package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
- package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
- package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
- package/src/prover/smt/solver/lp/nla-order.ts +0 -13
- package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -12
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
- package/src/prover/smt/solver/lp/nra-solver.ts +164 -147
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -5
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +61 -34
- package/src/prover/smt/solver/lp/pdd-solver.ts +74 -72
- package/src/prover/smt/solver/lp/pdd.ts +730 -358
- package/src/prover/smt/solver/lp/random-updater.ts +0 -9
- package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
- package/src/prover/smt/solver/lp/union-find.ts +5 -5
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +129 -139
- package/src/prover/smt/solver/mam-interpreter.ts +0 -21
- 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 +310 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +106 -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 +20 -63
- package/src/prover/smt/solver/model-evaluator.ts +192 -40
- package/src/prover/smt/solver/model-finder.ts +14 -32
- package/src/prover/smt/solver/model-generator.ts +104 -46
- package/src/prover/smt/solver/model-macro-solver.ts +60 -114
- 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 +382 -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 +495 -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 +214 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +359 -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 +357 -236
- package/src/prover/smt/solver/nlsat/atoms.ts +73 -54
- package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
- package/src/prover/smt/solver/nlsat/explain.ts +429 -275
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
- package/src/prover/smt/solver/nlsat/levelwise.ts +477 -344
- package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +2385 -832
- package/src/prover/smt/solver/nlsat/solver.ts +297 -156
- 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 -9
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -51
- package/src/prover/smt/solver/nlsat/upolynomial.ts +49 -109
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +112 -61
- 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 +801 -0
- package/src/prover/smt/solver/opt-nlsat.ts +386 -0
- package/src/prover/smt/solver/opt-pareto.ts +301 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +312 -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 +21 -26
- 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 +261 -79
- package/src/prover/smt/solver/probes.ts +577 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -30
- package/src/prover/smt/solver/proto-model.ts +650 -66
- package/src/prover/smt/solver/pull-quant.ts +28 -23
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/push-app-ite.ts +37 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -31
- package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
- package/src/prover/smt/solver/qe-lite.ts +41 -51
- 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 -16
- package/src/prover/smt/solver/qsat.ts +829 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +17 -74
- package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
- package/src/prover/smt/solver/quantifier-manager.ts +22 -32
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -2
- package/src/prover/smt/solver/rational.ts +45 -8
- 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 -6
- package/src/prover/smt/solver/relevancy.ts +2 -16
- package/src/prover/smt/solver/rewriter-tpl.ts +59 -135
- package/src/prover/smt/solver/rewriter.ts +507 -144
- package/src/prover/smt/solver/rlimit.ts +46 -24
- 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 +579 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +464 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +53 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +189 -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 +2107 -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 +124 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +589 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3546 -406
- package/src/prover/smt/solver/smtlib-script.ts +2134 -0
- package/src/prover/smt/solver/solve-eqs.ts +928 -0
- package/src/prover/smt/solver/solver.ts +135 -40
- package/src/prover/smt/solver/sort.ts +1 -5
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -6
- package/src/prover/smt/solver/tactic.ts +2141 -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 +1210 -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 +55 -25
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
- package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
- package/src/prover/smt/solver/theory-lra-internalize.ts +96 -53
- package/src/prover/smt/solver/theory-lra-model.ts +23 -53
- package/src/prover/smt/solver/theory-lra-propagate.ts +34 -42
- package/src/prover/smt/solver/theory-lra-state.ts +7 -28
- package/src/prover/smt/solver/theory-lra.ts +189 -9
- package/src/prover/smt/solver/theory-pb.ts +951 -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-without-terms.ts +24 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +486 -0
- package/src/prover/smt/solver/var-subst.ts +37 -39
- package/src/prover/smt/table.ts +3 -10
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +74 -48
- package/src/prover/tlapm/ocaml-marshal.ts +19 -21
- package/src/prover/tlapm/tlapm.ts +21 -20
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -2
- package/src/prover/zenon/check/check.ts +1 -11
- package/src/prover/zenon/check/definitions.ts +5 -15
- package/src/prover/zenon/check/equality.ts +0 -8
- package/src/prover/zenon/check/functions.ts +0 -4
- package/src/prover/zenon/check/keys.ts +0 -7
- package/src/prover/zenon/check/propositional.ts +0 -3
- package/src/prover/zenon/check/records.ts +1 -6
- package/src/prover/zenon/check/relations.ts +2 -14
- package/src/prover/zenon/check/rewrites.ts +2 -21
- package/src/prover/zenon/check/sets.ts +40 -61
- package/src/prover/zenon/check/terms.ts +1 -19
- package/src/prover/zenon/check/tla.ts +0 -6
- package/src/prover/zenon/decide.ts +10 -19
- package/src/prover/zenon/encode.ts +0 -9
- package/src/prover/zenon/eqrel.ts +2 -15
- package/src/prover/zenon/equality-rules.ts +24 -6
- package/src/prover/zenon/expr.ts +29 -28
- package/src/prover/zenon/index-table.ts +33 -61
- package/src/prover/zenon/isar-case.ts +9 -21
- package/src/prover/zenon/isar.ts +37 -67
- package/src/prover/zenon/limits.ts +0 -4
- package/src/prover/zenon/llproof.ts +2 -22
- package/src/prover/zenon/mltoll.ts +66 -106
- package/src/prover/zenon/node.ts +20 -15
- package/src/prover/zenon/ocaml.ts +1 -17
- package/src/prover/zenon/parse.ts +9 -13
- package/src/prover/zenon/phrase.ts +2 -14
- package/src/prover/zenon/proof.ts +0 -11
- package/src/prover/zenon/propositional-rules.ts +0 -7
- package/src/prover/zenon/rules.ts +3 -8
- package/src/prover/zenon/search.ts +11 -35
- package/src/prover/zenon/tla/functions.ts +59 -33
- package/src/prover/zenon/tla/llproof.ts +67 -78
- package/src/prover/zenon/tla/records.ts +57 -35
- package/src/prover/zenon/tla/rewrites.ts +12 -21
- package/src/prover/zenon/tla/sets.ts +88 -59
- package/src/prover/zenon/tla/terms.ts +0 -8
- package/src/prover/zenon/tla/tla.ts +66 -66
- package/src/randomization.ts +81 -35
- package/src/resolve.ts +1132 -430
- package/src/runtime.ts +33 -23
- package/src/sany/builtins.ts +11 -14
- package/src/sany/generation.ts +383 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +688 -0
- package/src/sany/generator-expressions.ts +1108 -0
- package/src/sany/generator-proofs.ts +665 -0
- package/src/sany/generator.ts +192 -2764
- package/src/sany/levels.ts +5 -35
- package/src/sany/lexer.ts +61 -80
- package/src/sany/linter.ts +0 -10
- package/src/sany/modules.ts +5 -7
- package/src/sany/nodes.ts +6 -44
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +32 -69
- package/src/sany/selectors.ts +60 -82
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +37 -120
- package/src/search.ts +913 -227
- package/src/simulate.ts +765 -0
- package/src/spec-description.ts +198 -104
- package/src/standard-definitions.ts +4 -4
- package/src/standard-modules.ts +302 -99
- package/src/state-graph.ts +52 -33
- package/src/subexpressions.ts +578 -166
- package/src/substitution-levels.ts +7 -7
- package/src/successors.ts +299 -108
- package/src/symmetry.ts +37 -28
- package/src/tableau.ts +29 -26
- package/src/tlc/fingerprint.ts +267 -79
- package/src/tlc/jar-data.ts +122 -6
- package/src/tlc/messages.ts +127 -56
- package/src/tlc/order.ts +53 -72
- package/src/tlc/random.ts +38 -49
- package/src/tlc/replay.ts +579 -230
- package/src/tlc/summary.ts +64 -60
- package/src/tlc/tlc-operators.ts +83 -47
- package/src/tlc/tlcext-operators.ts +205 -127
- package/src/tlc/trace-spec.ts +235 -0
- package/src/tlc/value-stream.ts +139 -0
- package/src/tlc/version.ts +1 -4
- package/src/trace-liveness.ts +529 -0
- package/src/transfer.ts +22 -25
- package/src/typed-tier.ts +6556 -0
- package/src/typescript/actions.ts +479 -0
- package/src/typescript/collections.ts +614 -0
- package/src/typescript/compile.ts +63 -0
- package/src/typescript/context.ts +94 -0
- package/src/typescript/emit.ts +121 -0
- package/src/typescript/expressions.ts +496 -0
- package/src/typescript/formula.ts +154 -0
- package/src/typescript/functions.ts +284 -0
- package/src/typescript/model.ts +162 -0
- package/src/typescript/names.ts +114 -0
- package/src/typescript/program.ts +48 -0
- package/src/typescript/properties.ts +139 -0
- package/src/typescript/scope.ts +112 -0
- package/src/typescript/steps.ts +167 -0
- package/src/typescript/types.ts +171 -0
- package/src/values.ts +945 -526
- package/src/worker.ts +7 -8
- package/src/prover/isabelle/isar/statement.ts +0 -57
- 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,577 @@
|
|
|
1
|
+
import { SmtParseError, SmtUnsupportedError } from "../../../errors";
|
|
2
|
+
import {
|
|
3
|
+
type AstManager,
|
|
4
|
+
FAMILY_ARITH,
|
|
5
|
+
FAMILY_ARRAY,
|
|
6
|
+
FAMILY_BASIC,
|
|
7
|
+
FAMILY_BV,
|
|
8
|
+
FAMILY_FPA,
|
|
9
|
+
FAMILY_USER,
|
|
10
|
+
KIND_APP,
|
|
11
|
+
KIND_QUANTIFIER,
|
|
12
|
+
KIND_VAR,
|
|
13
|
+
OP_ABS,
|
|
14
|
+
OP_ADD,
|
|
15
|
+
OP_ALGEBRAIC_NUM,
|
|
16
|
+
OP_BSDIV0,
|
|
17
|
+
OP_BSMOD0,
|
|
18
|
+
OP_BSREM0,
|
|
19
|
+
OP_BUDIV0,
|
|
20
|
+
OP_BUREM0,
|
|
21
|
+
OP_BV_NUM,
|
|
22
|
+
OP_CONCAT,
|
|
23
|
+
OP_DIV,
|
|
24
|
+
OP_EQ,
|
|
25
|
+
OP_EXTRACT,
|
|
26
|
+
OP_FPA_TO_REAL,
|
|
27
|
+
OP_GE,
|
|
28
|
+
OP_GT,
|
|
29
|
+
OP_IDIV,
|
|
30
|
+
OP_IS_INT,
|
|
31
|
+
OP_ITE,
|
|
32
|
+
OP_LE,
|
|
33
|
+
OP_LT,
|
|
34
|
+
OP_MOD,
|
|
35
|
+
OP_MUL,
|
|
36
|
+
OP_NUM,
|
|
37
|
+
OP_POWER,
|
|
38
|
+
OP_SUB,
|
|
39
|
+
OP_TO_INT,
|
|
40
|
+
OP_TO_REAL,
|
|
41
|
+
OP_UMINUS,
|
|
42
|
+
SORT_BOOL,
|
|
43
|
+
SORT_INT,
|
|
44
|
+
SORT_REAL,
|
|
45
|
+
} from "./ast";
|
|
46
|
+
import { getAckrBound } from "./ackr-helper";
|
|
47
|
+
import { BoundManager } from "./bound-manager";
|
|
48
|
+
import { Expr2Polynomial } from "./expr2polynomial";
|
|
49
|
+
import { PolynomialManager, PolynomialRef } from "./nlsat/polynomial";
|
|
50
|
+
import { findNonPb } from "./pb2bv-tactic";
|
|
51
|
+
import type { Goal } from "./goal";
|
|
52
|
+
import { isSymbol, type SExpr } from "./smtlib-parser";
|
|
53
|
+
|
|
54
|
+
export interface Probe {
|
|
55
|
+
(goal: Goal): number;
|
|
56
|
+
}
|
|
57
|
+
|
|
58
|
+
const forEachExpr = (goal: Goal, visit: (expr: number) => void) => {
|
|
59
|
+
const manager = goal.manager;
|
|
60
|
+
const visited = new Set<number>();
|
|
61
|
+
const todo = [...goal.forms.items].reverse();
|
|
62
|
+
for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
|
|
63
|
+
if (visited.has(expr)) continue;
|
|
64
|
+
visited.add(expr);
|
|
65
|
+
visit(expr);
|
|
66
|
+
if (manager.kinds[expr] === KIND_APP) manager.pushArgs(expr, todo);
|
|
67
|
+
else if (manager.kinds[expr] === KIND_QUANTIFIER) {
|
|
68
|
+
const data = manager.getQuantifier(expr);
|
|
69
|
+
todo.push(data.body, ...data.patterns, ...data.noPatterns);
|
|
70
|
+
}
|
|
71
|
+
}
|
|
72
|
+
};
|
|
73
|
+
|
|
74
|
+
const countExprs = (goal: Goal, isCounted: (expr: number) => boolean) => {
|
|
75
|
+
let count = 0;
|
|
76
|
+
forEachExpr(goal, (expr) => {
|
|
77
|
+
if (isCounted(expr)) count++;
|
|
78
|
+
});
|
|
79
|
+
return count;
|
|
80
|
+
};
|
|
81
|
+
|
|
82
|
+
const isNone = (goal: Goal, isFound: (expr: number) => boolean) => countExprs(goal, isFound) === 0;
|
|
83
|
+
|
|
84
|
+
const mkTest =
|
|
85
|
+
(isFound: (manager: AstManager, expr: number) => boolean): Probe =>
|
|
86
|
+
(goal) =>
|
|
87
|
+
Number(isNone(goal, (expr) => isFound(goal.manager, expr)));
|
|
88
|
+
|
|
89
|
+
const isConst = (manager: AstManager, expr: number) =>
|
|
90
|
+
manager.kinds[expr] === KIND_APP && manager.getNumArgs(expr) === 0 && !manager.isValue(expr);
|
|
91
|
+
|
|
92
|
+
const isArithSort = (sort: number) => sort === SORT_INT || sort === SORT_REAL;
|
|
93
|
+
|
|
94
|
+
const isApp = (manager: AstManager, expr: number) => manager.kinds[expr] === KIND_APP;
|
|
95
|
+
|
|
96
|
+
const isNonPropositional = (manager: AstManager, expr: number) =>
|
|
97
|
+
!isApp(manager, expr) ||
|
|
98
|
+
manager.sorts[expr] !== SORT_BOOL ||
|
|
99
|
+
(manager.getFamily(expr) !== FAMILY_BASIC && !manager.isUninterpretedConst(expr));
|
|
100
|
+
|
|
101
|
+
const BV_DIV0_OPS = [OP_BSDIV0, OP_BUDIV0, OP_BSREM0, OP_BUREM0, OP_BSMOD0];
|
|
102
|
+
|
|
103
|
+
const isNonQfbv = (manager: AstManager, expr: number) => {
|
|
104
|
+
if (!isApp(manager, expr)) return true;
|
|
105
|
+
if (manager.sorts[expr] !== SORT_BOOL && !manager.isBvSort(manager.sorts[expr])) return true;
|
|
106
|
+
const family = manager.getFamily(expr);
|
|
107
|
+
if (family === FAMILY_BASIC) return false;
|
|
108
|
+
if (family === FAMILY_BV) return BV_DIV0_OPS.includes(manager.getOp(expr));
|
|
109
|
+
return !manager.isUninterpretedConst(expr);
|
|
110
|
+
};
|
|
111
|
+
|
|
112
|
+
const isNonQfaufbv = (manager: AstManager, expr: number) => {
|
|
113
|
+
if (!isApp(manager, expr)) return true;
|
|
114
|
+
const sort = manager.sorts[expr];
|
|
115
|
+
if (sort !== SORT_BOOL && !manager.isBvSort(sort) && !manager.isArraySort(sort)) return true;
|
|
116
|
+
const family = manager.getFamily(expr);
|
|
117
|
+
return (
|
|
118
|
+
family !== FAMILY_BASIC &&
|
|
119
|
+
family !== FAMILY_BV &&
|
|
120
|
+
family !== FAMILY_ARRAY &&
|
|
121
|
+
!manager.isUninterpreted(expr)
|
|
122
|
+
);
|
|
123
|
+
};
|
|
124
|
+
|
|
125
|
+
const isNonQfufbv = (manager: AstManager, expr: number) => {
|
|
126
|
+
if (!isApp(manager, expr)) return true;
|
|
127
|
+
if (manager.sorts[expr] !== SORT_BOOL && !manager.isBvSort(manager.sorts[expr])) return true;
|
|
128
|
+
const family = manager.getFamily(expr);
|
|
129
|
+
return family !== FAMILY_BASIC && family !== FAMILY_BV && !manager.isUninterpreted(expr);
|
|
130
|
+
};
|
|
131
|
+
|
|
132
|
+
export const isQfufbv = mkTest(isNonQfufbv);
|
|
133
|
+
|
|
134
|
+
const isNonQfbvEq = (manager: AstManager, expr: number) =>
|
|
135
|
+
manager.kinds[expr] !== KIND_APP ||
|
|
136
|
+
(manager.getFamily(expr) === FAMILY_BV &&
|
|
137
|
+
![OP_BV_NUM, OP_EXTRACT, OP_CONCAT].includes(manager.getOp(expr)));
|
|
138
|
+
|
|
139
|
+
const mkNonQffp = (isLra: boolean) => (manager: AstManager, expr: number) => {
|
|
140
|
+
if (!isApp(manager, expr)) return true;
|
|
141
|
+
const sort = manager.sorts[expr];
|
|
142
|
+
if (
|
|
143
|
+
sort !== SORT_BOOL &&
|
|
144
|
+
!manager.isFpSort(sort) &&
|
|
145
|
+
!manager.isRmSort(sort) &&
|
|
146
|
+
!manager.isBvSort(sort) &&
|
|
147
|
+
sort !== SORT_REAL
|
|
148
|
+
)
|
|
149
|
+
return true;
|
|
150
|
+
const family = manager.getFamily(expr);
|
|
151
|
+
if (family === FAMILY_BASIC || family === FAMILY_FPA || family === FAMILY_BV) return false;
|
|
152
|
+
if ((isLra && family === FAMILY_ARITH) || manager.isUninterpretedConst(expr)) return false;
|
|
153
|
+
return isLra ? sort !== SORT_REAL : !(sort === SORT_REAL && manager.isNumeral(expr));
|
|
154
|
+
};
|
|
155
|
+
|
|
156
|
+
// Z3 rejects every application of the basic family before it would accept one, so the goal must not
|
|
157
|
+
// have a Boolean connective.
|
|
158
|
+
const isNonFpQfnra = (manager: AstManager, expr: number) => {
|
|
159
|
+
if (!isApp(manager, expr)) return true;
|
|
160
|
+
const family = manager.getFamily(expr);
|
|
161
|
+
const sort = manager.sorts[expr];
|
|
162
|
+
if (family === FAMILY_FPA)
|
|
163
|
+
return (
|
|
164
|
+
!manager.isFpSort(sort) && !manager.isRmSort(sort) && manager.getOp(expr) !== OP_FPA_TO_REAL
|
|
165
|
+
);
|
|
166
|
+
return (
|
|
167
|
+
family !== FAMILY_USER ||
|
|
168
|
+
(!manager.isFpSort(sort) && !manager.isRmSort(sort) && sort !== SORT_BOOL)
|
|
169
|
+
);
|
|
170
|
+
};
|
|
171
|
+
|
|
172
|
+
// Z3 builds these probes into its tactics without registering them by name. memory is registered,
|
|
173
|
+
// but it reads the megabytes Z3's allocator handed out, which the port has no counterpart for:
|
|
174
|
+
// only the port's own strategies see it, as 0, so qfnra takes the branch Z3 takes on small goals.
|
|
175
|
+
const INTERNAL_PROBES = new Map<string, Probe>([
|
|
176
|
+
["is-fp-qfnra", mkTest(isNonFpQfnra)],
|
|
177
|
+
["memory", () => 0],
|
|
178
|
+
]);
|
|
179
|
+
|
|
180
|
+
const LINEAR_OPS = [OP_LE, OP_GE, OP_LT, OP_GT, OP_ADD, OP_NUM];
|
|
181
|
+
|
|
182
|
+
const isLinearMul = (manager: AstManager, expr: number) =>
|
|
183
|
+
manager.getNumArgs(expr) === 2 && manager.isNumeral(manager.getArg(expr, 0));
|
|
184
|
+
|
|
185
|
+
const mkNonLira =
|
|
186
|
+
(isInt: boolean, isReal: boolean, isArray: boolean) => (manager: AstManager, expr: number) => {
|
|
187
|
+
if (!isApp(manager, expr)) return true;
|
|
188
|
+
const sort = manager.sorts[expr];
|
|
189
|
+
if (
|
|
190
|
+
sort !== SORT_BOOL &&
|
|
191
|
+
!(isInt && sort === SORT_INT) &&
|
|
192
|
+
!(isReal && sort === SORT_REAL) &&
|
|
193
|
+
!(isArray && manager.isArraySort(sort))
|
|
194
|
+
)
|
|
195
|
+
return true;
|
|
196
|
+
const family = manager.getFamily(expr);
|
|
197
|
+
if (family === FAMILY_BASIC || (isArray && family === FAMILY_ARRAY)) return false;
|
|
198
|
+
if (family !== FAMILY_ARITH)
|
|
199
|
+
return isArray ? !manager.isUninterpreted(expr) : !manager.isUninterpretedConst(expr);
|
|
200
|
+
const op = manager.getOp(expr);
|
|
201
|
+
if (LINEAR_OPS.includes(op)) return false;
|
|
202
|
+
if (op === OP_MUL) return !isLinearMul(manager, expr);
|
|
203
|
+
return op !== OP_TO_REAL || !isReal;
|
|
204
|
+
};
|
|
205
|
+
|
|
206
|
+
const isNonQflia = mkNonLira(true, false, false);
|
|
207
|
+
|
|
208
|
+
const isTermIte = (manager: AstManager, expr: number) =>
|
|
209
|
+
manager.getOp(expr) === OP_ITE && manager.sorts[expr] !== SORT_BOOL;
|
|
210
|
+
|
|
211
|
+
const isLp = (goal: Goal) => {
|
|
212
|
+
const manager = goal.manager;
|
|
213
|
+
return goal.forms.items.every((form) => {
|
|
214
|
+
let atom = form;
|
|
215
|
+
let isNegated = false;
|
|
216
|
+
while (manager.isNot(atom)) {
|
|
217
|
+
atom = manager.getArg(atom, 0);
|
|
218
|
+
isNegated = !isNegated;
|
|
219
|
+
}
|
|
220
|
+
if (manager.getOp(atom) === OP_EQ && !isNegated)
|
|
221
|
+
return isArithSort(manager.sorts[manager.getArg(atom, 0)]);
|
|
222
|
+
return [OP_LE, OP_GE, OP_LT, OP_GT].includes(manager.getOp(atom));
|
|
223
|
+
});
|
|
224
|
+
};
|
|
225
|
+
|
|
226
|
+
const isIlp: Probe = (goal) =>
|
|
227
|
+
Number(
|
|
228
|
+
isNone(goal, (expr) => isNonQflia(goal.manager, expr)) &&
|
|
229
|
+
isNone(goal, (expr) => isTermIte(goal.manager, expr)) &&
|
|
230
|
+
isLp(goal),
|
|
231
|
+
);
|
|
232
|
+
|
|
233
|
+
const hasNonlinearMul = (manager: AstManager, expr: number) => {
|
|
234
|
+
if (!isApp(manager, expr) || manager.getFamily(expr) !== FAMILY_ARITH) return false;
|
|
235
|
+
const op = manager.getOp(expr);
|
|
236
|
+
if (op === OP_MUL) return !isLinearMul(manager, expr);
|
|
237
|
+
if (op === OP_IDIV || op === OP_DIV || op === OP_MOD)
|
|
238
|
+
return !manager.isNumeral(manager.getArg(expr, 1));
|
|
239
|
+
return op === OP_POWER;
|
|
240
|
+
};
|
|
241
|
+
|
|
242
|
+
const NIRA_OPS = [OP_LE, OP_GE, OP_LT, OP_GT, OP_ADD, OP_UMINUS, OP_SUB, OP_ABS, OP_NUM];
|
|
243
|
+
|
|
244
|
+
const mkNonNira =
|
|
245
|
+
(isInt: boolean, isReal: boolean, isQuantified: boolean, isLinear: boolean) =>
|
|
246
|
+
(manager: AstManager, expr: number) => {
|
|
247
|
+
const sort = manager.sorts[expr];
|
|
248
|
+
const isCompatible =
|
|
249
|
+
sort === SORT_BOOL || (isInt && sort === SORT_INT) || (isReal && sort === SORT_REAL);
|
|
250
|
+
if (manager.kinds[expr] === KIND_VAR) return !isQuantified || !isCompatible;
|
|
251
|
+
if (manager.kinds[expr] === KIND_QUANTIFIER) return !isQuantified;
|
|
252
|
+
if (!isCompatible) return true;
|
|
253
|
+
const family = manager.getFamily(expr);
|
|
254
|
+
if (family === FAMILY_BASIC) return false;
|
|
255
|
+
if (family !== FAMILY_ARITH) return !manager.isUninterpretedConst(expr);
|
|
256
|
+
const op = manager.getOp(expr);
|
|
257
|
+
if (NIRA_OPS.includes(op)) return false;
|
|
258
|
+
if (op === OP_MUL)
|
|
259
|
+
return (
|
|
260
|
+
isLinear &&
|
|
261
|
+
(manager.getNumArgs(expr) !== 2 ||
|
|
262
|
+
(!manager.isNumeral(manager.getArg(expr, 0)) &&
|
|
263
|
+
!manager.isNumeral(manager.getArg(expr, 1))))
|
|
264
|
+
);
|
|
265
|
+
if (op === OP_IDIV || op === OP_DIV || op === OP_MOD) {
|
|
266
|
+
const divisor = manager.getArg(expr, 1);
|
|
267
|
+
if (isLinear)
|
|
268
|
+
return !manager.isNumeral(divisor) || manager.getRationalValue(divisor).isZero();
|
|
269
|
+
return !manager.isGroundApp(manager.getArg(expr, 0)) || !manager.isGroundApp(divisor);
|
|
270
|
+
}
|
|
271
|
+
if (op === OP_IS_INT) return isReal;
|
|
272
|
+
if (op === OP_TO_INT || op === OP_TO_REAL) return false;
|
|
273
|
+
if (op === OP_POWER) return isLinear;
|
|
274
|
+
if (op === OP_ALGEBRAIC_NUM) return isLinear || !isReal;
|
|
275
|
+
return true;
|
|
276
|
+
};
|
|
277
|
+
|
|
278
|
+
const mkNiraProbe =
|
|
279
|
+
(isInt: boolean, isReal: boolean, isQuantified: boolean, isLinear: boolean): Probe =>
|
|
280
|
+
(goal) => {
|
|
281
|
+
const isNonNira = mkNonNira(isInt, isReal, isQuantified, isLinear);
|
|
282
|
+
return Number(
|
|
283
|
+
isNone(goal, (expr) => isNonNira(goal.manager, expr)) &&
|
|
284
|
+
(isLinear || !isNone(goal, (expr) => hasNonlinearMul(goal.manager, expr))),
|
|
285
|
+
);
|
|
286
|
+
};
|
|
287
|
+
|
|
288
|
+
const isQfufnra: Probe = (goal) => {
|
|
289
|
+
const manager = goal.manager;
|
|
290
|
+
let isNonlinear = false;
|
|
291
|
+
const isFound = (expr: number) => {
|
|
292
|
+
if (manager.kinds[expr] !== KIND_APP) return true;
|
|
293
|
+
if (manager.getFamily(expr) !== FAMILY_ARITH) return false;
|
|
294
|
+
const op = manager.getOp(expr);
|
|
295
|
+
if (NIRA_OPS.includes(op) || op === OP_ALGEBRAIC_NUM) return false;
|
|
296
|
+
if (op === OP_MUL) {
|
|
297
|
+
const first = manager.getArg(expr, 0);
|
|
298
|
+
if (
|
|
299
|
+
manager.getNumArgs(expr) === 2 &&
|
|
300
|
+
manager.sorts[first] === SORT_REAL &&
|
|
301
|
+
!manager.isNumeral(first) &&
|
|
302
|
+
!manager.isNumeral(manager.getArg(expr, 1))
|
|
303
|
+
)
|
|
304
|
+
isNonlinear = true;
|
|
305
|
+
return false;
|
|
306
|
+
}
|
|
307
|
+
if (op === OP_IDIV || op === OP_DIV || op === OP_MOD)
|
|
308
|
+
return !manager.isNumeral(manager.getArg(expr, 1));
|
|
309
|
+
if (op === OP_POWER) {
|
|
310
|
+
if (!manager.isNumeral(manager.getArg(expr, 1))) return true;
|
|
311
|
+
isNonlinear = true;
|
|
312
|
+
return false;
|
|
313
|
+
}
|
|
314
|
+
return true;
|
|
315
|
+
};
|
|
316
|
+
return Number(
|
|
317
|
+
!goal.isProofsEnabled && !goal.isCoresEnabled && isNone(goal, isFound) && isNonlinear,
|
|
318
|
+
);
|
|
319
|
+
};
|
|
320
|
+
|
|
321
|
+
const getBounds = (goal: Goal) => {
|
|
322
|
+
const bounds = new BoundManager(goal.manager);
|
|
323
|
+
if (!goal.isProofsEnabled) for (const form of goal.forms.items) bounds.add(form);
|
|
324
|
+
return bounds;
|
|
325
|
+
};
|
|
326
|
+
|
|
327
|
+
const isUnbounded: Probe = (goal) => {
|
|
328
|
+
const manager = goal.manager;
|
|
329
|
+
const bounds = getBounds(goal);
|
|
330
|
+
return Number(
|
|
331
|
+
!isNone(
|
|
332
|
+
goal,
|
|
333
|
+
(expr) =>
|
|
334
|
+
manager.kinds[expr] === KIND_APP &&
|
|
335
|
+
manager.isUninterpretedConst(expr) &&
|
|
336
|
+
isArithSort(manager.sorts[expr]) &&
|
|
337
|
+
(!bounds.lowers.has(expr) || !bounds.uppers.has(expr)),
|
|
338
|
+
),
|
|
339
|
+
);
|
|
340
|
+
};
|
|
341
|
+
|
|
342
|
+
const isQuasiPb: Probe = (goal) => {
|
|
343
|
+
if (isUnbounded(goal) !== 0) return 0;
|
|
344
|
+
const bounds = getBounds(goal);
|
|
345
|
+
return Number(bounds.boundedVars.filter((variable) => !bounds.isZeroOne(variable)).length <= 1);
|
|
346
|
+
};
|
|
347
|
+
|
|
348
|
+
const isPb: Probe = (goal) =>
|
|
349
|
+
Number(findNonPb(goal.manager, goal.forms.items, getBounds(goal)) === undefined);
|
|
350
|
+
|
|
351
|
+
const hasQuantifiers: Probe = (goal) =>
|
|
352
|
+
Number(!isNone(goal, (expr) => goal.manager.kinds[expr] === KIND_QUANTIFIER));
|
|
353
|
+
|
|
354
|
+
const hasPatterns: Probe = (goal) => {
|
|
355
|
+
const manager = goal.manager;
|
|
356
|
+
return Number(
|
|
357
|
+
!isNone(
|
|
358
|
+
goal,
|
|
359
|
+
(expr) =>
|
|
360
|
+
manager.kinds[expr] === KIND_QUANTIFIER && manager.getQuantifier(expr).patterns.length > 0,
|
|
361
|
+
),
|
|
362
|
+
);
|
|
363
|
+
};
|
|
364
|
+
|
|
365
|
+
const mkArithDegreeProbe =
|
|
366
|
+
(isAverage: boolean): Probe =>
|
|
367
|
+
(goal) => {
|
|
368
|
+
const manager = goal.manager;
|
|
369
|
+
let variableCount = 0;
|
|
370
|
+
const expr2poly = new Expr2Polynomial(
|
|
371
|
+
manager,
|
|
372
|
+
new PolynomialManager(manager.limit),
|
|
373
|
+
new Map(),
|
|
374
|
+
() => variableCount++,
|
|
375
|
+
);
|
|
376
|
+
let maxDegree = 0;
|
|
377
|
+
let accDegree = 0;
|
|
378
|
+
let counter = 0;
|
|
379
|
+
const updateDegree = (polynomial: PolynomialRef) => {
|
|
380
|
+
const degree = expr2poly.pm.totalDegree(polynomial.get());
|
|
381
|
+
if (degree > maxDegree) maxDegree = degree;
|
|
382
|
+
accDegree += degree;
|
|
383
|
+
counter++;
|
|
384
|
+
};
|
|
385
|
+
const process = (expr: number) => {
|
|
386
|
+
const first = new PolynomialRef(expr2poly.pm);
|
|
387
|
+
const second = new PolynomialRef(expr2poly.pm);
|
|
388
|
+
expr2poly.toPolynomial(manager.getArg(expr, 0), first);
|
|
389
|
+
expr2poly.toPolynomial(manager.getArg(expr, 1), second);
|
|
390
|
+
updateDegree(first);
|
|
391
|
+
updateDegree(second);
|
|
392
|
+
second.reset();
|
|
393
|
+
first.reset();
|
|
394
|
+
};
|
|
395
|
+
forEachExpr(goal, (expr) => {
|
|
396
|
+
const op = manager.getOp(expr);
|
|
397
|
+
if (op === OP_LE || op === OP_LT || op === OP_GT || op === OP_GE) process(expr);
|
|
398
|
+
if (op === OP_EQ && isArithSort(manager.sorts[manager.getArg(expr, 0)])) process(expr);
|
|
399
|
+
});
|
|
400
|
+
expr2poly.release();
|
|
401
|
+
return isAverage ? (counter === 0 ? 0 : accDegree / counter) : maxDegree;
|
|
402
|
+
};
|
|
403
|
+
|
|
404
|
+
const getBitsize = (value: bigint) => (value < 0n ? -value : value).toString(2).length;
|
|
405
|
+
|
|
406
|
+
const mkArithBwProbe =
|
|
407
|
+
(isAverage: boolean): Probe =>
|
|
408
|
+
(goal) => {
|
|
409
|
+
const manager = goal.manager;
|
|
410
|
+
let maxBitWidth = 0;
|
|
411
|
+
let accBitWidth = 0;
|
|
412
|
+
let counter = 0;
|
|
413
|
+
forEachExpr(goal, (expr) => {
|
|
414
|
+
if (!manager.isNumeral(expr)) return;
|
|
415
|
+
const value = manager.getRationalValue(expr);
|
|
416
|
+
const bitWidth = getBitsize(value.num) + (value.den === 1n ? 0 : getBitsize(value.den));
|
|
417
|
+
if (bitWidth > maxBitWidth) maxBitWidth = bitWidth;
|
|
418
|
+
accBitWidth += bitWidth;
|
|
419
|
+
counter++;
|
|
420
|
+
});
|
|
421
|
+
return isAverage ? (counter === 0 ? 0 : accBitWidth / counter) : maxBitWidth;
|
|
422
|
+
};
|
|
423
|
+
|
|
424
|
+
const NAMED_PROBES = new Map<string, Probe>([
|
|
425
|
+
["depth", (goal) => goal.depth],
|
|
426
|
+
["size", (goal) => goal.forms.size],
|
|
427
|
+
["num-exprs", (goal) => countExprs(goal, () => true)],
|
|
428
|
+
[
|
|
429
|
+
"num-consts",
|
|
430
|
+
(goal) =>
|
|
431
|
+
countExprs(
|
|
432
|
+
goal,
|
|
433
|
+
(expr) => isConst(goal.manager, expr) && goal.manager.sorts[expr] !== SORT_BOOL,
|
|
434
|
+
),
|
|
435
|
+
],
|
|
436
|
+
[
|
|
437
|
+
"num-bool-consts",
|
|
438
|
+
(goal) =>
|
|
439
|
+
countExprs(
|
|
440
|
+
goal,
|
|
441
|
+
(expr) => isConst(goal.manager, expr) && goal.manager.sorts[expr] === SORT_BOOL,
|
|
442
|
+
),
|
|
443
|
+
],
|
|
444
|
+
[
|
|
445
|
+
"num-arith-consts",
|
|
446
|
+
(goal) =>
|
|
447
|
+
countExprs(
|
|
448
|
+
goal,
|
|
449
|
+
(expr) => isConst(goal.manager, expr) && isArithSort(goal.manager.sorts[expr]),
|
|
450
|
+
),
|
|
451
|
+
],
|
|
452
|
+
[
|
|
453
|
+
"num-bv-consts",
|
|
454
|
+
(goal) =>
|
|
455
|
+
countExprs(
|
|
456
|
+
goal,
|
|
457
|
+
(expr) => isConst(goal.manager, expr) && goal.manager.isBvSort(goal.manager.sorts[expr]),
|
|
458
|
+
),
|
|
459
|
+
],
|
|
460
|
+
["produce-proofs", (goal) => Number(goal.isProofsEnabled)],
|
|
461
|
+
["produce-model", () => 1],
|
|
462
|
+
["produce-unsat-cores", (goal) => Number(goal.isCoresEnabled)],
|
|
463
|
+
["has-quantifiers", hasQuantifiers],
|
|
464
|
+
["has-patterns", hasPatterns],
|
|
465
|
+
["is-propositional", mkTest(isNonPropositional)],
|
|
466
|
+
["is-qfbv", mkTest(isNonQfbv)],
|
|
467
|
+
["is-qfaufbv", mkTest(isNonQfaufbv)],
|
|
468
|
+
["is-qfbv-eq", mkTest(isNonQfbvEq)],
|
|
469
|
+
["is-quasi-pb", isQuasiPb],
|
|
470
|
+
["is-unbounded", isUnbounded],
|
|
471
|
+
["is-pb", isPb],
|
|
472
|
+
["is-qflia", mkTest(isNonQflia)],
|
|
473
|
+
["is-qfauflia", mkTest(mkNonLira(true, false, true))],
|
|
474
|
+
["is-qflra", mkTest(mkNonLira(false, true, false))],
|
|
475
|
+
["is-qflira", mkTest(mkNonLira(true, true, false))],
|
|
476
|
+
["is-ilp", isIlp],
|
|
477
|
+
["is-qfnia", mkNiraProbe(true, false, false, false)],
|
|
478
|
+
["is-qfnra", mkNiraProbe(false, true, false, false)],
|
|
479
|
+
["is-nia", mkNiraProbe(true, false, true, false)],
|
|
480
|
+
["is-nra", mkNiraProbe(false, true, true, false)],
|
|
481
|
+
["is-nira", mkNiraProbe(true, true, true, false)],
|
|
482
|
+
["is-lia", mkNiraProbe(true, false, true, true)],
|
|
483
|
+
["is-lra", mkNiraProbe(false, true, true, true)],
|
|
484
|
+
["is-lira", mkNiraProbe(true, true, true, true)],
|
|
485
|
+
["is-qfufnra", isQfufnra],
|
|
486
|
+
["is-qffp", mkTest(mkNonQffp(false))],
|
|
487
|
+
["is-qffpbv", mkTest(mkNonQffp(false))],
|
|
488
|
+
[
|
|
489
|
+
"is-qffplra",
|
|
490
|
+
(goal) =>
|
|
491
|
+
Number(
|
|
492
|
+
!isNone(
|
|
493
|
+
goal,
|
|
494
|
+
(expr) => isApp(goal.manager, expr) && goal.manager.getFamily(expr) === FAMILY_FPA,
|
|
495
|
+
) && mkTest(mkNonQffp(true))(goal) === 1,
|
|
496
|
+
),
|
|
497
|
+
],
|
|
498
|
+
["ackr-bound-probe", getAckrBound],
|
|
499
|
+
["arith-max-deg", mkArithDegreeProbe(false)],
|
|
500
|
+
["arith-avg-deg", mkArithDegreeProbe(true)],
|
|
501
|
+
["arith-max-bw", mkArithBwProbe(false)],
|
|
502
|
+
["arith-avg-bw", mkArithBwProbe(true)],
|
|
503
|
+
]);
|
|
504
|
+
|
|
505
|
+
const UNPORTED_PROBES = new Set(["memory"]);
|
|
506
|
+
|
|
507
|
+
const BINARY_PROBES = new Map<string, (first: number, second: number) => number>([
|
|
508
|
+
["=", (first, second) => Number(first === second)],
|
|
509
|
+
["<=", (first, second) => Number(first <= second)],
|
|
510
|
+
[">=", (first, second) => Number(first >= second)],
|
|
511
|
+
["<", (first, second) => Number(first < second)],
|
|
512
|
+
[">", (first, second) => Number(first > second)],
|
|
513
|
+
["=>", (first, second) => Number(first === 0 || second !== 0)],
|
|
514
|
+
["implies", (first, second) => Number(first === 0 || second !== 0)],
|
|
515
|
+
["-", (first, second) => first - second],
|
|
516
|
+
["/", (first, second) => first / second],
|
|
517
|
+
]);
|
|
518
|
+
|
|
519
|
+
const NARY_PROBES = new Map<string, (first: number, second: number) => number>([
|
|
520
|
+
["and", (first, second) => Number(first !== 0 && second !== 0)],
|
|
521
|
+
["or", (first, second) => Number(first !== 0 || second !== 0)],
|
|
522
|
+
["+", (first, second) => first + second],
|
|
523
|
+
["*", (first, second) => first * second],
|
|
524
|
+
]);
|
|
525
|
+
|
|
526
|
+
export const compileProbe = (sexpr: SExpr, isInternal = false): Probe => {
|
|
527
|
+
// A decimal is a numeral of the s-expression, which is_int32 rejects unless it is whole.
|
|
528
|
+
if (sexpr.kind === "numeral" || sexpr.kind === "decimal") {
|
|
529
|
+
const [whole, fraction = ""] = sexpr.text.split(".");
|
|
530
|
+
const value = Number(whole);
|
|
531
|
+
if (!/^0*$/.test(fraction) || value > 2 ** 31 - 1)
|
|
532
|
+
throw new SmtParseError(
|
|
533
|
+
"invalid probe, constant is too big to fit in a fixed size integer",
|
|
534
|
+
sexpr,
|
|
535
|
+
);
|
|
536
|
+
return () => value;
|
|
537
|
+
}
|
|
538
|
+
if (sexpr.kind !== "list") {
|
|
539
|
+
if (!isSymbol(sexpr)) throw new SmtParseError("invalid probe, unexpected input", sexpr);
|
|
540
|
+
const named =
|
|
541
|
+
NAMED_PROBES.get(sexpr.text) ?? (isInternal ? INTERNAL_PROBES.get(sexpr.text) : undefined);
|
|
542
|
+
if (named !== undefined) return named;
|
|
543
|
+
if (UNPORTED_PROBES.has(sexpr.text)) throw new SmtUnsupportedError(`the probe ${sexpr.text}`);
|
|
544
|
+
throw new SmtParseError(`invalid probe, unknown builtin probe ${sexpr.text}`, sexpr);
|
|
545
|
+
}
|
|
546
|
+
const head = sexpr.items[0];
|
|
547
|
+
if (head === undefined) throw new SmtParseError("invalid probe, arguments expected", sexpr.end);
|
|
548
|
+
if (!isSymbol(head)) throw new SmtParseError("invalid probe, symbol expected", sexpr.end);
|
|
549
|
+
const children = sexpr.items.slice(1);
|
|
550
|
+
if (head.text === "not") {
|
|
551
|
+
if (children.length !== 1)
|
|
552
|
+
throw new SmtParseError("invalid probe expression, one argument expected", sexpr.end);
|
|
553
|
+
const child = compileProbe(children[0], isInternal);
|
|
554
|
+
return (goal) => Number(child(goal) === 0);
|
|
555
|
+
}
|
|
556
|
+
const binary = BINARY_PROBES.get(head.text);
|
|
557
|
+
if (binary !== undefined) {
|
|
558
|
+
if (children.length !== 2)
|
|
559
|
+
throw new SmtParseError("invalid probe expression, two arguments expected", sexpr.end);
|
|
560
|
+
const first = compileProbe(children[0], isInternal);
|
|
561
|
+
const second = compileProbe(children[1], isInternal);
|
|
562
|
+
return (goal) => binary(first(goal), second(goal));
|
|
563
|
+
}
|
|
564
|
+
const nary = NARY_PROBES.get(head.text);
|
|
565
|
+
if (nary === undefined)
|
|
566
|
+
throw new SmtParseError(`invalid probe, unknown probe expression ${head.text}`, sexpr.end);
|
|
567
|
+
if (children.length === 0)
|
|
568
|
+
throw new SmtParseError("invalid probe, at least one argument expected", sexpr.end);
|
|
569
|
+
const probes = children.map((child) => compileProbe(child, isInternal));
|
|
570
|
+
// Deviation from Z3: MK_NARY_PROBE applies the operator to its first argument twice.
|
|
571
|
+
return (goal) => probes.map((probe) => probe(goal)).reduce(nary);
|
|
572
|
+
};
|
|
573
|
+
|
|
574
|
+
export const formatProbeValue = (value: number) =>
|
|
575
|
+
Number.isInteger(value) && Math.abs(value) < 1e6
|
|
576
|
+
? String(value)
|
|
577
|
+
: String(Number(value.toPrecision(6)));
|
|
@@ -1,16 +1,8 @@
|
|
|
1
|
-
// Ported from Z3 (src/tactic/core/propagate_values_tactic.cpp, src/ast/shared_occs.cpp), MIT license,
|
|
2
|
-
// see z3-license.txt. The propagate-values tactic: a formula that is an atom, a negated atom or an
|
|
3
|
-
// equality with a value rewrites the other formulas, when its atom or term occurs more than once in
|
|
4
|
-
// the goal.
|
|
5
1
|
import { KIND_APP, KIND_QUANTIFIER, OP_EQ, type AstManager } from "./ast";
|
|
6
|
-
import type
|
|
2
|
+
import { type Dependency, type Goal, joinDependencies } from "./goal";
|
|
7
3
|
import { Rewriter, TACTIC_REWRITER_OPTIONS } from "./rewriter";
|
|
8
4
|
|
|
9
|
-
//
|
|
10
|
-
const MAX_ROUNDS = 4;
|
|
11
|
-
|
|
12
|
-
// goal_shared_occs with atoms tracked: the terms that the goal's formulas reach more than once,
|
|
13
|
-
// quantifier bodies included and patterns excluded.
|
|
5
|
+
// Quantifier bodies are included and patterns excluded.
|
|
14
6
|
const getSharedOccs = (manager: AstManager, forms: number[]) => {
|
|
15
7
|
const visited = new Set<number>();
|
|
16
8
|
const shared = new Set<number>();
|
|
@@ -27,55 +19,70 @@ const getSharedOccs = (manager: AstManager, forms: number[]) => {
|
|
|
27
19
|
return shared;
|
|
28
20
|
};
|
|
29
21
|
|
|
30
|
-
export const propagateValues = (manager: AstManager, goal: Goal) => {
|
|
22
|
+
export const propagateValues = (manager: AstManager, goal: Goal, maxRounds = 4) => {
|
|
23
|
+
goal.depth++;
|
|
31
24
|
if (goal.isInconsistent) return;
|
|
25
|
+
if (goal.isProofsEnabled) {
|
|
26
|
+
goal.elimRedundancies();
|
|
27
|
+
return;
|
|
28
|
+
}
|
|
32
29
|
const rewriter = new Rewriter(manager, TACTIC_REWRITER_OPTIONS);
|
|
33
30
|
const substitution = new Map<number, number>();
|
|
34
|
-
|
|
31
|
+
const dependencies = new Map<number, Dependency | undefined>();
|
|
32
|
+
rewriter.setSubstitution(substitution, dependencies);
|
|
33
|
+
const insert = (expr: number, value: number, dependency: Dependency | undefined) => {
|
|
34
|
+
substitution.set(expr, value);
|
|
35
|
+
dependencies.set(expr, dependency);
|
|
36
|
+
};
|
|
37
|
+
const clear = () => {
|
|
38
|
+
substitution.clear();
|
|
39
|
+
dependencies.clear();
|
|
40
|
+
rewriter.setSubstitution(substitution, dependencies);
|
|
41
|
+
};
|
|
35
42
|
let occs = getSharedOccs(manager, goal.forms.items);
|
|
36
43
|
let isModified = false;
|
|
37
|
-
// process_current and push_result.
|
|
38
44
|
const process = (index: number) => {
|
|
39
45
|
const current = goal.forms.items[index];
|
|
40
46
|
const isRewriting = substitution.size !== 0;
|
|
41
47
|
const rewritten = isRewriting ? rewriter.rewrite(current) : current;
|
|
42
48
|
if (rewritten !== current) isModified = true;
|
|
43
|
-
goal.
|
|
49
|
+
const used = goal.isCoresEnabled ? rewriter.usedDependencies : undefined;
|
|
50
|
+
const dependency = joinDependencies(goal.getDependency(index), used);
|
|
51
|
+
// Forgetting the used dependencies drops the cache, whose results would hide them next time.
|
|
52
|
+
if (used !== undefined) {
|
|
53
|
+
rewriter.usedDependencies = undefined;
|
|
54
|
+
rewriter.setSubstitution(substitution, dependencies);
|
|
55
|
+
}
|
|
56
|
+
goal.update(index, rewritten, dependency);
|
|
44
57
|
if (isRewriting) manager.decRef(rewritten);
|
|
45
|
-
if (occs.has(rewritten))
|
|
58
|
+
if (occs.has(rewritten)) insert(rewritten, manager.trueExpr, dependency);
|
|
46
59
|
if (manager.isNot(rewritten) && occs.has(manager.getArg(rewritten, 0)))
|
|
47
|
-
|
|
60
|
+
insert(manager.getArg(rewritten, 0), manager.falseExpr, dependency);
|
|
48
61
|
if (manager.getOp(rewritten) !== OP_EQ) return;
|
|
49
|
-
if (
|
|
50
|
-
manager.
|
|
51
|
-
occs.has(manager.getArg(rewritten, 1))
|
|
52
|
-
)
|
|
53
|
-
substitution.set(manager.getArg(rewritten, 1), manager.getArg(rewritten, 0));
|
|
62
|
+
if (manager.isValue(manager.getArg(rewritten, 0)) && occs.has(manager.getArg(rewritten, 1)))
|
|
63
|
+
insert(manager.getArg(rewritten, 1), manager.getArg(rewritten, 0), dependency);
|
|
54
64
|
else if (
|
|
55
|
-
manager.
|
|
65
|
+
manager.isValue(manager.getArg(rewritten, 1)) &&
|
|
56
66
|
occs.has(manager.getArg(rewritten, 0))
|
|
57
67
|
)
|
|
58
|
-
|
|
68
|
+
insert(manager.getArg(rewritten, 0), manager.getArg(rewritten, 1), dependency);
|
|
59
69
|
};
|
|
60
|
-
|
|
61
|
-
// which stops when it changed nothing.
|
|
62
|
-
for (let round = 0; round < MAX_ROUNDS; round += 2) {
|
|
70
|
+
for (let round = 0; round < maxRounds; round += 2) {
|
|
63
71
|
const size = goal.forms.size;
|
|
64
72
|
for (let index = 0; index < size; index++) {
|
|
65
73
|
process(index);
|
|
66
74
|
if (goal.isInconsistent) return;
|
|
67
75
|
}
|
|
68
76
|
if (substitution.size === 0 && !isModified) break;
|
|
77
|
+
if (round + 1 >= maxRounds) break;
|
|
69
78
|
occs = getSharedOccs(manager, goal.forms.items);
|
|
70
|
-
|
|
71
|
-
rewriter.setSubstitution(substitution);
|
|
79
|
+
clear();
|
|
72
80
|
for (let index = goal.forms.size - 1; index >= 0; index--) {
|
|
73
81
|
process(index);
|
|
74
82
|
if (goal.isInconsistent) return;
|
|
75
83
|
}
|
|
76
84
|
if (!isModified) break;
|
|
77
|
-
|
|
78
|
-
rewriter.setSubstitution(substitution);
|
|
85
|
+
clear();
|
|
79
86
|
isModified = false;
|
|
80
87
|
occs = getSharedOccs(manager, goal.forms.items);
|
|
81
88
|
}
|