tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.7a3bb1545
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 +3 -3
- package/dist/compile.js +1 -1
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +58 -54
- 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-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +2682 -426
- package/dist/prove.js +2679 -423
- package/dist/run.cjs +43 -42
- package/dist/run.js +45 -44
- package/dist/tlapm.cjs +1 -1
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +43 -40
- package/dist/transfer.js +43 -40
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +3 -3
- package/src/bags.ts +46 -28
- package/src/check-trace.ts +2 -16
- package/src/check.ts +336 -88
- package/src/cli/runtime-invariants.ts +20 -56
- package/src/cli/tlapm.ts +424 -62
- package/src/cli/tlc-arguments.ts +2 -2
- package/src/cli/tlc-output.ts +4 -5
- package/src/cli/tlc-usage.ts +0 -1
- package/src/cli/tlc.ts +26 -7
- package/src/dependencies.ts +23 -2
- package/src/dfid.ts +9 -2
- package/src/environment.ts +27 -5
- package/src/errors.ts +30 -3
- package/src/evaluate.ts +9 -3
- package/src/exit-codes.ts +5 -2
- package/src/instances.ts +1 -1
- package/src/levels.ts +3 -2
- package/src/lexer.ts +5 -3
- package/src/liveness-checker.ts +572 -204
- package/src/liveness.ts +47 -32
- package/src/obligations/action.ts +10 -6
- package/src/obligations/anonymize.ts +33 -14
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +18 -6
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +22 -17
- package/src/obligations/index.ts +36 -6
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +1 -3
- package/src/obligations/normalize.ts +24 -13
- 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 +17 -7
- package/src/obligations/source.ts +71 -17
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +0 -2
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +8 -2
- package/src/parallel.ts +7 -2
- package/src/parser.ts +633 -186
- package/src/pretty-print.ts +1 -1
- package/src/prover/deciders.ts +11 -8
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +71 -41
- 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 +149 -3
- package/src/prover/isabelle/isar/method.ts +506 -198
- package/src/prover/isabelle/isar/proof.ts +570 -14
- package/src/prover/isabelle/isar/rule-cases.ts +226 -0
- package/src/prover/isabelle/isar/theory.ts +479 -69
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +83 -8
- package/src/prover/isabelle/provers/blast/blast.ts +0 -2
- 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 +1 -3
- package/src/prover/isabelle/provers/classical.ts +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +2 -4
- package/src/prover/isabelle/pure/bicompose.ts +0 -2
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +0 -2
- package/src/prover/isabelle/pure/drule.ts +63 -4
- 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 +0 -2
- 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 +0 -2
- package/src/prover/isabelle/pure/rewriter.ts +1 -8
- 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 +0 -2
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +0 -2
- 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 +0 -2
- 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 +1 -2
- package/src/prover/isabelle/tla/context.ts +51 -9
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +40 -1
- package/src/prover/isabelle/tla/simpdata.ts +0 -2
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +19 -12
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/methods.ts +159 -50
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +343 -65
- 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 +42 -6
- package/src/prover/smt/data.ts +191 -84
- package/src/prover/smt/encode.ts +122 -43
- 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 +483 -116
- 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 +165 -11
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1448 -41
- package/src/prover/smt/solver/auf-solver.ts +0 -1
- 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 +109 -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 +533 -114
- package/src/prover/smt/solver/ctx-simplify.ts +21 -12
- 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 +205 -0
- package/src/prover/smt/solver/distribute-forall.ts +57 -0
- package/src/prover/smt/solver/dom-simplify.ts +511 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -1
- package/src/prover/smt/solver/e-matching.ts +6 -7
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +542 -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 +901 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1046 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +328 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -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 +147 -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 +109 -36
- 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 +0 -2
- 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 +0 -1
- 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 +66 -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 +167 -85
- 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 -290
- 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 +118 -88
- 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 +17 -26
- package/src/prover/smt/solver/model-evaluator.ts +188 -12
- package/src/prover/smt/solver/model-finder.ts +0 -1
- package/src/prover/smt/solver/model-generator.ts +59 -30
- package/src/prover/smt/solver/model-macro-solver.ts +38 -27
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +709 -0
- package/src/prover/smt/solver/mus.ts +50 -0
- package/src/prover/smt/solver/muz/dl-context.ts +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 +1404 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +305 -88
- package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +424 -211
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
- package/src/prover/smt/solver/nlsat/solver.ts +282 -69
- 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 +8 -7
- package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
- 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 +281 -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 +511 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +650 -17
- 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 +1096 -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 +1499 -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 +9 -10
- package/src/prover/smt/solver/quantifier-manager.ts +25 -24
- 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 +262 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -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 +2105 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +995 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1298 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +730 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
- package/src/prover/smt/solver/seq-skolem.ts +294 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +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 +3154 -326
- package/src/prover/smt/solver/smtlib-script.ts +1702 -0
- package/src/prover/smt/solver/solve-eqs.ts +923 -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 -5
- package/src/prover/smt/solver/theory-lra-final-check.ts +56 -71
- package/src/prover/smt/solver/theory-lra-internalize.ts +89 -11
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -28
- package/src/prover/smt/solver/theory-lra-state.ts +6 -22
- package/src/prover/smt/solver/theory-lra.ts +188 -2
- package/src/prover/smt/solver/theory-pb.ts +933 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +852 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory.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 +29 -8
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +2 -0
- package/src/prover/zenon/decide.ts +10 -7
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +0 -2
- package/src/prover/zenon/equality-rules.ts +24 -2
- package/src/prover/zenon/expr.ts +21 -2
- package/src/prover/zenon/index-table.ts +7 -4
- package/src/prover/zenon/isar-case.ts +1 -3
- package/src/prover/zenon/isar.ts +2 -4
- package/src/prover/zenon/llproof.ts +0 -2
- package/src/prover/zenon/mltoll.ts +0 -2
- package/src/prover/zenon/node.ts +20 -5
- package/src/prover/zenon/parse.ts +6 -2
- package/src/prover/zenon/phrase.ts +1 -3
- 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 +7 -5
- package/src/prover/zenon/tla/functions.ts +0 -2
- package/src/prover/zenon/tla/llproof.ts +0 -2
- package/src/prover/zenon/tla/records.ts +0 -2
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +7 -8
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +0 -2
- package/src/resolve.ts +72 -36
- package/src/runtime.ts +6 -0
- package/src/sany/generation.ts +1 -13
- package/src/sany/generator-definitions.ts +1 -1
- package/src/sany/generator-expressions.ts +9 -17
- package/src/sany/generator-proofs.ts +1 -1
- package/src/sany/generator.ts +1 -1
- package/src/sany/levels.ts +0 -2
- package/src/sany/linter.ts +0 -2
- package/src/search.ts +198 -45
- package/src/simulate.ts +3 -0
- package/src/standard-definitions.ts +4 -0
- package/src/state-graph.ts +0 -2
- package/src/subexpressions.ts +4 -2
- package/src/successors.ts +1 -1
- 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/order.ts +14 -3
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlcext-operators.ts +61 -16
- package/src/tlc/trace-spec.ts +2 -3
- package/src/typed-tier.ts +6541 -0
- package/src/typescript/types.ts +2 -2
- package/src/values.ts +1 -1
- 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,867 @@
|
|
|
1
|
+
import {
|
|
2
|
+
KIND_APP,
|
|
3
|
+
OP_ITE,
|
|
4
|
+
OP_MOD,
|
|
5
|
+
OP_RE_COMPLEMENT,
|
|
6
|
+
OP_RE_CONCAT,
|
|
7
|
+
OP_RE_DIFF,
|
|
8
|
+
OP_RE_INTERSECT,
|
|
9
|
+
OP_RE_UNION,
|
|
10
|
+
OP_SEQ_CONCAT,
|
|
11
|
+
OP_SEQ_IN_RE,
|
|
12
|
+
OP_SEQ_NTH_I,
|
|
13
|
+
SORT_BOOL,
|
|
14
|
+
} from "./ast";
|
|
15
|
+
import type { Context } from "./context";
|
|
16
|
+
import type { Enode } from "./enode";
|
|
17
|
+
import { assign } from "./expr-ref";
|
|
18
|
+
import { ExprSafeReplace } from "./expr-safe-replace";
|
|
19
|
+
import { ObjMap } from "./hashtable";
|
|
20
|
+
import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
|
|
21
|
+
import { FALSE_LITERAL, getVar, isNegated, type Literal, negate } from "./literal";
|
|
22
|
+
import { type Dependency, mkJoin } from "./lp/dependency";
|
|
23
|
+
import type { Rational } from "./rational";
|
|
24
|
+
import { RefVector } from "./ref-vector";
|
|
25
|
+
import { getConcat, mkConcatOf, mkSeqApp } from "./seq-decl-plugin";
|
|
26
|
+
import { TRANSITION_BRZOZOWSKI, TRANSITION_LIGHT_ANTIMIROV } from "./seq-derive";
|
|
27
|
+
import { SeqEqApprox } from "./seq-eq-approx";
|
|
28
|
+
import { Monadic, ORIENTATION_RETRY } from "./seq-monadic";
|
|
29
|
+
import { LiveStates } from "./seq-regex-live";
|
|
30
|
+
import { RegexBisim } from "./seq-regex-bisim";
|
|
31
|
+
import {
|
|
32
|
+
addTruncate,
|
|
33
|
+
canBeMember,
|
|
34
|
+
getStrMinLength,
|
|
35
|
+
isDotPlus,
|
|
36
|
+
isEpsilon,
|
|
37
|
+
isFullSeq,
|
|
38
|
+
isReBinary,
|
|
39
|
+
isReEmpty,
|
|
40
|
+
isReGround,
|
|
41
|
+
mkEpsilon,
|
|
42
|
+
mkFullSeq,
|
|
43
|
+
mkRe,
|
|
44
|
+
mkReEmpty,
|
|
45
|
+
mkToRe,
|
|
46
|
+
UINT_MAX,
|
|
47
|
+
} from "./seq-re-util";
|
|
48
|
+
import { TheorySeqSolve } from "./theory-seq-solve";
|
|
49
|
+
|
|
50
|
+
const BOUND_LO = 0;
|
|
51
|
+
const BOUND_HI = 1;
|
|
52
|
+
const BOUND_LEN = 2;
|
|
53
|
+
const MAX_BOUND = 1000;
|
|
54
|
+
const EQ_APPROX_STATES = 1 << 12;
|
|
55
|
+
const LIVE_STATES = 10000;
|
|
56
|
+
const EMPTINESS_STEPS = 100000;
|
|
57
|
+
const EXPANSION_DEPTH = 40;
|
|
58
|
+
|
|
59
|
+
interface Expansion {
|
|
60
|
+
expr: number;
|
|
61
|
+
dep: Dependency;
|
|
62
|
+
}
|
|
63
|
+
|
|
64
|
+
interface MonadicMembership {
|
|
65
|
+
literal: Literal;
|
|
66
|
+
seq: number;
|
|
67
|
+
regex: number;
|
|
68
|
+
expanded: number;
|
|
69
|
+
dep: Dependency;
|
|
70
|
+
}
|
|
71
|
+
|
|
72
|
+
interface MonadicAssumption {
|
|
73
|
+
generation: number;
|
|
74
|
+
variable: Enode;
|
|
75
|
+
witness: Enode;
|
|
76
|
+
}
|
|
77
|
+
|
|
78
|
+
interface BoundConstraint {
|
|
79
|
+
length: number;
|
|
80
|
+
kind: number;
|
|
81
|
+
value: number;
|
|
82
|
+
}
|
|
83
|
+
|
|
84
|
+
interface CandidateBound extends BoundConstraint {
|
|
85
|
+
term: number;
|
|
86
|
+
}
|
|
87
|
+
|
|
88
|
+
const isUnsigned = (value: Rational) =>
|
|
89
|
+
value.isInt() && !value.isNegative() && value.num <= 0xffffffffn;
|
|
90
|
+
|
|
91
|
+
const getMembershipDep = (index: number) => 2 * (index + 1);
|
|
92
|
+
|
|
93
|
+
const getBoundDep = (index: number) => 2 * index + 1;
|
|
94
|
+
|
|
95
|
+
export abstract class TheorySeqRegex extends TheorySeqSolve {
|
|
96
|
+
private monadic: Monadic;
|
|
97
|
+
private monadicMemberships: MonadicMembership[] = [];
|
|
98
|
+
private monadicModel: ObjMap<number>;
|
|
99
|
+
private monadicAssumptions: MonadicAssumption[] = [];
|
|
100
|
+
private monadicBounds: BoundConstraint[] = [];
|
|
101
|
+
private monadicGeneration = 0;
|
|
102
|
+
private assumptionGeneration = -1;
|
|
103
|
+
private fallbackGeneration = -1;
|
|
104
|
+
private eqApprox: SeqEqApprox;
|
|
105
|
+
private liveStates: LiveStates;
|
|
106
|
+
|
|
107
|
+
constructor(context: Context, family: number) {
|
|
108
|
+
super(context, family);
|
|
109
|
+
const manager = context.manager;
|
|
110
|
+
this.monadic = new Monadic(
|
|
111
|
+
manager,
|
|
112
|
+
this.seqRewriter,
|
|
113
|
+
(undo) => context.pushTrail(undo),
|
|
114
|
+
(expr) => this.isVar(expr),
|
|
115
|
+
TRANSITION_LIGHT_ANTIMIROV,
|
|
116
|
+
);
|
|
117
|
+
this.monadic.orientation = ORIENTATION_RETRY;
|
|
118
|
+
this.monadic.splitRounds = 10;
|
|
119
|
+
this.monadicModel = new ObjMap((key) => manager.hashes[key]);
|
|
120
|
+
this.eqApprox = new SeqEqApprox(manager, this.seqRewriter.re, EQ_APPROX_STATES);
|
|
121
|
+
this.liveStates = new LiveStates(
|
|
122
|
+
manager,
|
|
123
|
+
this.seqRewriter.re,
|
|
124
|
+
TRANSITION_BRZOZOWSKI,
|
|
125
|
+
LIVE_STATES,
|
|
126
|
+
);
|
|
127
|
+
}
|
|
128
|
+
|
|
129
|
+
private get re() {
|
|
130
|
+
return this.seqRewriter.re;
|
|
131
|
+
}
|
|
132
|
+
|
|
133
|
+
protected addUnhandledExpr(expr: number) {
|
|
134
|
+
if (this.unhandledExpr !== undefined) return;
|
|
135
|
+
this.context.pushTrail(() => {
|
|
136
|
+
this.unhandledExpr = undefined;
|
|
137
|
+
});
|
|
138
|
+
this.unhandledExpr = this.keep(expr);
|
|
139
|
+
}
|
|
140
|
+
|
|
141
|
+
private pushBack<T>(items: T[], item: T, release: (item: T) => void = () => {}) {
|
|
142
|
+
items.push(item);
|
|
143
|
+
this.context.pushTrail(() => {
|
|
144
|
+
release(items.pop()!);
|
|
145
|
+
});
|
|
146
|
+
}
|
|
147
|
+
|
|
148
|
+
private expandShallow(expr: number, state: { dep: Dependency }, depth: number): number {
|
|
149
|
+
const manager = this.manager;
|
|
150
|
+
if (depth > EXPANSION_DEPTH) return expr;
|
|
151
|
+
if (manager.getOp(expr) === OP_SEQ_CONCAT)
|
|
152
|
+
return mkConcatOf(
|
|
153
|
+
manager,
|
|
154
|
+
manager.getArgs(expr).map((arg) => this.expandShallow(arg, state, depth + 1)),
|
|
155
|
+
manager.sorts[expr],
|
|
156
|
+
);
|
|
157
|
+
if (this.isEmpty(expr) || this.isString(expr)) return expr;
|
|
158
|
+
if (this.isUnit(expr) && manager.isValue(manager.getArg(expr, 0))) return expr;
|
|
159
|
+
const found = this.rep.findWithDep(expr);
|
|
160
|
+
if (found.expr === expr) return expr;
|
|
161
|
+
const sub = { dep: found.dep };
|
|
162
|
+
const expanded = this.expandShallow(found.expr, sub, depth + 1);
|
|
163
|
+
if (!this.monadic.canDecideTerm(expanded)) return expr;
|
|
164
|
+
state.dep = mkJoin(state.dep, sub.dep);
|
|
165
|
+
return expanded;
|
|
166
|
+
}
|
|
167
|
+
|
|
168
|
+
private computeExpansion(seq: number): Expansion {
|
|
169
|
+
const state = { dep: null, isChanged: false };
|
|
170
|
+
const full = this.canonize(seq, state);
|
|
171
|
+
if (full !== undefined && this.monadic.canDecideTerm(full))
|
|
172
|
+
return { expr: full, dep: state.dep };
|
|
173
|
+
const shallow = { dep: null };
|
|
174
|
+
const expanded = this.expandShallow(seq, shallow, 0);
|
|
175
|
+
if (this.monadic.canDecideTerm(expanded)) return { expr: expanded, dep: shallow.dep };
|
|
176
|
+
return { expr: seq, dep: null };
|
|
177
|
+
}
|
|
178
|
+
|
|
179
|
+
private addMonadicMembership(literal: Literal, seq: number, regex: number) {
|
|
180
|
+
if (this.monadicMemberships.some((membership) => membership.literal === literal)) return;
|
|
181
|
+
const expansion = this.computeExpansion(seq);
|
|
182
|
+
const index = this.monadicMemberships.length;
|
|
183
|
+
const manager = this.manager;
|
|
184
|
+
this.pushBack(
|
|
185
|
+
this.monadicMemberships,
|
|
186
|
+
{
|
|
187
|
+
literal,
|
|
188
|
+
seq: this.keep(seq),
|
|
189
|
+
regex: this.keep(regex),
|
|
190
|
+
expanded: this.keep(expansion.expr),
|
|
191
|
+
dep: expansion.dep,
|
|
192
|
+
},
|
|
193
|
+
(membership) => {
|
|
194
|
+
manager.decRef(membership.expanded);
|
|
195
|
+
manager.decRef(membership.regex);
|
|
196
|
+
manager.decRef(membership.seq);
|
|
197
|
+
},
|
|
198
|
+
);
|
|
199
|
+
this.monadic.add(expansion.expr, regex, getMembershipDep(index));
|
|
200
|
+
const generation = this.monadicGeneration;
|
|
201
|
+
this.context.pushTrail(() => {
|
|
202
|
+
this.monadicGeneration = generation;
|
|
203
|
+
});
|
|
204
|
+
this.monadicGeneration++;
|
|
205
|
+
}
|
|
206
|
+
|
|
207
|
+
private refreshExpansions() {
|
|
208
|
+
for (let index = 0; index < this.monadicMemberships.length; index++) {
|
|
209
|
+
const membership = this.monadicMemberships[index];
|
|
210
|
+
const expansion = this.computeExpansion(membership.seq);
|
|
211
|
+
membership.expanded = assign(this.manager, membership.expanded, expansion.expr);
|
|
212
|
+
membership.dep = expansion.dep;
|
|
213
|
+
this.monadic.setTerm(getMembershipDep(index), expansion.expr);
|
|
214
|
+
}
|
|
215
|
+
}
|
|
216
|
+
|
|
217
|
+
private collectVars(seq: number, vars: number[]) {
|
|
218
|
+
const manager = this.manager;
|
|
219
|
+
const todo = [seq];
|
|
220
|
+
for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
|
|
221
|
+
if (manager.getOp(expr) === OP_SEQ_CONCAT) {
|
|
222
|
+
todo.push(...manager.getArgs(expr));
|
|
223
|
+
continue;
|
|
224
|
+
}
|
|
225
|
+
if (this.isVar(expr) && !vars.includes(expr)) vars.push(expr);
|
|
226
|
+
}
|
|
227
|
+
}
|
|
228
|
+
|
|
229
|
+
private collectCandidateBounds(candidates: CandidateBound[]) {
|
|
230
|
+
const addTerm = (term: number) => {
|
|
231
|
+
const length = this.mkLen(term);
|
|
232
|
+
const lo = this.lowerBound(length);
|
|
233
|
+
const hi = this.upperBound(length);
|
|
234
|
+
const hasLo = lo !== undefined && isUnsigned(lo) && lo.num > 0n;
|
|
235
|
+
const hasHi = hi !== undefined && isUnsigned(hi);
|
|
236
|
+
if (hasLo && hasHi && lo.equals(hi)) {
|
|
237
|
+
if (lo.num <= MAX_BOUND)
|
|
238
|
+
candidates.push({ term, length, kind: BOUND_LEN, value: Number(lo.num) });
|
|
239
|
+
return;
|
|
240
|
+
}
|
|
241
|
+
if (hasLo && lo.num <= MAX_BOUND)
|
|
242
|
+
candidates.push({ term, length, kind: BOUND_LO, value: Number(lo.num) });
|
|
243
|
+
if (hasHi && hi.num <= MAX_BOUND)
|
|
244
|
+
candidates.push({ term, length, kind: BOUND_HI, value: Number(hi.num) });
|
|
245
|
+
};
|
|
246
|
+
for (const membership of this.monadicMemberships) {
|
|
247
|
+
addTerm(membership.expanded);
|
|
248
|
+
const vars: number[] = [];
|
|
249
|
+
this.collectVars(membership.expanded, vars);
|
|
250
|
+
for (const variable of vars) addTerm(variable);
|
|
251
|
+
}
|
|
252
|
+
}
|
|
253
|
+
|
|
254
|
+
private getModelLength(term: number) {
|
|
255
|
+
const manager = this.manager;
|
|
256
|
+
const todo = [term];
|
|
257
|
+
let length = 0;
|
|
258
|
+
for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
|
|
259
|
+
if (this.isConcat(expr)) {
|
|
260
|
+
todo.push(manager.getArg(expr, 0), manager.getArg(expr, 1));
|
|
261
|
+
continue;
|
|
262
|
+
}
|
|
263
|
+
if (this.isEmpty(expr)) continue;
|
|
264
|
+
if (this.isUnit(expr)) {
|
|
265
|
+
length++;
|
|
266
|
+
continue;
|
|
267
|
+
}
|
|
268
|
+
const chars = manager.getString(expr);
|
|
269
|
+
if (chars !== undefined) {
|
|
270
|
+
length += chars.length;
|
|
271
|
+
continue;
|
|
272
|
+
}
|
|
273
|
+
const witness = this.monadicModel.get(expr);
|
|
274
|
+
if (witness === undefined || witness === expr) return undefined;
|
|
275
|
+
todo.push(witness);
|
|
276
|
+
}
|
|
277
|
+
return length;
|
|
278
|
+
}
|
|
279
|
+
|
|
280
|
+
private isBoundSatisfied(candidate: CandidateBound) {
|
|
281
|
+
const length = this.getModelLength(candidate.term);
|
|
282
|
+
if (length === undefined) return true;
|
|
283
|
+
if (candidate.kind === BOUND_LO) return length >= candidate.value;
|
|
284
|
+
if (candidate.kind === BOUND_HI) return length <= candidate.value;
|
|
285
|
+
return length === candidate.value;
|
|
286
|
+
}
|
|
287
|
+
|
|
288
|
+
private recordBound(candidate: CandidateBound) {
|
|
289
|
+
if (
|
|
290
|
+
this.monadicBounds.some(
|
|
291
|
+
(bound) =>
|
|
292
|
+
bound.length === candidate.length &&
|
|
293
|
+
bound.kind === candidate.kind &&
|
|
294
|
+
bound.value === candidate.value,
|
|
295
|
+
)
|
|
296
|
+
)
|
|
297
|
+
return;
|
|
298
|
+
const dep = getBoundDep(this.monadicBounds.length);
|
|
299
|
+
this.pushBack(
|
|
300
|
+
this.monadicBounds,
|
|
301
|
+
{ length: this.keep(candidate.length), kind: candidate.kind, value: candidate.value },
|
|
302
|
+
(bound) => this.manager.decRef(bound.length),
|
|
303
|
+
);
|
|
304
|
+
if (candidate.kind === BOUND_LO) this.monadic.addLo(candidate.term, candidate.value, dep);
|
|
305
|
+
else if (candidate.kind === BOUND_HI) this.monadic.addHi(candidate.term, candidate.value, dep);
|
|
306
|
+
else this.monadic.addLen(candidate.term, candidate.value, dep);
|
|
307
|
+
}
|
|
308
|
+
|
|
309
|
+
private addCoreLiteral(dep: number, literals: Literal[], state: { dep: Dependency }) {
|
|
310
|
+
if (dep % 2 === 0) {
|
|
311
|
+
const membership = this.monadicMemberships[dep / 2 - 1];
|
|
312
|
+
literals.push(membership.literal);
|
|
313
|
+
if (membership.dep !== null) state.dep = mkJoin(state.dep, membership.dep);
|
|
314
|
+
return;
|
|
315
|
+
}
|
|
316
|
+
const bound = this.monadicBounds[(dep - 1) / 2];
|
|
317
|
+
if (bound.kind !== BOUND_HI) literals.push(this.mkGeLiteral(bound.length, bound.value));
|
|
318
|
+
if (bound.kind !== BOUND_LO) literals.push(this.mkLeLiteral(bound.length, bound.value));
|
|
319
|
+
}
|
|
320
|
+
|
|
321
|
+
private propagateAcceptLegacy(literal: Literal, seq: number, inputRegex: number) {
|
|
322
|
+
const manager = this.manager;
|
|
323
|
+
if (this.isStringEquality(literal)) return;
|
|
324
|
+
let regex = inputRegex;
|
|
325
|
+
if (!manager.isValue(seq)) {
|
|
326
|
+
const approximation = this.getOverapproxRegex(seq);
|
|
327
|
+
if (!isFullSeq(manager, approximation))
|
|
328
|
+
regex = mkRe(manager, OP_RE_INTERSECT, [regex, approximation]);
|
|
329
|
+
}
|
|
330
|
+
const accept = this.sk.mkAccept(seq, this.mkInt(0), regex);
|
|
331
|
+
this.addAxiomOf(negate(literal), this.mkLiteralOf(accept));
|
|
332
|
+
}
|
|
333
|
+
|
|
334
|
+
private enableLegacyFallback() {
|
|
335
|
+
if (this.fallbackGeneration === this.monadicGeneration) return;
|
|
336
|
+
for (const membership of this.monadicMemberships)
|
|
337
|
+
this.propagateAcceptLegacy(membership.literal, membership.seq, membership.regex);
|
|
338
|
+
const generation = this.fallbackGeneration;
|
|
339
|
+
this.context.pushTrail(() => {
|
|
340
|
+
this.fallbackGeneration = generation;
|
|
341
|
+
});
|
|
342
|
+
this.fallbackGeneration = this.monadicGeneration;
|
|
343
|
+
}
|
|
344
|
+
|
|
345
|
+
protected checkEquationConflict() {
|
|
346
|
+
const manager = this.manager;
|
|
347
|
+
const context = this.context;
|
|
348
|
+
if (this.monadicMemberships.length === 0 || this.eqs.size === 0) return false;
|
|
349
|
+
const outer = manager.beginTemporaries();
|
|
350
|
+
this.eqApprox.resetViews();
|
|
351
|
+
const owners = new Map<number, number[]>();
|
|
352
|
+
for (let index = 0; index < this.monadicMemberships.length; index++) {
|
|
353
|
+
const membership = this.monadicMemberships[index];
|
|
354
|
+
if (context.getAssignment(membership.literal) !== L_TRUE) continue;
|
|
355
|
+
const owned = owners.get(membership.seq) ?? [];
|
|
356
|
+
owned.push(index);
|
|
357
|
+
owners.set(membership.seq, owned);
|
|
358
|
+
this.eqApprox.addView(membership.seq, membership.regex, -1);
|
|
359
|
+
}
|
|
360
|
+
let conflict: { literals: Literal[]; dep: Dependency } | undefined;
|
|
361
|
+
for (const eq of owners.size === 0 ? [] : this.eqs.items) {
|
|
362
|
+
if (eq.ls.length === 0 || eq.rs.length === 0) continue;
|
|
363
|
+
const lhs = mkConcatOf(manager, eq.ls, manager.sorts[eq.ls[0]]);
|
|
364
|
+
const rhs = mkConcatOf(manager, eq.rs, manager.sorts[eq.rs[0]]);
|
|
365
|
+
if (this.eqApprox.check(lhs, rhs) !== L_FALSE) continue;
|
|
366
|
+
const literals: Literal[] = [];
|
|
367
|
+
for (const term of this.eqApprox.used)
|
|
368
|
+
for (const index of owners.get(term) ?? [])
|
|
369
|
+
literals.push(this.monadicMemberships[index].literal);
|
|
370
|
+
if (eq.dep === null && literals.length === 0) continue;
|
|
371
|
+
conflict = { literals, dep: eq.dep };
|
|
372
|
+
break;
|
|
373
|
+
}
|
|
374
|
+
manager.endTemporaries(outer);
|
|
375
|
+
if (conflict === undefined) return false;
|
|
376
|
+
this.conflictOrAxiom(conflict.literals, conflict.dep);
|
|
377
|
+
return true;
|
|
378
|
+
}
|
|
379
|
+
|
|
380
|
+
private solveMonadic() {
|
|
381
|
+
const manager = this.manager;
|
|
382
|
+
this.refreshExpansions();
|
|
383
|
+
const candidates: CandidateBound[] = [];
|
|
384
|
+
this.collectCandidateBounds(candidates);
|
|
385
|
+
let result = L_UNDEF;
|
|
386
|
+
let guard = candidates.length + 1;
|
|
387
|
+
this.monadicModel.clear();
|
|
388
|
+
const outer = manager.beginTemporaries();
|
|
389
|
+
for (;;) {
|
|
390
|
+
result = this.monadic.check();
|
|
391
|
+
if (result !== L_TRUE) break;
|
|
392
|
+
this.monadicModel.clear();
|
|
393
|
+
if (this.monadic.materializeAll(this.monadicModel) !== L_TRUE) {
|
|
394
|
+
result = L_UNDEF;
|
|
395
|
+
break;
|
|
396
|
+
}
|
|
397
|
+
let isProgressing = false;
|
|
398
|
+
for (const candidate of candidates) {
|
|
399
|
+
if (this.isBoundSatisfied(candidate)) continue;
|
|
400
|
+
this.recordBound(candidate);
|
|
401
|
+
isProgressing = true;
|
|
402
|
+
}
|
|
403
|
+
if (!isProgressing || guard-- === 0) break;
|
|
404
|
+
}
|
|
405
|
+
manager.endTemporaries(outer);
|
|
406
|
+
return result;
|
|
407
|
+
}
|
|
408
|
+
|
|
409
|
+
protected finalCheckRegex() {
|
|
410
|
+
if (this.monadicMemberships.length === 0) return false;
|
|
411
|
+
if (this.fallbackGeneration === this.monadicGeneration) return false;
|
|
412
|
+
if (this.assumptionGeneration === this.monadicGeneration) {
|
|
413
|
+
for (const assumption of this.monadicAssumptions) {
|
|
414
|
+
if (assumption.generation !== this.monadicGeneration) continue;
|
|
415
|
+
if (assumption.variable.root !== assumption.witness.root) {
|
|
416
|
+
this.enableLegacyFallback();
|
|
417
|
+
return true;
|
|
418
|
+
}
|
|
419
|
+
}
|
|
420
|
+
return false;
|
|
421
|
+
}
|
|
422
|
+
const result = this.solveMonadic();
|
|
423
|
+
if (result === L_FALSE) {
|
|
424
|
+
const literals: Literal[] = [];
|
|
425
|
+
const state = { dep: null };
|
|
426
|
+
for (const dep of this.monadic.core) this.addCoreLiteral(dep, literals, state);
|
|
427
|
+
this.conflictOrAxiom(literals, state.dep);
|
|
428
|
+
return true;
|
|
429
|
+
}
|
|
430
|
+
if (result === L_UNDEF) {
|
|
431
|
+
this.enableLegacyFallback();
|
|
432
|
+
return true;
|
|
433
|
+
}
|
|
434
|
+
const generation = this.assumptionGeneration;
|
|
435
|
+
this.context.pushTrail(() => {
|
|
436
|
+
this.assumptionGeneration = generation;
|
|
437
|
+
});
|
|
438
|
+
this.assumptionGeneration = this.monadicGeneration;
|
|
439
|
+
for (const [variable, witness] of this.monadicModel) {
|
|
440
|
+
const variableNode = this.ensureEnodeOf(variable);
|
|
441
|
+
const witnessNode = this.ensureEnodeOf(witness);
|
|
442
|
+
if (variableNode.root === witnessNode.root) continue;
|
|
443
|
+
this.context.assumeEq(variableNode, witnessNode);
|
|
444
|
+
this.pushBack(this.monadicAssumptions, {
|
|
445
|
+
generation: this.monadicGeneration,
|
|
446
|
+
variable: variableNode,
|
|
447
|
+
witness: witnessNode,
|
|
448
|
+
});
|
|
449
|
+
}
|
|
450
|
+
return true;
|
|
451
|
+
}
|
|
452
|
+
|
|
453
|
+
private isStringEquality(literal: Literal) {
|
|
454
|
+
const manager = this.manager;
|
|
455
|
+
const expr = this.context.boolVar2Expr[getVar(literal)];
|
|
456
|
+
const id = this.mkInt(manager.ids[expr]);
|
|
457
|
+
const seq = manager.getArg(expr, 0);
|
|
458
|
+
const seqSort = manager.sorts[seq];
|
|
459
|
+
const patterns = this.re.isReContainsPattern(manager.getArg(expr, 1));
|
|
460
|
+
if (patterns === undefined) return false;
|
|
461
|
+
const mkCont = (index: number) => this.sk.mk("seq.cont", [id, this.mkInt(index)], seqSort);
|
|
462
|
+
let index = 0;
|
|
463
|
+
const parts = [mkCont(index)];
|
|
464
|
+
for (const pattern of patterns) {
|
|
465
|
+
parts.push(...pattern);
|
|
466
|
+
parts.push(mkCont(++index));
|
|
467
|
+
}
|
|
468
|
+
this.propagateEq(null, [literal], seq, mkConcatOf(manager, parts, seqSort), true);
|
|
469
|
+
return true;
|
|
470
|
+
}
|
|
471
|
+
|
|
472
|
+
protected propagateInRe(literal: Literal) {
|
|
473
|
+
const manager = this.manager;
|
|
474
|
+
const expr = this.context.boolVar2Expr[getVar(literal)];
|
|
475
|
+
const seq = manager.getArg(expr, 0);
|
|
476
|
+
const regex = manager.getArg(expr, 1);
|
|
477
|
+
if (this.unfoldComplement(literal, seq, regex)) return;
|
|
478
|
+
if (this.unfoldPrefix(literal, seq, regex)) return;
|
|
479
|
+
if (this.factorIte(literal, seq, regex)) return;
|
|
480
|
+
this.propagateLengthResidue(literal, seq, regex);
|
|
481
|
+
this.addMonadicMembership(literal, seq, regex);
|
|
482
|
+
}
|
|
483
|
+
|
|
484
|
+
private propagateLengthResidue(literal: Literal, seq: number, regex: number) {
|
|
485
|
+
if (isNegated(literal)) return;
|
|
486
|
+
if (!canBeMember(this.re.info, seq, regex)) {
|
|
487
|
+
this.addAxiomOf(negate(literal));
|
|
488
|
+
return;
|
|
489
|
+
}
|
|
490
|
+
const info = this.re.info.getInfo(regex);
|
|
491
|
+
if (!info.isKnown || info.period <= 1 || !this.areLengthsLive(seq)) return;
|
|
492
|
+
const residues: number[] = [];
|
|
493
|
+
for (let residue = 0; residue < info.period; residue++)
|
|
494
|
+
if ((info.residues >> BigInt(residue)) & 1n) residues.push(residue);
|
|
495
|
+
if (residues.length === 0 || residues.length > 4) return;
|
|
496
|
+
const mod = this.mkArith(OP_MOD, [this.mkLen(seq), this.mkInt(info.period)]);
|
|
497
|
+
const literals = [negate(literal)];
|
|
498
|
+
for (const residue of residues)
|
|
499
|
+
literals.push(this.mkEqLiteral(mod, this.mkInt(residue), false));
|
|
500
|
+
this.addAxiom(literals);
|
|
501
|
+
}
|
|
502
|
+
|
|
503
|
+
private areLengthsLive(seq: number) {
|
|
504
|
+
const manager = this.manager;
|
|
505
|
+
if (this.hasLength(seq)) return true;
|
|
506
|
+
const todo = [seq];
|
|
507
|
+
let hasVar = false;
|
|
508
|
+
for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
|
|
509
|
+
if (this.isConcat(expr)) {
|
|
510
|
+
todo.push(manager.getArg(expr, 0), manager.getArg(expr, 1));
|
|
511
|
+
continue;
|
|
512
|
+
}
|
|
513
|
+
if (this.isEmpty(expr) || this.isUnit(expr) || this.isString(expr)) continue;
|
|
514
|
+
if (!this.hasLength(expr)) return false;
|
|
515
|
+
hasVar = true;
|
|
516
|
+
}
|
|
517
|
+
return hasVar;
|
|
518
|
+
}
|
|
519
|
+
|
|
520
|
+
private mkInRe(seq: number, regex: number) {
|
|
521
|
+
return mkSeqApp(this.manager, OP_SEQ_IN_RE, [seq, regex]);
|
|
522
|
+
}
|
|
523
|
+
|
|
524
|
+
private unfoldComplement(literal: Literal, seq: number, regex: number) {
|
|
525
|
+
if (!isNegated(literal)) return false;
|
|
526
|
+
const formula = this.rewrite(this.mkInRe(seq, mkRe(this.manager, OP_RE_COMPLEMENT, [regex])));
|
|
527
|
+
const complemented = this.mkLiteralOf(formula);
|
|
528
|
+
if (literal === complemented) this.addUnhandledExpr(formula);
|
|
529
|
+
this.propagateLit(null, [literal], complemented);
|
|
530
|
+
return true;
|
|
531
|
+
}
|
|
532
|
+
|
|
533
|
+
private unfoldPrefix(literal: Literal, seq: number, regex: number) {
|
|
534
|
+
const manager = this.manager;
|
|
535
|
+
const prefix: number[] = [];
|
|
536
|
+
let tail = seq;
|
|
537
|
+
while (this.isConcat(tail) && this.isUnit(manager.getArg(tail, 0))) {
|
|
538
|
+
prefix.push(manager.getArg(manager.getArg(tail, 0), 0));
|
|
539
|
+
tail = manager.getArg(tail, 1);
|
|
540
|
+
}
|
|
541
|
+
if (prefix.length === 0) return false;
|
|
542
|
+
let derivative = regex;
|
|
543
|
+
for (const element of prefix) {
|
|
544
|
+
derivative = this.re.mkDerivative(element, derivative);
|
|
545
|
+
if (isReEmpty(manager, derivative)) {
|
|
546
|
+
this.setConflict(null, [literal]);
|
|
547
|
+
return true;
|
|
548
|
+
}
|
|
549
|
+
}
|
|
550
|
+
this.propagateLit(
|
|
551
|
+
null,
|
|
552
|
+
[literal],
|
|
553
|
+
this.mkLiteralOf(this.rewrite(this.mkInRe(tail, derivative))),
|
|
554
|
+
);
|
|
555
|
+
return true;
|
|
556
|
+
}
|
|
557
|
+
|
|
558
|
+
private decomposeIte(regex: number) {
|
|
559
|
+
const manager = this.manager;
|
|
560
|
+
if (manager.getOp(regex) === OP_ITE) return manager.getArgs(regex);
|
|
561
|
+
const visited = new Set<number>();
|
|
562
|
+
const todo = [regex];
|
|
563
|
+
for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
|
|
564
|
+
if (visited.has(current)) continue;
|
|
565
|
+
visited.add(current);
|
|
566
|
+
if (manager.kinds[current] !== KIND_APP) continue;
|
|
567
|
+
if (manager.getOp(current) === OP_ITE) {
|
|
568
|
+
const getReplaced = (branch: number) => {
|
|
569
|
+
const replace = new ExprSafeReplace(manager);
|
|
570
|
+
replace.insert(current, branch);
|
|
571
|
+
return replace.apply(regex);
|
|
572
|
+
};
|
|
573
|
+
return [
|
|
574
|
+
manager.getArg(current, 0),
|
|
575
|
+
getReplaced(manager.getArg(current, 1)),
|
|
576
|
+
getReplaced(manager.getArg(current, 2)),
|
|
577
|
+
];
|
|
578
|
+
}
|
|
579
|
+
manager.pushArgs(current, todo);
|
|
580
|
+
}
|
|
581
|
+
return undefined;
|
|
582
|
+
}
|
|
583
|
+
|
|
584
|
+
private factorIte(literal: Literal, seq: number, regex: number) {
|
|
585
|
+
const context = this.context;
|
|
586
|
+
const decomposed = this.decomposeIte(regex);
|
|
587
|
+
if (decomposed === undefined) return false;
|
|
588
|
+
const condition = this.mkLiteralOf(decomposed[0]);
|
|
589
|
+
const value = context.getAssignment(condition);
|
|
590
|
+
if (value === L_TRUE)
|
|
591
|
+
this.propagateLit(
|
|
592
|
+
null,
|
|
593
|
+
[literal, condition],
|
|
594
|
+
this.mkLiteralOf(this.mkInRe(seq, decomposed[1])),
|
|
595
|
+
);
|
|
596
|
+
else if (value === L_FALSE)
|
|
597
|
+
this.propagateLit(
|
|
598
|
+
null,
|
|
599
|
+
[literal, negate(condition)],
|
|
600
|
+
this.mkLiteralOf(this.mkInRe(seq, decomposed[2])),
|
|
601
|
+
);
|
|
602
|
+
else {
|
|
603
|
+
context.markLiteralAsRelevant(condition);
|
|
604
|
+
const inThen = this.mkLiteralOf(this.mkInRe(seq, decomposed[1]));
|
|
605
|
+
const inElse = this.mkLiteralOf(this.mkInRe(seq, decomposed[2]));
|
|
606
|
+
this.addAxiomOf(negate(literal), negate(condition), inThen);
|
|
607
|
+
this.addAxiomOf(negate(literal), condition, inElse);
|
|
608
|
+
}
|
|
609
|
+
return true;
|
|
610
|
+
}
|
|
611
|
+
|
|
612
|
+
private getOverapproxRegex(seq: number): number {
|
|
613
|
+
const manager = this.manager;
|
|
614
|
+
const toRe = mkToRe(manager, seq);
|
|
615
|
+
const dotStar = mkFullSeq(manager, manager.sorts[toRe]);
|
|
616
|
+
if (manager.isValue(seq)) return toRe;
|
|
617
|
+
if (manager.getOp(seq) === OP_SEQ_CONCAT) {
|
|
618
|
+
let approximation = -1;
|
|
619
|
+
let last = -1;
|
|
620
|
+
for (const part of getConcat(manager, seq, [])) {
|
|
621
|
+
const partApproximation = this.getOverapproxRegex(part);
|
|
622
|
+
if (approximation === -1) approximation = partApproximation;
|
|
623
|
+
else if (last !== dotStar || partApproximation !== dotStar)
|
|
624
|
+
approximation = mkRe(manager, OP_RE_CONCAT, [approximation, partApproximation]);
|
|
625
|
+
last = partApproximation;
|
|
626
|
+
}
|
|
627
|
+
return approximation === -1 ? mkEpsilon(manager, manager.sorts[seq]) : approximation;
|
|
628
|
+
}
|
|
629
|
+
if (manager.getOp(seq) === OP_ITE) {
|
|
630
|
+
const thenApproximation = this.getOverapproxRegex(manager.getArg(seq, 1));
|
|
631
|
+
if (isFullSeq(manager, thenApproximation)) return thenApproximation;
|
|
632
|
+
const elseApproximation = this.getOverapproxRegex(manager.getArg(seq, 2));
|
|
633
|
+
if (isFullSeq(manager, elseApproximation)) return elseApproximation;
|
|
634
|
+
return mkRe(manager, OP_RE_UNION, [thenApproximation, elseApproximation]);
|
|
635
|
+
}
|
|
636
|
+
return dotStar;
|
|
637
|
+
}
|
|
638
|
+
|
|
639
|
+
private isBlockedAsEmpty(regex: number, literal: Literal) {
|
|
640
|
+
const manager = this.manager;
|
|
641
|
+
const info = this.re.info.getInfo(regex);
|
|
642
|
+
if (isReEmpty(manager, regex) || info.lo === UINT_MAX) {
|
|
643
|
+
this.addAxiomOf(negate(literal));
|
|
644
|
+
return true;
|
|
645
|
+
}
|
|
646
|
+
if (!info.isInterpreted) return false;
|
|
647
|
+
const outer = manager.beginTemporaries();
|
|
648
|
+
const isEmpty =
|
|
649
|
+
this.liveStates.isDead(this.liveStates.getSearch(regex, -1)) ||
|
|
650
|
+
this.isReEmptyLanguage(regex) === L_TRUE;
|
|
651
|
+
manager.endTemporaries(outer);
|
|
652
|
+
if (isEmpty) this.addAxiomOf(negate(literal));
|
|
653
|
+
return isEmpty;
|
|
654
|
+
}
|
|
655
|
+
|
|
656
|
+
protected propagateAccept(literal: Literal) {
|
|
657
|
+
const manager = this.manager;
|
|
658
|
+
const expr = this.context.boolVar2Expr[getVar(literal)];
|
|
659
|
+
const accept = this.sk.getAccept(expr);
|
|
660
|
+
if (accept === undefined) return;
|
|
661
|
+
const seq = accept.seq;
|
|
662
|
+
const regex = accept.regex;
|
|
663
|
+
const position = accept.position;
|
|
664
|
+
if (this.isBlockedAsEmpty(regex, literal)) return;
|
|
665
|
+
if (this.isBlockingUnfolding(literal, position)) return;
|
|
666
|
+
const minLength = this.re.info.getInfo(regex).lo;
|
|
667
|
+
this.propagateLit(
|
|
668
|
+
null,
|
|
669
|
+
[literal],
|
|
670
|
+
this.mkGeLiteral(this.mkLen(seq), addTruncate(minLength, position)),
|
|
671
|
+
);
|
|
672
|
+
const isShort = this.mkLeLiteral(this.mkLen(seq), position);
|
|
673
|
+
if (minLength === 0) {
|
|
674
|
+
const nullable = this.rewrite(this.re.isNullable(regex));
|
|
675
|
+
if (manager.isFalse(nullable)) this.propagateLit(null, [literal], negate(isShort));
|
|
676
|
+
else if (!manager.isTrue(nullable)) {
|
|
677
|
+
const nullableLiteral = this.mkLiteralOf(nullable);
|
|
678
|
+
this.context.markLiteralAsRelevant(nullableLiteral);
|
|
679
|
+
this.addAxiomOf(negate(literal), negate(isShort), nullableLiteral);
|
|
680
|
+
if (manager.getOp(nullable) === OP_SEQ_IN_RE) this.addUnhandledExpr(nullable);
|
|
681
|
+
}
|
|
682
|
+
}
|
|
683
|
+
const derivative = this.mkDerivativeOf(
|
|
684
|
+
mkSeqApp(manager, OP_SEQ_NTH_I, [seq, accept.index]),
|
|
685
|
+
regex,
|
|
686
|
+
);
|
|
687
|
+
const next = this.mkDerivAccept(seq, position + 1, derivative);
|
|
688
|
+
this.addAxiom([negate(literal), isShort, this.mkLiteralOf(next)]);
|
|
689
|
+
}
|
|
690
|
+
|
|
691
|
+
private isBlockingUnfolding(literal: Literal, position: number) {
|
|
692
|
+
const context = this.context;
|
|
693
|
+
const maxUnfolding = this.maxUnfoldingLiteral;
|
|
694
|
+
if (position <= this.maxUnfoldingDepth || maxUnfolding === undefined) return false;
|
|
695
|
+
if (context.getAssignment(maxUnfolding) !== L_TRUE) return false;
|
|
696
|
+
if (context.scopeLevel === context.baseLevel) return false;
|
|
697
|
+
this.propagateLit(null, [literal], negate(maxUnfolding));
|
|
698
|
+
return true;
|
|
699
|
+
}
|
|
700
|
+
|
|
701
|
+
private symmetricDiff(first: number, second: number) {
|
|
702
|
+
const manager = this.manager;
|
|
703
|
+
const diff =
|
|
704
|
+
first === second
|
|
705
|
+
? mkReEmpty(manager, manager.sorts[first])
|
|
706
|
+
: isReEmpty(manager, first)
|
|
707
|
+
? second
|
|
708
|
+
: isReEmpty(manager, second)
|
|
709
|
+
? first
|
|
710
|
+
: mkRe(manager, OP_RE_UNION, [
|
|
711
|
+
mkRe(manager, OP_RE_DIFF, [first, second]),
|
|
712
|
+
mkRe(manager, OP_RE_DIFF, [second, first]),
|
|
713
|
+
]);
|
|
714
|
+
const result = this.rewrite(diff);
|
|
715
|
+
manager.releaseLater(result);
|
|
716
|
+
return result;
|
|
717
|
+
}
|
|
718
|
+
|
|
719
|
+
private mkDerivativeOf(element: number, regex: number) {
|
|
720
|
+
const manager = this.manager;
|
|
721
|
+
const derivative = this.re.mkSymbolicDerivative(regex);
|
|
722
|
+
const elementSort = manager.getSeqElementSort(manager.getReSeqSort(manager.sorts[regex]));
|
|
723
|
+
const replace = new ExprSafeReplace(manager);
|
|
724
|
+
replace.insert(manager.mkVar(0, elementSort), element);
|
|
725
|
+
return replace.apply(derivative);
|
|
726
|
+
}
|
|
727
|
+
|
|
728
|
+
protected propagateReEq(first: number, second: number) {
|
|
729
|
+
const manager = this.manager;
|
|
730
|
+
const outer = manager.beginTemporaries();
|
|
731
|
+
const diff = this.symmetricDiff(first, second);
|
|
732
|
+
let status = isReEmpty(manager, diff) ? L_TRUE : L_UNDEF;
|
|
733
|
+
if (
|
|
734
|
+
status === L_UNDEF &&
|
|
735
|
+
(isReEmpty(manager, first) || isReEmpty(manager, second)) &&
|
|
736
|
+
isReGround(this.re.info, diff)
|
|
737
|
+
)
|
|
738
|
+
status = this.isReEmptyLanguage(diff);
|
|
739
|
+
if (status === L_UNDEF && isReGround(this.re.info, first) && isReGround(this.re.info, second))
|
|
740
|
+
status = this.areEquivalent(first, second);
|
|
741
|
+
manager.endTemporaries(outer);
|
|
742
|
+
if (status === L_TRUE) return;
|
|
743
|
+
if (status === L_FALSE) {
|
|
744
|
+
this.addAxiomOf(negate(this.mkEqLiteral(first, second, false)), FALSE_LITERAL);
|
|
745
|
+
return;
|
|
746
|
+
}
|
|
747
|
+
this.addUnhandledExpr(first);
|
|
748
|
+
this.addUnhandledExpr(second);
|
|
749
|
+
}
|
|
750
|
+
|
|
751
|
+
protected propagateReNe(first: number, second: number) {
|
|
752
|
+
const manager = this.manager;
|
|
753
|
+
const outer = manager.beginTemporaries();
|
|
754
|
+
// Z3 computes the symmetric difference here without using it.
|
|
755
|
+
this.symmetricDiff(first, second);
|
|
756
|
+
const status =
|
|
757
|
+
isReGround(this.re.info, first) && isReGround(this.re.info, second)
|
|
758
|
+
? this.areEquivalent(first, second)
|
|
759
|
+
: L_UNDEF;
|
|
760
|
+
manager.endTemporaries(outer);
|
|
761
|
+
if (status === L_FALSE) return;
|
|
762
|
+
if (status === L_TRUE) {
|
|
763
|
+
this.addAxiomOf(this.mkEqLiteral(first, second, false), FALSE_LITERAL);
|
|
764
|
+
return;
|
|
765
|
+
}
|
|
766
|
+
this.addUnhandledExpr(first);
|
|
767
|
+
this.addUnhandledExpr(second);
|
|
768
|
+
}
|
|
769
|
+
|
|
770
|
+
private areEquivalent(first: number, second: number) {
|
|
771
|
+
const bisim = new RegexBisim(this.manager, this.re);
|
|
772
|
+
const status = bisim.areEquivalent(first, second);
|
|
773
|
+
bisim.release();
|
|
774
|
+
return status;
|
|
775
|
+
}
|
|
776
|
+
|
|
777
|
+
private mkDerivAccept(seq: number, position: number, regex: number) {
|
|
778
|
+
const manager = this.manager;
|
|
779
|
+
const toVisit = [regex];
|
|
780
|
+
const accepts = new Map<number, number>();
|
|
781
|
+
const isLonger = getStrMinLength(manager, seq) > position;
|
|
782
|
+
const index = this.mkInt(position);
|
|
783
|
+
while (toVisit.length > 0) {
|
|
784
|
+
const expr = toVisit[toVisit.length - 1];
|
|
785
|
+
const isIte = manager.getOp(expr) === OP_ITE;
|
|
786
|
+
const isUnion = isReBinary(manager, expr, OP_RE_UNION);
|
|
787
|
+
const first = isIte ? manager.getArg(expr, 1) : isUnion ? manager.getArg(expr, 0) : -1;
|
|
788
|
+
const second = isIte ? manager.getArg(expr, 2) : isUnion ? manager.getArg(expr, 1) : -1;
|
|
789
|
+
if (!accepts.has(expr)) {
|
|
790
|
+
if (first !== -1) toVisit.push(first, second);
|
|
791
|
+
accepts.set(expr, -1);
|
|
792
|
+
continue;
|
|
793
|
+
}
|
|
794
|
+
toVisit.pop();
|
|
795
|
+
if (accepts.get(expr) !== -1) continue;
|
|
796
|
+
if (isIte) {
|
|
797
|
+
const condition = manager.getArg(expr, 0);
|
|
798
|
+
const thenAccept = accepts.get(first)!;
|
|
799
|
+
const elseAccept = accepts.get(second)!;
|
|
800
|
+
accepts.set(
|
|
801
|
+
expr,
|
|
802
|
+
manager.isTrue(condition) || thenAccept === elseAccept
|
|
803
|
+
? thenAccept
|
|
804
|
+
: manager.isFalse(condition)
|
|
805
|
+
? elseAccept
|
|
806
|
+
: manager.mkApp(OP_ITE, [condition, thenAccept, elseAccept], SORT_BOOL),
|
|
807
|
+
);
|
|
808
|
+
} else if (isReEmpty(manager, expr) || (isLonger && isEpsilon(manager, expr)))
|
|
809
|
+
accepts.set(expr, manager.falseExpr);
|
|
810
|
+
else if (isFullSeq(manager, expr) || (isLonger && isDotPlus(manager, expr)))
|
|
811
|
+
accepts.set(expr, manager.trueExpr);
|
|
812
|
+
else if (isUnion) {
|
|
813
|
+
const firstAccept = accepts.get(first)!;
|
|
814
|
+
const secondAccept = accepts.get(second)!;
|
|
815
|
+
accepts.set(
|
|
816
|
+
expr,
|
|
817
|
+
manager.isFalse(firstAccept) || firstAccept === secondAccept
|
|
818
|
+
? secondAccept
|
|
819
|
+
: manager.isFalse(secondAccept)
|
|
820
|
+
? firstAccept
|
|
821
|
+
: manager.mkOr([firstAccept, secondAccept]),
|
|
822
|
+
);
|
|
823
|
+
} else accepts.set(expr, this.sk.mkAccept(seq, index, expr));
|
|
824
|
+
}
|
|
825
|
+
return this.rewrite(accepts.get(regex)!);
|
|
826
|
+
}
|
|
827
|
+
|
|
828
|
+
private isReEmptyLanguage(regex: number) {
|
|
829
|
+
const manager = this.manager;
|
|
830
|
+
if (isReEmpty(manager, regex)) return L_TRUE;
|
|
831
|
+
const pinned = new RefVector(manager);
|
|
832
|
+
const visited = new Set([regex]);
|
|
833
|
+
const work = [regex];
|
|
834
|
+
pinned.push(regex);
|
|
835
|
+
const derive = this.re.getDerive();
|
|
836
|
+
let result = L_TRUE;
|
|
837
|
+
for (let steps = 1; work.length > 0; steps++) {
|
|
838
|
+
if (steps > EMPTINESS_STEPS) {
|
|
839
|
+
result = L_UNDEF;
|
|
840
|
+
break;
|
|
841
|
+
}
|
|
842
|
+
const state = work.pop()!;
|
|
843
|
+
const info = this.re.info.getInfo(state);
|
|
844
|
+
if (!info.isKnown) {
|
|
845
|
+
result = L_UNDEF;
|
|
846
|
+
break;
|
|
847
|
+
}
|
|
848
|
+
if (info.nullable === L_TRUE || info.isClassical) {
|
|
849
|
+
result = L_FALSE;
|
|
850
|
+
break;
|
|
851
|
+
}
|
|
852
|
+
if (info.lo === UINT_MAX) continue;
|
|
853
|
+
const cofactors = new RefVector(manager);
|
|
854
|
+
derive.derivativeCofactors(state, cofactors);
|
|
855
|
+
for (let pair = 0; pair < cofactors.size; pair += 2) {
|
|
856
|
+
const target = cofactors.items[pair + 1];
|
|
857
|
+
if (isReEmpty(manager, target) || visited.has(target)) continue;
|
|
858
|
+
visited.add(target);
|
|
859
|
+
pinned.push(target);
|
|
860
|
+
work.push(target);
|
|
861
|
+
}
|
|
862
|
+
cofactors.reset();
|
|
863
|
+
}
|
|
864
|
+
pinned.reset();
|
|
865
|
+
return result;
|
|
866
|
+
}
|
|
867
|
+
}
|