tla-ts 0.0.9 → 0.0.10-dev.63a6693bd
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 +29 -29
- package/dist/deciders.js +42 -42
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +106 -10
- package/dist/index.d.ts +106 -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 +117 -37
- 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 +129 -104
- package/dist/transfer.js +129 -104
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +3 -1
- package/src/ast.ts +48 -62
- package/src/bags.ts +99 -102
- package/src/builtins.ts +28 -75
- package/src/bundled-modules.ts +1 -8
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +282 -0
- package/src/check.ts +599 -754
- package/src/cli/options.ts +12 -32
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +136 -0
- package/src/cli/shared.ts +19 -12
- package/src/cli/tlapm.ts +14 -25
- package/src/cli/tlc-arguments.ts +652 -0
- package/src/cli/tlc-output.ts +687 -0
- package/src/cli/tlc-usage.ts +361 -0
- package/src/cli/tlc.ts +309 -658
- 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 +196 -74
- package/src/config.ts +140 -109
- package/src/coverage.ts +830 -0
- package/src/dependencies.ts +14 -53
- package/src/dfid.ts +618 -0
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +169 -335
- package/src/errors.ts +71 -55
- package/src/evaluate.ts +598 -340
- package/src/exit-codes.ts +37 -3
- package/src/fingerprints.ts +75 -11
- package/src/index.ts +3 -0
- package/src/instances.ts +126 -21
- package/src/java-hash.ts +7 -0
- package/src/java-overrides.ts +4 -19
- package/src/json-reader.ts +455 -0
- package/src/json.ts +252 -139
- package/src/levels.ts +46 -58
- package/src/lexer.ts +80 -100
- package/src/liveness-checker.ts +103 -153
- package/src/liveness.ts +150 -109
- package/src/obligations/action.ts +8 -39
- package/src/obligations/anonymize.ts +88 -82
- package/src/obligations/equality.ts +1 -1
- package/src/obligations/expression.ts +20 -21
- package/src/obligations/format.ts +1 -9
- package/src/obligations/generate.ts +46 -49
- package/src/obligations/index.ts +2 -13
- package/src/obligations/levels.ts +4 -8
- package/src/obligations/module.ts +28 -53
- package/src/obligations/normalize.ts +7 -25
- 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 +42 -58
- package/src/obligations/source.ts +48 -78
- package/src/obligations/subexpression.ts +5 -11
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +13 -19
- package/src/obligations/tuples.ts +3 -9
- package/src/parallel-worker.ts +30 -60
- package/src/parallel.ts +57 -71
- package/src/parser.ts +584 -316
- 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 +3 -7
- 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 +114 -115
- package/src/prover/isabelle/isar/method.ts +29 -53
- 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 +26 -36
- package/src/prover/isabelle/isar/type-check.ts +17 -31
- package/src/prover/isabelle/provers/blast/blast.ts +17 -104
- 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 +28 -51
- package/src/prover/isabelle/pure/bicompose.ts +25 -38
- package/src/prover/isabelle/pure/consts.ts +1 -7
- package/src/prover/isabelle/pure/conv.ts +3 -17
- package/src/prover/isabelle/pure/drule.ts +33 -42
- 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 +2 -15
- 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 +17 -62
- package/src/prover/isabelle/pure/rewriter.ts +31 -67
- 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 +3 -32
- package/src/prover/isabelle/pure/tactic.ts +12 -22
- package/src/prover/isabelle/pure/tactical.ts +48 -47
- 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 +27 -47
- 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 +17 -24
- package/src/prover/isabelle/tla/context.ts +15 -18
- package/src/prover/isabelle/tla/logic.ts +14 -32
- package/src/prover/isabelle/tla/simpdata.ts +46 -43
- package/src/prover/isabelle/tools/intuitionistic.ts +1 -10
- package/src/prover/ocaml.ts +0 -6
- package/src/prover/prep/action.ts +14 -54
- package/src/prover/prep/enabled-axioms.ts +12 -19
- package/src/prover/prep/fingerprint.ts +2 -21
- package/src/prover/prep/level-comparison.ts +8 -12
- package/src/prover/prep/md5.ts +0 -2
- package/src/prover/prep/methods.ts +33 -39
- package/src/prover/prep/normalize.ts +4 -28
- package/src/prover/prove-worker.ts +0 -2
- package/src/prover/prove.ts +87 -100
- 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 +20 -28
- package/src/prover/smt/data.ts +433 -424
- package/src/prover/smt/encode.ts +43 -52
- 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 +663 -667
- 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 -165
- package/src/prover/smt/solver/auf-solver.ts +8 -44
- 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 +7 -64
- 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 +4 -35
- 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 +1 -6
- 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 +7 -100
- 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 +9 -102
- 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 +36 -135
- 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 +18 -58
- 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 +3 -37
- package/src/prover/smt/solver/model-evaluator.ts +3 -29
- package/src/prover/smt/solver/model-finder.ts +15 -32
- package/src/prover/smt/solver/model-generator.ts +1 -12
- package/src/prover/smt/solver/model-macro-solver.ts +23 -88
- package/src/prover/smt/solver/nlsat/algebraic.ts +63 -159
- package/src/prover/smt/solver/nlsat/atoms.ts +25 -23
- package/src/prover/smt/solver/nlsat/evaluator.ts +17 -22
- package/src/prover/smt/solver/nlsat/explain.ts +10 -69
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -50
- package/src/prover/smt/solver/nlsat/levelwise.ts +49 -135
- package/src/prover/smt/solver/nlsat/mpbq.ts +3 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +29 -159
- package/src/prover/smt/solver/nlsat/solver.ts +18 -90
- package/src/prover/smt/solver/nlsat/types.ts +1 -8
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +2 -45
- 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 -52
- 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 +27 -47
- package/src/prover/smt/solver/quantifier-manager.ts +2 -13
- 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 +80 -131
- 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 +1 -7
- package/src/prover/smt/solver/theory-lra-final-check.ts +4 -22
- package/src/prover/smt/solver/theory-lra-internalize.ts +6 -43
- 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 +45 -40
- package/src/prover/tlapm/ocaml-marshal.ts +19 -21
- package/src/prover/tlapm/tlapm.ts +21 -20
- package/src/prover/verdict.ts +7 -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 +0 -12
- package/src/prover/zenon/encode.ts +1 -8
- package/src/prover/zenon/eqrel.ts +2 -13
- package/src/prover/zenon/equality-rules.ts +0 -4
- package/src/prover/zenon/expr.ts +8 -26
- package/src/prover/zenon/index-table.ts +26 -57
- package/src/prover/zenon/isar-case.ts +9 -19
- package/src/prover/zenon/isar.ts +36 -64
- package/src/prover/zenon/limits.ts +0 -4
- package/src/prover/zenon/llproof.ts +2 -20
- package/src/prover/zenon/mltoll.ts +66 -104
- package/src/prover/zenon/node.ts +1 -11
- package/src/prover/zenon/ocaml.ts +1 -17
- package/src/prover/zenon/parse.ts +4 -12
- 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 +5 -31
- package/src/prover/zenon/tla/functions.ts +59 -31
- package/src/prover/zenon/tla/llproof.ts +67 -76
- package/src/prover/zenon/tla/records.ts +57 -33
- package/src/prover/zenon/tla/rewrites.ts +12 -19
- package/src/prover/zenon/tla/sets.ts +83 -53
- package/src/prover/zenon/tla/terms.ts +0 -6
- package/src/prover/zenon/tla/tla.ts +66 -64
- package/src/randomization.ts +81 -35
- package/src/resolve.ts +67 -184
- package/src/runtime.ts +22 -22
- package/src/sany/builtins.ts +2 -5
- package/src/sany/generation.ts +394 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1100 -0
- package/src/sany/generator-proofs.ts +662 -0
- package/src/sany/generator.ts +191 -2764
- package/src/sany/levels.ts +6 -34
- package/src/sany/lexer.ts +58 -77
- package/src/sany/linter.ts +1 -9
- package/src/sany/modules.ts +1 -5
- package/src/sany/nodes.ts +5 -43
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +32 -69
- package/src/sany/selectors.ts +49 -76
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +35 -117
- package/src/search.ts +541 -163
- package/src/simulate.ts +709 -0
- package/src/spec-description.ts +192 -100
- package/src/standard-definitions.ts +0 -4
- package/src/standard-modules.ts +264 -95
- package/src/state-graph.ts +52 -31
- package/src/subexpressions.ts +69 -52
- package/src/substitution-levels.ts +7 -7
- package/src/successors.ts +266 -99
- package/src/symmetry.ts +33 -25
- package/src/tableau.ts +27 -24
- package/src/tlc/fingerprint.ts +183 -67
- package/src/tlc/jar-data.ts +112 -6
- package/src/tlc/messages.ts +125 -54
- package/src/tlc/order.ts +39 -69
- package/src/tlc/random.ts +37 -49
- package/src/tlc/replay.ts +553 -228
- package/src/tlc/summary.ts +36 -47
- package/src/tlc/tlc-operators.ts +78 -44
- package/src/tlc/tlcext-operators.ts +139 -122
- package/src/tlc/trace-spec.ts +249 -0
- package/src/tlc/value-stream.ts +139 -0
- package/src/tlc/version.ts +1 -4
- package/src/transfer.ts +22 -25
- 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 +832 -484
- package/src/worker.ts +7 -8
|
@@ -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,
|
|
@@ -31,7 +30,6 @@ import {
|
|
|
31
30
|
OP_TRUE,
|
|
32
31
|
OP_FALSE,
|
|
33
32
|
OP_UMINUS,
|
|
34
|
-
OP_UNINTERPRETED,
|
|
35
33
|
OP_XOR,
|
|
36
34
|
SORT_BOOL,
|
|
37
35
|
SORT_INT,
|
|
@@ -43,20 +41,15 @@ import { replaceFreeVars } from "./var-subst";
|
|
|
43
41
|
|
|
44
42
|
type SExpr = string | SExpr[];
|
|
45
43
|
|
|
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
44
|
type Binding =
|
|
49
45
|
| { kind: "var"; depth: number; sort: number }
|
|
50
46
|
| { kind: "let"; depth: number; expr: number };
|
|
51
47
|
|
|
52
48
|
interface SmtProblem {
|
|
53
49
|
assertions: number[];
|
|
54
|
-
// Z3 prints no answer for a script without check-sat.
|
|
55
50
|
hasCheckSat: boolean;
|
|
56
51
|
}
|
|
57
52
|
|
|
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
53
|
interface ApplicationFrame {
|
|
61
54
|
name: string;
|
|
62
55
|
list: SExpr[];
|
|
@@ -64,37 +57,56 @@ interface ApplicationFrame {
|
|
|
64
57
|
next: number;
|
|
65
58
|
}
|
|
66
59
|
|
|
67
|
-
|
|
68
|
-
|
|
69
|
-
|
|
70
|
-
|
|
71
|
-
[
|
|
72
|
-
|
|
73
|
-
|
|
74
|
-
|
|
75
|
-
["+", OP_ADD],
|
|
76
|
-
["*", OP_MUL],
|
|
77
|
-
["/", OP_DIV],
|
|
78
|
-
["div", OP_IDIV],
|
|
79
|
-
["mod", OP_MOD],
|
|
80
|
-
["abs", OP_ABS],
|
|
81
|
-
["to_real", OP_TO_REAL],
|
|
82
|
-
["to_int", OP_TO_INT],
|
|
83
|
-
["is_int", OP_IS_INT],
|
|
84
|
-
]);
|
|
60
|
+
interface Operator {
|
|
61
|
+
op: number;
|
|
62
|
+
symbol?: string;
|
|
63
|
+
isChainable?: boolean;
|
|
64
|
+
arity: [min: number, max: number];
|
|
65
|
+
domain: "join" | "branches" | "arith" | "first" | number;
|
|
66
|
+
range: "domain" | number;
|
|
67
|
+
}
|
|
85
68
|
|
|
86
|
-
|
|
87
|
-
|
|
69
|
+
const OPERATORS: Operator[] = [
|
|
70
|
+
{ op: OP_AND, symbol: "and", arity: [0, Infinity], domain: SORT_BOOL, range: SORT_BOOL },
|
|
71
|
+
{ op: OP_OR, symbol: "or", arity: [0, Infinity], domain: SORT_BOOL, range: SORT_BOOL },
|
|
72
|
+
{ op: OP_NOT, symbol: "not", arity: [1, 1], domain: SORT_BOOL, range: SORT_BOOL },
|
|
73
|
+
{ op: OP_IMPLIES, symbol: "=>", arity: [2, 2], domain: SORT_BOOL, range: SORT_BOOL },
|
|
74
|
+
{ op: OP_XOR, symbol: "xor", arity: [2, 2], domain: SORT_BOOL, range: SORT_BOOL },
|
|
75
|
+
{ op: OP_ITE, symbol: "ite", arity: [3, 3], domain: "branches", range: "domain" },
|
|
76
|
+
{ op: OP_DISTINCT, symbol: "distinct", arity: [2, Infinity], domain: "join", range: SORT_BOOL },
|
|
77
|
+
{ op: OP_ADD, symbol: "+", arity: [1, Infinity], domain: "arith", range: "domain" },
|
|
78
|
+
{ op: OP_MUL, symbol: "*", arity: [1, Infinity], domain: "arith", range: "domain" },
|
|
79
|
+
{ op: OP_DIV, symbol: "/", arity: [2, 2], domain: SORT_REAL, range: SORT_REAL },
|
|
80
|
+
{ op: OP_IDIV, symbol: "div", arity: [2, 2], domain: SORT_INT, range: SORT_INT },
|
|
81
|
+
{ op: OP_MOD, symbol: "mod", arity: [2, 2], domain: SORT_INT, range: SORT_INT },
|
|
82
|
+
{ op: OP_ABS, symbol: "abs", arity: [1, 1], domain: "first", range: "domain" },
|
|
83
|
+
{ op: OP_TO_REAL, symbol: "to_real", arity: [1, 1], domain: "first", range: SORT_REAL },
|
|
84
|
+
{ op: OP_TO_INT, symbol: "to_int", arity: [1, 1], domain: "first", range: SORT_INT },
|
|
85
|
+
{ op: OP_IS_INT, symbol: "is_int", arity: [1, 1], domain: SORT_REAL, range: SORT_BOOL },
|
|
86
|
+
{
|
|
87
|
+
op: OP_EQ,
|
|
88
|
+
symbol: "=",
|
|
89
|
+
isChainable: true,
|
|
90
|
+
arity: [2, Infinity],
|
|
91
|
+
domain: "join",
|
|
92
|
+
range: SORT_BOOL,
|
|
93
|
+
},
|
|
94
|
+
{ op: OP_LE, symbol: "<=", isChainable: true, arity: [2, 2], domain: "arith", range: SORT_BOOL },
|
|
95
|
+
{ op: OP_GE, symbol: ">=", isChainable: true, arity: [2, 2], domain: "arith", range: SORT_BOOL },
|
|
96
|
+
{ op: OP_LT, symbol: "<", isChainable: true, arity: [2, 2], domain: "arith", range: SORT_BOOL },
|
|
97
|
+
{ op: OP_GT, symbol: ">", isChainable: true, arity: [2, 2], domain: "arith", range: SORT_BOOL },
|
|
98
|
+
{ op: OP_SUB, arity: [1, Infinity], domain: "arith", range: "domain" },
|
|
99
|
+
{ op: OP_UMINUS, arity: [1, 1], domain: "arith", range: "domain" },
|
|
100
|
+
];
|
|
88
101
|
|
|
89
|
-
const
|
|
102
|
+
const OPERATORS_BY_OP = new Map<number, Operator>();
|
|
103
|
+
const OPERATORS_BY_SYMBOL = new Map<string, Operator>();
|
|
104
|
+
for (const operator of OPERATORS) {
|
|
105
|
+
OPERATORS_BY_OP.set(operator.op, operator);
|
|
106
|
+
if (operator.symbol !== undefined) OPERATORS_BY_SYMBOL.set(operator.symbol, operator);
|
|
107
|
+
}
|
|
90
108
|
|
|
91
|
-
const
|
|
92
|
-
["=", OP_EQ],
|
|
93
|
-
["<=", OP_LE],
|
|
94
|
-
[">=", OP_GE],
|
|
95
|
-
["<", OP_LT],
|
|
96
|
-
[">", OP_GT],
|
|
97
|
-
]);
|
|
109
|
+
const DECIMAL = /^([0-9]+)\.([0-9]+)$/;
|
|
98
110
|
|
|
99
111
|
const tokenize = (text: string) => {
|
|
100
112
|
const tokens: string[] = [];
|
|
@@ -155,8 +167,6 @@ const expectSymbol = (sexpr: SExpr | undefined): string => {
|
|
|
155
167
|
return sexpr;
|
|
156
168
|
};
|
|
157
169
|
|
|
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
170
|
export const parseSmtlib = (
|
|
161
171
|
text: string,
|
|
162
172
|
manager: AstManager,
|
|
@@ -186,40 +196,19 @@ export const parseSmtlib = (
|
|
|
186
196
|
return undefined;
|
|
187
197
|
};
|
|
188
198
|
|
|
189
|
-
// basic_decl_plugin::join: Int and Real join to Real. Other sorts join only with themselves.
|
|
190
199
|
const getJoin = (args: number[]) => {
|
|
191
200
|
const argSorts = args.map((arg) => manager.sorts[arg]);
|
|
192
201
|
if (!argSorts.every(isArithSort)) return argSorts[0];
|
|
193
202
|
return argSorts.includes(SORT_REAL) ? SORT_REAL : SORT_INT;
|
|
194
203
|
};
|
|
195
204
|
|
|
196
|
-
|
|
197
|
-
|
|
198
|
-
if (
|
|
199
|
-
if (
|
|
200
|
-
|
|
201
|
-
if (op === OP_ABS || op === OP_TO_REAL || op === OP_TO_INT) return manager.sorts[args[0]];
|
|
202
|
-
if (op === OP_IDIV || op === OP_MOD) return SORT_INT;
|
|
203
|
-
if (op === OP_DIV || op === OP_IS_INT) return SORT_REAL;
|
|
204
|
-
return SORT_BOOL;
|
|
205
|
+
const getDomainSort = (operator: Operator, args: number[]) => {
|
|
206
|
+
if (operator.domain === "branches") return getJoin(args.slice(1));
|
|
207
|
+
if (operator.domain === "join") return getJoin(args);
|
|
208
|
+
if (operator.domain === "arith") return getJoin(args) === SORT_REAL ? SORT_REAL : SORT_INT;
|
|
209
|
+
return operator.domain === "first" ? manager.sorts[args[0]] : operator.domain;
|
|
205
210
|
};
|
|
206
211
|
|
|
207
|
-
const getRange = (op: number, domainSort: number) =>
|
|
208
|
-
op === OP_TO_REAL || op === OP_DIV
|
|
209
|
-
? SORT_REAL
|
|
210
|
-
: op === OP_TO_INT || op === OP_IDIV || op === OP_MOD
|
|
211
|
-
? SORT_INT
|
|
212
|
-
: op === OP_ITE ||
|
|
213
|
-
op === OP_ABS ||
|
|
214
|
-
op === OP_ADD ||
|
|
215
|
-
op === OP_SUB ||
|
|
216
|
-
op === OP_UMINUS ||
|
|
217
|
-
op === OP_MUL
|
|
218
|
-
? domainSort
|
|
219
|
-
: SORT_BOOL;
|
|
220
|
-
|
|
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
212
|
const coerce = (arg: number, sort: number) => {
|
|
224
213
|
const argSort = manager.sorts[arg];
|
|
225
214
|
if (argSort === sort || !isArithSort(argSort) || !isArithSort(sort)) return arg;
|
|
@@ -228,65 +217,45 @@ export const parseSmtlib = (
|
|
|
228
217
|
: manager.mkApp(OP_TO_INT, [arg], SORT_INT);
|
|
229
218
|
};
|
|
230
219
|
|
|
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
220
|
const mkApp = (decl: number, inputArgs: number[], domainSort?: number) => {
|
|
235
|
-
const
|
|
236
|
-
const
|
|
237
|
-
const
|
|
238
|
-
|
|
239
|
-
const builtinSort = isUninterpreted ? -1 : (domainSort ?? getDomainSort(op, inputArgs));
|
|
221
|
+
const funcDecl = manager.funcDecls[decl];
|
|
222
|
+
const operator = OPERATORS_BY_OP.get(funcDecl.op);
|
|
223
|
+
const builtinSort =
|
|
224
|
+
operator === undefined ? -1 : (domainSort ?? getDomainSort(operator, inputArgs));
|
|
240
225
|
const getExpected = (index: number) =>
|
|
241
|
-
|
|
226
|
+
operator === undefined
|
|
227
|
+
? funcDecl.domain[index]
|
|
228
|
+
: operator.op === OP_ITE && index === 0
|
|
229
|
+
? SORT_BOOL
|
|
230
|
+
: builtinSort;
|
|
242
231
|
const args = inputArgs.map((arg, index) =>
|
|
243
232
|
getExpected(index) === undefined ? arg : coerce(arg, getExpected(index)),
|
|
244
233
|
);
|
|
245
|
-
const
|
|
246
|
-
|
|
247
|
-
|
|
248
|
-
|
|
249
|
-
? true
|
|
250
|
-
: op === OP_ITE
|
|
251
|
-
? isArity(3, 3)
|
|
252
|
-
: op === OP_EQ || op === OP_DISTINCT
|
|
253
|
-
? isArity(2, Infinity)
|
|
254
|
-
: op === OP_NOT ||
|
|
255
|
-
op === OP_UMINUS ||
|
|
256
|
-
op === OP_ABS ||
|
|
257
|
-
op === OP_TO_REAL ||
|
|
258
|
-
op === OP_TO_INT ||
|
|
259
|
-
op === OP_IS_INT
|
|
260
|
-
? isArity(1, 1)
|
|
261
|
-
: op === OP_IMPLIES ||
|
|
262
|
-
op === OP_XOR ||
|
|
263
|
-
op === OP_IDIV ||
|
|
264
|
-
op === OP_MOD ||
|
|
265
|
-
op === OP_DIV ||
|
|
266
|
-
op === OP_LE ||
|
|
267
|
-
op === OP_GE ||
|
|
268
|
-
op === OP_LT ||
|
|
269
|
-
op === OP_GT
|
|
270
|
-
? isArity(2, 2)
|
|
271
|
-
: isArity(1, Infinity);
|
|
272
|
-
const isBuiltinArith = manager.funcDecls[decl].family === FAMILY_ARITH;
|
|
234
|
+
const isArityOk =
|
|
235
|
+
operator === undefined
|
|
236
|
+
? args.length === funcDecl.domain.length
|
|
237
|
+
: args.length >= operator.arity[0] && args.length <= operator.arity[1];
|
|
273
238
|
const isWellSorted =
|
|
274
239
|
isArityOk &&
|
|
275
|
-
(
|
|
240
|
+
(funcDecl.family !== FAMILY_ARITH || isArithSort(builtinSort)) &&
|
|
276
241
|
args.every((arg, index) => manager.sorts[arg] === getExpected(index));
|
|
277
|
-
if (!isWellSorted) throw new SmtParseError(`ill-sorted application of ${name}`);
|
|
242
|
+
if (!isWellSorted) throw new SmtParseError(`ill-sorted application of ${funcDecl.name}`);
|
|
278
243
|
return manager.mkApp(
|
|
279
244
|
decl,
|
|
280
245
|
args,
|
|
281
|
-
|
|
246
|
+
operator === undefined
|
|
247
|
+
? funcDecl.range
|
|
248
|
+
: operator.range === "domain"
|
|
249
|
+
? builtinSort
|
|
250
|
+
: operator.range,
|
|
282
251
|
);
|
|
283
252
|
};
|
|
284
253
|
|
|
285
|
-
const mkChain = (
|
|
286
|
-
const domainSort = getDomainSort(
|
|
254
|
+
const mkChain = (operator: Operator, args: number[]) => {
|
|
255
|
+
const domainSort = getDomainSort(operator, args);
|
|
287
256
|
const pairs: number[] = [];
|
|
288
257
|
for (let index = 0; index + 1 < args.length; index++)
|
|
289
|
-
pairs.push(mkApp(op, [args[index], args[index + 1]], domainSort));
|
|
258
|
+
pairs.push(mkApp(operator.op, [args[index], args[index + 1]], domainSort));
|
|
290
259
|
return pairs.length === 1 ? pairs[0] : mkApp(OP_AND, pairs);
|
|
291
260
|
};
|
|
292
261
|
|
|
@@ -295,8 +264,6 @@ export const parseSmtlib = (
|
|
|
295
264
|
return expr;
|
|
296
265
|
};
|
|
297
266
|
|
|
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
267
|
const parsePattern = (sexpr: SExpr) => {
|
|
301
268
|
if (!Array.isArray(sexpr) || sexpr.length === 0) return undefined;
|
|
302
269
|
const head = sexpr[0];
|
|
@@ -307,8 +274,6 @@ export const parseSmtlib = (
|
|
|
307
274
|
return manager.mkPattern([parseTerm(sexpr)]);
|
|
308
275
|
};
|
|
309
276
|
|
|
310
|
-
// pattern_validator: a pattern has no Boolean operator other than equality, no quantifier, and
|
|
311
|
-
// every variable of its quantifier.
|
|
312
277
|
const isValidPattern = (pattern: number, numDecls: number) => {
|
|
313
278
|
const found = new Set<number>();
|
|
314
279
|
const isValid = (expr: number): boolean => {
|
|
@@ -342,8 +307,6 @@ export const parseSmtlib = (
|
|
|
342
307
|
});
|
|
343
308
|
scopes.push(scope);
|
|
344
309
|
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
310
|
const boundVars = varSorts.map((sort, index) =>
|
|
348
311
|
manager.mkVar(varSorts.length - 1 - index, sort),
|
|
349
312
|
);
|
|
@@ -369,8 +332,6 @@ export const parseSmtlib = (
|
|
|
369
332
|
}
|
|
370
333
|
scopes.pop();
|
|
371
334
|
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
335
|
let numKept = 0;
|
|
375
336
|
for (const pattern of patterns) {
|
|
376
337
|
if (!isValidPattern(pattern, varSorts.length)) continue;
|
|
@@ -408,23 +369,19 @@ export const parseSmtlib = (
|
|
|
408
369
|
};
|
|
409
370
|
|
|
410
371
|
const parseApp = (name: string, args: number[]) => {
|
|
411
|
-
const chainable = CHAINABLE_OPS.get(name);
|
|
412
|
-
if (chainable !== undefined) return mkChain(chainable, args);
|
|
413
372
|
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
373
|
if (name === "/" && args.length > 2)
|
|
416
374
|
return args
|
|
417
375
|
.slice(1)
|
|
418
376
|
.reduce((dividend, divisor) => mkApp(OP_DIV, [dividend, divisor]), args[0]);
|
|
419
|
-
const
|
|
420
|
-
if (
|
|
377
|
+
const operator = OPERATORS_BY_SYMBOL.get(name);
|
|
378
|
+
if (operator?.isChainable) return mkChain(operator, args);
|
|
379
|
+
if (operator !== undefined) return mkApp(operator.op, args);
|
|
421
380
|
const decl = funcs.get(name);
|
|
422
381
|
if (decl === undefined) throw new SmtParseError(`unknown function ${name}`);
|
|
423
382
|
return mkApp(decl, args);
|
|
424
383
|
};
|
|
425
384
|
|
|
426
|
-
// A term without nested applications to parse first: a symbol, a quantifier, a let or an
|
|
427
|
-
// annotation.
|
|
428
385
|
const parseLeaf = (sexpr: SExpr): number => {
|
|
429
386
|
if (typeof sexpr === "string") {
|
|
430
387
|
if (/^[0-9]+$/.test(sexpr)) return manager.mkNumeral(BigInt(sexpr));
|
|
@@ -437,9 +394,6 @@ export const parseSmtlib = (
|
|
|
437
394
|
if (sexpr === "false") return manager.falseExpr;
|
|
438
395
|
const binding = lookup(sexpr);
|
|
439
396
|
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
397
|
if (binding !== undefined)
|
|
444
398
|
return depth === binding.depth
|
|
445
399
|
? binding.expr
|
|
@@ -452,7 +406,6 @@ export const parseSmtlib = (
|
|
|
452
406
|
if (head === "forall" || head === "exists") return parseQuantifier(sexpr, head === "forall");
|
|
453
407
|
if (head === "let") return parseLet(sexpr);
|
|
454
408
|
const named = parseTerm(sexpr[1]);
|
|
455
|
-
// name_expr: cmd_context keeps a named expression as a macro.
|
|
456
409
|
const nameIndex = sexpr.indexOf(":named");
|
|
457
410
|
if (nameIndex !== -1) {
|
|
458
411
|
manager.incRef(named);
|
|
@@ -461,8 +414,6 @@ export const parseSmtlib = (
|
|
|
461
414
|
return named;
|
|
462
415
|
};
|
|
463
416
|
|
|
464
|
-
// Applications keep their own stack, like Z3's parser, so deeply nested terms do not exhaust the
|
|
465
|
-
// call stack.
|
|
466
417
|
const parseTerm = (sexpr: SExpr): number => {
|
|
467
418
|
const frames: ApplicationFrame[] = [];
|
|
468
419
|
const results: number[] = [];
|
|
@@ -502,8 +453,7 @@ export const parseSmtlib = (
|
|
|
502
453
|
} else if (name === "declare-fun" || name === "declare-const") {
|
|
503
454
|
const domain = name === "declare-fun" ? expectList(list[2]).map(parseSort) : [];
|
|
504
455
|
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.
|
|
456
|
+
// Z3's builtin_signature_collides and is_transcendental_shadow_decl each make and release fresh variables of the domain.
|
|
507
457
|
for (let round = 0; round < 2; round++) {
|
|
508
458
|
const vars = domain.map((sort, index) => manager.mkVar(index, sort));
|
|
509
459
|
for (const domainVar of vars) manager.incRef(domainVar);
|
|
@@ -511,7 +461,6 @@ export const parseSmtlib = (
|
|
|
511
461
|
}
|
|
512
462
|
funcs.set(expectSymbol(list[1]), manager.mkFuncDecl(expectSymbol(list[1]), domain, range));
|
|
513
463
|
} else if (name === "assert") {
|
|
514
|
-
// cmd_context::assert_expr keeps the assertion, and passes it to the solver.
|
|
515
464
|
const assertion = expectBool(parseTerm(list[1]));
|
|
516
465
|
manager.incRef(assertion);
|
|
517
466
|
assertions.push(assertion);
|
|
@@ -1,6 +1,4 @@
|
|
|
1
|
-
// Ported from Z3 (src/smt/smt_solver.cpp, src/smt/smt_kernel.cpp, src/smt/smt_setup.cpp), MIT
|
|
2
|
-
// license, see z3-license.txt. Decides an SMT-LIB problem the way `z3 -smt2 AUTO_CONFIG=false
|
|
3
|
-
// smt.MBQI=true` does for tlapm's UFNIA obligations.
|
|
1
|
+
// Ported from Z3 (src/smt/smt_solver.cpp, src/smt/smt_kernel.cpp, src/smt/smt_setup.cpp), MIT license, see z3-license.txt.
|
|
4
2
|
import { isStackOverflow, SmtCanceledError, SmtUnsupportedError } from "../../../errors";
|
|
5
3
|
import type { DecideOptions, Verdict } from "../../verdict";
|
|
6
4
|
import { AssertedFormulas } from "./asserted-formulas";
|
|
@@ -16,46 +14,37 @@ interface SmtCheck {
|
|
|
16
14
|
numInstances: number;
|
|
17
15
|
}
|
|
18
16
|
|
|
19
|
-
// The verdict, and the number of quantifier instances the search made.
|
|
20
17
|
export const checkSmt = (text: string, options: DecideOptions): SmtCheck => {
|
|
21
18
|
const manager = new AstManager(
|
|
22
19
|
new ResourceLimit(Date.now() + options.timeLimitMs, options.signal),
|
|
23
20
|
);
|
|
24
|
-
|
|
25
|
-
|
|
26
|
-
// kernel's model finder counts a step of the resource limit when it is made, and
|
|
27
|
-
// solver::assert_expr counts one for each assertion.
|
|
28
|
-
const incremental = new AssertedFormulas(manager);
|
|
29
|
-
manager.limit.inc();
|
|
30
|
-
const problem = parseSmtlib(text, manager, (assertion) => {
|
|
21
|
+
try {
|
|
22
|
+
const incremental = new AssertedFormulas(manager);
|
|
31
23
|
manager.limit.inc();
|
|
32
|
-
|
|
33
|
-
|
|
34
|
-
|
|
35
|
-
|
|
36
|
-
|
|
37
|
-
|
|
24
|
+
const problem = parseSmtlib(text, manager, (assertion) => {
|
|
25
|
+
manager.limit.inc();
|
|
26
|
+
incremental.assertExpr(assertion);
|
|
27
|
+
});
|
|
28
|
+
if (!problem.hasCheckSat) return { verdict: "unknown", numInstances: 0 };
|
|
29
|
+
const goal = applyUfniaTactic(manager, problem.assertions);
|
|
30
|
+
if (goal.isInconsistent || goal.forms.size === 0) {
|
|
31
|
+
return { verdict: goal.isInconsistent ? "unsat" : "sat", numInstances: 0 };
|
|
32
|
+
}
|
|
33
|
+
const asserted = new AssertedFormulas(manager);
|
|
34
|
+
const context = new Context(manager, { isMbqi: true, relevancyLevel: 2 });
|
|
35
|
+
for (const assertion of goal.forms.items) asserted.assertExpr(assertion);
|
|
36
|
+
context.setupContext();
|
|
37
|
+
context.internalizeAssertions(asserted);
|
|
38
|
+
const result = context.search();
|
|
39
|
+
return {
|
|
40
|
+
verdict: result === L_FALSE ? "unsat" : result === L_TRUE ? "sat" : "unknown",
|
|
41
|
+
numInstances: context.qmanager.getNumInstances(),
|
|
42
|
+
};
|
|
43
|
+
} finally {
|
|
38
44
|
manager.limit.release();
|
|
39
|
-
return { verdict: goal.isInconsistent ? "unsat" : "sat", numInstances: 0 };
|
|
40
45
|
}
|
|
41
|
-
// smt_tactic makes the context, which makes its asserted formulas first, and asserts the goal.
|
|
42
|
-
// setup_context then makes the theories, before the formulas are reduced.
|
|
43
|
-
const asserted = new AssertedFormulas(manager);
|
|
44
|
-
const context = new Context(manager, { isMbqi: true, relevancyLevel: 2 });
|
|
45
|
-
for (const assertion of goal.forms.items) asserted.assertExpr(assertion);
|
|
46
|
-
context.setupContext();
|
|
47
|
-
context.internalizeAssertions(asserted);
|
|
48
|
-
const result = context.search();
|
|
49
|
-
manager.limit.release();
|
|
50
|
-
return {
|
|
51
|
-
verdict: result === L_FALSE ? "unsat" : result === L_TRUE ? "sat" : "unknown",
|
|
52
|
-
numInstances: context.qmanager.getNumInstances(),
|
|
53
|
-
};
|
|
54
46
|
};
|
|
55
47
|
|
|
56
|
-
// Throws SmtParseError on malformed input. Input outside the subset the solver supports is unknown,
|
|
57
|
-
// and so is a search that runs past the time limit, that the signal aborts, or that exhausts the
|
|
58
|
-
// heap or the stack.
|
|
59
48
|
export const decideSmt = (text: string, options: DecideOptions): Verdict => {
|
|
60
49
|
try {
|
|
61
50
|
return checkSmt(text, options).verdict;
|
|
@@ -1,6 +1,4 @@
|
|
|
1
|
-
// Array.prototype.sort copies its array before sorting,
|
|
2
|
-
// clauses and disjunctions. Insertion sort is stable like it and sorts a short array in place, so
|
|
3
|
-
// both give the same order.
|
|
1
|
+
// Array.prototype.sort copies its array before sorting, so a short array is insertion sorted in place, which is stable too.
|
|
4
2
|
const MAX_INSERTION_SORT_LENGTH = 16;
|
|
5
3
|
|
|
6
4
|
export const sortByKey = (values: number[], getKey: (value: number) => number) => {
|
|
@@ -18,8 +16,6 @@ export const sortByKey = (values: number[], getKey: (value: number) => number) =
|
|
|
18
16
|
}
|
|
19
17
|
};
|
|
20
18
|
|
|
21
|
-
// std::sort of literals: sortByKey with the number as its key, which a call site of its own keeps
|
|
22
|
-
// cheap.
|
|
23
19
|
export const sortNumbers = (values: number[]) => {
|
|
24
20
|
if (values.length > MAX_INSERTION_SORT_LENGTH) {
|
|
25
21
|
values.sort((first, second) => first - second);
|
|
@@ -1,8 +1,4 @@
|
|
|
1
1
|
// Ported from Z3 (src/smt/smt_context.cpp), MIT license, see z3-license.txt.
|
|
2
|
-
// m_sticky_generation_updates: the generations that update_generation lowered, by node. Only a node
|
|
3
|
-
// of the same declaration can be congruent to another, so the updates are grouped by declaration.
|
|
4
|
-
// Each group keeps its updates in the order of insertion, as a Map does, in arrays that iterate
|
|
5
|
-
// without allocating. A deleted update leaves a hole until holes are half of its group.
|
|
6
2
|
import { shrink } from "./array";
|
|
7
3
|
import type { Enode } from "./enode";
|
|
8
4
|
|
|
@@ -47,7 +43,6 @@ export class StickyGenerations {
|
|
|
47
43
|
if (2 * group.numHoles > group.nodes.length) compact(group);
|
|
48
44
|
}
|
|
49
45
|
|
|
50
|
-
// The updates of the declaration in the order of insertion, where a deleted one is null.
|
|
51
46
|
getGroup(decl: number): Readonly<Pick<Group, "nodes" | "generations">> | undefined {
|
|
52
47
|
return this.groups.get(decl);
|
|
53
48
|
}
|
|
@@ -1,6 +1,4 @@
|
|
|
1
|
-
// Ported from Z3 (src/smt/theory_lra.cpp, src/smt/arith_eq_adapter.cpp), MIT license, see
|
|
2
|
-
// z3-license.txt. The axioms of theory_lra: those of div, mod, to_int and is_int, and the
|
|
3
|
-
// arith_eq_adapter axioms that tie an equality of terms to their two inequalities.
|
|
1
|
+
// Ported from Z3 (src/smt/theory_lra.cpp, src/smt/arith_eq_adapter.cpp), MIT license, see z3-license.txt.
|
|
4
2
|
import { SmtInvariantError } from "../../../errors";
|
|
5
3
|
import {
|
|
6
4
|
OP_ADD,
|
|
@@ -18,7 +16,7 @@ import {
|
|
|
18
16
|
SORT_INT,
|
|
19
17
|
SORT_REAL,
|
|
20
18
|
} from "./ast";
|
|
21
|
-
import { Enode } from "./enode";
|
|
19
|
+
import type { Enode } from "./enode";
|
|
22
20
|
import { FALSE_LITERAL, getVar, isNegated, Literal, negate, TRUE_LITERAL } from "./literal";
|
|
23
21
|
import { Rational } from "./rational";
|
|
24
22
|
import { TheoryLraState } from "./theory-lra-state";
|
|
@@ -26,10 +24,8 @@ import { TheoryLraState } from "./theory-lra-state";
|
|
|
26
24
|
export abstract class TheoryLraAxioms extends TheoryLraState {
|
|
27
25
|
private processedEqs = new Set<string>();
|
|
28
26
|
|
|
29
|
-
// m_restart_pairs: equalities whose axioms a backjump to the base level drops, remade on restart.
|
|
30
27
|
protected restartPairs: Enode[][] = [];
|
|
31
28
|
|
|
32
|
-
// The enode of a term, internalized first if it has none.
|
|
33
29
|
protected getInternalizedEnode(expr: number) {
|
|
34
30
|
const context = this.context;
|
|
35
31
|
if (!context.isEInternalized(expr)) context.internalize(expr, false);
|
|
@@ -133,27 +129,21 @@ export abstract class TheoryLraAxioms extends TheoryLraState {
|
|
|
133
129
|
else if (op === OP_MOD) this.mkIdivModAxioms(manager.getArg(expr, 0), manager.getArg(expr, 1));
|
|
134
130
|
}
|
|
135
131
|
|
|
136
|
-
// mk_literal.
|
|
137
132
|
protected mkLiteral(atom: number) {
|
|
138
133
|
const context = this.context;
|
|
139
134
|
if (!context.isEInternalized(atom)) context.internalize(atom, false);
|
|
140
135
|
return context.getLiteral(atom);
|
|
141
136
|
}
|
|
142
137
|
|
|
143
|
-
// ensure_enode: the relevant enode of a term.
|
|
144
138
|
private ensureEnode(expr: number) {
|
|
145
139
|
const node = this.getInternalizedEnode(expr);
|
|
146
140
|
this.context.markAsRelevant(expr);
|
|
147
141
|
return node;
|
|
148
142
|
}
|
|
149
143
|
|
|
150
|
-
//
|
|
151
|
-
// relevant only once the first is false. A unit axiom is the clause of false and the literal, so
|
|
152
|
-
// mk_clause drops false and the literal is justified by unit resolution with true, which lemma
|
|
153
|
-
// minimization can see through, rather than by an axiom.
|
|
144
|
+
// A unit axiom is the clause of false and the literal, so Z3 justifies the literal by unit resolution, not by an axiom.
|
|
154
145
|
protected mkAxiom(literals: Literal[]) {
|
|
155
146
|
const context = this.context;
|
|
156
|
-
// mkThAxiom simplifies the literals it is given, which this reads after.
|
|
157
147
|
context.mkThAxiom(
|
|
158
148
|
literals.length === 1 ? [context.falseLiteral, literals[0]] : literals.slice(),
|
|
159
149
|
);
|
|
@@ -167,12 +157,10 @@ export abstract class TheoryLraAxioms extends TheoryLraState {
|
|
|
167
157
|
context.relevancy.addWatch(
|
|
168
158
|
context.boolVar2Expr[getVar(literals[0])],
|
|
169
159
|
isNegated(literals[0]),
|
|
170
|
-
// simple_relevancy_eh marks the consequent without propagating.
|
|
171
160
|
() => context.relevancy.markAsRelevant(consequent),
|
|
172
161
|
);
|
|
173
162
|
}
|
|
174
163
|
|
|
175
|
-
// mk_div_axiom: q = 0 or q * (p / q) = p.
|
|
176
164
|
private mkDivAxiom(dividend: number, divisor: number) {
|
|
177
165
|
const manager = this.manager;
|
|
178
166
|
if (this.isZeroNumeral(divisor)) return;
|
|
@@ -185,7 +173,6 @@ export abstract class TheoryLraAxioms extends TheoryLraState {
|
|
|
185
173
|
this.mkAxiom([isZero, this.mkEq(product, dividend)]);
|
|
186
174
|
}
|
|
187
175
|
|
|
188
|
-
// mk_to_int_axiom: to_int (to_real x) = x, and to_real (to_int x) <= x < to_real (to_int x) + 1.
|
|
189
176
|
private mkToIntAxiom(term: number) {
|
|
190
177
|
const manager = this.manager;
|
|
191
178
|
const arg = manager.getArg(term, 0);
|
|
@@ -210,7 +197,6 @@ export abstract class TheoryLraAxioms extends TheoryLraState {
|
|
|
210
197
|
this.mkAxiom([negate(upperLiteral)]);
|
|
211
198
|
}
|
|
212
199
|
|
|
213
|
-
// mk_is_int_axiom: is_int x if and only if to_real (to_int x) = x.
|
|
214
200
|
protected mkIsIntAxiom(atom: number) {
|
|
215
201
|
const manager = this.manager;
|
|
216
202
|
const arg = manager.getArg(atom, 0);
|
|
@@ -223,7 +209,6 @@ export abstract class TheoryLraAxioms extends TheoryLraState {
|
|
|
223
209
|
this.mkAxiom([isInt, negate(eq)]);
|
|
224
210
|
}
|
|
225
211
|
|
|
226
|
-
// theory::mk_eq: the literal of an equality between two terms, internalized.
|
|
227
212
|
protected mkEq(first: number, second: number) {
|
|
228
213
|
const manager = this.manager;
|
|
229
214
|
if (first === second) return TRUE_LITERAL;
|
|
@@ -233,11 +218,9 @@ export abstract class TheoryLraAxioms extends TheoryLraState {
|
|
|
233
218
|
return this.context.getLiteral(atom);
|
|
234
219
|
}
|
|
235
220
|
|
|
236
|
-
// mk_idiv_mod_axioms: q * (div p q) + (mod p q) = p and 0 <= (mod p q) < |q| when q is not 0.
|
|
237
221
|
protected mkIdivModAxioms(dividend: number, divisor: number) {
|
|
238
222
|
const manager = this.manager;
|
|
239
223
|
if (manager.getNumeral(divisor) === 0n) return;
|
|
240
|
-
// The expr_refs of mk_idiv_mod_axioms, released in reverse when it returns.
|
|
241
224
|
const refs: number[] = [];
|
|
242
225
|
const hold = (expr: number) => {
|
|
243
226
|
manager.incRef(expr);
|
|
@@ -255,7 +238,6 @@ export abstract class TheoryLraAxioms extends TheoryLraState {
|
|
|
255
238
|
const remainder = hold(manager.mkApp(OP_MOD, [dividend, divisor], SORT_INT));
|
|
256
239
|
const zero = hold(manager.mkNumeral(0n));
|
|
257
240
|
if (manager.getNumeral(dividend) === 0n) {
|
|
258
|
-
// q != 0 implies div 0 q = 0 and mod 0 q = 0.
|
|
259
241
|
const isDivisorNonnegative = this.mkLiteral(manager.mkApp(OP_GE, [divisor, zero], SORT_BOOL));
|
|
260
242
|
const isDivisorNonpositive = this.mkLiteral(manager.mkApp(OP_LE, [divisor, zero], SORT_BOOL));
|
|
261
243
|
const consequents = [
|
|
@@ -289,7 +271,6 @@ export abstract class TheoryLraAxioms extends TheoryLraState {
|
|
|
289
271
|
this.mkAxiom([this.mkLiteral(manager.mkApp(OP_LE, [remainder, upper], SORT_BOOL))]);
|
|
290
272
|
return;
|
|
291
273
|
}
|
|
292
|
-
// q = 0 or (mod p q) >= 0, q >= 0 or (mod p q) + q <= -1, and q <= 0 or (mod p q) - q <= -1.
|
|
293
274
|
const minusOne = hold(manager.mkNumeral(-1n));
|
|
294
275
|
const minusDivisor = hold(manager.mkApp(OP_MUL, [minusOne, divisor], SORT_INT));
|
|
295
276
|
const isZero = this.mkLiteral(manager.mkEq(divisor, zero));
|
|
@@ -317,8 +298,6 @@ export abstract class TheoryLraAxioms extends TheoryLraState {
|
|
|
317
298
|
);
|
|
318
299
|
this.mkAxiom([isDivisorNonnegative, isBelowNegatedDivisor]);
|
|
319
300
|
this.mkEqAxioms(this.ensureEnode(combination), this.ensureEnode(dividend));
|
|
320
|
-
// q = 0 or q * (div p q) <= p. The rewritten atom replaces the unrewritten one, which Z3
|
|
321
|
-
// releases at once, and its own expr_ref goes at the end of the block.
|
|
322
301
|
const unrewritten = manager.mkApp(
|
|
323
302
|
OP_GE,
|
|
324
303
|
[
|
|
@@ -1,6 +1,4 @@
|
|
|
1
1
|
// Ported from Z3 (src/smt/theory_lra.cpp, src/math/lp/lp_api.h), MIT license, see z3-license.txt.
|
|
2
|
-
// The atoms of theory_lra: each is a bound on a column, with axioms between the bounds of the same
|
|
3
|
-
// column.
|
|
4
2
|
import { OP_GE, OP_IS_INT, OP_LE } from "./ast";
|
|
5
3
|
import { BoolVar, Literal, mkLiteral, negate } from "./literal";
|
|
6
4
|
import { Rational } from "./rational";
|
|
@@ -68,7 +66,6 @@ export abstract class TheoryLraBounds extends TheoryLraInternalize {
|
|
|
68
66
|
this.unassignedBounds[thVar] = saved + increment;
|
|
69
67
|
}
|
|
70
68
|
|
|
71
|
-
// bound2constraint_kind: the kind of the bound when its atom is true or false.
|
|
72
69
|
protected getBoundKind(bound: ApiBound, isTrue: boolean) {
|
|
73
70
|
if (bound.isLower) return isTrue ? KIND_GE : bound.isInt ? KIND_LE : KIND_LT;
|
|
74
71
|
return isTrue ? KIND_LE : bound.isInt ? KIND_GE : KIND_GT;
|
|
@@ -79,7 +76,6 @@ export abstract class TheoryLraBounds extends TheoryLraInternalize {
|
|
|
79
76
|
this.internalizeHead--;
|
|
80
77
|
const column = this.registerVar(thVar);
|
|
81
78
|
const isInt = this.isIntVar(thVar);
|
|
82
|
-
const partial = { isLower, isInt };
|
|
83
79
|
const kindTrue = isLower ? KIND_GE : KIND_LE;
|
|
84
80
|
const kindFalse = isLower ? (isInt ? KIND_LE : KIND_LT) : isInt ? KIND_GE : KIND_GT;
|
|
85
81
|
const constraintTrue = this.solver.mkVarBound(column, kindTrue, value);
|
|
@@ -91,10 +87,9 @@ export abstract class TheoryLraBounds extends TheoryLraInternalize {
|
|
|
91
87
|
const constraintFalse = this.solver.mkVarBound(column, kindFalse, falseValue);
|
|
92
88
|
this.constraintSources[constraintTrue] = mkLiteral(boolVar);
|
|
93
89
|
this.constraintSources[constraintFalse] = mkLiteral(boolVar, true);
|
|
94
|
-
return { boolVar, thVar, column, value, constraintTrue, constraintFalse,
|
|
90
|
+
return { boolVar, thVar, column, value, constraintTrue, constraintFalse, isLower, isInt };
|
|
95
91
|
}
|
|
96
92
|
|
|
97
|
-
// mk_bound_axioms: implications between a new bound and its closest neighbors on the variable.
|
|
98
93
|
private mkBoundAxioms(bound: ApiBound) {
|
|
99
94
|
if (!this.context.isSearching) {
|
|
100
95
|
this.newBounds.push(bound);
|
|
@@ -146,7 +141,6 @@ export abstract class TheoryLraBounds extends TheoryLraInternalize {
|
|
|
146
141
|
else mkClause([negate(l1), l2]);
|
|
147
142
|
}
|
|
148
143
|
|
|
149
|
-
// flush_bound_axioms: the axioms of the bounds created before the search, per variable.
|
|
150
144
|
protected flushBoundAxioms() {
|
|
151
145
|
while (this.newBounds.length > 0) {
|
|
152
146
|
const pending = this.newBounds.slice().sort((first, second) => first.thVar - second.thVar);
|