tla-ts 0.0.10-dev.28c823e4b → 0.0.10-dev.4a2a53c48
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +2 -1
- package/dist/compile.cjs +6 -6
- package/dist/compile.js +10 -10
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +57 -53
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +3 -0
- package/dist/index.d.ts +3 -0
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove.cjs +2683 -427
- package/dist/prove.js +2681 -425
- package/dist/run.cjs +45 -42
- package/dist/run.js +47 -44
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +42 -39
- package/dist/transfer.js +44 -41
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +41 -36
- package/src/builtins.ts +4 -13
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +282 -0
- package/src/check.ts +353 -549
- package/src/cli/options.ts +6 -31
- package/src/cli/shared.ts +1 -1
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +222 -210
- package/src/cli/tlc-output.ts +687 -0
- package/src/cli/tlc-usage.ts +1 -2
- package/src/cli/tlc.ts +49 -702
- package/src/cli/xml-exporter.ts +23 -33
- package/src/codegen.ts +5 -10
- package/src/coverage.ts +3 -10
- package/src/dependencies.ts +30 -14
- package/src/dfid.ts +16 -16
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +55 -338
- package/src/errors.ts +33 -5
- package/src/evaluate.ts +5 -4
- package/src/exit-codes.ts +1 -0
- package/src/fingerprints.ts +65 -1
- package/src/instances.ts +47 -10
- package/src/java-hash.ts +7 -0
- package/src/json.ts +4 -7
- package/src/levels.ts +39 -42
- package/src/lexer.ts +5 -3
- package/src/liveness-checker.ts +553 -237
- package/src/liveness.ts +94 -86
- package/src/obligations/action.ts +14 -17
- package/src/obligations/anonymize.ts +37 -16
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +36 -8
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +66 -54
- package/src/obligations/index.ts +38 -8
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +28 -41
- package/src/obligations/normalize.ts +26 -14
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +43 -13
- package/src/obligations/proof.ts +3 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +55 -50
- package/src/obligations/source.ts +118 -74
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +5 -7
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +10 -30
- package/src/parallel.ts +24 -47
- package/src/parser.ts +580 -180
- package/src/pretty-print.ts +1 -1
- package/src/prover/decide-pool.ts +3 -3
- package/src/prover/deciders.ts +12 -9
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +72 -42
- package/src/prover/isabelle/isar/attrib.ts +250 -0
- package/src/prover/isabelle/isar/context.ts +335 -0
- package/src/prover/isabelle/isar/induct.ts +382 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
- package/src/prover/isabelle/isar/method.ts +509 -212
- package/src/prover/isabelle/isar/proof.ts +570 -14
- package/src/prover/isabelle/isar/rule-cases.ts +224 -0
- package/src/prover/isabelle/isar/theory.ts +487 -76
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +89 -14
- package/src/prover/isabelle/provers/blast/blast.ts +7 -65
- package/src/prover/isabelle/provers/blast/branch.ts +0 -2
- package/src/prover/isabelle/provers/blast/prove.ts +0 -2
- package/src/prover/isabelle/provers/blast/rules.ts +0 -2
- package/src/prover/isabelle/provers/blast/state.ts +0 -2
- package/src/prover/isabelle/provers/blast/term.ts +0 -2
- package/src/prover/isabelle/provers/clasimp.ts +0 -2
- package/src/prover/isabelle/provers/classical.ts +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +17 -28
- package/src/prover/isabelle/pure/bicompose.ts +9 -27
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +2 -10
- package/src/prover/isabelle/pure/drule.ts +72 -6
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +1 -3
- package/src/prover/isabelle/pure/logic.ts +1 -3
- package/src/prover/isabelle/pure/name.ts +0 -2
- package/src/prover/isabelle/pure/net.ts +0 -2
- package/src/prover/isabelle/pure/object-logic.ts +13 -7
- package/src/prover/isabelle/pure/pattern.ts +0 -2
- package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
- package/src/prover/isabelle/pure/rewriter.ts +6 -17
- package/src/prover/isabelle/pure/search.ts +0 -2
- package/src/prover/isabelle/pure/seq.ts +0 -2
- package/src/prover/isabelle/pure/simplifier.ts +26 -7
- package/src/prover/isabelle/pure/table.ts +2 -3
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +42 -37
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +0 -2
- package/src/prover/isabelle/pure/thm.ts +14 -13
- package/src/prover/isabelle/pure/type.ts +0 -2
- package/src/prover/isabelle/pure/unify.ts +0 -2
- package/src/prover/isabelle/pure/variable.ts +0 -2
- package/src/prover/isabelle/tla/classical-setup.ts +18 -16
- package/src/prover/isabelle/tla/context.ts +58 -11
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +49 -21
- package/src/prover/isabelle/tla/simpdata.ts +1 -12
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +30 -31
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/fingerprint.ts +2 -5
- package/src/prover/prep/methods.ts +181 -51
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +395 -94
- package/src/prover/ptl/decide.ts +95 -50
- package/src/prover/ptl/encode.ts +2 -3
- package/src/prover/ptl/tableau.ts +28 -2
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -8
- package/src/prover/smt/context.ts +43 -8
- package/src/prover/smt/data.ts +498 -379
- package/src/prover/smt/encode.ts +148 -57
- package/src/prover/smt/extensionality.ts +5 -3
- package/src/prover/smt/flatten.ts +4 -6
- package/src/prover/smt/format.ts +28 -4
- package/src/prover/smt/instances.ts +7 -1
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1021 -618
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
- package/src/prover/smt/solver/ackr-helper.ts +179 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
- package/src/prover/smt/solver/act-cache.ts +0 -1
- package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
- package/src/prover/smt/solver/aig-tactic.ts +52 -0
- package/src/prover/smt/solver/aig.ts +889 -0
- package/src/prover/smt/solver/arith-rewriter.ts +613 -6
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +309 -0
- package/src/prover/smt/solver/asserted-formulas.ts +87 -16
- package/src/prover/smt/solver/ast-lt.ts +166 -12
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1427 -41
- package/src/prover/smt/solver/auf-solver.ts +2 -6
- package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +600 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +110 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -2
- package/src/prover/smt/solver/cg-table.ts +39 -25
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +516 -115
- package/src/prover/smt/solver/ctx-simplify.ts +20 -10
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
- package/src/prover/smt/solver/der.ts +38 -10
- package/src/prover/smt/solver/diff-neq.ts +206 -0
- package/src/prover/smt/solver/distribute-forall.ts +57 -0
- package/src/prover/smt/solver/dom-simplify.ts +511 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -1
- package/src/prover/smt/solver/e-matching.ts +7 -8
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
- package/src/prover/smt/solver/enode.ts +100 -3
- package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +907 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1050 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +335 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
- package/src/prover/smt/solver/expr2polynomial.ts +146 -0
- package/src/prover/smt/solver/factor.ts +141 -0
- package/src/prover/smt/solver/fd-solver.ts +265 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -15
- package/src/prover/smt/solver/fix-dl-var.ts +148 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +884 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +175 -15
- package/src/prover/smt/solver/goal2nlsat.ts +189 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -1
- package/src/prover/smt/solver/hashtable.ts +30 -16
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +110 -38
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -1
- package/src/prover/smt/solver/lia2card.ts +268 -0
- package/src/prover/smt/solver/lia2pb.ts +154 -0
- package/src/prover/smt/solver/literal.ts +0 -1
- package/src/prover/smt/solver/logic-tactics.ts +345 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
- package/src/prover/smt/solver/lp/constraints.ts +0 -1
- package/src/prover/smt/solver/lp/containers.ts +0 -1
- package/src/prover/smt/solver/lp/core-solver.ts +18 -3
- package/src/prover/smt/solver/lp/cross-nested.ts +0 -1
- package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
- package/src/prover/smt/solver/lp/dependency.ts +0 -2
- package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
- package/src/prover/smt/solver/lp/explanation.ts +0 -1
- package/src/prover/smt/solver/lp/gomory.ts +0 -1
- package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
- package/src/prover/smt/solver/lp/hnf.ts +0 -3
- package/src/prover/smt/solver/lp/int-cube.ts +3 -4
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
- package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
- package/src/prover/smt/solver/lp/nex-creator.ts +0 -1
- package/src/prover/smt/solver/lp/nex.ts +0 -1
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +0 -2
- package/src/prover/smt/solver/lp/nla-core.ts +42 -11
- package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
- package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +9 -4
- package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
- package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
- package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
- package/src/prover/smt/solver/lp/nla-order.ts +0 -2
- package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -2
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
- package/src/prover/smt/solver/lp/nra-solver.ts +25 -4
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
- package/src/prover/smt/solver/lp/pdd.ts +2 -2
- package/src/prover/smt/solver/lp/random-updater.ts +0 -2
- package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
- package/src/prover/smt/solver/lp/union-find.ts +7 -2
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +122 -90
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +309 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +105 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +18 -27
- package/src/prover/smt/solver/model-evaluator.ts +188 -12
- package/src/prover/smt/solver/model-finder.ts +12 -18
- package/src/prover/smt/solver/model-generator.ts +56 -29
- package/src/prover/smt/solver/model-macro-solver.ts +49 -46
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +711 -0
- package/src/prover/smt/solver/mus.ts +51 -0
- package/src/prover/smt/solver/muz/dl-context.ts +404 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
- package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +63 -23
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
- package/src/prover/smt/solver/nlsat/solver.ts +234 -36
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
- package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +105 -23
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +787 -0
- package/src/prover/smt/solver/opt-nlsat.ts +375 -0
- package/src/prover/smt/solver/opt-pareto.ts +282 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +308 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +19 -11
- package/src/prover/smt/solver/pb-rewriter.ts +284 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +202 -57
- package/src/prover/smt/solver/probes.ts +512 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +648 -19
- package/src/prover/smt/solver/pull-quant.ts +28 -12
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -3
- package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
- package/src/prover/smt/solver/qe-lite.ts +37 -17
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1498 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -1
- package/src/prover/smt/solver/qsat.ts +814 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +16 -56
- package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
- package/src/prover/smt/solver/quantifier-manager.ts +8 -16
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +45 -1
- package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -1
- package/src/prover/smt/solver/relevancy.ts +1 -2
- package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
- package/src/prover/smt/solver/rewriter.ts +475 -36
- package/src/prover/smt/solver/rlimit.ts +25 -2
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2127 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +1010 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1301 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +728 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
- package/src/prover/smt/solver/seq-skolem.ts +317 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +83 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +496 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
- package/src/prover/smt/solver/smtlib-script.ts +1631 -0
- package/src/prover/smt/solver/solve-eqs.ts +929 -0
- package/src/prover/smt/solver/solver.ts +113 -22
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +1986 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1200 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
- package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
- package/src/prover/smt/solver/theory-lra-internalize.ts +86 -27
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
- package/src/prover/smt/solver/theory-lra-state.ts +6 -22
- package/src/prover/smt/solver/theory-lra.ts +188 -1
- package/src/prover/smt/solver/theory-pb.ts +934 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +871 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
- package/src/prover/smt/solver/var-subst.ts +36 -14
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +50 -19
- package/src/prover/tlapm/tlapm.ts +15 -9
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -0
- package/src/prover/zenon/check/check.ts +1 -2
- package/src/prover/zenon/check/records.ts +1 -1
- package/src/prover/zenon/check/relations.ts +2 -1
- package/src/prover/zenon/check/rewrites.ts +2 -15
- package/src/prover/zenon/check/sets.ts +40 -58
- package/src/prover/zenon/check/terms.ts +1 -2
- package/src/prover/zenon/decide.ts +10 -7
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +2 -2
- package/src/prover/zenon/equality-rules.ts +0 -2
- package/src/prover/zenon/expr.ts +7 -2
- package/src/prover/zenon/index-table.ts +9 -21
- package/src/prover/zenon/isar-case.ts +0 -2
- package/src/prover/zenon/isar.ts +35 -37
- package/src/prover/zenon/llproof.ts +2 -13
- package/src/prover/zenon/mltoll.ts +12 -30
- package/src/prover/zenon/node.ts +20 -5
- package/src/prover/zenon/parse.ts +9 -8
- package/src/prover/zenon/phrase.ts +0 -2
- package/src/prover/zenon/proof.ts +0 -2
- package/src/prover/zenon/propositional-rules.ts +0 -2
- package/src/prover/zenon/rules.ts +0 -2
- package/src/prover/zenon/search.ts +11 -19
- package/src/prover/zenon/tla/functions.ts +2 -4
- package/src/prover/zenon/tla/llproof.ts +9 -13
- package/src/prover/zenon/tla/records.ts +1 -8
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +22 -22
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +7 -8
- package/src/resolve.ts +56 -74
- package/src/runtime.ts +4 -0
- 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 +155 -2625
- package/src/sany/levels.ts +0 -2
- package/src/sany/lexer.ts +17 -16
- package/src/sany/linter.ts +0 -2
- package/src/sany/nodes.ts +6 -13
- package/src/sany/report.ts +3 -6
- package/src/sany/selectors.ts +35 -38
- package/src/sany/xml.ts +23 -55
- package/src/search.ts +205 -43
- package/src/simulate.ts +160 -133
- package/src/spec-description.ts +33 -48
- package/src/standard-definitions.ts +4 -0
- package/src/standard-modules.ts +16 -32
- package/src/state-graph.ts +2 -9
- package/src/substitution-levels.ts +5 -4
- package/src/successors.ts +6 -8
- package/src/symmetry.ts +2 -2
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/messages.ts +20 -15
- package/src/tlc/order.ts +2 -9
- package/src/tlc/random.ts +4 -4
- package/src/tlc/replay.ts +8 -15
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlc-operators.ts +2 -3
- package/src/tlc/tlcext-operators.ts +44 -12
- package/src/tlc/trace-spec.ts +25 -45
- package/src/typed-tier.ts +6535 -0
- package/src/typescript/actions.ts +2 -4
- package/src/typescript/collections.ts +34 -20
- package/src/typescript/compile.ts +1 -3
- package/src/typescript/formula.ts +5 -3
- package/src/typescript/model.ts +4 -5
- package/src/typescript/steps.ts +20 -18
- package/src/values.ts +63 -158
- package/src/prover/isabelle/isar/statement.ts +0 -52
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/tlaps-module.ts +0 -510
- package/src/prover/zenon/LICENSE +0 -32
|
@@ -1,68 +1,82 @@
|
|
|
1
|
-
// Ported from Z3 (src/smt/smt_cg_table.h, src/smt/smt_cg_table.cpp), MIT license, see z3-license.txt.
|
|
2
1
|
import { CONGRUENCE_JUSTIFICATIONS, type Enode } from "./enode";
|
|
3
2
|
|
|
3
|
+
// The smt enode and the euf enode share the congruence table.
|
|
4
|
+
export interface CgNode {
|
|
5
|
+
readonly owner: number;
|
|
6
|
+
readonly decl: number;
|
|
7
|
+
readonly numArgs: number;
|
|
8
|
+
readonly isCommutative: boolean;
|
|
9
|
+
// Whether cg_table::mk_table_for gives the declaration the binary commutative table.
|
|
10
|
+
readonly isCommutativeTable: boolean;
|
|
11
|
+
readonly root: CgNode;
|
|
12
|
+
getArg(index: number): CgNode;
|
|
13
|
+
}
|
|
14
|
+
|
|
4
15
|
const getEqHash = (decl: number, first: number, second: number) =>
|
|
5
16
|
first < second
|
|
6
17
|
? (Math.imul(Math.imul(decl, 0x9e3779b1) + first, 0x85ebca6b) + second) | 0
|
|
7
18
|
: (Math.imul(Math.imul(decl, 0x9e3779b1) + second, 0x85ebca6b) + first) | 0;
|
|
8
19
|
|
|
9
|
-
const getHash = (decl: number, args:
|
|
10
|
-
if (
|
|
20
|
+
const getHash = (decl: number, args: readonly CgNode[], isCommutativeTable: boolean) => {
|
|
21
|
+
if (isCommutativeTable) return getEqHash(decl, args[0].root.owner, args[1].root.owner);
|
|
11
22
|
let hash = decl;
|
|
12
23
|
for (let index = 0; index < args.length; index++)
|
|
13
24
|
hash = (Math.imul(hash, 0x9e3779b1) + args[index].root.owner) | 0;
|
|
14
25
|
return hash;
|
|
15
26
|
};
|
|
16
27
|
|
|
17
|
-
const getNodeHash = (node:
|
|
18
|
-
if (node.
|
|
28
|
+
const getNodeHash = (node: CgNode) => {
|
|
29
|
+
if (node.isCommutativeTable)
|
|
30
|
+
return getEqHash(node.decl, node.getArg(0).root.owner, node.getArg(1).root.owner);
|
|
19
31
|
let hash = node.decl;
|
|
20
32
|
for (let index = 0; index < node.numArgs; index++)
|
|
21
33
|
hash = (Math.imul(hash, 0x9e3779b1) + node.getArg(index).root.owner) | 0;
|
|
22
34
|
return hash;
|
|
23
35
|
};
|
|
24
36
|
|
|
25
|
-
const isPairCongruentTo = (node:
|
|
37
|
+
const isPairCongruentTo = (node: CgNode, first: CgNode, second: CgNode, isCommutative: boolean) => {
|
|
26
38
|
const nodeFirst = node.getArg(0).root;
|
|
27
39
|
const nodeSecond = node.getArg(1).root;
|
|
28
40
|
return (
|
|
29
41
|
(nodeFirst === first.root && nodeSecond === second.root) ||
|
|
30
|
-
(
|
|
42
|
+
(isCommutative && nodeFirst === second.root && nodeSecond === first.root)
|
|
31
43
|
);
|
|
32
44
|
};
|
|
33
45
|
|
|
34
|
-
const isCongruentTo = (node:
|
|
46
|
+
const isCongruentTo = (node: CgNode, decl: number, args: readonly CgNode[]) => {
|
|
35
47
|
if (node.decl !== decl || node.numArgs !== args.length) return false;
|
|
36
|
-
if (
|
|
48
|
+
if (node.isCommutative) return isPairCongruentTo(node, args[0], args[1], true);
|
|
37
49
|
for (let index = 0; index < args.length; index++)
|
|
38
50
|
if (node.getArg(index).root !== args[index].root) return false;
|
|
39
51
|
return true;
|
|
40
52
|
};
|
|
41
53
|
|
|
42
|
-
export const isCongruent = (first:
|
|
54
|
+
export const isCongruent = (first: CgNode, second: CgNode) => {
|
|
43
55
|
if (first.decl !== second.decl || first.numArgs !== second.numArgs) return false;
|
|
44
56
|
if (first.numArgs === 2)
|
|
45
|
-
return isPairCongruentTo(first, second.getArg(0), second.getArg(1), first.
|
|
57
|
+
return isPairCongruentTo(first, second.getArg(0), second.getArg(1), first.isCommutative);
|
|
46
58
|
for (let index = 0; index < first.numArgs; index++)
|
|
47
59
|
if (first.getArg(index).root !== second.getArg(index).root) return false;
|
|
48
60
|
return true;
|
|
49
61
|
};
|
|
50
62
|
|
|
51
63
|
export const getCongruenceJustification = (node: Enode, congruent: Enode) =>
|
|
52
|
-
CONGRUENCE_JUSTIFICATIONS[
|
|
64
|
+
CONGRUENCE_JUSTIFICATIONS[
|
|
65
|
+
node.isCommutative && congruent.getArg(0).root !== node.getArg(0).root ? 1 : 0
|
|
66
|
+
];
|
|
53
67
|
|
|
54
68
|
const EMPTY = 0;
|
|
55
69
|
const FULL = 1;
|
|
56
70
|
const DELETED = 2;
|
|
57
71
|
|
|
58
|
-
export class CgTable {
|
|
59
|
-
private nodes = Array<
|
|
72
|
+
export class CgTable<Node extends CgNode = Enode> {
|
|
73
|
+
private nodes = Array<Node | null>(1024).fill(null);
|
|
60
74
|
private hashes = new Int32Array(1024);
|
|
61
75
|
private states = new Uint8Array(1024);
|
|
62
76
|
private numFull = 0;
|
|
63
77
|
private numDeleted = 0;
|
|
64
78
|
|
|
65
|
-
private find(decl: number, args:
|
|
79
|
+
private find(decl: number, args: readonly CgNode[], hash: number) {
|
|
66
80
|
const mask = this.states.length - 1;
|
|
67
81
|
for (let slot = hash & mask; this.states[slot] !== EMPTY; slot = (slot + 1) & mask) {
|
|
68
82
|
const node = this.nodes[slot];
|
|
@@ -70,14 +84,14 @@ export class CgTable {
|
|
|
70
84
|
this.states[slot] === FULL &&
|
|
71
85
|
this.hashes[slot] === hash &&
|
|
72
86
|
node !== null &&
|
|
73
|
-
isCongruentTo(node, decl, args
|
|
87
|
+
isCongruentTo(node, decl, args)
|
|
74
88
|
)
|
|
75
89
|
return node;
|
|
76
90
|
}
|
|
77
91
|
return undefined;
|
|
78
92
|
}
|
|
79
93
|
|
|
80
|
-
private findNode(node:
|
|
94
|
+
private findNode(node: CgNode, hash: number) {
|
|
81
95
|
const mask = this.states.length - 1;
|
|
82
96
|
for (let slot = hash & mask; this.states[slot] !== EMPTY; slot = (slot + 1) & mask) {
|
|
83
97
|
const candidate = this.nodes[slot];
|
|
@@ -92,7 +106,7 @@ export class CgTable {
|
|
|
92
106
|
return undefined;
|
|
93
107
|
}
|
|
94
108
|
|
|
95
|
-
insert(node:
|
|
109
|
+
insert(node: Node) {
|
|
96
110
|
const hash = getNodeHash(node);
|
|
97
111
|
const existing = this.findNode(node, hash);
|
|
98
112
|
if (existing !== undefined) return existing;
|
|
@@ -105,7 +119,7 @@ export class CgTable {
|
|
|
105
119
|
return node;
|
|
106
120
|
}
|
|
107
121
|
|
|
108
|
-
private place(slot: number, node:
|
|
122
|
+
private place(slot: number, node: Node, hash: number) {
|
|
109
123
|
this.nodes[slot] = node;
|
|
110
124
|
this.hashes[slot] = hash;
|
|
111
125
|
this.states[slot] = FULL;
|
|
@@ -117,7 +131,7 @@ export class CgTable {
|
|
|
117
131
|
const hashes = this.hashes;
|
|
118
132
|
const states = this.states;
|
|
119
133
|
const size = 4 * this.numFull > states.length ? 2 * states.length : states.length;
|
|
120
|
-
this.nodes = Array<
|
|
134
|
+
this.nodes = Array<Node | null>(size).fill(null);
|
|
121
135
|
this.hashes = new Int32Array(size);
|
|
122
136
|
this.states = new Uint8Array(size);
|
|
123
137
|
this.numFull = 0;
|
|
@@ -132,22 +146,22 @@ export class CgTable {
|
|
|
132
146
|
}
|
|
133
147
|
}
|
|
134
148
|
|
|
135
|
-
findFor(decl: number, args:
|
|
136
|
-
return this.find(decl, args,
|
|
149
|
+
findFor(decl: number, args: readonly CgNode[], isCommutativeTable: boolean) {
|
|
150
|
+
return this.find(decl, args, getHash(decl, args, isCommutativeTable));
|
|
137
151
|
}
|
|
138
152
|
|
|
139
|
-
findCongruent(node:
|
|
153
|
+
findCongruent(node: CgNode) {
|
|
140
154
|
return this.findNode(node, getNodeHash(node));
|
|
141
155
|
}
|
|
142
156
|
|
|
143
|
-
private getSlot(node:
|
|
157
|
+
private getSlot(node: CgNode) {
|
|
144
158
|
const mask = this.states.length - 1;
|
|
145
159
|
for (let slot = getNodeHash(node) & mask; this.states[slot] !== EMPTY; slot = (slot + 1) & mask)
|
|
146
160
|
if (this.nodes[slot] === node) return slot;
|
|
147
161
|
return -1;
|
|
148
162
|
}
|
|
149
163
|
|
|
150
|
-
erase(node:
|
|
164
|
+
erase(node: CgNode) {
|
|
151
165
|
const slot = this.getSlot(node);
|
|
152
166
|
if (slot === -1) return;
|
|
153
167
|
this.nodes[slot] = null;
|
|
@@ -0,0 +1,330 @@
|
|
|
1
|
+
import {
|
|
2
|
+
type AstManager,
|
|
3
|
+
FAMILY_ARITH,
|
|
4
|
+
FAMILY_ARRAY,
|
|
5
|
+
FAMILY_BASIC,
|
|
6
|
+
FAMILY_BV,
|
|
7
|
+
FAMILY_CHAR,
|
|
8
|
+
FAMILY_DATATYPE,
|
|
9
|
+
FAMILY_FINITE_SET,
|
|
10
|
+
FAMILY_FPA,
|
|
11
|
+
FAMILY_LABEL,
|
|
12
|
+
FAMILY_MODEL_VALUE,
|
|
13
|
+
FAMILY_PB,
|
|
14
|
+
FAMILY_POLY,
|
|
15
|
+
FAMILY_RECFUN,
|
|
16
|
+
FAMILY_SEQ,
|
|
17
|
+
FAMILY_USER,
|
|
18
|
+
KIND_APP,
|
|
19
|
+
KIND_VAR,
|
|
20
|
+
OP_ADD,
|
|
21
|
+
OP_DISTINCT,
|
|
22
|
+
OP_DIV,
|
|
23
|
+
OP_EQ,
|
|
24
|
+
OP_GE,
|
|
25
|
+
OP_GT,
|
|
26
|
+
OP_IDIV,
|
|
27
|
+
OP_ITE,
|
|
28
|
+
OP_LE,
|
|
29
|
+
OP_LT,
|
|
30
|
+
OP_MOD,
|
|
31
|
+
OP_REM,
|
|
32
|
+
OP_MUL,
|
|
33
|
+
OP_NUM,
|
|
34
|
+
OP_SUB,
|
|
35
|
+
OP_TO_INT,
|
|
36
|
+
OP_TO_REAL,
|
|
37
|
+
OP_UMINUS,
|
|
38
|
+
SORT_BOOL,
|
|
39
|
+
SORT_INT,
|
|
40
|
+
SORT_REAL,
|
|
41
|
+
} from "./ast";
|
|
42
|
+
import { logicHasPb } from "./smt-logics";
|
|
43
|
+
|
|
44
|
+
interface LogicFlags {
|
|
45
|
+
isUf: boolean;
|
|
46
|
+
isDt: boolean;
|
|
47
|
+
isArrays: boolean;
|
|
48
|
+
isBvArrays: boolean;
|
|
49
|
+
isReals: boolean;
|
|
50
|
+
isInts: boolean;
|
|
51
|
+
isDiff: boolean;
|
|
52
|
+
isNonlinear: boolean;
|
|
53
|
+
isBvs: boolean;
|
|
54
|
+
isQuantifiers: boolean;
|
|
55
|
+
isAllowingCasts: boolean;
|
|
56
|
+
}
|
|
57
|
+
|
|
58
|
+
const NO_FLAGS: LogicFlags = {
|
|
59
|
+
isUf: false,
|
|
60
|
+
isDt: false,
|
|
61
|
+
isArrays: false,
|
|
62
|
+
isBvArrays: false,
|
|
63
|
+
isReals: false,
|
|
64
|
+
isInts: false,
|
|
65
|
+
isDiff: false,
|
|
66
|
+
isNonlinear: false,
|
|
67
|
+
isBvs: false,
|
|
68
|
+
isQuantifiers: false,
|
|
69
|
+
isAllowingCasts: false,
|
|
70
|
+
};
|
|
71
|
+
|
|
72
|
+
const STRING_FLAGS = {
|
|
73
|
+
isUf: true,
|
|
74
|
+
isBvs: true,
|
|
75
|
+
isInts: true,
|
|
76
|
+
isArrays: true,
|
|
77
|
+
isReals: true,
|
|
78
|
+
isQuantifiers: true,
|
|
79
|
+
};
|
|
80
|
+
|
|
81
|
+
const LOGICS = new Map<string, Partial<LogicFlags>>([
|
|
82
|
+
["AUFLIA", { isUf: true, isArrays: true, isInts: true, isQuantifiers: true }],
|
|
83
|
+
["AUFLIRA", { isUf: true, isArrays: true, isReals: true, isInts: true, isQuantifiers: true }],
|
|
84
|
+
[
|
|
85
|
+
"AUFNIRA",
|
|
86
|
+
{
|
|
87
|
+
isUf: true,
|
|
88
|
+
isArrays: true,
|
|
89
|
+
isReals: true,
|
|
90
|
+
isInts: true,
|
|
91
|
+
isNonlinear: true,
|
|
92
|
+
isQuantifiers: true,
|
|
93
|
+
},
|
|
94
|
+
],
|
|
95
|
+
["LRA", { isReals: true, isQuantifiers: true }],
|
|
96
|
+
["QF_ABV", { isBvArrays: true, isBvs: true }],
|
|
97
|
+
["QF_AUFBV", { isUf: true, isBvArrays: true, isBvs: true }],
|
|
98
|
+
["QF_UFBV", { isUf: true, isBvs: true }],
|
|
99
|
+
["QF_UFDT", { isUf: true, isDt: true }],
|
|
100
|
+
["QF_DT", { isDt: true }],
|
|
101
|
+
["QF_AUFLIA", { isUf: true, isArrays: true, isInts: true }],
|
|
102
|
+
["QF_AX", { isArrays: true }],
|
|
103
|
+
["QF_FF", {}],
|
|
104
|
+
["QF_FFA", {}],
|
|
105
|
+
["QF_BV", { isBvs: true }],
|
|
106
|
+
["QF_IDL", { isInts: true, isDiff: true }],
|
|
107
|
+
["QF_RDL", { isReals: true, isDiff: true }],
|
|
108
|
+
["QF_LIA", { isInts: true }],
|
|
109
|
+
["QF_LRA", { isReals: true }],
|
|
110
|
+
["QF_NIA", { isInts: true, isNonlinear: true }],
|
|
111
|
+
["QF_NRA", { isReals: true, isNonlinear: true }],
|
|
112
|
+
["QF_NTA", { isReals: true, isNonlinear: true, isAllowingCasts: true }],
|
|
113
|
+
["QF_UF", { isUf: true }],
|
|
114
|
+
["QF_UFIDL", { isUf: true, isInts: true, isDiff: true }],
|
|
115
|
+
["QF_UFLIA", { isUf: true, isInts: true }],
|
|
116
|
+
["QF_UFLRA", { isUf: true, isReals: true }],
|
|
117
|
+
["QF_UFNRA", { isUf: true, isReals: true, isNonlinear: true }],
|
|
118
|
+
["UFLRA", { isUf: true, isReals: true, isQuantifiers: true }],
|
|
119
|
+
["UFNIA", { isUf: true, isInts: true, isQuantifiers: true, isNonlinear: true }],
|
|
120
|
+
["UFBV", { isUf: true, isBvs: true, isQuantifiers: true }],
|
|
121
|
+
["QF_S", STRING_FLAGS],
|
|
122
|
+
["QF_SLIA", STRING_FLAGS],
|
|
123
|
+
["QF_FD", { isBvs: true, isUf: true, isInts: true, isDt: true, isNonlinear: true }],
|
|
124
|
+
["SMTFD", { isBvs: true, isUf: true, isArrays: true }],
|
|
125
|
+
]);
|
|
126
|
+
|
|
127
|
+
const FAMILY_NAMES = new Map([
|
|
128
|
+
[FAMILY_FINITE_SET, "finite_set"],
|
|
129
|
+
[FAMILY_DATATYPE, "datatype"],
|
|
130
|
+
[FAMILY_FPA, "fpa"],
|
|
131
|
+
[FAMILY_CHAR, "char"],
|
|
132
|
+
[FAMILY_PB, "pb"],
|
|
133
|
+
[FAMILY_RECFUN, "recfun"],
|
|
134
|
+
[FAMILY_POLY, "polymorphic"],
|
|
135
|
+
]);
|
|
136
|
+
|
|
137
|
+
const NONLINEAR = "logic does not support nonlinear arithmetic";
|
|
138
|
+
const NON_DIFF = "logic only supports difference arithmetic";
|
|
139
|
+
|
|
140
|
+
export const createLogicChecker = (manager: AstManager, logic: string | undefined) => {
|
|
141
|
+
const known = logic === undefined ? undefined : LOGICS.get(logic);
|
|
142
|
+
const flags = { ...NO_FLAGS, ...known };
|
|
143
|
+
|
|
144
|
+
// Z3 rejects only the uninterpreted sorts of its null family, but declare-sort makes the sorts of
|
|
145
|
+
// its user sort family, which every logic accepts.
|
|
146
|
+
const checkSort = (sort: number): string | undefined => {
|
|
147
|
+
if (sort === SORT_BOOL) return undefined;
|
|
148
|
+
if (sort === SORT_INT) return flags.isInts ? undefined : "logic does not support integers";
|
|
149
|
+
if (sort === SORT_REAL) return flags.isReals ? undefined : "logic does not support reals";
|
|
150
|
+
if (manager.isBvSort(sort))
|
|
151
|
+
return flags.isBvs ? undefined : "logic does not support bitvectors";
|
|
152
|
+
if (manager.isDatatypeSort(sort))
|
|
153
|
+
return flags.isDt ? undefined : "logic does not support algebraic datatypes";
|
|
154
|
+
if (!manager.isArraySort(sort) || flags.isArrays) return undefined;
|
|
155
|
+
if (!flags.isBvArrays) return "logic does not support arrays";
|
|
156
|
+
const parameters = manager.getSortParameters(sort);
|
|
157
|
+
if (parameters.slice(0, -1).some((domain) => !manager.isBvSort(domain)))
|
|
158
|
+
return "logic supports only arrays from bitvectors to bitvectors";
|
|
159
|
+
return checkSort(manager.getArrayRange(sort));
|
|
160
|
+
};
|
|
161
|
+
|
|
162
|
+
const isIntNumeral = (expr: number) => {
|
|
163
|
+
const negated = manager.getOp(expr) === OP_UMINUS ? manager.getArg(expr, 0) : expr;
|
|
164
|
+
const real = manager.getOp(negated) === OP_TO_REAL ? manager.getArg(negated, 0) : negated;
|
|
165
|
+
return manager.getOp(real) === OP_NUM;
|
|
166
|
+
};
|
|
167
|
+
|
|
168
|
+
const isNumeral = (expr: number) => {
|
|
169
|
+
const negated = manager.getOp(expr) === OP_UMINUS ? manager.getArg(expr, 0) : expr;
|
|
170
|
+
return (
|
|
171
|
+
isIntNumeral(negated) ||
|
|
172
|
+
(manager.getOp(negated) === OP_DIV &&
|
|
173
|
+
isIntNumeral(manager.getArg(negated, 0)) &&
|
|
174
|
+
isIntNumeral(manager.getArg(negated, 1)))
|
|
175
|
+
);
|
|
176
|
+
};
|
|
177
|
+
|
|
178
|
+
const isArith = (expr: number) =>
|
|
179
|
+
manager.sorts[expr] === SORT_INT || manager.sorts[expr] === SORT_REAL;
|
|
180
|
+
|
|
181
|
+
const isDiffVar = (expr: number) =>
|
|
182
|
+
(manager.kinds[expr] === KIND_APP && manager.getFamily(expr) === FAMILY_USER) ||
|
|
183
|
+
manager.getOp(expr) === OP_ITE;
|
|
184
|
+
|
|
185
|
+
const isAddOrSub = (expr: number) =>
|
|
186
|
+
manager.getOp(expr) === OP_ADD || manager.getOp(expr) === OP_SUB;
|
|
187
|
+
|
|
188
|
+
const isOffset = (expr: number) => {
|
|
189
|
+
for (let current = expr; ;) {
|
|
190
|
+
const nonNumerals = manager.getArgs(current).filter((arg) => !isNumeral(arg));
|
|
191
|
+
if (nonNumerals.length > 1) return false;
|
|
192
|
+
if (nonNumerals.length === 0 || isDiffVar(nonNumerals[0])) return true;
|
|
193
|
+
if (!isAddOrSub(nonNumerals[0])) return false;
|
|
194
|
+
current = nonNumerals[0];
|
|
195
|
+
}
|
|
196
|
+
};
|
|
197
|
+
|
|
198
|
+
const isDiffArg = (expr: number) =>
|
|
199
|
+
isDiffVar(expr) || isNumeral(expr) || (isAddOrSub(expr) && isOffset(expr));
|
|
200
|
+
|
|
201
|
+
const hasSameArgs = (expr: number) => {
|
|
202
|
+
const args = manager.getArgs(expr);
|
|
203
|
+
return args.length > 0 && args.every((arg) => arg === args[0]);
|
|
204
|
+
};
|
|
205
|
+
|
|
206
|
+
const checkDiffPredicate = (expr: number) => {
|
|
207
|
+
const first = manager.getArg(expr, 0);
|
|
208
|
+
const second = manager.getArg(expr, 1);
|
|
209
|
+
if (!isArith(first) || (isDiffArg(first) && isDiffArg(second))) return undefined;
|
|
210
|
+
const [lhs, rhs] = isNumeral(first) ? [second, first] : [first, second];
|
|
211
|
+
if (!isNumeral(rhs) || manager.getOp(lhs) !== OP_SUB || manager.getNumArgs(lhs) !== 2)
|
|
212
|
+
return NON_DIFF;
|
|
213
|
+
const minuend = manager.getArg(lhs, 0);
|
|
214
|
+
const subtrahend = manager.getArg(lhs, 1);
|
|
215
|
+
if (isDiffVar(minuend) && isDiffVar(subtrahend)) return undefined;
|
|
216
|
+
if (manager.getOp(minuend) !== OP_ADD || manager.getOp(subtrahend) !== OP_ADD) return NON_DIFF;
|
|
217
|
+
return manager.getNumArgs(minuend) === manager.getNumArgs(subtrahend) &&
|
|
218
|
+
hasSameArgs(minuend) &&
|
|
219
|
+
hasSameArgs(subtrahend)
|
|
220
|
+
? undefined
|
|
221
|
+
: NON_DIFF;
|
|
222
|
+
};
|
|
223
|
+
|
|
224
|
+
// check_diff_args tests the application itself once for each argument.
|
|
225
|
+
const checkDiffArgs = (expr: number) =>
|
|
226
|
+
manager.getNumArgs(expr) > 0 && isArith(expr) && !isDiffArg(expr) ? NON_DIFF : undefined;
|
|
227
|
+
|
|
228
|
+
const checkArith = (expr: number) => {
|
|
229
|
+
const op = manager.getOp(expr);
|
|
230
|
+
const args = manager.getArgs(expr);
|
|
231
|
+
if (op === OP_MUL && !flags.isNonlinear && args.filter((arg) => !isNumeral(arg)).length > 1)
|
|
232
|
+
return NONLINEAR;
|
|
233
|
+
if (
|
|
234
|
+
(op === OP_DIV || op === OP_IDIV || op === OP_REM || op === OP_MOD) &&
|
|
235
|
+
(args.length !== 2 || (!flags.isNonlinear && !isNumeral(args[1])))
|
|
236
|
+
)
|
|
237
|
+
return NONLINEAR;
|
|
238
|
+
if (flags.isDiff && (op === OP_LE || op === OP_LT || op === OP_GE || op === OP_GT)) {
|
|
239
|
+
const error = checkDiffPredicate(expr);
|
|
240
|
+
if (error !== undefined) return error;
|
|
241
|
+
}
|
|
242
|
+
if (
|
|
243
|
+
(!flags.isInts || !flags.isReals) &&
|
|
244
|
+
!flags.isAllowingCasts &&
|
|
245
|
+
(op === OP_TO_REAL || op === OP_TO_INT)
|
|
246
|
+
)
|
|
247
|
+
return "logic does not support casting operators";
|
|
248
|
+
return undefined;
|
|
249
|
+
};
|
|
250
|
+
|
|
251
|
+
const checkApp = (expr: number) => {
|
|
252
|
+
const sortError = checkSort(manager.sorts[expr]);
|
|
253
|
+
if (sortError !== undefined) return sortError;
|
|
254
|
+
const family = manager.getFamily(expr);
|
|
255
|
+
if (family === FAMILY_USER) {
|
|
256
|
+
if (!flags.isUf && manager.getNumArgs(expr) > 0)
|
|
257
|
+
return "logic does not support uninterpreted functions";
|
|
258
|
+
return flags.isDiff ? checkDiffArgs(expr) : undefined;
|
|
259
|
+
}
|
|
260
|
+
if (family === FAMILY_ARITH) return checkArith(expr);
|
|
261
|
+
if (family === FAMILY_BV) return undefined;
|
|
262
|
+
if (family === FAMILY_ARRAY) return flags.isDiff ? checkDiffArgs(expr) : undefined;
|
|
263
|
+
if (family === FAMILY_BASIC) {
|
|
264
|
+
if (!flags.isDiff) return undefined;
|
|
265
|
+
const op = manager.getOp(expr);
|
|
266
|
+
if (op === OP_EQ) return checkDiffPredicate(expr);
|
|
267
|
+
return op === OP_DISTINCT || op === OP_ITE ? checkDiffArgs(expr) : undefined;
|
|
268
|
+
}
|
|
269
|
+
if (family === FAMILY_MODEL_VALUE || family === FAMILY_LABEL) return undefined;
|
|
270
|
+
if (family === FAMILY_SEQ || manager.isCharSort(manager.sorts[expr])) return undefined;
|
|
271
|
+
if (family === FAMILY_DATATYPE && flags.isDt) return undefined;
|
|
272
|
+
if (family === FAMILY_PB && logic !== undefined && logicHasPb(logic)) return undefined;
|
|
273
|
+
return `logic does not support theory ${FAMILY_NAMES.get(family)}`;
|
|
274
|
+
};
|
|
275
|
+
|
|
276
|
+
const checkNode = (expr: number) => {
|
|
277
|
+
const kind = manager.kinds[expr];
|
|
278
|
+
if (kind === KIND_APP) return checkApp(expr);
|
|
279
|
+
if (!flags.isQuantifiers) return "logic does not support quantifiers";
|
|
280
|
+
return kind === KIND_VAR ? checkSort(manager.sorts[expr]) : undefined;
|
|
281
|
+
};
|
|
282
|
+
|
|
283
|
+
const getChildren = (expr: number) => {
|
|
284
|
+
if (manager.kinds[expr] === KIND_APP) return manager.getArgs(expr);
|
|
285
|
+
if (manager.kinds[expr] === KIND_VAR) return [];
|
|
286
|
+
const data = manager.getQuantifier(expr);
|
|
287
|
+
return [data.body, ...data.patterns, ...data.noPatterns];
|
|
288
|
+
};
|
|
289
|
+
|
|
290
|
+
// quick_for_each_expr visits each term once, after its arguments, and a quantifier's body
|
|
291
|
+
// before its patterns.
|
|
292
|
+
const checkExpr = (expr: number) => {
|
|
293
|
+
if (known === undefined) return undefined;
|
|
294
|
+
const visited = new Set([expr]);
|
|
295
|
+
const exprs = [expr];
|
|
296
|
+
const children = [getChildren(expr)];
|
|
297
|
+
const nextChildren = [0];
|
|
298
|
+
while (exprs.length > 0) {
|
|
299
|
+
const top = exprs.length - 1;
|
|
300
|
+
const child = children[top][nextChildren[top]++];
|
|
301
|
+
if (child === undefined) {
|
|
302
|
+
const error = checkNode(exprs.pop() as number);
|
|
303
|
+
if (error !== undefined) return error;
|
|
304
|
+
children.pop();
|
|
305
|
+
nextChildren.pop();
|
|
306
|
+
continue;
|
|
307
|
+
}
|
|
308
|
+
if (visited.has(child)) continue;
|
|
309
|
+
visited.add(child);
|
|
310
|
+
exprs.push(child);
|
|
311
|
+
children.push(getChildren(child));
|
|
312
|
+
nextChildren.push(0);
|
|
313
|
+
}
|
|
314
|
+
return undefined;
|
|
315
|
+
};
|
|
316
|
+
|
|
317
|
+
const checkDecl = (decl: number) => {
|
|
318
|
+
if (known === undefined) return undefined;
|
|
319
|
+
const funcDecl = manager.funcDecls[decl];
|
|
320
|
+
if (funcDecl.domain.length > 0 && !flags.isUf && funcDecl.family === FAMILY_USER)
|
|
321
|
+
return "logic does not support uninterpreted functions";
|
|
322
|
+
for (const sort of funcDecl.domain) {
|
|
323
|
+
const error = checkSort(sort);
|
|
324
|
+
if (error !== undefined) return error;
|
|
325
|
+
}
|
|
326
|
+
return checkSort(funcDecl.range);
|
|
327
|
+
};
|
|
328
|
+
|
|
329
|
+
return { checkExpr, checkDecl };
|
|
330
|
+
};
|
|
@@ -1,4 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/smt/smt_clause.h, src/smt/smt_b_justification.h, src/util/small_object_allocator.cpp), MIT license, see z3-license.txt.
|
|
2
1
|
import { SmtInvariantError } from "../../../errors";
|
|
3
2
|
import type { Justification } from "./enode";
|
|
4
3
|
import type { Literal } from "./literal";
|