tla-ts 0.0.9 → 0.0.10
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 +29 -1
- package/dist/compile.cjs +23 -0
- package/dist/compile.js +23 -0
- package/dist/deciders.cjs +28 -28
- package/dist/deciders.js +43 -43
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +72 -10
- package/dist/index.d.ts +72 -10
- 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 +116 -36
- package/dist/prove.js +116 -36
- package/dist/run.cjs +143 -31
- package/dist/run.js +143 -31
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +128 -103
- package/dist/transfer.js +128 -103
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +3 -1
- package/src/ast.ts +7 -21
- package/src/bags.ts +99 -99
- package/src/builtins.ts +44 -75
- package/src/bundled-modules.ts +1 -8
- package/src/check.ts +576 -300
- package/src/cli/options.ts +11 -6
- package/src/cli/run.ts +2 -2
- package/src/cli/runtime-invariants.ts +135 -0
- package/src/cli/shared.ts +20 -9
- package/src/cli/tlapm.ts +0 -12
- package/src/cli/tlc-arguments.ts +646 -0
- package/src/cli/tlc-usage.ts +362 -0
- package/src/cli/tlc.ts +538 -220
- package/src/cli/typescript.ts +23 -0
- package/src/cli/xml-exporter.ts +4 -16
- package/src/cli.ts +0 -1
- package/src/codegen.ts +191 -64
- package/src/config.ts +140 -109
- package/src/coverage.ts +837 -0
- package/src/dependencies.ts +6 -40
- package/src/dfid.ts +618 -0
- package/src/environment.ts +240 -118
- package/src/errors.ts +70 -55
- package/src/evaluate.ts +630 -297
- package/src/exit-codes.ts +37 -3
- package/src/fingerprints.ts +10 -10
- package/src/index.ts +3 -0
- package/src/instances.ts +79 -11
- package/src/java-overrides.ts +2 -12
- package/src/json-reader.ts +456 -0
- package/src/json.ts +262 -139
- package/src/levels.ts +2 -3
- package/src/lexer.ts +17 -26
- package/src/liveness-checker.ts +10 -18
- package/src/liveness.ts +121 -49
- package/src/obligations/action.ts +4 -28
- package/src/obligations/anonymize.ts +84 -80
- package/src/obligations/equality.ts +1 -1
- package/src/obligations/expression.ts +2 -19
- package/src/obligations/format.ts +1 -9
- package/src/obligations/generate.ts +1 -11
- package/src/obligations/index.ts +0 -11
- package/src/obligations/levels.ts +4 -8
- package/src/obligations/module.ts +1 -15
- package/src/obligations/normalize.ts +5 -24
- package/src/obligations/operators.ts +1 -2
- package/src/obligations/pragma.ts +1 -10
- package/src/obligations/printer.ts +47 -46
- package/src/obligations/proof.ts +1 -5
- package/src/obligations/regroup.ts +1 -4
- package/src/obligations/simplify.ts +3 -14
- package/src/obligations/source.ts +1 -21
- package/src/obligations/subexpression.ts +5 -11
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +8 -14
- package/src/obligations/tuples.ts +3 -9
- package/src/parallel-worker.ts +29 -39
- package/src/parallel.ts +29 -13
- package/src/parser.ts +436 -90
- package/src/pcal/ast.ts +7 -28
- package/src/pcal/parse.ts +11 -39
- package/src/pcal/tokenize.ts +4 -20
- package/src/pcal/translate.ts +10 -42
- package/src/pcal/validate.ts +3 -21
- package/src/pretty-print.ts +1 -2
- package/src/prover/decide-pool.ts +5 -10
- package/src/prover/deciders.ts +0 -4
- package/src/prover/first-order.ts +0 -11
- package/src/prover/isabelle/decide.ts +0 -6
- package/src/prover/isabelle/encode.ts +11 -23
- package/src/prover/isabelle/isar/inner-syntax.ts +108 -114
- package/src/prover/isabelle/isar/method.ts +25 -38
- package/src/prover/isabelle/isar/proof.ts +1 -10
- package/src/prover/isabelle/isar/statement.ts +1 -6
- package/src/prover/isabelle/isar/theory.ts +15 -26
- package/src/prover/isabelle/isar/type-check.ts +11 -25
- package/src/prover/isabelle/provers/blast/blast.ts +10 -41
- package/src/prover/isabelle/provers/blast/branch.ts +1 -32
- package/src/prover/isabelle/provers/blast/prove.ts +1 -35
- package/src/prover/isabelle/provers/blast/rules.ts +6 -44
- package/src/prover/isabelle/provers/blast/state.ts +2 -28
- package/src/prover/isabelle/provers/blast/term.ts +9 -36
- package/src/prover/isabelle/provers/clasimp.ts +1 -13
- package/src/prover/isabelle/provers/classical.ts +14 -42
- package/src/prover/isabelle/provers/hypsubst.ts +11 -25
- package/src/prover/isabelle/pure/bicompose.ts +16 -13
- package/src/prover/isabelle/pure/consts.ts +1 -7
- package/src/prover/isabelle/pure/conv.ts +1 -9
- package/src/prover/isabelle/pure/drule.ts +24 -40
- package/src/prover/isabelle/pure/envir.ts +3 -52
- package/src/prover/isabelle/pure/goal.ts +1 -7
- 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 -14
- package/src/prover/isabelle/pure/name.ts +2 -9
- package/src/prover/isabelle/pure/net.ts +3 -59
- package/src/prover/isabelle/pure/object-logic.ts +3 -10
- package/src/prover/isabelle/pure/pattern.ts +2 -19
- package/src/prover/isabelle/pure/raw-simplifier.ts +13 -49
- package/src/prover/isabelle/pure/rewriter.ts +26 -58
- package/src/prover/isabelle/pure/search.ts +3 -10
- package/src/prover/isabelle/pure/seq.ts +1 -10
- package/src/prover/isabelle/pure/simplifier.ts +4 -12
- package/src/prover/isabelle/pure/table.ts +1 -31
- package/src/prover/isabelle/pure/tactic.ts +12 -22
- package/src/prover/isabelle/pure/tactical.ts +6 -12
- package/src/prover/isabelle/pure/term-ord.ts +2 -6
- package/src/prover/isabelle/pure/term.ts +2 -43
- package/src/prover/isabelle/pure/thm.ts +13 -36
- package/src/prover/isabelle/pure/type.ts +2 -15
- package/src/prover/isabelle/pure/unify.ts +20 -30
- package/src/prover/isabelle/pure/variable.ts +3 -7
- package/src/prover/isabelle/tla/classical-setup.ts +9 -19
- package/src/prover/isabelle/tla/context.ts +8 -16
- package/src/prover/isabelle/tla/logic.ts +4 -11
- package/src/prover/isabelle/tla/simpdata.ts +46 -34
- package/src/prover/isabelle/tools/intuitionistic.ts +1 -10
- package/src/prover/ocaml.ts +0 -6
- package/src/prover/prep/action.ts +4 -36
- package/src/prover/prep/enabled-axioms.ts +12 -19
- package/src/prover/prep/fingerprint.ts +0 -16
- package/src/prover/prep/level-comparison.ts +8 -12
- package/src/prover/prep/md5.ts +0 -2
- package/src/prover/prep/methods.ts +9 -36
- package/src/prover/prep/normalize.ts +4 -28
- package/src/prover/prove-worker.ts +0 -2
- package/src/prover/prove.ts +0 -36
- package/src/prover/ptl/decide.ts +7 -12
- package/src/prover/ptl/encode.ts +14 -36
- package/src/prover/ptl/sat.ts +24 -32
- package/src/prover/ptl/tableau.ts +12 -26
- package/src/prover/smt/axioms.ts +0 -7
- package/src/prover/smt/context.ts +19 -26
- package/src/prover/smt/data.ts +51 -54
- package/src/prover/smt/encode.ts +14 -35
- package/src/prover/smt/extensionality.ts +0 -10
- package/src/prover/smt/flatten.ts +3 -22
- package/src/prover/smt/format.ts +5 -10
- package/src/prover/smt/instances.ts +0 -10
- package/src/prover/smt/rewrite.ts +66 -101
- package/src/prover/smt/solver/act-cache.ts +0 -15
- package/src/prover/smt/solver/arith-rewriter.ts +3 -48
- package/src/prover/smt/solver/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +1 -43
- package/src/prover/smt/solver/ast-lt.ts +1 -11
- package/src/prover/smt/solver/ast-util.ts +1 -6
- package/src/prover/smt/solver/ast.ts +1 -143
- package/src/prover/smt/solver/auf-solver.ts +6 -39
- package/src/prover/smt/solver/case-split-queue.ts +1 -9
- package/src/prover/smt/solver/cg-table.ts +1 -18
- package/src/prover/smt/solver/clause.ts +1 -27
- package/src/prover/smt/solver/conflict-resolution.ts +0 -9
- package/src/prover/smt/solver/context.ts +4 -61
- package/src/prover/smt/solver/ctx-simplify.ts +14 -41
- package/src/prover/smt/solver/der.ts +2 -21
- package/src/prover/smt/solver/dyn-ack.ts +1 -11
- package/src/prover/smt/solver/e-matching.ts +3 -34
- package/src/prover/smt/solver/enode.ts +1 -21
- package/src/prover/smt/solver/expr-ref.ts +1 -5
- package/src/prover/smt/solver/expr-safe-replace.ts +0 -5
- package/src/prover/smt/solver/fingerprints.ts +1 -12
- package/src/prover/smt/solver/flat-literals.ts +1 -9
- package/src/prover/smt/solver/goal.ts +2 -14
- package/src/prover/smt/solver/hash.ts +0 -8
- package/src/prover/smt/solver/hashtable.ts +1 -12
- package/src/prover/smt/solver/internalizer.ts +6 -98
- package/src/prover/smt/solver/lbool.ts +1 -2
- package/src/prover/smt/solver/literal.ts +0 -3
- package/src/prover/smt/solver/lp/bound-propagator.ts +8 -26
- package/src/prover/smt/solver/lp/constraints.ts +2 -8
- package/src/prover/smt/solver/lp/containers.ts +12 -30
- package/src/prover/smt/solver/lp/core-solver.ts +10 -31
- package/src/prover/smt/solver/lp/cross-nested.ts +6 -20
- package/src/prover/smt/solver/lp/dep-intervals.ts +7 -22
- package/src/prover/smt/solver/lp/dependency.ts +1 -4
- package/src/prover/smt/solver/lp/dioph-eq.ts +12 -98
- package/src/prover/smt/solver/lp/explanation.ts +1 -6
- package/src/prover/smt/solver/lp/gomory.ts +9 -22
- package/src/prover/smt/solver/lp/hnf-cutter.ts +17 -23
- package/src/prover/smt/solver/lp/hnf.ts +11 -26
- package/src/prover/smt/solver/lp/int-cube.ts +15 -36
- package/src/prover/smt/solver/lp/int-solver.ts +4 -34
- package/src/prover/smt/solver/lp/lar-solver.ts +32 -81
- package/src/prover/smt/solver/lp/lar-term.ts +1 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +1 -14
- package/src/prover/smt/solver/lp/maximize-term.ts +20 -45
- package/src/prover/smt/solver/lp/nex-creator.ts +5 -28
- package/src/prover/smt/solver/lp/nex.ts +1 -6
- package/src/prover/smt/solver/lp/nla-backoff.ts +1 -4
- package/src/prover/smt/solver/lp/nla-basics.ts +5 -30
- package/src/prover/smt/solver/lp/nla-core.ts +35 -130
- package/src/prover/smt/solver/lp/nla-divisions.ts +32 -42
- package/src/prover/smt/solver/lp/nla-emonics.ts +4 -21
- package/src/prover/smt/solver/lp/nla-factorization.ts +1 -4
- package/src/prover/smt/solver/lp/nla-grobner.ts +15 -69
- package/src/prover/smt/solver/lp/nla-horner.ts +3 -11
- package/src/prover/smt/solver/lp/nla-intervals.ts +2 -12
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +16 -41
- package/src/prover/smt/solver/lp/nla-monotone.ts +2 -6
- package/src/prover/smt/solver/lp/nla-order.ts +2 -13
- package/src/prover/smt/solver/lp/nla-patcher.ts +4 -7
- package/src/prover/smt/solver/lp/nla-tangents.ts +1 -9
- package/src/prover/smt/solver/lp/nla-throttle.ts +1 -6
- package/src/prover/smt/solver/lp/nla-types.ts +1 -11
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -25
- package/src/prover/smt/solver/lp/nra-solver.ts +5 -52
- package/src/prover/smt/solver/lp/numeric-pair.ts +1 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +1 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +2 -14
- package/src/prover/smt/solver/lp/pdd-solver.ts +4 -33
- package/src/prover/smt/solver/lp/pdd.ts +7 -70
- package/src/prover/smt/solver/lp/random-updater.ts +1 -8
- package/src/prover/smt/solver/lp/static-matrix.ts +9 -19
- package/src/prover/smt/solver/lp/union-find.ts +1 -6
- package/src/prover/smt/solver/mam-compiler.ts +14 -56
- package/src/prover/smt/solver/mam-interpreter.ts +1 -21
- package/src/prover/smt/solver/maximize-ac-sharing.ts +2 -17
- package/src/prover/smt/solver/model-checker.ts +2 -36
- package/src/prover/smt/solver/model-evaluator.ts +3 -29
- package/src/prover/smt/solver/model-finder.ts +3 -15
- package/src/prover/smt/solver/model-generator.ts +1 -12
- package/src/prover/smt/solver/model-macro-solver.ts +12 -69
- package/src/prover/smt/solver/nlsat/algebraic.ts +55 -151
- package/src/prover/smt/solver/nlsat/atoms.ts +5 -19
- package/src/prover/smt/solver/nlsat/evaluator.ts +17 -22
- package/src/prover/smt/solver/nlsat/explain.ts +3 -47
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -50
- package/src/prover/smt/solver/nlsat/levelwise.ts +48 -129
- package/src/prover/smt/solver/nlsat/mpbq.ts +3 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +17 -156
- package/src/prover/smt/solver/nlsat/solver.ts +7 -67
- package/src/prover/smt/solver/nlsat/types.ts +1 -8
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -44
- package/src/prover/smt/solver/nlsat/upolynomial.ts +11 -92
- package/src/prover/smt/solver/nnf.ts +3 -38
- package/src/prover/smt/solver/pattern-inference.ts +2 -15
- package/src/prover/smt/solver/poly-rewriter.ts +3 -23
- package/src/prover/smt/solver/propagate-values.ts +1 -10
- package/src/prover/smt/solver/proto-model.ts +3 -48
- package/src/prover/smt/solver/pull-quant.ts +1 -12
- package/src/prover/smt/solver/qe-lite-der.ts +1 -29
- package/src/prover/smt/solver/qe-lite-fm.ts +2 -25
- package/src/prover/smt/solver/qe-lite.ts +3 -33
- package/src/prover/smt/solver/qi-queue.ts +1 -16
- package/src/prover/smt/solver/quant-tactics.ts +5 -22
- package/src/prover/smt/solver/quantifier-analyzer.ts +17 -37
- package/src/prover/smt/solver/quantifier-manager.ts +1 -8
- package/src/prover/smt/solver/random-gen.ts +1 -2
- package/src/prover/smt/solver/rational.ts +1 -8
- package/src/prover/smt/solver/ref-vector.ts +1 -6
- package/src/prover/smt/solver/relevancy.ts +2 -15
- package/src/prover/smt/solver/rewriter-tpl.ts +3 -147
- package/src/prover/smt/solver/rewriter.ts +3 -85
- package/src/prover/smt/solver/rlimit.ts +2 -20
- package/src/prover/smt/solver/smtlib-parser.ts +2 -37
- package/src/prover/smt/solver/solver.ts +23 -34
- package/src/prover/smt/solver/sort.ts +1 -5
- package/src/prover/smt/solver/sticky-generations.ts +0 -5
- package/src/prover/smt/solver/theory-lra-axioms.ts +3 -24
- package/src/prover/smt/solver/theory-lra-bounds.ts +0 -5
- package/src/prover/smt/solver/theory-lra-final-check.ts +4 -22
- package/src/prover/smt/solver/theory-lra-internalize.ts +1 -27
- package/src/prover/smt/solver/theory-lra-model.ts +4 -19
- package/src/prover/smt/solver/theory-lra-propagate.ts +1 -15
- package/src/prover/smt/solver/theory-lra-state.ts +3 -8
- package/src/prover/smt/solver/theory-lra.ts +1 -8
- package/src/prover/smt/solver/var-subst.ts +2 -26
- package/src/prover/smt/table.ts +0 -8
- package/src/prover/tlapm/cache.ts +20 -25
- package/src/prover/tlapm/ocaml-marshal.ts +19 -21
- package/src/prover/tlapm/tlapm.ts +12 -17
- package/src/prover/verdict.ts +0 -2
- package/src/prover/zenon/check/check.ts +0 -9
- 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 +0 -5
- package/src/prover/zenon/check/relations.ts +0 -13
- package/src/prover/zenon/check/rewrites.ts +0 -6
- package/src/prover/zenon/check/sets.ts +0 -3
- package/src/prover/zenon/check/terms.ts +0 -17
- package/src/prover/zenon/check/tla.ts +0 -6
- package/src/prover/zenon/decide.ts +0 -12
- package/src/prover/zenon/encode.ts +1 -8
- package/src/prover/zenon/eqrel.ts +0 -13
- package/src/prover/zenon/equality-rules.ts +0 -4
- package/src/prover/zenon/expr.ts +1 -26
- package/src/prover/zenon/index-table.ts +17 -38
- package/src/prover/zenon/isar-case.ts +9 -19
- package/src/prover/zenon/isar.ts +1 -29
- package/src/prover/zenon/limits.ts +0 -4
- package/src/prover/zenon/llproof.ts +0 -9
- package/src/prover/zenon/mltoll.ts +54 -76
- package/src/prover/zenon/node.ts +1 -11
- package/src/prover/zenon/ocaml.ts +1 -17
- package/src/prover/zenon/parse.ts +2 -7
- package/src/prover/zenon/phrase.ts +1 -11
- package/src/prover/zenon/proof.ts +0 -9
- package/src/prover/zenon/propositional-rules.ts +0 -5
- package/src/prover/zenon/rules.ts +2 -6
- package/src/prover/zenon/search.ts +1 -17
- package/src/prover/zenon/tla/functions.ts +57 -29
- package/src/prover/zenon/tla/llproof.ts +63 -70
- package/src/prover/zenon/tla/records.ts +56 -27
- package/src/prover/zenon/tla/rewrites.ts +12 -19
- package/src/prover/zenon/tla/sets.ts +68 -39
- package/src/prover/zenon/tla/terms.ts +0 -6
- package/src/prover/zenon/tla/tla.ts +59 -58
- package/src/randomization.ts +84 -35
- package/src/resolve.ts +18 -60
- package/src/runtime.ts +11 -4
- package/src/sany/builtins.ts +3 -4
- package/src/sany/generator.ts +119 -169
- package/src/sany/levels.ts +6 -30
- package/src/sany/lexer.ts +7 -23
- package/src/sany/linter.ts +1 -8
- package/src/sany/modules.ts +1 -5
- package/src/sany/nodes.ts +0 -31
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +29 -63
- package/src/sany/selectors.ts +15 -39
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +13 -63
- package/src/search.ts +494 -154
- package/src/simulate.ts +694 -0
- package/src/spec-description.ts +166 -48
- package/src/standard-definitions.ts +2 -3
- package/src/standard-modules.ts +264 -68
- package/src/state-graph.ts +51 -18
- package/src/subexpressions.ts +31 -5
- package/src/substitution-levels.ts +2 -3
- package/src/successors.ts +267 -77
- package/src/symmetry.ts +31 -8
- package/src/tableau.ts +27 -24
- package/src/tlc/fingerprint.ts +183 -61
- package/src/tlc/jar-data.ts +113 -6
- package/src/tlc/messages.ts +122 -37
- package/src/tlc/order.ts +33 -38
- package/src/tlc/random.ts +16 -16
- package/src/tlc/replay.ts +563 -211
- package/src/tlc/summary.ts +2 -4
- package/src/tlc/tlc-operators.ts +81 -36
- package/src/tlc/tlcext-operators.ts +138 -117
- package/src/tlc/trace-spec.ts +273 -0
- package/src/tlc/value-stream.ts +143 -0
- package/src/tlc/version.ts +2 -4
- package/src/transfer.ts +22 -25
- package/src/typescript/actions.ts +481 -0
- package/src/typescript/collections.ts +600 -0
- package/src/typescript/compile.ts +65 -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 +152 -0
- package/src/typescript/functions.ts +284 -0
- package/src/typescript/model.ts +163 -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 +165 -0
- package/src/typescript/types.ts +171 -0
- package/src/values.ts +826 -276
- package/src/worker.ts +7 -8
|
@@ -1,11 +1,10 @@
|
|
|
1
|
-
// Ported from Z3 (src/ast/rewriter/th_rewriter.cpp, bool_rewriter.cpp, arith_rewriter.cpp), MIT
|
|
2
|
-
// license, see z3-license.txt. Only the rewrites that tlapm's encoding exercises are ported.
|
|
1
|
+
// Ported from Z3 (src/ast/rewriter/th_rewriter.cpp, bool_rewriter.cpp, arith_rewriter.cpp), MIT license, see z3-license.txt.
|
|
3
2
|
import { ArithRewriter, KERNEL_ARITH_OPTIONS, TACTIC_ARITH_OPTIONS } from "./arith-rewriter";
|
|
4
3
|
import type { ArithRewriterOptions } from "./poly-rewriter";
|
|
5
4
|
import { isAstLess } from "./ast-lt";
|
|
6
5
|
import { Der } from "./der";
|
|
7
6
|
import {
|
|
8
|
-
AstManager,
|
|
7
|
+
type AstManager,
|
|
9
8
|
FAMILY_ARITH,
|
|
10
9
|
FAMILY_BASIC,
|
|
11
10
|
KIND_APP,
|
|
@@ -43,32 +42,24 @@ import { sortByKey } from "./sort";
|
|
|
43
42
|
import { UnusedVarsEliminator } from "./var-subst";
|
|
44
43
|
|
|
45
44
|
interface RewriterOptions {
|
|
46
|
-
// Replaces (and a b) with (not (or (not a) (not b))), as Z3's asserted_formulas does after NNF.
|
|
47
45
|
readonly isEliminatingAnd: boolean;
|
|
48
46
|
readonly arith: ArithRewriterOptions;
|
|
49
|
-
// rewrite_patterns: the patterns of a quantifier are rewritten like its body. The kernel's rewriters
|
|
50
|
-
// set it, and the tactics' leave it off.
|
|
51
47
|
readonly isRewritingPatterns: boolean;
|
|
52
|
-
// pull_cheap_ite: a binary predicate or a function of an ite with values distributes over the ite.
|
|
53
48
|
readonly isPullingCheapIte?: boolean;
|
|
54
49
|
}
|
|
55
50
|
|
|
56
|
-
// The parameters that asserted_formulas gives the kernel's rewriters.
|
|
57
51
|
export const KERNEL_REWRITER_OPTIONS: RewriterOptions = {
|
|
58
52
|
isEliminatingAnd: false,
|
|
59
53
|
arith: KERNEL_ARITH_OPTIONS,
|
|
60
54
|
isRewritingPatterns: true,
|
|
61
55
|
};
|
|
62
56
|
|
|
63
|
-
// th_rewriter's defaults, which the tactics and the model use.
|
|
64
57
|
export const TACTIC_REWRITER_OPTIONS: RewriterOptions = {
|
|
65
58
|
isEliminatingAnd: false,
|
|
66
59
|
arith: TACTIC_ARITH_OPTIONS,
|
|
67
60
|
isRewritingPatterns: false,
|
|
68
61
|
};
|
|
69
62
|
|
|
70
|
-
// A term that reduceTo is rewriting: the depth left for its arguments, its next argument, and where
|
|
71
|
-
// its arguments' results start.
|
|
72
63
|
interface ReduceFrame {
|
|
73
64
|
expr: number;
|
|
74
65
|
depth: number;
|
|
@@ -76,14 +67,11 @@ interface ReduceFrame {
|
|
|
76
67
|
spos: number;
|
|
77
68
|
}
|
|
78
69
|
|
|
79
|
-
// rewriter_tpl with th_rewriter_cfg.
|
|
80
70
|
export class Rewriter extends RewriterTpl {
|
|
81
71
|
private arith: ArithRewriter;
|
|
82
72
|
private substitution = new Map<number, number>();
|
|
83
73
|
private unusedVarsEliminator: UnusedVarsEliminator;
|
|
84
74
|
private der: Der;
|
|
85
|
-
// try_ite_value writes the result of reduce_app, which is the m_r of the rewriter that applies
|
|
86
|
-
// this one, as it goes: the first write releases what m_r held.
|
|
87
75
|
releaseResult = () => this.setLastResult(-1);
|
|
88
76
|
|
|
89
77
|
constructor(
|
|
@@ -97,16 +85,12 @@ export class Rewriter extends RewriterTpl {
|
|
|
97
85
|
this.der = new Der(manager);
|
|
98
86
|
}
|
|
99
87
|
|
|
100
|
-
// ~imp: the members of th_rewriter_cfg go before the caches of rewriter_tpl.
|
|
101
88
|
release() {
|
|
102
89
|
this.unusedVarsEliminator.release();
|
|
103
90
|
this.der.release();
|
|
104
91
|
super.release();
|
|
105
92
|
}
|
|
106
93
|
|
|
107
|
-
// Rewrites the top depth levels of a term, outside the main loop. Like rewriter_tpl, it keeps its
|
|
108
|
-
// frames on an explicit stack, so a deep term or a long chain of rewrites cannot overflow the call
|
|
109
|
-
// stack.
|
|
110
94
|
private reduceTo(expr: number, depth: number): number {
|
|
111
95
|
const manager = this.manager;
|
|
112
96
|
const frames: ReduceFrame[] = [];
|
|
@@ -134,14 +118,10 @@ export class Rewriter extends RewriterTpl {
|
|
|
134
118
|
return results[0];
|
|
135
119
|
}
|
|
136
120
|
|
|
137
|
-
// updt_params with elim_and, which asserted_formulas turns on after NNF. The caller resets the
|
|
138
|
-
// rewriter.
|
|
139
121
|
setEliminatingAnd(isEliminatingAnd: boolean) {
|
|
140
122
|
this.options = { ...this.options, isEliminatingAnd };
|
|
141
123
|
}
|
|
142
124
|
|
|
143
|
-
// th_rewriter::set_substitution: rewrites replace each key of the substitution with its value, and
|
|
144
|
-
// the rewriter is reset. The caller may extend the substitution between rewrites without a reset.
|
|
145
125
|
setSubstitution(substitution: Map<number, number>) {
|
|
146
126
|
this.substitution = substitution;
|
|
147
127
|
this.reset();
|
|
@@ -151,8 +131,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
151
131
|
return this.substitution.size === 0 ? undefined : this.substitution.get(expr);
|
|
152
132
|
}
|
|
153
133
|
|
|
154
|
-
// flat_assoc: th_rewriter flattens and, or and + into an enclosing application of the same
|
|
155
|
-
// operator.
|
|
156
134
|
isFlatAssoc(decl: number) {
|
|
157
135
|
const op = this.manager.funcDecls[decl].op;
|
|
158
136
|
return op === OP_AND || op === OP_OR || op === OP_ADD;
|
|
@@ -164,7 +142,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
164
142
|
|
|
165
143
|
reduceApp(decl: number, args: number[], sort: number) {
|
|
166
144
|
const manager = this.manager;
|
|
167
|
-
// An uninterpreted application only reduces by pull_ite, which needs two arguments.
|
|
168
145
|
if (
|
|
169
146
|
manager.funcDecls[decl].op === OP_UNINTERPRETED &&
|
|
170
147
|
(args.length !== 2 || this.options.isPullingCheapIte !== true)
|
|
@@ -181,10 +158,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
181
158
|
return this.manager.withTemporaries(() => this.reduceQuantifierCore(expr, body, patterns));
|
|
182
159
|
}
|
|
183
160
|
|
|
184
|
-
// th_rewriter_cfg::reduce_quantifier: a bound Boolean variable among the conjuncts of a universal
|
|
185
|
-
// body or the disjuncts of an existential one decides the quantifier. Otherwise it merges a
|
|
186
|
-
// directly nested quantifier of the same kind when neither has patterns, eliminates unused
|
|
187
|
-
// variables, and applies der to pattern-free quantifiers.
|
|
188
161
|
private reduceQuantifierCore(expr: number, body: number, newPatterns: number[]) {
|
|
189
162
|
const manager = this.manager;
|
|
190
163
|
const data = manager.getQuantifier(expr);
|
|
@@ -200,7 +173,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
200
173
|
return data.isForall ? manager.falseExpr : manager.trueExpr;
|
|
201
174
|
const nested =
|
|
202
175
|
manager.kinds[body] === KIND_QUANTIFIER ? manager.getQuantifier(body) : undefined;
|
|
203
|
-
// remove_duplicates.
|
|
204
176
|
const patterns = newPatterns.filter((pattern, index) => newPatterns.indexOf(pattern) === index);
|
|
205
177
|
const merged =
|
|
206
178
|
nested !== undefined &&
|
|
@@ -232,8 +204,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
232
204
|
return rewritten;
|
|
233
205
|
}
|
|
234
206
|
|
|
235
|
-
// th_rewriter_cfg::apply_subst: the substitution replaces terms in the patterns without rewriting
|
|
236
|
-
// them, like expr_safe_replace.
|
|
237
207
|
private substitutePatterns(patterns: number[]) {
|
|
238
208
|
const manager = this.manager;
|
|
239
209
|
if (this.substitution.size === 0) return patterns;
|
|
@@ -255,7 +225,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
255
225
|
return patterns.map((pattern) => manager.mkPattern(manager.mapArgs(pattern, replace)));
|
|
256
226
|
}
|
|
257
227
|
|
|
258
|
-
// th_rewriter::mk_app: one reduction, without rewriting what it returns.
|
|
259
228
|
mkApp(decl: number, args: number[], sort: number) {
|
|
260
229
|
const reduced = this.reduceAppTop(decl, args, sort);
|
|
261
230
|
return reduced === -1
|
|
@@ -265,7 +234,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
265
234
|
: reduced.expr;
|
|
266
235
|
}
|
|
267
236
|
|
|
268
|
-
// th_rewriter's mk_app, with the result of a Rewrite rewritten again.
|
|
269
237
|
mkAppCore(decl: number, args: number[], sort: number): number {
|
|
270
238
|
const reduced = this.reduceAppTop(decl, args, sort);
|
|
271
239
|
return reduced === -1
|
|
@@ -275,7 +243,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
275
243
|
: this.reduceTo(reduced.expr, getRewriteDepth(reduced));
|
|
276
244
|
}
|
|
277
245
|
|
|
278
|
-
// th_rewriter_cfg::reduce_app: reduce_app_core, then pull_ite with pull_cheap_ite. -1 is BR_FAILED.
|
|
279
246
|
private reduceAppTop(decl: number, args: number[], sort: number) {
|
|
280
247
|
const manager = this.manager;
|
|
281
248
|
const reduced = this.reduceAppCore(decl, args);
|
|
@@ -292,8 +259,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
292
259
|
: reduced;
|
|
293
260
|
}
|
|
294
261
|
|
|
295
|
-
// pull_ite: (p (ite c a b) v) is (ite c (p a v) (p b v)) for a value v, and likewise for
|
|
296
|
-
// (p (ite c a b) (ite c a' b')) and a value first, for a p of two arguments.
|
|
297
262
|
private pullIte(decl: number, first: number, second: number, sort: number): Rewrite | undefined {
|
|
298
263
|
const manager = this.manager;
|
|
299
264
|
if (sort === SORT_BOOL && manager.sorts[first] !== SORT_BOOL) {
|
|
@@ -326,8 +291,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
326
291
|
return undefined;
|
|
327
292
|
}
|
|
328
293
|
|
|
329
|
-
// pull_ite_core: the value comes first when isSwapped. An equality of a branch and the value is
|
|
330
|
-
// decided when the branch is a value.
|
|
331
294
|
private pullIteCore(
|
|
332
295
|
decl: number,
|
|
333
296
|
ite: number,
|
|
@@ -348,7 +311,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
348
311
|
return { expr: manager.mkApp(OP_ITE, [manager.getArg(ite, 0), ...branches], sort), depth: 2 };
|
|
349
312
|
}
|
|
350
313
|
|
|
351
|
-
// is_ite_value_tree: an unshared ite whose leaves are values, through unshared ites.
|
|
352
314
|
private isIteValueTree(expr: number) {
|
|
353
315
|
const manager = this.manager;
|
|
354
316
|
if (!this.isIte(expr) || manager.getRefCount(expr) !== 1) return false;
|
|
@@ -362,7 +324,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
362
324
|
return true;
|
|
363
325
|
}
|
|
364
326
|
|
|
365
|
-
// The reductions of the Boolean and arithmetic rewriters, which the model evaluator applies too.
|
|
366
327
|
reduceAppCore(decl: number, args: number[]): number | Rewrite {
|
|
367
328
|
const manager = this.manager;
|
|
368
329
|
const op = manager.funcDecls[decl].op;
|
|
@@ -422,7 +383,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
422
383
|
}
|
|
423
384
|
}
|
|
424
385
|
|
|
425
|
-
// bool_rewriter::mk_not: (not (= a b)) of Booleans is (= (not a) b).
|
|
426
386
|
mkNot(arg: number): number {
|
|
427
387
|
const manager = this.manager;
|
|
428
388
|
if (manager.isNot(arg)) return manager.getArg(arg, 0);
|
|
@@ -431,9 +391,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
431
391
|
return manager.mkNot(arg);
|
|
432
392
|
}
|
|
433
393
|
|
|
434
|
-
// bool_rewriter::mk_flat_or_core and mk_nflat_or_core: lifts the disjuncts of nested disjunctions
|
|
435
|
-
// one level, drops false and duplicates, and detects true or a complementary pair. With
|
|
436
|
-
// sort_disjunctions, a disjunction that changed or is out of ast_lt's order is stably sorted by id.
|
|
437
394
|
mkOr(args: number[]): number {
|
|
438
395
|
const manager = this.manager;
|
|
439
396
|
const isNested = args.some((arg) => manager.getOp(arg) === OP_OR);
|
|
@@ -449,14 +406,11 @@ export class Rewriter extends RewriterTpl {
|
|
|
449
406
|
const isOutOfOrder = result.some(
|
|
450
407
|
(arg, index) => index > 0 && isAstLess(manager, arg, result[index - 1]),
|
|
451
408
|
);
|
|
452
|
-
// Dropping false or a duplicate disjunct also sets mk_nflat_or_core's s.
|
|
453
409
|
if (isNested || result.length !== flatArgs.length || isOutOfOrder)
|
|
454
410
|
sortByKey(result, (arg) => manager.ids[arg]);
|
|
455
411
|
return manager.mkOr(result);
|
|
456
412
|
}
|
|
457
413
|
|
|
458
|
-
// bool_rewriter::mk_and_core: with elim_and, mk_and_as_or. Otherwise mk_flat_and_core lifts the
|
|
459
|
-
// conjuncts of nested conjunctions one level, and has the result rewritten again.
|
|
460
414
|
private mkAndCore(args: number[]): number | Rewrite {
|
|
461
415
|
const manager = this.manager;
|
|
462
416
|
if (this.options.isEliminatingAnd) return this.mkAndAsOr(args);
|
|
@@ -464,7 +418,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
464
418
|
return { expr: this.mkNflatAnd(this.flattenArgs(args, OP_AND)), depth: 1 };
|
|
465
419
|
}
|
|
466
420
|
|
|
467
|
-
// The arguments with those that apply op replaced by their own arguments, one level deep.
|
|
468
421
|
private flattenArgs(args: number[], op: number) {
|
|
469
422
|
const manager = this.manager;
|
|
470
423
|
const flatArgs: number[] = [];
|
|
@@ -474,14 +427,11 @@ export class Rewriter extends RewriterTpl {
|
|
|
474
427
|
return flatArgs;
|
|
475
428
|
}
|
|
476
429
|
|
|
477
|
-
// bool_rewriter::mk_and, which takes the result of mk_and_core as it is.
|
|
478
430
|
mkAnd(args: number[]): number {
|
|
479
431
|
const result = this.mkAndCore(args);
|
|
480
432
|
return typeof result === "number" ? result : result.expr;
|
|
481
433
|
}
|
|
482
434
|
|
|
483
|
-
// bool_rewriter::mk_nflat_and_core: drops true and duplicates, and detects false or a complementary
|
|
484
|
-
// pair.
|
|
485
435
|
private mkNflatAnd(args: number[]) {
|
|
486
436
|
const manager = this.manager;
|
|
487
437
|
const literals = manager.flatLiterals;
|
|
@@ -495,8 +445,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
495
445
|
return result.length === 1 ? result[0] : manager.mkAnd(result);
|
|
496
446
|
}
|
|
497
447
|
|
|
498
|
-
// bool_rewriter::mk_and_as_or: the negation of the disjunction of the negated conjuncts. Each
|
|
499
|
-
// negation is built with its own temporaries, and the negations outlive the disjunction.
|
|
500
448
|
private mkAndAsOr(args: number[]) {
|
|
501
449
|
const manager = this.manager;
|
|
502
450
|
const negations = args.map((arg) => manager.withTemporaries(() => this.mkNot(arg)));
|
|
@@ -506,8 +454,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
506
454
|
return result;
|
|
507
455
|
}
|
|
508
456
|
|
|
509
|
-
// try_ite_eq: (ite c t e) = t is c when e is a value distinct from t, and likewise for e. The main
|
|
510
|
-
// loop rewrites the result again.
|
|
511
457
|
private tryIteEq(ite: number, other: number): Rewrite | undefined {
|
|
512
458
|
const manager = this.manager;
|
|
513
459
|
if (!this.isIte(ite)) return undefined;
|
|
@@ -527,7 +473,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
527
473
|
return first !== second && manager.isUniqueValue(first) && manager.isUniqueValue(second);
|
|
528
474
|
}
|
|
529
475
|
|
|
530
|
-
// The ite_extra_rules of mk_eq_core: an ite against a value, or two ites of values.
|
|
531
476
|
private mkIteValueEq(left: number, right: number): number | Rewrite | undefined {
|
|
532
477
|
const manager = this.manager;
|
|
533
478
|
if (this.isIte(left) && manager.isUniqueValue(right)) return this.tryIteValue(left, right);
|
|
@@ -569,22 +514,17 @@ export class Rewriter extends RewriterTpl {
|
|
|
569
514
|
return { expr: manager.mkApp(OP_AND, clauses, SORT_BOOL), depth: Infinity };
|
|
570
515
|
}
|
|
571
516
|
|
|
572
|
-
// try_ite_value: (ite c t e) = v for a value v. It builds its results without rewriting them, and
|
|
573
|
-
// the main loop rewrites them again.
|
|
574
517
|
private tryIteValue(ite: number, value: number): number | Rewrite | undefined {
|
|
575
518
|
const manager = this.manager;
|
|
576
519
|
const condition = manager.getArg(ite, 0);
|
|
577
520
|
const thenExpr = manager.getArg(ite, 1);
|
|
578
521
|
const elseExpr = manager.getArg(ite, 2);
|
|
579
|
-
// An equality of a branch is the first write to the result.
|
|
580
522
|
const write = (result: number) => {
|
|
581
523
|
this.releaseResult();
|
|
582
524
|
return result;
|
|
583
525
|
};
|
|
584
|
-
// Z3 rewrites the equality of a branch only below depth 500.
|
|
585
526
|
const mkBranchEq = (branch: number) =>
|
|
586
527
|
write(manager.depths[branch] < 500 ? this.mkEq(branch, value) : manager.mkEq(branch, value));
|
|
587
|
-
// mk_eq_plain.
|
|
588
528
|
const mkPlainEq = (branch: number) =>
|
|
589
529
|
branch === value
|
|
590
530
|
? manager.trueExpr
|
|
@@ -621,12 +561,10 @@ export class Rewriter extends RewriterTpl {
|
|
|
621
561
|
const branches = [mkPlainEq(thenExpr), getExpr(elseEq)];
|
|
622
562
|
return { expr: manager.mkApp(OP_ITE, [condition, ...branches], SORT_BOOL), depth: 2 };
|
|
623
563
|
}
|
|
624
|
-
// simplify_eq_ite's result is written even when it is null.
|
|
625
564
|
this.releaseResult();
|
|
626
565
|
return this.isDisjointFrom(ite, value) ? manager.falseExpr : undefined;
|
|
627
566
|
}
|
|
628
567
|
|
|
629
|
-
// simplify_eq_ite: whether every leaf of a tree of ites is a value distinct from the value.
|
|
630
568
|
private isDisjointFrom(ite: number, value: number) {
|
|
631
569
|
const manager = this.manager;
|
|
632
570
|
const visited = new Set<number>();
|
|
@@ -642,7 +580,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
642
580
|
return true;
|
|
643
581
|
}
|
|
644
582
|
|
|
645
|
-
// bool_rewriter::mk_eq, which does not rewrite the result of mk_eq_core again.
|
|
646
583
|
mkEq(left: number, right: number): number {
|
|
647
584
|
const result = this.mkEqCore(left, right);
|
|
648
585
|
return result === undefined
|
|
@@ -652,7 +589,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
652
589
|
: result.expr;
|
|
653
590
|
}
|
|
654
591
|
|
|
655
|
-
// bool_rewriter::mk_eq_core, after arith_rewriter::mk_eq_core folds numerals.
|
|
656
592
|
private mkEqCore(inputLeft: number, inputRight: number): number | Rewrite | undefined {
|
|
657
593
|
const manager = this.manager;
|
|
658
594
|
if (inputLeft === inputRight) return manager.trueExpr;
|
|
@@ -677,7 +613,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
677
613
|
if (manager.isNot(lhs))
|
|
678
614
|
return { expr: manager.mkNot(manager.mkEq(manager.getArg(lhs, 0), rhs)), depth: 2 };
|
|
679
615
|
if (isUnfolded) return { expr: manager.mkEq(lhs, rhs), depth: 1 };
|
|
680
|
-
// (= (= a b) (= a (not b))) is false.
|
|
681
616
|
if (manager.getOp(lhs) === OP_EQ && manager.getOp(rhs) === OP_EQ) {
|
|
682
617
|
const isNegationOf = (expr: number, other: number) =>
|
|
683
618
|
manager.isNot(expr) && manager.getArg(expr, 0) === other;
|
|
@@ -694,9 +629,7 @@ export class Rewriter extends RewriterTpl {
|
|
|
694
629
|
return undefined;
|
|
695
630
|
}
|
|
696
631
|
|
|
697
|
-
//
|
|
698
|
-
// again, since mk_eq may dispatch to other rewriters. Z3 keeps a longer distinct, which tlapm does
|
|
699
|
-
// not send, and this port expands it into disequalities.
|
|
632
|
+
// Z3 keeps a distinct of more than two arguments, which tlapm does not send, where this expands it into disequalities.
|
|
700
633
|
private mkDistinct(args: number[]): number | Rewrite {
|
|
701
634
|
if (args.length === 2) return { expr: this.mkNot(this.mkEq(args[0], args[1])), depth: 2 };
|
|
702
635
|
const pairs: number[] = [];
|
|
@@ -706,22 +639,17 @@ export class Rewriter extends RewriterTpl {
|
|
|
706
639
|
return this.mkAnd(pairs);
|
|
707
640
|
}
|
|
708
641
|
|
|
709
|
-
// bool_rewriter::mk_ite_core with elim_ite and ite_extra_rules. It applies the rules that change
|
|
710
|
-
// only the condition or a branch in sequence, and a result that it builds from new terms comes as a
|
|
711
|
-
// Rewrite for the main loop.
|
|
712
642
|
private mkIte(inputCondition: number, inputThen: number, inputElse: number): number | Rewrite {
|
|
713
643
|
const manager = this.manager;
|
|
714
644
|
const isNegated = manager.isNot(inputCondition);
|
|
715
645
|
const condition = isNegated ? manager.getArg(inputCondition, 0) : inputCondition;
|
|
716
646
|
const elseCandidate = isNegated ? inputThen : inputElse;
|
|
717
647
|
const thenCandidate = isNegated ? inputElse : inputThen;
|
|
718
|
-
// (ite c (ite c t1 t2) t3) is (ite c t1 t3).
|
|
719
648
|
const thenExpr =
|
|
720
649
|
this.isIte(thenCandidate) && manager.getArg(thenCandidate, 0) === condition
|
|
721
650
|
? manager.getArg(thenCandidate, 1)
|
|
722
651
|
: thenCandidate;
|
|
723
652
|
const sort = manager.sorts[thenExpr];
|
|
724
|
-
// (ite c t1 (ite c2 t1 t2)) is (ite (or c c2) t1 t2).
|
|
725
653
|
if (this.isIte(elseCandidate) && manager.getArg(elseCandidate, 1) === thenExpr) {
|
|
726
654
|
const disjunction = manager.mkApp(
|
|
727
655
|
OP_OR,
|
|
@@ -737,7 +665,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
737
665
|
depth: 3,
|
|
738
666
|
};
|
|
739
667
|
}
|
|
740
|
-
// (ite c t1 (ite c t2 t3)) is (ite c t1 t3).
|
|
741
668
|
const elseExpr =
|
|
742
669
|
this.isIte(elseCandidate) && manager.getArg(elseCandidate, 0) === condition
|
|
743
670
|
? manager.getArg(elseCandidate, 2)
|
|
@@ -756,7 +683,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
756
683
|
if (manager.isFalse(elseExpr) || elseExpr === condition)
|
|
757
684
|
return { expr: this.mkAnd([condition, thenExpr]), depth: 1 };
|
|
758
685
|
if (thenExpr === condition) return this.mkOr([condition, elseExpr]);
|
|
759
|
-
// is_complement_core: one branch is the negation of the other.
|
|
760
686
|
if (
|
|
761
687
|
(manager.isNot(thenExpr) && manager.getArg(thenExpr, 0) === elseExpr) ||
|
|
762
688
|
(manager.isNot(elseExpr) && manager.getArg(elseExpr, 0) === thenExpr)
|
|
@@ -765,7 +691,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
765
691
|
}
|
|
766
692
|
const isElseIte = this.isIte(elseExpr);
|
|
767
693
|
if (this.isIte(thenExpr)) {
|
|
768
|
-
// (ite c1 (ite c2 t1 t2) t1) is (ite (and c1 (not c2)) t2 t1).
|
|
769
694
|
if (elseExpr === manager.getArg(thenExpr, 1)) {
|
|
770
695
|
const conjunction = this.mkAnd([condition, this.mkNot(manager.getArg(thenExpr, 0))]);
|
|
771
696
|
return {
|
|
@@ -773,7 +698,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
773
698
|
depth: 2,
|
|
774
699
|
};
|
|
775
700
|
}
|
|
776
|
-
// (ite c1 (ite c2 t1 t2) t2) is (ite (and c1 c2) t1 t2).
|
|
777
701
|
if (elseExpr === manager.getArg(thenExpr, 2)) {
|
|
778
702
|
const conjunction = this.mkAnd([condition, manager.getArg(thenExpr, 0)]);
|
|
779
703
|
return {
|
|
@@ -781,8 +705,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
781
705
|
depth: 2,
|
|
782
706
|
};
|
|
783
707
|
}
|
|
784
|
-
// (ite c1 (ite c2 t1 t2) (ite c3 t1 t2)) is (ite (or (and c1 c2) (and (not c1) c3)) t1 t2),
|
|
785
|
-
// and with (ite c3 t2 t1) the last conjunct is (not c3).
|
|
786
708
|
const isSameBranches =
|
|
787
709
|
isElseIte &&
|
|
788
710
|
manager.getArg(thenExpr, 1) === manager.getArg(elseExpr, 1) &&
|
|
@@ -810,7 +732,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
810
732
|
}
|
|
811
733
|
}
|
|
812
734
|
if (isElseIte) {
|
|
813
|
-
// (ite c1 t1 (ite c2 t1 t2)) is (ite (or c1 c2) t1 t2).
|
|
814
735
|
if (thenExpr === manager.getArg(elseExpr, 1)) {
|
|
815
736
|
const disjunction = this.mkOr([condition, manager.getArg(elseExpr, 0)]);
|
|
816
737
|
return {
|
|
@@ -818,7 +739,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
818
739
|
depth: 1,
|
|
819
740
|
};
|
|
820
741
|
}
|
|
821
|
-
// (ite c1 t1 (ite c2 t2 t1)) is (ite (or c1 (not c2)) t1 t2).
|
|
822
742
|
if (thenExpr === manager.getArg(elseExpr, 2)) {
|
|
823
743
|
const disjunction = this.mkOr([condition, this.mkNot(manager.getArg(elseExpr, 0))]);
|
|
824
744
|
return {
|
|
@@ -830,8 +750,6 @@ export class Rewriter extends RewriterTpl {
|
|
|
830
750
|
return manager.mkApp(OP_ITE, [condition, thenExpr, elseExpr], sort);
|
|
831
751
|
}
|
|
832
752
|
|
|
833
|
-
// poly_rewriter::mk_add and mk_sub with a result: arith_rewriter's sum or difference, which is
|
|
834
|
-
// not rewritten again.
|
|
835
753
|
mkAdd(args: number[]) {
|
|
836
754
|
return this.arith.mkAdd(args) ?? this.arith.mkAddApp(args);
|
|
837
755
|
}
|
|
@@ -1,15 +1,10 @@
|
|
|
1
|
-
// Ported from Z3 (src/util/rlimit.h, src/util/rlimit.cpp, src/util/memory_manager.cpp), MIT
|
|
2
|
-
// license, see z3-license.txt. The resource limit of an ast_manager, shared by every context and
|
|
3
|
-
// rewriter that uses the manager. It cancels the work at the deadline, in milliseconds since the
|
|
4
|
-
// epoch, when the signal aborts, or when the heap is nearly full.
|
|
1
|
+
// Ported from Z3 (src/util/rlimit.h, src/util/rlimit.cpp, src/util/memory_manager.cpp), MIT license, see z3-license.txt.
|
|
5
2
|
import type { GCProfiler } from "node:v8";
|
|
6
3
|
import { SmtCanceledError } from "../../../errors";
|
|
7
4
|
|
|
8
5
|
export class ResourceLimit {
|
|
9
|
-
// m_count: the steps taken, which MBQI also uses as a random seed.
|
|
10
6
|
count = 0;
|
|
11
7
|
private isCanceled = false;
|
|
12
|
-
// Watches for a full collection while the used size is past the threshold.
|
|
13
8
|
private profiler: GCProfiler | null = null;
|
|
14
9
|
|
|
15
10
|
constructor(
|
|
@@ -17,9 +12,6 @@ export class ResourceLimit {
|
|
|
17
12
|
private signal?: AbortSignal,
|
|
18
13
|
) {}
|
|
19
14
|
|
|
20
|
-
// inc: counts a step and returns whether the work may go on. The clock and the heap are read on
|
|
21
|
-
// every 256th step, since a step costs less than reading them. A step can allocate kilobytes, so
|
|
22
|
-
// reading the heap less often lets it fill between two readings.
|
|
23
15
|
inc() {
|
|
24
16
|
this.count++;
|
|
25
17
|
if (
|
|
@@ -33,13 +25,10 @@ export class ResourceLimit {
|
|
|
33
25
|
return !this.isCanceled;
|
|
34
26
|
}
|
|
35
27
|
|
|
36
|
-
// tactic::checkpoint: counts a step, and throws once the work is canceled.
|
|
37
28
|
checkpoint() {
|
|
38
29
|
if (!this.inc()) throw new SmtCanceledError();
|
|
39
30
|
}
|
|
40
31
|
|
|
41
|
-
// The used size counts garbage, such as what earlier work left, until the collector runs. So once
|
|
42
|
-
// it passes the threshold, the size after the next full collection decides.
|
|
43
32
|
private isHeapNearlyFull() {
|
|
44
33
|
if (v8 === undefined) return false;
|
|
45
34
|
const statistics = v8.getHeapStatistics();
|
|
@@ -62,22 +51,15 @@ export class ResourceLimit {
|
|
|
62
51
|
return collection.afterGC.heapStatistics.usedHeapSize > threshold;
|
|
63
52
|
}
|
|
64
53
|
|
|
65
|
-
// Stops watching the collector, which the work does when it ends.
|
|
66
54
|
release() {
|
|
67
55
|
this.profiler?.stop();
|
|
68
56
|
this.profiler = null;
|
|
69
57
|
}
|
|
70
58
|
}
|
|
71
59
|
|
|
72
|
-
// Z3 runs as its own process, where running out of memory ends only that process and tlapm counts
|
|
73
|
-
// the obligation as failed. The solver shares its caller's process instead, which running out of
|
|
74
|
-
// heap would end, so it stops before the heap fills, like Z3's max_memory in memory::allocate. The
|
|
75
|
-
// heap statistics come from node:v8. In V8, which Node and Deno use, the used and the available
|
|
76
|
-
// size add up to the heap limit. Bun reports the memory of the machine and no full collections,
|
|
77
|
-
// and its getHeapStatistics walks every live object, which made a proof 100 times slower, so the
|
|
78
|
-
// check is off there.
|
|
79
60
|
const HEAP_FRACTION = 0.8;
|
|
80
61
|
const CLOCK_CHECK_MASK = 255;
|
|
62
|
+
// HACK: Bun's getHeapStatistics walks every live object, which made a proof 100 times slower.
|
|
81
63
|
const v8 =
|
|
82
64
|
typeof process === "undefined" || process.versions.bun !== undefined
|
|
83
65
|
? undefined
|
|
@@ -1,8 +1,7 @@
|
|
|
1
1
|
// Ported from Z3 (src/parsers/smt2/smt2parser.cpp), MIT license, see z3-license.txt.
|
|
2
|
-
// Parses the SMT-LIB subset that tlapm emits into Z3-style expressions.
|
|
3
2
|
import { SmtParseError, SmtUnsupportedError } from "../../../errors";
|
|
4
3
|
import {
|
|
5
|
-
AstManager,
|
|
4
|
+
type AstManager,
|
|
6
5
|
FAMILY_ARITH,
|
|
7
6
|
FAMILY_BASIC,
|
|
8
7
|
KIND_QUANTIFIER,
|
|
@@ -43,20 +42,15 @@ import { replaceFreeVars } from "./var-subst";
|
|
|
43
42
|
|
|
44
43
|
type SExpr = string | SExpr[];
|
|
45
44
|
|
|
46
|
-
// A name in scope: a variable bound by a quantifier, or a let binding's term. depth is the number of
|
|
47
|
-
// binders above it.
|
|
48
45
|
type Binding =
|
|
49
46
|
| { kind: "var"; depth: number; sort: number }
|
|
50
47
|
| { kind: "let"; depth: number; expr: number };
|
|
51
48
|
|
|
52
49
|
interface SmtProblem {
|
|
53
50
|
assertions: number[];
|
|
54
|
-
// Z3 prints no answer for a script without check-sat.
|
|
55
51
|
hasCheckSat: boolean;
|
|
56
52
|
}
|
|
57
53
|
|
|
58
|
-
// An application that parseTerm is parsing: its name, its list, where its arguments start on the
|
|
59
|
-
// result stack, and its next argument.
|
|
60
54
|
interface ApplicationFrame {
|
|
61
55
|
name: string;
|
|
62
56
|
list: SExpr[];
|
|
@@ -83,7 +77,6 @@ const BUILTIN_OPS = new Map<string, number>([
|
|
|
83
77
|
["is_int", OP_IS_INT],
|
|
84
78
|
]);
|
|
85
79
|
|
|
86
|
-
// arith_decl_plugin's use_coercion: the operators that are Real when any argument is Real.
|
|
87
80
|
const COERCING_OPS = new Set([OP_ADD, OP_SUB, OP_UMINUS, OP_MUL, OP_LE, OP_GE, OP_LT, OP_GT]);
|
|
88
81
|
|
|
89
82
|
const DECIMAL = /^([0-9]+)\.([0-9]+)$/;
|
|
@@ -155,8 +148,6 @@ const expectSymbol = (sexpr: SExpr | undefined): string => {
|
|
|
155
148
|
return sexpr;
|
|
156
149
|
};
|
|
157
150
|
|
|
158
|
-
// Parses a script, and hands each assertion to assertExpr as Z3's cmd_context does, before it parses
|
|
159
|
-
// the next command. Expressions are created in the order of Z3's parser, and live as long as there.
|
|
160
151
|
export const parseSmtlib = (
|
|
161
152
|
text: string,
|
|
162
153
|
manager: AstManager,
|
|
@@ -186,14 +177,12 @@ export const parseSmtlib = (
|
|
|
186
177
|
return undefined;
|
|
187
178
|
};
|
|
188
179
|
|
|
189
|
-
// basic_decl_plugin::join: Int and Real join to Real. Other sorts join only with themselves.
|
|
190
180
|
const getJoin = (args: number[]) => {
|
|
191
181
|
const argSorts = args.map((arg) => manager.sorts[arg]);
|
|
192
182
|
if (!argSorts.every(isArithSort)) return argSorts[0];
|
|
193
183
|
return argSorts.includes(SORT_REAL) ? SORT_REAL : SORT_INT;
|
|
194
184
|
};
|
|
195
185
|
|
|
196
|
-
// The sort of the arguments of a builtin, as Z3's decl plugins pick its declaration.
|
|
197
186
|
const getDomainSort = (op: number, args: number[]) => {
|
|
198
187
|
if (op === OP_ITE) return getJoin(args.slice(1));
|
|
199
188
|
if (op === OP_EQ || op === OP_DISTINCT) return getJoin(args);
|
|
@@ -218,8 +207,6 @@ export const parseSmtlib = (
|
|
|
218
207
|
? domainSort
|
|
219
208
|
: SORT_BOOL;
|
|
220
209
|
|
|
221
|
-
// ast_manager::coerce_to: an Int argument of a Real position becomes to_real, and a Real argument
|
|
222
|
-
// of an Int position to_int.
|
|
223
210
|
const coerce = (arg: number, sort: number) => {
|
|
224
211
|
const argSort = manager.sorts[arg];
|
|
225
212
|
if (argSort === sort || !isArithSort(argSort) || !isArithSort(sort)) return arg;
|
|
@@ -228,9 +215,6 @@ export const parseSmtlib = (
|
|
|
228
215
|
: manager.mkApp(OP_TO_INT, [arg], SORT_INT);
|
|
229
216
|
};
|
|
230
217
|
|
|
231
|
-
// Coerces the arguments of an application to the sorts of its declaration, as Z3 does with its
|
|
232
|
-
// default int_real_coercions, then checks their sorts and number, so the solver only sees
|
|
233
|
-
// well-sorted terms, and that quantifiers occur only under Boolean connectives.
|
|
234
218
|
const mkApp = (decl: number, inputArgs: number[], domainSort?: number) => {
|
|
235
219
|
const op = manager.funcDecls[decl].op;
|
|
236
220
|
const name = manager.funcDecls[decl].name;
|
|
@@ -295,8 +279,6 @@ export const parseSmtlib = (
|
|
|
295
279
|
return expr;
|
|
296
280
|
};
|
|
297
281
|
|
|
298
|
-
// push_pattern_frame with ignore_bad_patterns: (t1 ... tn) is a multi-pattern, (f a ...) a pattern
|
|
299
|
-
// of one term, and a pattern that starts with a constant is dropped unparsed.
|
|
300
282
|
const parsePattern = (sexpr: SExpr) => {
|
|
301
283
|
if (!Array.isArray(sexpr) || sexpr.length === 0) return undefined;
|
|
302
284
|
const head = sexpr[0];
|
|
@@ -307,8 +289,6 @@ export const parseSmtlib = (
|
|
|
307
289
|
return manager.mkPattern([parseTerm(sexpr)]);
|
|
308
290
|
};
|
|
309
291
|
|
|
310
|
-
// pattern_validator: a pattern has no Boolean operator other than equality, no quantifier, and
|
|
311
|
-
// every variable of its quantifier.
|
|
312
292
|
const isValidPattern = (pattern: number, numDecls: number) => {
|
|
313
293
|
const found = new Set<number>();
|
|
314
294
|
const isValid = (expr: number): boolean => {
|
|
@@ -342,8 +322,6 @@ export const parseSmtlib = (
|
|
|
342
322
|
});
|
|
343
323
|
scopes.push(scope);
|
|
344
324
|
depth += varSorts.length;
|
|
345
|
-
// parse_sorted_vars: the variables are created first, the first declared with the largest index,
|
|
346
|
-
// and the parser's stack holds them until the quantifier is created.
|
|
347
325
|
const boundVars = varSorts.map((sort, index) =>
|
|
348
326
|
manager.mkVar(varSorts.length - 1 - index, sort),
|
|
349
327
|
);
|
|
@@ -369,8 +347,6 @@ export const parseSmtlib = (
|
|
|
369
347
|
}
|
|
370
348
|
scopes.pop();
|
|
371
349
|
depth -= varSorts.length;
|
|
372
|
-
// pop_quant_frame: the invalid patterns leave the parser's stack before the quantifier is made,
|
|
373
|
-
// and the valid ones after.
|
|
374
350
|
let numKept = 0;
|
|
375
351
|
for (const pattern of patterns) {
|
|
376
352
|
if (!isValidPattern(pattern, varSorts.length)) continue;
|
|
@@ -411,7 +387,6 @@ export const parseSmtlib = (
|
|
|
411
387
|
const chainable = CHAINABLE_OPS.get(name);
|
|
412
388
|
if (chainable !== undefined) return mkChain(chainable, args);
|
|
413
389
|
if (name === "-") return mkApp(args.length === 1 ? OP_UMINUS : OP_SUB, args);
|
|
414
|
-
// ast_manager::mk_app: / is left associative, so more arguments nest to the left.
|
|
415
390
|
if (name === "/" && args.length > 2)
|
|
416
391
|
return args
|
|
417
392
|
.slice(1)
|
|
@@ -423,8 +398,6 @@ export const parseSmtlib = (
|
|
|
423
398
|
return mkApp(decl, args);
|
|
424
399
|
};
|
|
425
400
|
|
|
426
|
-
// A term without nested applications to parse first: a symbol, a quantifier, a let or an
|
|
427
|
-
// annotation.
|
|
428
401
|
const parseLeaf = (sexpr: SExpr): number => {
|
|
429
402
|
if (typeof sexpr === "string") {
|
|
430
403
|
if (/^[0-9]+$/.test(sexpr)) return manager.mkNumeral(BigInt(sexpr));
|
|
@@ -437,9 +410,6 @@ export const parseSmtlib = (
|
|
|
437
410
|
if (sexpr === "false") return manager.falseExpr;
|
|
438
411
|
const binding = lookup(sexpr);
|
|
439
412
|
if (binding?.kind === "var") return manager.mkVar(depth - 1 - binding.depth, binding.sort);
|
|
440
|
-
// Z3's var_shifter moves the free variables of a let binding up by the binders since. Its cache
|
|
441
|
-
// holds the terms it makes, but this parser holds no references, so it rebuilds the binding
|
|
442
|
-
// with replaceFreeVars.
|
|
443
413
|
if (binding !== undefined)
|
|
444
414
|
return depth === binding.depth
|
|
445
415
|
? binding.expr
|
|
@@ -452,7 +422,6 @@ export const parseSmtlib = (
|
|
|
452
422
|
if (head === "forall" || head === "exists") return parseQuantifier(sexpr, head === "forall");
|
|
453
423
|
if (head === "let") return parseLet(sexpr);
|
|
454
424
|
const named = parseTerm(sexpr[1]);
|
|
455
|
-
// name_expr: cmd_context keeps a named expression as a macro.
|
|
456
425
|
const nameIndex = sexpr.indexOf(":named");
|
|
457
426
|
if (nameIndex !== -1) {
|
|
458
427
|
manager.incRef(named);
|
|
@@ -461,8 +430,6 @@ export const parseSmtlib = (
|
|
|
461
430
|
return named;
|
|
462
431
|
};
|
|
463
432
|
|
|
464
|
-
// Applications keep their own stack, like Z3's parser, so deeply nested terms do not exhaust the
|
|
465
|
-
// call stack.
|
|
466
433
|
const parseTerm = (sexpr: SExpr): number => {
|
|
467
434
|
const frames: ApplicationFrame[] = [];
|
|
468
435
|
const results: number[] = [];
|
|
@@ -502,8 +469,7 @@ export const parseSmtlib = (
|
|
|
502
469
|
} else if (name === "declare-fun" || name === "declare-const") {
|
|
503
470
|
const domain = name === "declare-fun" ? expectList(list[2]).map(parseSort) : [];
|
|
504
471
|
const range = parseSort(name === "declare-fun" ? list[3] : list[2]);
|
|
505
|
-
// builtin_signature_collides and is_transcendental_shadow_decl each
|
|
506
|
-
// name to fresh variables, which they then release.
|
|
472
|
+
// Z3's builtin_signature_collides and is_transcendental_shadow_decl each make and release fresh variables of the domain.
|
|
507
473
|
for (let round = 0; round < 2; round++) {
|
|
508
474
|
const vars = domain.map((sort, index) => manager.mkVar(index, sort));
|
|
509
475
|
for (const domainVar of vars) manager.incRef(domainVar);
|
|
@@ -511,7 +477,6 @@ export const parseSmtlib = (
|
|
|
511
477
|
}
|
|
512
478
|
funcs.set(expectSymbol(list[1]), manager.mkFuncDecl(expectSymbol(list[1]), domain, range));
|
|
513
479
|
} else if (name === "assert") {
|
|
514
|
-
// cmd_context::assert_expr keeps the assertion, and passes it to the solver.
|
|
515
480
|
const assertion = expectBool(parseTerm(list[1]));
|
|
516
481
|
manager.incRef(assertion);
|
|
517
482
|
assertions.push(assertion);
|