tla-ts 0.0.10-dev.28c823e4b → 0.0.10-dev.37a75eb5b
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 +4 -1
- package/dist/index.d.ts +4 -1
- 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 +43 -42
- package/dist/run.js +45 -44
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +43 -40
- package/dist/transfer.js +42 -39
- 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/bags.ts +47 -28
- package/src/builtins.ts +4 -13
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +268 -0
- package/src/check.ts +476 -590
- package/src/cli/options.ts +6 -31
- package/src/cli/runtime-invariants.ts +20 -56
- package/src/cli/shared.ts +1 -1
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +224 -212
- package/src/cli/tlc-output.ts +686 -0
- package/src/cli/tlc-usage.ts +1 -2
- package/src/cli/tlc.ts +60 -708
- 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 +25 -18
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +73 -338
- package/src/errors.ts +33 -5
- package/src/evaluate.ts +14 -7
- package/src/exit-codes.ts +3 -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 +42 -44
- package/src/lexer.ts +5 -3
- package/src/liveness-checker.ts +597 -240
- 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 +17 -31
- package/src/parallel.ts +29 -47
- package/src/parser.ts +652 -220
- 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 +93 -15
- 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 +536 -117
- 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 +271 -0
- package/src/prover/smt/solver/factor.ts +163 -0
- package/src/prover/smt/solver/fd-solver.ts +267 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -15
- package/src/prover/smt/solver/fix-dl-var.ts +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 +639 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -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 +177 -15
- package/src/prover/smt/solver/goal2nlsat.ts +216 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -1
- package/src/prover/smt/solver/hashtable.ts +30 -16
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +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 +7 -2
- package/src/prover/smt/solver/lp/core-solver.ts +18 -3
- package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
- package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
- package/src/prover/smt/solver/lp/dependency.ts +0 -2
- package/src/prover/smt/solver/lp/dioph-eq.ts +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 +3 -3
- package/src/prover/smt/solver/lp/nex.ts +2 -2
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
- package/src/prover/smt/solver/lp/nla-core.ts +68 -17
- 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 +165 -83
- package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
- package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
- package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
- package/src/prover/smt/solver/lp/nla-order.ts +0 -2
- package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -2
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
- package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
- package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
- package/src/prover/smt/solver/lp/pdd.ts +725 -289
- 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 +410 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1407 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +315 -97
- package/src/prover/smt/solver/nlsat/atoms.ts +71 -38
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +427 -229
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +464 -246
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +2410 -683
- package/src/prover/smt/solver/nlsat/solver.ts +293 -92
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -8
- package/src/prover/smt/solver/nlsat/upolynomial.ts +40 -19
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +105 -23
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +792 -0
- package/src/prover/smt/solver/opt-nlsat.ts +386 -0
- package/src/prover/smt/solver/opt-pareto.ts +282 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +311 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +19 -11
- package/src/prover/smt/solver/pb-rewriter.ts +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 +22 -25
- 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 +38 -2
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +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 +1298 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +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 +90 -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 +1704 -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 +1995 -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 +94 -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 +24 -2
- package/src/prover/zenon/expr.ts +28 -2
- package/src/prover/zenon/index-table.ts +11 -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 +2 -3
- 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 +127 -108
- package/src/runtime.ts +6 -0
- package/src/sany/generation.ts +382 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1092 -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 +243 -52
- 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/subexpressions.ts +3 -1
- 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/jar-data.ts +12 -0
- package/src/tlc/messages.ts +20 -15
- package/src/tlc/order.ts +16 -12
- 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 +61 -16
- package/src/tlc/trace-spec.ts +26 -47
- 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
|
@@ -0,0 +1,618 @@
|
|
|
1
|
+
import { SmtUnsupportedError } from "../../../../errors";
|
|
2
|
+
import { mkArrayApp } from "../array-decl-plugin";
|
|
3
|
+
import {
|
|
4
|
+
FAMILY_ARRAY,
|
|
5
|
+
OP_ARRAY_DEFAULT,
|
|
6
|
+
OP_DT_ACCESSOR,
|
|
7
|
+
OP_DT_CONSTRUCTOR,
|
|
8
|
+
OP_DT_IS,
|
|
9
|
+
OP_DT_RECOGNISER,
|
|
10
|
+
OP_DT_UPDATE_FIELD,
|
|
11
|
+
SORT_BOOL,
|
|
12
|
+
SORT_SIZE_INFINITE,
|
|
13
|
+
} from "../ast";
|
|
14
|
+
import {
|
|
15
|
+
getAccessorConstructor,
|
|
16
|
+
getConstructorAccessors,
|
|
17
|
+
getConstructorIndex,
|
|
18
|
+
getConstructorIs,
|
|
19
|
+
getDatatypeConstructors,
|
|
20
|
+
getDatatypeDef,
|
|
21
|
+
getNonRecConstructor,
|
|
22
|
+
getNumConstructors,
|
|
23
|
+
getRecognizerConstructor,
|
|
24
|
+
isRecursiveDatatype,
|
|
25
|
+
} from "../datatype-decl-plugin";
|
|
26
|
+
import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
|
|
27
|
+
import type { ProtoModel } from "../proto-model";
|
|
28
|
+
import { NULL_LITERAL } from "../sat/clause";
|
|
29
|
+
import { CR_CONTINUE, CR_DONE } from "../sat/solver";
|
|
30
|
+
import { ArraySolver } from "./array-solver";
|
|
31
|
+
import { type Enode, NULL_THEORY_VAR, type ThEq } from "./egraph";
|
|
32
|
+
import type { EufSolver } from "./euf-solver";
|
|
33
|
+
import { UnionFind } from "../lp/union-find";
|
|
34
|
+
import { addDependency, type Dependencies, ThSolver } from "./th-solver";
|
|
35
|
+
|
|
36
|
+
const ENTER = 0;
|
|
37
|
+
const EXIT = 1;
|
|
38
|
+
|
|
39
|
+
interface VarData {
|
|
40
|
+
constructorNode: Enode | null;
|
|
41
|
+
readonly recognizers: (Enode | null)[];
|
|
42
|
+
}
|
|
43
|
+
|
|
44
|
+
export class DtSolver extends ThSolver {
|
|
45
|
+
private readonly find: UnionFind;
|
|
46
|
+
private varData: VarData[] = [];
|
|
47
|
+
private toUnmark1: Enode[] = [];
|
|
48
|
+
private toUnmark2: Enode[] = [];
|
|
49
|
+
private usedEqs: [Enode, Enode][] = [];
|
|
50
|
+
private dfs: [number, Enode][] = [];
|
|
51
|
+
private parents = new Map<Enode, Enode>();
|
|
52
|
+
|
|
53
|
+
constructor(ctx: EufSolver, id: number) {
|
|
54
|
+
super(ctx, "datatype", id);
|
|
55
|
+
this.find = new UnionFind(ctx.trail);
|
|
56
|
+
this.find.handler = { mergeEh: (first, second) => this.mergeEh(first, second) };
|
|
57
|
+
}
|
|
58
|
+
|
|
59
|
+
private isOp(expr: number, op: number) {
|
|
60
|
+
return this.manager.getOp(expr) === op;
|
|
61
|
+
}
|
|
62
|
+
|
|
63
|
+
private isConstructor(expr: number) {
|
|
64
|
+
return this.isOp(expr, OP_DT_CONSTRUCTOR);
|
|
65
|
+
}
|
|
66
|
+
|
|
67
|
+
private isRecognizer(expr: number) {
|
|
68
|
+
return this.isOp(expr, OP_DT_RECOGNISER) || this.isOp(expr, OP_DT_IS);
|
|
69
|
+
}
|
|
70
|
+
|
|
71
|
+
private isUpdateField(expr: number) {
|
|
72
|
+
return this.isOp(expr, OP_DT_UPDATE_FIELD);
|
|
73
|
+
}
|
|
74
|
+
|
|
75
|
+
private isDatatypeSort(sort: number) {
|
|
76
|
+
return this.manager.isDatatypeSort(sort);
|
|
77
|
+
}
|
|
78
|
+
|
|
79
|
+
private isDatatype(expr: number) {
|
|
80
|
+
return this.isDatatypeSort(this.manager.sorts[expr]);
|
|
81
|
+
}
|
|
82
|
+
|
|
83
|
+
private isArrayOfDatatypes(sort: number) {
|
|
84
|
+
const manager = this.manager;
|
|
85
|
+
return manager.isArraySort(sort) && this.isDatatypeSort(manager.getArrayRange(sort));
|
|
86
|
+
}
|
|
87
|
+
|
|
88
|
+
private isSeqOfDatatypes(sort: number) {
|
|
89
|
+
const manager = this.manager;
|
|
90
|
+
return manager.isSeqSort(sort) && this.isDatatypeSort(manager.getSortParameters(sort)[0]);
|
|
91
|
+
}
|
|
92
|
+
|
|
93
|
+
private isEnumSort(sort: number) {
|
|
94
|
+
return (
|
|
95
|
+
getDatatypeDef(this.manager, sort)?.constructors.every(
|
|
96
|
+
(constructor) => constructor.accessors.length === 0,
|
|
97
|
+
) ?? false
|
|
98
|
+
);
|
|
99
|
+
}
|
|
100
|
+
|
|
101
|
+
private value(node: Enode) {
|
|
102
|
+
return this.s.value(2 * node.boolVar);
|
|
103
|
+
}
|
|
104
|
+
|
|
105
|
+
private mkApp(decl: number, args: number[]) {
|
|
106
|
+
const manager = this.manager;
|
|
107
|
+
return manager.mkApp(decl, args, manager.funcDecls[decl].range);
|
|
108
|
+
}
|
|
109
|
+
|
|
110
|
+
private clearMark() {
|
|
111
|
+
for (const node of this.toUnmark1) node.isMarked1 = false;
|
|
112
|
+
for (const node of this.toUnmark2) node.isMarked2 = false;
|
|
113
|
+
this.toUnmark1 = [];
|
|
114
|
+
this.toUnmark2 = [];
|
|
115
|
+
}
|
|
116
|
+
|
|
117
|
+
private ocMarkOnStack(node: Enode) {
|
|
118
|
+
const root = node.root;
|
|
119
|
+
root.isMarked1 = true;
|
|
120
|
+
this.toUnmark1.push(root);
|
|
121
|
+
}
|
|
122
|
+
|
|
123
|
+
private ocMarkCycleFree(node: Enode) {
|
|
124
|
+
const root = node.root;
|
|
125
|
+
root.isMarked2 = true;
|
|
126
|
+
this.toUnmark2.push(root);
|
|
127
|
+
}
|
|
128
|
+
|
|
129
|
+
private ocPushStack(node: Enode) {
|
|
130
|
+
this.dfs.push([EXIT, node], [ENTER, node]);
|
|
131
|
+
}
|
|
132
|
+
|
|
133
|
+
private assertEqAxiom(first: Enode, second: number, antecedent = NULL_LITERAL) {
|
|
134
|
+
if (antecedent === NULL_LITERAL) {
|
|
135
|
+
this.addUnit(this.eqInternalize(first.owner, second));
|
|
136
|
+
return;
|
|
137
|
+
}
|
|
138
|
+
if (this.s.value(antecedent) === L_TRUE) {
|
|
139
|
+
const secondNode = this.eInternalize(second);
|
|
140
|
+
if (first.root !== secondNode.root) this.propagateEq([antecedent], [], first, secondNode);
|
|
141
|
+
return;
|
|
142
|
+
}
|
|
143
|
+
this.addClause([antecedent ^ 1, this.eqInternalize(first.owner, second)]);
|
|
144
|
+
}
|
|
145
|
+
|
|
146
|
+
private assertIsConstructorAxiom(node: Enode, constructor: number, antecedent = NULL_LITERAL) {
|
|
147
|
+
const args = getConstructorAccessors(this.manager, constructor).map((accessor) =>
|
|
148
|
+
this.mkApp(accessor, [node.owner]),
|
|
149
|
+
);
|
|
150
|
+
this.assertEqAxiom(node, this.mkApp(constructor, args), antecedent);
|
|
151
|
+
}
|
|
152
|
+
|
|
153
|
+
private assertAccessorAxioms(node: Enode) {
|
|
154
|
+
getConstructorAccessors(this.manager, node.decl).forEach((accessor, index) =>
|
|
155
|
+
this.assertEqAxiom(node.getArg(index), this.mkApp(accessor, [node.owner])),
|
|
156
|
+
);
|
|
157
|
+
}
|
|
158
|
+
|
|
159
|
+
private signRecognizerConflict(constructor: Enode, recognizer: Enode) {
|
|
160
|
+
const lit = 2 * recognizer.boolVar;
|
|
161
|
+
this.clearMark();
|
|
162
|
+
this.setConflict([lit ^ 1], [[constructor, recognizer.getArg(0)]]);
|
|
163
|
+
}
|
|
164
|
+
|
|
165
|
+
private assertUpdateFieldAxioms(node: Enode) {
|
|
166
|
+
const manager = this.manager;
|
|
167
|
+
const own = node.owner;
|
|
168
|
+
const record = node.getArg(0).owner;
|
|
169
|
+
const field = manager.funcDecls[node.decl].parameters[0];
|
|
170
|
+
const constructor = getAccessorConstructor(manager, field);
|
|
171
|
+
const recognizer = getConstructorIs(manager, constructor);
|
|
172
|
+
const isConstructor = this.mkLiteral(manager.mkApp(recognizer, [record], SORT_BOOL));
|
|
173
|
+
for (const accessor of getConstructorAccessors(manager, constructor)) {
|
|
174
|
+
const arg =
|
|
175
|
+
accessor === field ? node.getArg(1) : this.eInternalize(this.mkApp(accessor, [record]));
|
|
176
|
+
this.assertEqAxiom(arg, this.mkApp(accessor, [own]), isConstructor);
|
|
177
|
+
}
|
|
178
|
+
this.assertEqAxiom(node, record, isConstructor ^ 1);
|
|
179
|
+
const isOwnConstructor = this.mkLiteral(manager.mkApp(recognizer, [own], SORT_BOOL));
|
|
180
|
+
this.addClause([isConstructor ^ 1, isOwnConstructor]);
|
|
181
|
+
}
|
|
182
|
+
|
|
183
|
+
override mkVar(node: Enode) {
|
|
184
|
+
if (this.isAttachedToVar(node)) return node.getThVar(this.id);
|
|
185
|
+
const manager = this.manager;
|
|
186
|
+
const thVar = super.mkVar(node);
|
|
187
|
+
this.find.mkVar();
|
|
188
|
+
const data: VarData = { constructorNode: null, recognizers: [] };
|
|
189
|
+
this.varData.push(data);
|
|
190
|
+
this.ctx.egraph.addThVar(node, thVar, this.id);
|
|
191
|
+
const expr = node.owner;
|
|
192
|
+
if (this.isConstructor(expr)) {
|
|
193
|
+
data.constructorNode = node;
|
|
194
|
+
this.assertAccessorAxioms(node);
|
|
195
|
+
} else if (this.isUpdateField(expr)) this.assertUpdateFieldAxioms(node);
|
|
196
|
+
else if (!this.isRecognizer(expr)) {
|
|
197
|
+
const sort = manager.sorts[expr];
|
|
198
|
+
if (getNumConstructors(manager, sort) === 1)
|
|
199
|
+
this.assertIsConstructorAxiom(node, getDatatypeConstructors(manager, sort)[0]);
|
|
200
|
+
else if (manager.getSortSize(sort) !== SORT_SIZE_INFINITE) this.mkSplit(thVar);
|
|
201
|
+
}
|
|
202
|
+
return thVar;
|
|
203
|
+
}
|
|
204
|
+
|
|
205
|
+
private mkSplit(inputVar: number) {
|
|
206
|
+
const manager = this.manager;
|
|
207
|
+
const thVar = this.find.find(inputVar);
|
|
208
|
+
const node = this.var2enodeOf(thVar);
|
|
209
|
+
const sort = manager.sorts[node.owner];
|
|
210
|
+
if (this.isEnumSort(sort)) {
|
|
211
|
+
this.mkEnumSplit(thVar);
|
|
212
|
+
return;
|
|
213
|
+
}
|
|
214
|
+
const nonRecConstructor = getNonRecConstructor(manager, sort);
|
|
215
|
+
const index = getConstructorIndex(manager, nonRecConstructor);
|
|
216
|
+
const recognizer = this.varData[thVar].recognizers[index] ?? null;
|
|
217
|
+
if (recognizer === null && manager.funcDecls[nonRecConstructor].domain.length === 0) {
|
|
218
|
+
const eq = this.eqInternalize(node.owner, this.mkApp(nonRecConstructor, []));
|
|
219
|
+
this.s.setPhaseLiteral(eq);
|
|
220
|
+
if (this.s.value(eq) === L_FALSE) this.mkEnumSplit(thVar);
|
|
221
|
+
} else if (recognizer === null) this.mkRecognizerConstructorLiteral(nonRecConstructor, node);
|
|
222
|
+
else if (this.value(recognizer) === L_FALSE) this.mkEnumSplit(thVar);
|
|
223
|
+
}
|
|
224
|
+
|
|
225
|
+
private mkRecognizerConstructorLiteral(constructor: number, node: Enode) {
|
|
226
|
+
const recognizer = getConstructorIs(this.manager, constructor);
|
|
227
|
+
const lit = this.mkLiteral(this.manager.mkApp(recognizer, [node.owner], SORT_BOOL));
|
|
228
|
+
this.s.setPhaseLiteral(lit);
|
|
229
|
+
return lit;
|
|
230
|
+
}
|
|
231
|
+
|
|
232
|
+
private mkEnumSplit(thVar: number) {
|
|
233
|
+
const manager = this.manager;
|
|
234
|
+
const node = this.var2enodeOf(thVar);
|
|
235
|
+
const data = this.varData[thVar];
|
|
236
|
+
const constructors = getDatatypeConstructors(manager, manager.sorts[node.owner]);
|
|
237
|
+
const size = constructors.length;
|
|
238
|
+
const start = this.random();
|
|
239
|
+
const lits: number[] = [];
|
|
240
|
+
for (let index = 0; index < size; index++) {
|
|
241
|
+
const position = (index + start) % size;
|
|
242
|
+
const constructor = constructors[position];
|
|
243
|
+
if (manager.funcDecls[constructor].domain.length > 0) {
|
|
244
|
+
const current = data.recognizers[position] ?? null;
|
|
245
|
+
if (current !== null && this.value(current) !== L_FALSE) return;
|
|
246
|
+
const lit = this.mkRecognizerConstructorLiteral(constructor, node);
|
|
247
|
+
if (current === null) return;
|
|
248
|
+
if (this.s.value(lit) !== L_FALSE) return;
|
|
249
|
+
lits.push(lit ^ 1);
|
|
250
|
+
continue;
|
|
251
|
+
}
|
|
252
|
+
const lit = this.eqInternalize(node.owner, this.mkApp(constructor, []));
|
|
253
|
+
const value = this.s.value(lit);
|
|
254
|
+
if (value === L_UNDEF) {
|
|
255
|
+
this.s.setPhaseLiteral(lit);
|
|
256
|
+
return;
|
|
257
|
+
}
|
|
258
|
+
if (value === L_TRUE) return;
|
|
259
|
+
lits.push(lit ^ 1);
|
|
260
|
+
}
|
|
261
|
+
this.setConflict(lits, []);
|
|
262
|
+
}
|
|
263
|
+
|
|
264
|
+
override applySortCnstr(node: Enode) {
|
|
265
|
+
this.forcePush();
|
|
266
|
+
if (!this.isAttachedToVar(node)) this.mkVar(node);
|
|
267
|
+
}
|
|
268
|
+
|
|
269
|
+
override newEqEh(eq: ThEq) {
|
|
270
|
+
this.forcePush();
|
|
271
|
+
this.find.merge(eq.v1, eq.v2);
|
|
272
|
+
}
|
|
273
|
+
|
|
274
|
+
override asserted(lit: number) {
|
|
275
|
+
this.forcePush();
|
|
276
|
+
const manager = this.manager;
|
|
277
|
+
const node = this.boolVar2enode(lit >> 1);
|
|
278
|
+
if (node === undefined || !this.isRecognizer(node.owner)) return;
|
|
279
|
+
const arg = node.getArg(0);
|
|
280
|
+
const thVar = this.find.find(arg.getThVar(this.id));
|
|
281
|
+
const data = this.varData[thVar];
|
|
282
|
+
const constructor = getRecognizerConstructor(manager, node.decl);
|
|
283
|
+
if ((lit & 1) === 0) {
|
|
284
|
+
if (data.constructorNode !== null && data.constructorNode.decl === constructor) return;
|
|
285
|
+
this.assertIsConstructorAxiom(arg, constructor, lit);
|
|
286
|
+
} else if (data.constructorNode === null) this.propagateRecognizer(thVar, node);
|
|
287
|
+
else if (data.constructorNode.decl === constructor)
|
|
288
|
+
this.signRecognizerConflict(data.constructorNode, node);
|
|
289
|
+
}
|
|
290
|
+
|
|
291
|
+
private addRecognizer(inputVar: number, recognizer: Enode) {
|
|
292
|
+
const manager = this.manager;
|
|
293
|
+
const thVar = this.find.find(inputVar);
|
|
294
|
+
const data = this.varData[thVar];
|
|
295
|
+
const sort = manager.funcDecls[recognizer.decl].domain[0];
|
|
296
|
+
if (data.recognizers.length === 0)
|
|
297
|
+
for (let index = 0; index < getNumConstructors(manager, sort); index++)
|
|
298
|
+
data.recognizers.push(null);
|
|
299
|
+
const constructor = getRecognizerConstructor(manager, recognizer.decl);
|
|
300
|
+
const index = getConstructorIndex(manager, constructor);
|
|
301
|
+
if (data.recognizers[index] !== null) return;
|
|
302
|
+
const value = this.value(recognizer);
|
|
303
|
+
if (value === L_TRUE) return;
|
|
304
|
+
if (value === L_FALSE && data.constructorNode !== null) {
|
|
305
|
+
if (data.constructorNode.decl === constructor)
|
|
306
|
+
this.signRecognizerConflict(data.constructorNode, recognizer);
|
|
307
|
+
return;
|
|
308
|
+
}
|
|
309
|
+
this.ctx.trail.push(() => {
|
|
310
|
+
data.recognizers[index] = null;
|
|
311
|
+
});
|
|
312
|
+
data.recognizers[index] = recognizer;
|
|
313
|
+
if (value === L_FALSE) this.propagateRecognizer(thVar, recognizer);
|
|
314
|
+
}
|
|
315
|
+
|
|
316
|
+
private propagateRecognizer(thVar: number, recognizer: Enode) {
|
|
317
|
+
const manager = this.manager;
|
|
318
|
+
const node = this.var2enodeOf(thVar);
|
|
319
|
+
const sort = manager.sorts[node.owner];
|
|
320
|
+
const data = this.varData[thVar];
|
|
321
|
+
if (data.recognizers.length === 0) {
|
|
322
|
+
this.addRecognizer(thVar, recognizer);
|
|
323
|
+
return;
|
|
324
|
+
}
|
|
325
|
+
const lits: number[] = [];
|
|
326
|
+
const eqs: [Enode, Enode][] = [];
|
|
327
|
+
let numUnassigned = 0;
|
|
328
|
+
let unassignedIndex = -1;
|
|
329
|
+
for (let index = 0; index < data.recognizers.length; index++) {
|
|
330
|
+
const current = data.recognizers[index];
|
|
331
|
+
if (current !== null && this.value(current) === L_TRUE) return;
|
|
332
|
+
if (current !== null && this.value(current) === L_FALSE) {
|
|
333
|
+
lits.push(2 * current.boolVar + 1);
|
|
334
|
+
if (node !== current.getArg(0)) eqs.push([node, current.getArg(0)]);
|
|
335
|
+
continue;
|
|
336
|
+
}
|
|
337
|
+
if (numUnassigned === 0) unassignedIndex = index;
|
|
338
|
+
numUnassigned++;
|
|
339
|
+
}
|
|
340
|
+
if (numUnassigned === 0) {
|
|
341
|
+
this.setConflict(lits, eqs);
|
|
342
|
+
return;
|
|
343
|
+
}
|
|
344
|
+
if (numUnassigned === 1) {
|
|
345
|
+
const current = data.recognizers[unassignedIndex];
|
|
346
|
+
const consequent =
|
|
347
|
+
current !== null
|
|
348
|
+
? 2 * current.boolVar
|
|
349
|
+
: this.mkLiteral(
|
|
350
|
+
manager.mkApp(
|
|
351
|
+
getConstructorIs(manager, getDatatypeConstructors(manager, sort)[unassignedIndex]),
|
|
352
|
+
[node.owner],
|
|
353
|
+
SORT_BOOL,
|
|
354
|
+
),
|
|
355
|
+
);
|
|
356
|
+
this.propagateLit(lits, eqs, consequent);
|
|
357
|
+
return;
|
|
358
|
+
}
|
|
359
|
+
if (manager.getSortSize(sort) !== SORT_SIZE_INFINITE) this.mkSplit(thVar);
|
|
360
|
+
}
|
|
361
|
+
|
|
362
|
+
private mergeEh(first: number, second: number) {
|
|
363
|
+
const manager = this.manager;
|
|
364
|
+
const firstData = this.varData[first];
|
|
365
|
+
const secondData = this.varData[second];
|
|
366
|
+
const firstConstructor = firstData.constructorNode;
|
|
367
|
+
const secondConstructor = secondData.constructorNode;
|
|
368
|
+
if (
|
|
369
|
+
firstConstructor !== null &&
|
|
370
|
+
secondConstructor !== null &&
|
|
371
|
+
firstConstructor.decl !== secondConstructor.decl
|
|
372
|
+
)
|
|
373
|
+
this.setConflict([], [[firstConstructor, secondConstructor]]);
|
|
374
|
+
else if (secondConstructor !== null && firstConstructor === null) {
|
|
375
|
+
this.ctx.trail.push(() => {
|
|
376
|
+
firstData.constructorNode = null;
|
|
377
|
+
});
|
|
378
|
+
if (firstData.recognizers.length > 0) {
|
|
379
|
+
const recognizer =
|
|
380
|
+
firstData.recognizers[getConstructorIndex(manager, secondConstructor.decl)];
|
|
381
|
+
if (recognizer !== null && this.value(recognizer) === L_FALSE) {
|
|
382
|
+
this.signRecognizerConflict(secondConstructor, recognizer);
|
|
383
|
+
return;
|
|
384
|
+
}
|
|
385
|
+
}
|
|
386
|
+
firstData.constructorNode = secondConstructor;
|
|
387
|
+
}
|
|
388
|
+
for (const recognizer of secondData.recognizers)
|
|
389
|
+
if (recognizer !== null) this.addRecognizer(first, recognizer);
|
|
390
|
+
}
|
|
391
|
+
|
|
392
|
+
private getArrayArgs(node: Enode) {
|
|
393
|
+
const arrays = this.ctx.fid2solver(FAMILY_ARRAY);
|
|
394
|
+
const nodes = arrays instanceof ArraySolver ? [...arrays.parentSelects(node)] : [];
|
|
395
|
+
const arrayDefault = this.ctx.getEnode(
|
|
396
|
+
mkArrayApp(this.manager, OP_ARRAY_DEFAULT, [node.owner]),
|
|
397
|
+
);
|
|
398
|
+
if (arrayDefault !== undefined) nodes.push(arrayDefault);
|
|
399
|
+
return nodes;
|
|
400
|
+
}
|
|
401
|
+
|
|
402
|
+
private ocGetConstructor(app: Enode) {
|
|
403
|
+
const thVar = app.root.getThVar(this.id);
|
|
404
|
+
if (thVar === NULL_THEORY_VAR) return null;
|
|
405
|
+
return this.varData[this.find.find(thVar)].constructorNode;
|
|
406
|
+
}
|
|
407
|
+
|
|
408
|
+
private explainIsChild(parent: Enode, child: Enode) {
|
|
409
|
+
const parentConstructor = this.ocGetConstructor(parent) as Enode;
|
|
410
|
+
if (parent !== parentConstructor) this.usedEqs.push([parent, parentConstructor]);
|
|
411
|
+
const add = (arg: Enode) => {
|
|
412
|
+
if (arg.root !== child.root) return;
|
|
413
|
+
if (arg !== child) this.usedEqs.push([arg, child]);
|
|
414
|
+
};
|
|
415
|
+
for (const arg of parentConstructor.args) {
|
|
416
|
+
add(arg);
|
|
417
|
+
const sort = this.manager.sorts[arg.owner];
|
|
418
|
+
if (this.isArrayOfDatatypes(sort))
|
|
419
|
+
for (const arrayArg of this.getArrayArgs(arg)) add(arrayArg);
|
|
420
|
+
if (this.isSeqOfDatatypes(sort))
|
|
421
|
+
throw new SmtUnsupportedError("sat.euf datatypes in sequences");
|
|
422
|
+
}
|
|
423
|
+
}
|
|
424
|
+
|
|
425
|
+
private occursCheckExplain(inputApp: Enode, root: Enode) {
|
|
426
|
+
this.explainIsChild(inputApp, root);
|
|
427
|
+
let app = inputApp;
|
|
428
|
+
while (app.root !== root.root) {
|
|
429
|
+
const parentApp = this.parents.get(app.root) as Enode;
|
|
430
|
+
this.explainIsChild(parentApp, app);
|
|
431
|
+
app = parentApp;
|
|
432
|
+
}
|
|
433
|
+
if (app !== root) this.usedEqs.push([app, root]);
|
|
434
|
+
}
|
|
435
|
+
|
|
436
|
+
private occursCheckEnter(inputApp: Enode) {
|
|
437
|
+
const app = inputApp.root;
|
|
438
|
+
const thVar = app.getThVar(this.id);
|
|
439
|
+
if (thVar === NULL_THEORY_VAR) return false;
|
|
440
|
+
const parent = this.varData[this.find.find(thVar)].constructorNode;
|
|
441
|
+
if (parent === null) return false;
|
|
442
|
+
this.ocMarkOnStack(parent);
|
|
443
|
+
const processArg = (arg: Enode) => {
|
|
444
|
+
if (arg.root.isMarked2) return false;
|
|
445
|
+
if (arg.root.isMarked1) {
|
|
446
|
+
this.occursCheckExplain(parent, arg);
|
|
447
|
+
return true;
|
|
448
|
+
}
|
|
449
|
+
if (this.isDatatype(arg.owner)) {
|
|
450
|
+
this.parents.set(arg.root, parent);
|
|
451
|
+
this.ocPushStack(arg);
|
|
452
|
+
}
|
|
453
|
+
return false;
|
|
454
|
+
};
|
|
455
|
+
for (const arg of parent.args) {
|
|
456
|
+
if (arg.root.isMarked2) continue;
|
|
457
|
+
if (arg.root.isMarked1) {
|
|
458
|
+
this.occursCheckExplain(parent, arg);
|
|
459
|
+
return true;
|
|
460
|
+
}
|
|
461
|
+
const sort = this.manager.sorts[arg.owner];
|
|
462
|
+
if (this.isDatatypeSort(sort)) {
|
|
463
|
+
this.parents.set(arg.root, parent);
|
|
464
|
+
this.ocPushStack(arg);
|
|
465
|
+
} else if (this.isSeqOfDatatypes(sort))
|
|
466
|
+
throw new SmtUnsupportedError("sat.euf datatypes in sequences");
|
|
467
|
+
else if (this.isArrayOfDatatypes(sort))
|
|
468
|
+
for (const arrayArg of this.getArrayArgs(arg)) if (processArg(arrayArg)) return true;
|
|
469
|
+
}
|
|
470
|
+
return false;
|
|
471
|
+
}
|
|
472
|
+
|
|
473
|
+
private occursCheck(node: Enode) {
|
|
474
|
+
let isCyclic = false;
|
|
475
|
+
this.ocPushStack(node);
|
|
476
|
+
while (!isCyclic && this.dfs.length > 0) {
|
|
477
|
+
const [op, app] = this.dfs.pop() as [number, Enode];
|
|
478
|
+
if (app.root.isMarked2) continue;
|
|
479
|
+
if (op === ENTER) isCyclic = this.occursCheckEnter(app);
|
|
480
|
+
else this.ocMarkCycleFree(app);
|
|
481
|
+
}
|
|
482
|
+
if (isCyclic) {
|
|
483
|
+
this.clearMark();
|
|
484
|
+
this.setConflict([], this.usedEqs);
|
|
485
|
+
}
|
|
486
|
+
return isCyclic;
|
|
487
|
+
}
|
|
488
|
+
|
|
489
|
+
override check() {
|
|
490
|
+
this.forcePush();
|
|
491
|
+
const manager = this.manager;
|
|
492
|
+
const numVars = this.numVars;
|
|
493
|
+
this.usedEqs = [];
|
|
494
|
+
this.dfs = [];
|
|
495
|
+
this.parents.clear();
|
|
496
|
+
const start = this.random();
|
|
497
|
+
let result = CR_DONE;
|
|
498
|
+
for (let index = 0; index < numVars; index++) {
|
|
499
|
+
const thVar = (index + start) % numVars;
|
|
500
|
+
if (thVar !== this.find.find(thVar)) continue;
|
|
501
|
+
const node = this.var2enodeOf(thVar);
|
|
502
|
+
if (!this.isDatatype(node.owner)) continue;
|
|
503
|
+
if (
|
|
504
|
+
isRecursiveDatatype(manager, manager.sorts[node.owner]) &&
|
|
505
|
+
!node.root.isMarked2 &&
|
|
506
|
+
this.occursCheck(node)
|
|
507
|
+
) {
|
|
508
|
+
this.clearMark();
|
|
509
|
+
return CR_CONTINUE;
|
|
510
|
+
}
|
|
511
|
+
if (this.varData[thVar].constructorNode !== null) continue;
|
|
512
|
+
this.clearMark();
|
|
513
|
+
this.mkSplit(thVar);
|
|
514
|
+
result = CR_CONTINUE;
|
|
515
|
+
}
|
|
516
|
+
this.clearMark();
|
|
517
|
+
return result;
|
|
518
|
+
}
|
|
519
|
+
|
|
520
|
+
protected override popCore(numScopes: number) {
|
|
521
|
+
super.popCore(numScopes);
|
|
522
|
+
this.varData.length = this.numVars;
|
|
523
|
+
}
|
|
524
|
+
|
|
525
|
+
override addValue(node: Enode, model: ProtoModel, values: (number | undefined)[]) {
|
|
526
|
+
const thVar = node.getThVar(this.id);
|
|
527
|
+
if (thVar === NULL_THEORY_VAR) {
|
|
528
|
+
values[node.root.owner] = model.getFreshValue(this.manager.sorts[node.owner]) ?? undefined;
|
|
529
|
+
return;
|
|
530
|
+
}
|
|
531
|
+
const constructor = this.varData[this.find.find(thVar)].constructorNode as Enode;
|
|
532
|
+
values[node.root.owner] = this.mkApp(
|
|
533
|
+
constructor.decl,
|
|
534
|
+
constructor.args.map((arg) => values[arg.root.owner] as number),
|
|
535
|
+
);
|
|
536
|
+
}
|
|
537
|
+
|
|
538
|
+
override addDep(node: Enode, deps: Dependencies) {
|
|
539
|
+
if (!this.isDatatype(node.owner)) return false;
|
|
540
|
+
const thVar = node.getThVar(this.id);
|
|
541
|
+
if (thVar === NULL_THEORY_VAR) return false;
|
|
542
|
+
const constructor = this.varData[this.find.find(thVar)].constructorNode as Enode;
|
|
543
|
+
if (constructor.numArgs === 0) deps.set(node, null);
|
|
544
|
+
for (const arg of constructor.args) addDependency(deps, node, arg.root);
|
|
545
|
+
return true;
|
|
546
|
+
}
|
|
547
|
+
|
|
548
|
+
override includeFuncInterp(decl: number) {
|
|
549
|
+
const manager = this.manager;
|
|
550
|
+
if (manager.funcDecls[decl].op !== OP_DT_ACCESSOR) return false;
|
|
551
|
+
const constructor = getAccessorConstructor(manager, decl);
|
|
552
|
+
for (const app of this.ctx.egraph.enodesOf(decl)) {
|
|
553
|
+
const appConstructor = this.ocGetConstructor(app.getArg(0));
|
|
554
|
+
if (
|
|
555
|
+
appConstructor !== null &&
|
|
556
|
+
this.isConstructor(appConstructor.owner) &&
|
|
557
|
+
appConstructor.decl !== constructor
|
|
558
|
+
)
|
|
559
|
+
return true;
|
|
560
|
+
}
|
|
561
|
+
return false;
|
|
562
|
+
}
|
|
563
|
+
|
|
564
|
+
internalize(expr: number, isSign: boolean, isRoot: boolean) {
|
|
565
|
+
if (!this.visitRec(expr, isSign, isRoot)) return NULL_LITERAL;
|
|
566
|
+
const lit = this.expr2literal(expr);
|
|
567
|
+
return isSign ? lit ^ 1 : lit;
|
|
568
|
+
}
|
|
569
|
+
|
|
570
|
+
internalizeTerm(expr: number) {
|
|
571
|
+
this.visitRec(expr, false, false);
|
|
572
|
+
}
|
|
573
|
+
|
|
574
|
+
protected override visit(expr: number) {
|
|
575
|
+
if (this.visited(expr)) return true;
|
|
576
|
+
const manager = this.manager;
|
|
577
|
+
if (!manager.isApp(expr) || manager.getFamily(expr) !== this.id) {
|
|
578
|
+
this.ctx.internalizeTerm(expr);
|
|
579
|
+
if (this.isDatatype(expr)) this.mkVar(this.expr2enode(expr) as Enode);
|
|
580
|
+
return true;
|
|
581
|
+
}
|
|
582
|
+
this.stack.push({ expr, index: 0 });
|
|
583
|
+
return false;
|
|
584
|
+
}
|
|
585
|
+
|
|
586
|
+
protected override visited(expr: number) {
|
|
587
|
+
const node = this.expr2enode(expr);
|
|
588
|
+
return node !== undefined && node.getThVar(this.id) !== NULL_THEORY_VAR;
|
|
589
|
+
}
|
|
590
|
+
|
|
591
|
+
protected override postVisit(expr: number) {
|
|
592
|
+
const node = this.expr2enode(expr) ?? this.mkEnode(expr);
|
|
593
|
+
if (this.isConstructor(expr) || this.isUpdateField(expr)) {
|
|
594
|
+
for (const arg of node.args) {
|
|
595
|
+
const sort = this.manager.sorts[arg.owner];
|
|
596
|
+
if (this.isDatatypeSort(sort)) this.mkVar(arg);
|
|
597
|
+
else if (this.isArrayOfDatatypes(sort))
|
|
598
|
+
this.mkVar(this.eInternalize(mkArrayApp(this.manager, OP_ARRAY_DEFAULT, [arg.owner])));
|
|
599
|
+
}
|
|
600
|
+
this.mkVar(node);
|
|
601
|
+
} else if (this.isRecognizer(expr)) {
|
|
602
|
+
this.mkVar(node);
|
|
603
|
+
this.addRecognizer(this.mkVar(node.getArg(0)), node);
|
|
604
|
+
} else {
|
|
605
|
+
this.mkVar(node.getArg(0));
|
|
606
|
+
if (this.isDatatype(expr)) this.mkVar(node);
|
|
607
|
+
}
|
|
608
|
+
return true;
|
|
609
|
+
}
|
|
610
|
+
|
|
611
|
+
override getPhase() {
|
|
612
|
+
return L_TRUE;
|
|
613
|
+
}
|
|
614
|
+
|
|
615
|
+
override isSelfPropagating() {
|
|
616
|
+
return true;
|
|
617
|
+
}
|
|
618
|
+
}
|