tla-ts 0.0.10-dev.8aec06f77 → 0.0.10-dev.8be00045c
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/dist/deciders.cjs +37 -36
- package/dist/deciders.js +55 -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.cjs +146 -58
- package/dist/prove.js +143 -55
- package/dist/run.cjs +43 -43
- package/dist/run.js +45 -45
- package/dist/transfer.cjs +29 -26
- package/dist/transfer.js +43 -40
- package/dist/worker.cjs +1 -1
- package/dist/worker.js +1 -1
- 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 +261 -68
- 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 +1 -1
- package/src/evaluate.ts +9 -3
- package/src/exit-codes.ts +5 -2
- package/src/instances.ts +1 -1
- package/src/levels.ts +134 -86
- package/src/liveness-checker.ts +572 -204
- package/src/liveness.ts +47 -32
- package/src/obligations/action.ts +0 -2
- package/src/obligations/anonymize.ts +2 -6
- package/src/obligations/equality.ts +0 -2
- package/src/obligations/expression.ts +0 -2
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +0 -2
- package/src/obligations/index.ts +5 -3
- package/src/obligations/levels.ts +0 -2
- package/src/obligations/module.ts +0 -2
- package/src/obligations/normalize.ts +0 -2
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +2 -2
- package/src/obligations/printer.ts +0 -2
- package/src/obligations/proof.ts +0 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +0 -2
- package/src/obligations/subexpression.ts +0 -2
- package/src/obligations/substitution.ts +0 -2
- 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 +224 -82
- package/src/pretty-print.ts +1 -1
- package/src/prover/deciders.ts +1 -8
- package/src/prover/isabelle/encode.ts +0 -2
- package/src/prover/isabelle/isar/attrib.ts +86 -49
- package/src/prover/isabelle/isar/context.ts +25 -26
- package/src/prover/isabelle/isar/induct.ts +2 -9
- package/src/prover/isabelle/isar/method.ts +5 -9
- package/src/prover/isabelle/isar/proof.ts +33 -18
- package/src/prover/isabelle/isar/rule-cases.ts +14 -22
- package/src/prover/isabelle/isar/theory.ts +16 -17
- package/src/prover/isabelle/isar/toplevel.ts +46 -56
- package/src/prover/isabelle/isar/type-check.ts +0 -2
- 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 +1 -3
- 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 +0 -2
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +0 -2
- 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 +0 -2
- 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 +0 -2
- 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 +0 -2
- 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 +0 -2
- package/src/prover/isabelle/tla/simpdata.ts +0 -2
- package/src/prover/isabelle/tools/intuitionistic.ts +0 -2
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +1 -0
- package/src/prover/prep/methods.ts +50 -3
- package/src/prover/prep/normalize.ts +4 -1
- package/src/prover/prove.ts +58 -32
- package/src/prover/ptl/decide.ts +43 -63
- package/src/prover/smt/data.ts +51 -45
- package/src/prover/smt/encode.ts +1 -2
- package/src/prover/smt/rewrite.ts +3 -7
- package/src/prover/smt/simplify.ts +1 -1
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +0 -2
- package/src/prover/smt/solver/ackr-helper.ts +0 -3
- package/src/prover/smt/solver/ackr-model-converter.ts +0 -1
- package/src/prover/smt/solver/act-cache.ts +0 -1
- package/src/prover/smt/solver/add-bounds-tactic.ts +0 -1
- package/src/prover/smt/solver/aig-tactic.ts +25 -16
- package/src/prover/smt/solver/aig.ts +2 -3
- package/src/prover/smt/solver/arith-rewriter.ts +3 -6
- package/src/prover/smt/solver/arith-terms.ts +0 -2
- package/src/prover/smt/solver/array-decl-plugin.ts +0 -1
- package/src/prover/smt/solver/array-rewriter.ts +0 -1
- package/src/prover/smt/solver/asserted-formulas.ts +9 -3
- package/src/prover/smt/solver/ast-lt.ts +1 -2
- package/src/prover/smt/solver/ast-util.ts +3 -3
- package/src/prover/smt/solver/ast.ts +112 -156
- package/src/prover/smt/solver/auf-solver.ts +0 -1
- package/src/prover/smt/solver/bit-blast-tactic.ts +0 -3
- package/src/prover/smt/solver/bit-blaster.ts +0 -3
- package/src/prover/smt/solver/bound-manager.ts +39 -29
- package/src/prover/smt/solver/bound-simplifier.ts +0 -2
- package/src/prover/smt/solver/bv-bound-chk.ts +2 -10
- package/src/prover/smt/solver/bv-decl-plugin.ts +0 -1
- package/src/prover/smt/solver/bv-divrem-bounds.ts +0 -2
- package/src/prover/smt/solver/bv-rewriter.ts +15 -19
- package/src/prover/smt/solver/bv1-blast.ts +1 -11
- package/src/prover/smt/solver/bv2fpa-converter.ts +0 -1
- package/src/prover/smt/solver/bv2int-rewriter.ts +0 -1
- package/src/prover/smt/solver/bv2real-rewriter.ts +0 -1
- package/src/prover/smt/solver/card2bv.ts +1 -4
- package/src/prover/smt/solver/case-split-queue.ts +0 -2
- package/src/prover/smt/solver/cg-table.ts +19 -16
- package/src/prover/smt/solver/check-logic.ts +6 -2
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +0 -2
- package/src/prover/smt/solver/conflict-resolution.ts +0 -1
- package/src/prover/smt/solver/context.ts +41 -14
- package/src/prover/smt/solver/ctx-simplify.ts +1 -3
- package/src/prover/smt/solver/ctx-solver-simplify.ts +0 -2
- package/src/prover/smt/solver/datatype-decl-plugin.ts +0 -1
- package/src/prover/smt/solver/datatype-rewriter.ts +0 -1
- package/src/prover/smt/solver/demodulator.ts +2 -5
- package/src/prover/smt/solver/dependent-expr-state.ts +16 -3
- package/src/prover/smt/solver/der.ts +0 -1
- package/src/prover/smt/solver/diff-neq.ts +1 -3
- package/src/prover/smt/solver/distribute-forall.ts +1 -11
- package/src/prover/smt/solver/dom-simplify.ts +1 -3
- package/src/prover/smt/solver/dt2bv-tactic.ts +2 -9
- 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 +0 -1
- package/src/prover/smt/solver/elim-uncnstr.ts +7 -23
- package/src/prover/smt/solver/enode.ts +15 -2
- package/src/prover/smt/solver/eq2bv-tactic.ts +0 -1
- package/src/prover/smt/solver/euf/arith-axioms.ts +0 -1
- package/src/prover/smt/solver/euf/arith-internalize.ts +1 -3
- package/src/prover/smt/solver/euf/arith-solver.ts +0 -1
- package/src/prover/smt/solver/euf/array-axioms.ts +0 -1
- package/src/prover/smt/solver/euf/array-internalize.ts +20 -11
- package/src/prover/smt/solver/euf/array-solver.ts +0 -2
- package/src/prover/smt/solver/euf/bv-ackerman.ts +0 -2
- package/src/prover/smt/solver/euf/bv-internalize.ts +1 -3
- package/src/prover/smt/solver/euf/bv-solver.ts +0 -2
- package/src/prover/smt/solver/euf/dt-solver.ts +19 -21
- package/src/prover/smt/solver/euf/egraph.ts +68 -43
- package/src/prover/smt/solver/euf/euf-solver.ts +36 -23
- package/src/prover/smt/solver/euf/fpa-solver.ts +37 -53
- package/src/prover/smt/solver/euf/mam.ts +7 -55
- package/src/prover/smt/solver/euf/q-ematch.ts +21 -97
- package/src/prover/smt/solver/euf/q-mbi.ts +4 -4
- package/src/prover/smt/solver/euf/q-model-fixer.ts +1 -4
- package/src/prover/smt/solver/euf/q-solver.ts +2 -2
- package/src/prover/smt/solver/euf/th-solver.ts +1 -10
- package/src/prover/smt/solver/euf/th-solvers.ts +0 -1
- package/src/prover/smt/solver/expr-ref.ts +0 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +0 -1
- package/src/prover/smt/solver/expr2polynomial.ts +204 -80
- package/src/prover/smt/solver/factor.ts +37 -26
- package/src/prover/smt/solver/fd-solver.ts +3 -5
- package/src/prover/smt/solver/fingerprints.ts +0 -1
- package/src/prover/smt/solver/fix-dl-var.ts +1 -3
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +19 -14
- package/src/prover/smt/solver/fpa-decl-plugin.ts +0 -1
- package/src/prover/smt/solver/fpa-rewriter.ts +2 -2
- package/src/prover/smt/solver/fpa2bv-converter.ts +13 -8
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +0 -1
- package/src/prover/smt/solver/fpa2bv-tactic.ts +0 -2
- package/src/prover/smt/solver/goal.ts +3 -2
- package/src/prover/smt/solver/goal2nlsat.ts +57 -32
- package/src/prover/smt/solver/guard-set.ts +0 -1
- package/src/prover/smt/solver/hash.ts +0 -1
- package/src/prover/smt/solver/hashtable.ts +0 -1
- package/src/prover/smt/solver/inf-eps.ts +1 -2
- package/src/prover/smt/solver/inj-axiom.ts +0 -1
- package/src/prover/smt/solver/internalizer.ts +41 -3
- package/src/prover/smt/solver/lackr.ts +0 -2
- package/src/prover/smt/solver/lbool.ts +0 -1
- package/src/prover/smt/solver/lia2card.ts +0 -1
- package/src/prover/smt/solver/lia2pb.ts +18 -5
- package/src/prover/smt/solver/literal.ts +0 -1
- package/src/prover/smt/solver/logic-tactics.ts +0 -4
- 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 +0 -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 +0 -1
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +1 -2
- 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 +0 -3
- 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 +26 -7
- 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 +158 -82
- 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 +144 -108
- 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 +50 -19
- 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 +138 -97
- 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 +1 -2
- package/src/prover/smt/solver/macro-finder.ts +1 -4
- package/src/prover/smt/solver/mam-compiler.ts +14 -15
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +1 -13
- package/src/prover/smt/solver/max-cliques.ts +0 -2
- package/src/prover/smt/solver/maxcore.ts +5 -14
- package/src/prover/smt/solver/maximize-ac-sharing.ts +0 -1
- package/src/prover/smt/solver/maxlex.ts +0 -8
- package/src/prover/smt/solver/maxsmt-base.ts +7 -1
- package/src/prover/smt/solver/maxsmt.ts +0 -1
- package/src/prover/smt/solver/mbp/mbp-arith.ts +2 -12
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +0 -1
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +9 -2
- package/src/prover/smt/solver/mbp/mbp-qel.ts +0 -1
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +1 -10
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +0 -1
- package/src/prover/smt/solver/model-based-opt.ts +1 -2
- package/src/prover/smt/solver/model-checker.ts +0 -1
- package/src/prover/smt/solver/model-evaluator.ts +9 -6
- package/src/prover/smt/solver/model-finder.ts +0 -1
- package/src/prover/smt/solver/model-generator.ts +3 -2
- package/src/prover/smt/solver/model-macro-solver.ts +3 -4
- package/src/prover/smt/solver/model-printer.ts +0 -1
- package/src/prover/smt/solver/mpf.ts +2 -5
- package/src/prover/smt/solver/mus.ts +1 -3
- package/src/prover/smt/solver/muz/dl-context.ts +67 -9
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +0 -1
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +68 -22
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +7 -3
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +0 -2
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +39 -11
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +78 -16
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +9 -4
- package/src/prover/smt/solver/muz/dl-rule-set.ts +0 -1
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +0 -4
- package/src/prover/smt/solver/muz/dl-rule.ts +95 -33
- package/src/prover/smt/solver/muz/hnf.ts +6 -6
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +15 -6
- package/src/prover/smt/solver/muz/rule-properties.ts +194 -37
- package/src/prover/smt/solver/muz/spacer-context.ts +104 -89
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +15 -3
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +0 -3
- package/src/prover/smt/solver/muz/spacer-manager.ts +0 -2
- package/src/prover/smt/solver/muz/spacer-pdr.ts +4 -4
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +3 -9
- package/src/prover/smt/solver/muz/spacer-util.ts +2 -3
- package/src/prover/smt/solver/muz/substitution.ts +88 -39
- package/src/prover/smt/solver/nla2bv-tactic.ts +0 -1
- package/src/prover/smt/solver/nlqsat.ts +4 -4
- package/src/prover/smt/solver/nlsat/algebraic.ts +194 -93
- 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 +379 -217
- package/src/prover/smt/solver/nlsat/interval-set.ts +0 -1
- package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
- package/src/prover/smt/solver/nlsat/mpbq.ts +0 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
- package/src/prover/smt/solver/nlsat/solver.ts +112 -99
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +2 -3
- package/src/prover/smt/solver/nlsat/transcendentals.ts +41 -19
- 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 +0 -1
- package/src/prover/smt/solver/nnf.ts +0 -1
- package/src/prover/smt/solver/normalize-bounds.ts +0 -1
- package/src/prover/smt/solver/occf.ts +0 -1
- package/src/prover/smt/solver/opt-context.ts +15 -10
- package/src/prover/smt/solver/opt-nlsat.ts +97 -77
- package/src/prover/smt/solver/opt-pareto.ts +0 -2
- package/src/prover/smt/solver/opt-preprocess.ts +0 -1
- package/src/prover/smt/solver/opt-solver.ts +22 -11
- package/src/prover/smt/solver/opt-value.ts +0 -1
- package/src/prover/smt/solver/optsmt.ts +13 -12
- package/src/prover/smt/solver/parallel-tactic.ts +0 -2
- package/src/prover/smt/solver/pattern-inference.ts +2 -3
- package/src/prover/smt/solver/pb-rewriter.ts +14 -20
- package/src/prover/smt/solver/pb2bv-tactic.ts +0 -2
- package/src/prover/smt/solver/poly-rewriter.ts +2 -3
- package/src/prover/smt/solver/probes.ts +4 -7
- package/src/prover/smt/solver/propagate-values.ts +4 -1
- package/src/prover/smt/solver/proto-model.ts +6 -7
- package/src/prover/smt/solver/pull-quant.ts +0 -1
- package/src/prover/smt/solver/purify-arith.ts +50 -16
- package/src/prover/smt/solver/qe-arith-plugin.ts +4 -7
- package/src/prover/smt/solver/qe-lite-der.ts +0 -1
- package/src/prover/smt/solver/qe-lite-fm.ts +0 -1
- package/src/prover/smt/solver/qe-lite.ts +0 -1
- package/src/prover/smt/solver/qe-mbp.ts +13 -24
- package/src/prover/smt/solver/qe.ts +48 -57
- package/src/prover/smt/solver/qel.ts +0 -1
- package/src/prover/smt/solver/qi-queue.ts +0 -1
- package/src/prover/smt/solver/qsat.ts +70 -91
- package/src/prover/smt/solver/quant-hoist.ts +0 -1
- package/src/prover/smt/solver/quant-tactics.ts +0 -1
- package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
- package/src/prover/smt/solver/quantifier-manager.ts +14 -10
- package/src/prover/smt/solver/quasi-macros.ts +9 -20
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +17 -1
- package/src/prover/smt/solver/recfun-decl-plugin.ts +35 -21
- package/src/prover/smt/solver/recfun-rewriter.ts +1 -2
- package/src/prover/smt/solver/reduce-args.ts +0 -1
- package/src/prover/smt/solver/reduce-bv-size.ts +0 -1
- package/src/prover/smt/solver/ref-vector.ts +0 -1
- package/src/prover/smt/solver/relevancy.ts +0 -1
- package/src/prover/smt/solver/rewriter-tpl.ts +6 -3
- package/src/prover/smt/solver/rewriter.ts +1 -2
- package/src/prover/smt/solver/rlimit.ts +13 -1
- package/src/prover/smt/solver/sat/asymm-branch.ts +59 -48
- package/src/prover/smt/solver/sat/big.ts +0 -1
- package/src/prover/smt/solver/sat/clause-use-list.ts +0 -8
- package/src/prover/smt/solver/sat/clause.ts +1 -6
- package/src/prover/smt/solver/sat/cleaner.ts +0 -2
- package/src/prover/smt/solver/sat/config.ts +4 -7
- package/src/prover/smt/solver/sat/consequences.ts +1 -2
- package/src/prover/smt/solver/sat/elim-eqs.ts +0 -2
- package/src/prover/smt/solver/sat/goal2sat.ts +1 -3
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +4 -13
- package/src/prover/smt/solver/sat/model-converter.ts +2 -18
- package/src/prover/smt/solver/sat/pb-constraint.ts +0 -3
- package/src/prover/smt/solver/sat/pb-solver.ts +50 -26
- package/src/prover/smt/solver/sat/probing.ts +22 -21
- package/src/prover/smt/solver/sat/sat-tactic.ts +2 -2
- package/src/prover/smt/solver/sat/sat2goal.ts +9 -12
- package/src/prover/smt/solver/sat/scc.ts +0 -1
- package/src/prover/smt/solver/sat/simplifier.ts +16 -60
- package/src/prover/smt/solver/sat/solver.ts +45 -68
- package/src/prover/smt/solver/sat/var-queue.ts +0 -2
- package/src/prover/smt/solver/sat/watch-list.ts +7 -3
- package/src/prover/smt/solver/search-tree.ts +0 -1
- package/src/prover/smt/solver/seq-axioms.ts +20 -36
- package/src/prover/smt/solver/seq-decl-plugin.ts +7 -8
- package/src/prover/smt/solver/seq-derive.ts +9 -15
- package/src/prover/smt/solver/seq-eq-approx.ts +0 -2
- package/src/prover/smt/solver/seq-eq-solver.ts +9 -10
- package/src/prover/smt/solver/seq-factory.ts +0 -1
- package/src/prover/smt/solver/seq-monadic.ts +7 -7
- package/src/prover/smt/solver/seq-range-predicate.ts +14 -3
- package/src/prover/smt/solver/seq-re-rewriter.ts +3 -12
- package/src/prover/smt/solver/seq-re-util.ts +2 -5
- package/src/prover/smt/solver/seq-regex-bisim.ts +2 -3
- package/src/prover/smt/solver/seq-regex-live.ts +6 -8
- package/src/prover/smt/solver/seq-rewriter.ts +31 -34
- package/src/prover/smt/solver/seq-skolem.ts +0 -24
- package/src/prover/smt/solver/seq-subset.ts +0 -1
- package/src/prover/smt/solver/seq-view-witness.ts +4 -6
- package/src/prover/smt/solver/smt-consequences.ts +0 -2
- package/src/prover/smt/solver/smt-kernel.ts +8 -3
- package/src/prover/smt/solver/smt-logics.ts +0 -1
- package/src/prover/smt/solver/smt-setup.ts +18 -14
- package/src/prover/smt/solver/smt2-printer.ts +0 -2
- package/src/prover/smt/solver/smtlib-parser.ts +1187 -592
- package/src/prover/smt/solver/smtlib-script.ts +957 -750
- package/src/prover/smt/solver/solve-eqs.ts +11 -19
- package/src/prover/smt/solver/solver.ts +1 -2
- package/src/prover/smt/solver/static-features.ts +0 -2
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +77 -18
- package/src/prover/smt/solver/term-enumeration.ts +0 -1
- package/src/prover/smt/solver/theory-array.ts +25 -60
- package/src/prover/smt/solver/theory-bv.ts +15 -54
- package/src/prover/smt/solver/theory-char.ts +0 -1
- package/src/prover/smt/solver/theory-datatype.ts +0 -1
- package/src/prover/smt/solver/theory-finite-set.ts +2 -2
- package/src/prover/smt/solver/theory-fpa.ts +46 -79
- package/src/prover/smt/solver/theory-lra-axioms.ts +0 -1
- package/src/prover/smt/solver/theory-lra-bounds.ts +0 -1
- package/src/prover/smt/solver/theory-lra-final-check.ts +0 -2
- package/src/prover/smt/solver/theory-lra-internalize.ts +8 -1
- package/src/prover/smt/solver/theory-lra-model.ts +0 -1
- package/src/prover/smt/solver/theory-lra-propagate.ts +0 -3
- package/src/prover/smt/solver/theory-lra-state.ts +0 -1
- package/src/prover/smt/solver/theory-lra.ts +0 -2
- package/src/prover/smt/solver/theory-pb.ts +12 -11
- package/src/prover/smt/solver/theory-polymorphism.ts +3 -4
- package/src/prover/smt/solver/theory-recfun.ts +2 -3
- package/src/prover/smt/solver/theory-seq-regex.ts +3 -7
- package/src/prover/smt/solver/theory-seq-solve.ts +6 -8
- package/src/prover/smt/solver/theory-seq-state.ts +8 -26
- package/src/prover/smt/solver/theory-seq.ts +32 -55
- package/src/prover/smt/solver/theory.ts +16 -2
- package/src/prover/smt/solver/tseitin-cnf.ts +3 -5
- package/src/prover/smt/solver/var-subst.ts +2 -3
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/zenon/decide.ts +9 -13
- 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 +12 -13
- package/src/prover/zenon/parse.ts +0 -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 +0 -2
- 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 +1 -3
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +0 -2
- package/src/resolve.ts +264 -77
- package/src/runtime.ts +6 -0
- package/src/sany/generation.ts +1 -13
- package/src/sany/generator-definitions.ts +2 -1
- package/src/sany/generator-expressions.ts +30 -27
- package/src/sany/generator-proofs.ts +1 -1
- package/src/sany/generator.ts +2 -1
- package/src/sany/levels.ts +0 -2
- package/src/sany/linter.ts +0 -2
- package/src/sany/nodes.ts +1 -1
- package/src/sany/selectors.ts +6 -5
- 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 +165 -78
- 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/smt/solver/seq-regex-witness.ts +0 -100
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/zenon/LICENSE +0 -32
|
@@ -1,4 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/ast/seq_decl_plugin.cpp, src/ast/char_decl_plugin.cpp), MIT license, see z3-license.txt.
|
|
2
1
|
import { SmtInvariantError } from "../../../errors";
|
|
3
2
|
import {
|
|
4
3
|
type AstManager,
|
|
@@ -444,13 +443,14 @@ const getEmptyReSignature = (
|
|
|
444
443
|
kind: number,
|
|
445
444
|
op: number,
|
|
446
445
|
reglanName: string,
|
|
446
|
+
domain: readonly number[],
|
|
447
447
|
range: number | undefined,
|
|
448
448
|
) => {
|
|
449
449
|
const reglan = manager.mkReSort(manager.mkStringSort());
|
|
450
450
|
const rng = range ?? reglan;
|
|
451
|
-
if (rng !== reglan) return mkSignature(op, getPsig(op).name,
|
|
452
|
-
const matched = match(manager, getPsig(kind),
|
|
453
|
-
return typeof matched === "string" ? matched : mkSignature(op, reglanName,
|
|
451
|
+
if (kind === op && rng !== reglan) return mkSignature(op, getPsig(op).name, domain, rng);
|
|
452
|
+
const matched = match(manager, getPsig(kind), domain, rng);
|
|
453
|
+
return typeof matched === "string" ? matched : mkSignature(op, reglanName, domain, matched);
|
|
454
454
|
};
|
|
455
455
|
|
|
456
456
|
const getCharSignature = (
|
|
@@ -570,10 +570,10 @@ export const getSeqSignature = (
|
|
|
570
570
|
}
|
|
571
571
|
case OP_INTERNAL_REGEXP_FULL_CHAR:
|
|
572
572
|
case OP_RE_FULL_CHAR_SET:
|
|
573
|
-
return getEmptyReSignature(manager, kind, OP_RE_FULL_CHAR_SET, "re.allchar", range);
|
|
573
|
+
return getEmptyReSignature(manager, kind, OP_RE_FULL_CHAR_SET, "re.allchar", domain, range);
|
|
574
574
|
case OP_INTERNAL_REGEXP_EMPTY:
|
|
575
575
|
case OP_RE_EMPTY_SET:
|
|
576
|
-
return getEmptyReSignature(manager, kind, OP_RE_EMPTY_SET, "re.none", range);
|
|
576
|
+
return getEmptyReSignature(manager, kind, OP_RE_EMPTY_SET, "re.none", domain, range);
|
|
577
577
|
case OP_RE_FULL_SEQ_SET:
|
|
578
578
|
return mkSignature(kind, "re.all", domain, range ?? manager.mkReSort(manager.mkStringSort()));
|
|
579
579
|
case OP_RE_LOOP: {
|
|
@@ -773,8 +773,7 @@ export const isBinaryApp = (manager: AstManager, expr: number, op: number) =>
|
|
|
773
773
|
|
|
774
774
|
export const getConcat = (manager: AstManager, expr: number, result: number[]) => {
|
|
775
775
|
const todo = [expr];
|
|
776
|
-
|
|
777
|
-
const current = todo.pop()!;
|
|
776
|
+
for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
|
|
778
777
|
if (isBinaryApp(manager, current, OP_SEQ_CONCAT)) {
|
|
779
778
|
todo.push(manager.getArg(current, 1), manager.getArg(current, 0));
|
|
780
779
|
continue;
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/ast/rewriter/seq_derive.cpp, src/ast/rewriter/bool_rewriter.cpp), MIT
|
|
2
|
-
// license, see z3-license.txt.
|
|
3
1
|
import { mkArrayApp } from "./array-decl-plugin";
|
|
4
2
|
import {
|
|
5
3
|
type AstManager,
|
|
@@ -65,7 +63,7 @@ import {
|
|
|
65
63
|
import { type ReRewriter, getResultExpr } from "./seq-re-rewriter";
|
|
66
64
|
|
|
67
65
|
export const DERIVATIVE_ANTIMIROV = 0;
|
|
68
|
-
|
|
66
|
+
const DERIVATIVE_BRZOZOWSKI = 1;
|
|
69
67
|
export const TRANSITION_BRZOZOWSKI = 0;
|
|
70
68
|
export const TRANSITION_LIGHT_ANTIMIROV = 1;
|
|
71
69
|
|
|
@@ -177,7 +175,8 @@ export class Derive {
|
|
|
177
175
|
}
|
|
178
176
|
|
|
179
177
|
private reset() {
|
|
180
|
-
|
|
178
|
+
// Deviation from Z3: the xor caches go too, as the trail was all that kept their results alive.
|
|
179
|
+
for (const cache of [...this.caches, ...this.topCaches, ...this.xorCaches]) cache.clear();
|
|
181
180
|
this.resetOpCaches();
|
|
182
181
|
this.trail.reset();
|
|
183
182
|
this.element = assign(this.manager, this.element, -1);
|
|
@@ -639,8 +638,7 @@ export class Derive {
|
|
|
639
638
|
if (isFullSeq(manager, first) || isFullSeq(manager, second)) return mkFullSeq(manager, sort);
|
|
640
639
|
const elements: number[] = [];
|
|
641
640
|
const todo = [second, first];
|
|
642
|
-
|
|
643
|
-
const expr = todo.pop()!;
|
|
641
|
+
for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
|
|
644
642
|
if (isReBinary(manager, expr, OP_RE_UNION)) {
|
|
645
643
|
todo.push(manager.getArg(expr, 1), manager.getArg(expr, 0));
|
|
646
644
|
continue;
|
|
@@ -1244,11 +1242,9 @@ export class Derive {
|
|
|
1244
1242
|
}
|
|
1245
1243
|
|
|
1246
1244
|
derivativeCofactors(regex: number, result: RefVector) {
|
|
1247
|
-
const
|
|
1248
|
-
|
|
1249
|
-
|
|
1250
|
-
const derivative = this.derive(DERIVATIVE_BRZOZOWSKI, element, regex);
|
|
1251
|
-
this.getCofactors(element, derivative, result);
|
|
1245
|
+
const derivative = this.deriveSymbolic(DERIVATIVE_BRZOZOWSKI, regex);
|
|
1246
|
+
// Like Z3, a cached derivative whose lookup reset the op caches leaves the element unset, which stops the interval pruning.
|
|
1247
|
+
this.getCofactors(this.element, derivative, result);
|
|
1252
1248
|
}
|
|
1253
1249
|
|
|
1254
1250
|
lightAntDerivativeCofactors(regex: number, result: RefVector) {
|
|
@@ -1271,8 +1267,7 @@ export class Derive {
|
|
|
1271
1267
|
for (let pair = 0; pair < brzozowski.size; pair += 2) {
|
|
1272
1268
|
const guard = brzozowski.items[pair];
|
|
1273
1269
|
const pending = [brzozowski.items[pair + 1]];
|
|
1274
|
-
|
|
1275
|
-
const target = pending.pop()!;
|
|
1270
|
+
for (let target = pending.pop(); target !== undefined; target = pending.pop()) {
|
|
1276
1271
|
if (isReBinary(manager, target, OP_RE_UNION)) {
|
|
1277
1272
|
pending.push(manager.getArg(target, 1), manager.getArg(target, 0));
|
|
1278
1273
|
continue;
|
|
@@ -1286,8 +1281,7 @@ export class Derive {
|
|
|
1286
1281
|
}
|
|
1287
1282
|
const tail = manager.getArg(target, 1);
|
|
1288
1283
|
const heads = [manager.getArg(target, 0)];
|
|
1289
|
-
|
|
1290
|
-
const current = heads.pop()!;
|
|
1284
|
+
for (let current = heads.pop(); current !== undefined; current = heads.pop()) {
|
|
1291
1285
|
if (isReBinary(manager, current, OP_RE_UNION))
|
|
1292
1286
|
heads.push(manager.getArg(current, 1), manager.getArg(current, 0));
|
|
1293
1287
|
else add(guard, this.re.mkReAppend(current, tail));
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/ast/seq/seq_eq_approx.cpp, src/ast/seq/seq_eq_approx.h), MIT license, see
|
|
2
|
-
// z3-license.txt.
|
|
3
1
|
import { type AstManager, OP_SEQ_CONCAT, OP_SEQ_UNIT } from "./ast";
|
|
4
2
|
import { GuardSet, GuardSetCache } from "./guard-set";
|
|
5
3
|
import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
|
|
@@ -1,4 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/ast/seq/seq_eq_solver.cpp), MIT license, see z3-license.txt.
|
|
2
1
|
import { SmtUnsupportedError } from "../../../errors";
|
|
3
2
|
import {
|
|
4
3
|
type AstManager,
|
|
@@ -28,7 +27,7 @@ export interface SeqLength {
|
|
|
28
27
|
value: Rational;
|
|
29
28
|
}
|
|
30
29
|
|
|
31
|
-
|
|
30
|
+
interface SeqEqSolverHost {
|
|
32
31
|
addConsequence(isUsingDeps: boolean, clause: number[]): void;
|
|
33
32
|
addSolution(variable: number, term: number): void;
|
|
34
33
|
expr2rep(expr: number): number;
|
|
@@ -42,7 +41,7 @@ export interface BinaryEq {
|
|
|
42
41
|
y: number;
|
|
43
42
|
}
|
|
44
43
|
|
|
45
|
-
|
|
44
|
+
interface TernaryEq {
|
|
46
45
|
x: number;
|
|
47
46
|
xs: number[];
|
|
48
47
|
y1: number;
|
|
@@ -311,7 +310,7 @@ export class SeqEqSolver {
|
|
|
311
310
|
}
|
|
312
311
|
|
|
313
312
|
private matchTernaryEqR(ls: readonly number[], rs: readonly number[]): TernaryEq | undefined {
|
|
314
|
-
if (ls.length <= 1 || rs.length <= 1 || !this.isVar(rs[0]) || !this.isVar(rs.
|
|
313
|
+
if (ls.length <= 1 || rs.length <= 1 || !this.isVar(rs[0]) || !this.isVar(rs[rs.length - 1]))
|
|
315
314
|
return undefined;
|
|
316
315
|
const numLsUnits = this.countUnitsR2l(ls, ls.length - 1);
|
|
317
316
|
if (numLsUnits === 0 || numLsUnits === ls.length) return undefined;
|
|
@@ -334,7 +333,7 @@ export class SeqEqSolver {
|
|
|
334
333
|
}
|
|
335
334
|
|
|
336
335
|
private matchTernaryEqL(ls: readonly number[], rs: readonly number[]): TernaryEq | undefined {
|
|
337
|
-
if (ls.length <= 1 || rs.length <= 1 || !this.isVar(rs[0]) || !this.isVar(rs.
|
|
336
|
+
if (ls.length <= 1 || rs.length <= 1 || !this.isVar(rs[0]) || !this.isVar(rs[rs.length - 1]))
|
|
338
337
|
return undefined;
|
|
339
338
|
const numLsUnits = this.countUnitsL2r(ls, 0);
|
|
340
339
|
if (numLsUnits === 0 || numLsUnits === ls.length) return undefined;
|
|
@@ -360,11 +359,11 @@ export class SeqEqSolver {
|
|
|
360
359
|
ls.length > 1 &&
|
|
361
360
|
this.isVar(ls[0]) &&
|
|
362
361
|
rs.length > 1 &&
|
|
363
|
-
this.isVar(rs.
|
|
362
|
+
this.isVar(rs[rs.length - 1]) &&
|
|
364
363
|
ls.slice(1).every((expr) => this.isUnit(expr)) &&
|
|
365
364
|
rs.slice(0, -1).every((expr) => this.isUnit(expr))
|
|
366
365
|
)
|
|
367
|
-
return { x: ls[0], y: rs.
|
|
366
|
+
return { x: ls[0], y: rs[rs.length - 1], xs: ls.slice(1), ys: rs.slice(0, -1) };
|
|
368
367
|
return undefined;
|
|
369
368
|
}
|
|
370
369
|
|
|
@@ -380,10 +379,10 @@ export class SeqEqSolver {
|
|
|
380
379
|
if (
|
|
381
380
|
ls.length <= 1 ||
|
|
382
381
|
!this.isVar(ls[0]) ||
|
|
383
|
-
!this.isVar(ls.
|
|
382
|
+
!this.isVar(ls[ls.length - 1]) ||
|
|
384
383
|
rs.length <= 1 ||
|
|
385
384
|
!this.isVar(rs[0]) ||
|
|
386
|
-
!this.isVar(rs.
|
|
385
|
+
!this.isVar(rs[rs.length - 1])
|
|
387
386
|
)
|
|
388
387
|
return undefined;
|
|
389
388
|
const lsNonUnit = this.countNonUnitsL2r(ls, 0);
|
|
@@ -404,7 +403,7 @@ export class SeqEqSolver {
|
|
|
404
403
|
|
|
405
404
|
canAlignFromLhs(ls: readonly number[], rs: readonly number[]) {
|
|
406
405
|
const manager = this.manager;
|
|
407
|
-
const last = rs.
|
|
406
|
+
const last = rs[rs.length - 1];
|
|
408
407
|
for (let index = 0; index < ls.length; index++) {
|
|
409
408
|
if (manager.areDistinct(ls[index], last)) continue;
|
|
410
409
|
if (index === 0) return true;
|
|
@@ -1,4 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/model/seq_factory.h, src/model/char_factory.h), MIT license, see z3-license.txt.
|
|
2
1
|
import { SmtUnsupportedError } from "../../../errors";
|
|
3
2
|
import { type AstManager, OP_SEQ_TO_RE, OP_SEQ_UNIT } from "./ast";
|
|
4
3
|
import { mkConcatOf, mkSeqApp } from "./seq-decl-plugin";
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/ast/seq/seq_monadic.cpp, src/ast/seq/seq_monadic.h), MIT license, see
|
|
2
|
-
// z3-license.txt.
|
|
3
1
|
import {
|
|
4
2
|
type AstManager,
|
|
5
3
|
KIND_APP,
|
|
@@ -37,15 +35,15 @@ import {
|
|
|
37
35
|
ViewWitness,
|
|
38
36
|
} from "./seq-view-witness";
|
|
39
37
|
|
|
40
|
-
|
|
41
|
-
|
|
38
|
+
const ORIENTATION_FORWARD = 0;
|
|
39
|
+
const ORIENTATION_REVERSED = 1;
|
|
42
40
|
export const ORIENTATION_RETRY = 2;
|
|
43
41
|
|
|
44
42
|
const LIVE_STATE_CAP = 1 << 12;
|
|
45
43
|
const COFACTOR_CACHE_CAP = 1 << 16;
|
|
46
44
|
const LENGTH_CONSTRAINING_KEY = 2 ** 40;
|
|
47
45
|
|
|
48
|
-
|
|
46
|
+
interface Memberships {
|
|
49
47
|
terms: number[];
|
|
50
48
|
regexes: number[];
|
|
51
49
|
deps: number[];
|
|
@@ -135,8 +133,10 @@ export class Monadic {
|
|
|
135
133
|
this.pins.push(regex);
|
|
136
134
|
this.pins.push(element);
|
|
137
135
|
this.pins.pushOwned(derivative);
|
|
138
|
-
|
|
139
|
-
|
|
136
|
+
const derivatives = this.derivativeCache.get(regex);
|
|
137
|
+
if (derivatives === undefined)
|
|
138
|
+
this.derivativeCache.set(regex, new Map([[element, derivative]]));
|
|
139
|
+
else derivatives.set(element, derivative);
|
|
140
140
|
return derivative;
|
|
141
141
|
}
|
|
142
142
|
|
|
@@ -1,7 +1,6 @@
|
|
|
1
|
-
// Ported from Z3 (src/ast/rewriter/seq_range_predicate.cpp,
|
|
2
|
-
// src/ast/rewriter/seq_range_collapse.cpp), MIT license, see z3-license.txt.
|
|
3
1
|
import {
|
|
4
2
|
type AstManager,
|
|
3
|
+
FAMILY_CHAR,
|
|
5
4
|
OP_AND,
|
|
6
5
|
OP_CHAR_LE,
|
|
7
6
|
OP_EQ,
|
|
@@ -10,6 +9,7 @@ import {
|
|
|
10
9
|
OP_RE_COMPLEMENT,
|
|
11
10
|
OP_RE_DIFF,
|
|
12
11
|
OP_RE_INTERSECT,
|
|
12
|
+
OP_RE_OF_PRED,
|
|
13
13
|
OP_SEQ_UNIT,
|
|
14
14
|
OP_RE_RANGE,
|
|
15
15
|
OP_RE_UNION,
|
|
@@ -202,7 +202,18 @@ export const regexToRangePredicate = (
|
|
|
202
202
|
const pair = getPair(first, second);
|
|
203
203
|
return pair === undefined ? undefined : intersectRanges(pair[0], pair[1]);
|
|
204
204
|
}
|
|
205
|
-
|
|
205
|
+
if (!isReUnary(manager, regex, OP_RE_OF_PRED) || !manager.isLambda(manager.getArg(regex, 0)))
|
|
206
|
+
return undefined;
|
|
207
|
+
const lambda = manager.getQuantifier(manager.getArg(regex, 0));
|
|
208
|
+
if (lambda.sorts.length !== 1) return undefined;
|
|
209
|
+
const variable = manager.mkVar(0, lambda.sorts[0]);
|
|
210
|
+
manager.incRef(variable);
|
|
211
|
+
const ranges =
|
|
212
|
+
manager.getSortFamily(lambda.sorts[0]) === FAMILY_CHAR
|
|
213
|
+
? guardToRangePredicate(manager, variable, lambda.body)
|
|
214
|
+
: undefined;
|
|
215
|
+
manager.decRef(variable);
|
|
216
|
+
return ranges;
|
|
206
217
|
};
|
|
207
218
|
|
|
208
219
|
export const rangePredicateToRegex = (
|
|
@@ -1,4 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/ast/rewriter/seq_rewriter.cpp), MIT license, see z3-license.txt.
|
|
2
1
|
import { SmtInvariantError } from "../../../errors";
|
|
3
2
|
import {
|
|
4
3
|
type AstManager,
|
|
@@ -50,7 +49,6 @@ import {
|
|
|
50
49
|
uniteRanges,
|
|
51
50
|
} from "./seq-range-predicate";
|
|
52
51
|
import { RegexBisim } from "./seq-regex-bisim";
|
|
53
|
-
import { RegexWitness } from "./seq-regex-witness";
|
|
54
52
|
import {
|
|
55
53
|
UINT_MAX,
|
|
56
54
|
canBeMember,
|
|
@@ -486,7 +484,8 @@ export class ReRewriter {
|
|
|
486
484
|
left === right ? 0 : getId(left) < getId(right) ? -1 : 1;
|
|
487
485
|
const composeResult = (suffix: number) => {
|
|
488
486
|
let result = suffix;
|
|
489
|
-
|
|
487
|
+
for (let regex = prefix.pop(); regex !== undefined; regex = prefix.pop())
|
|
488
|
+
result = compose(regex, result);
|
|
490
489
|
return result;
|
|
491
490
|
};
|
|
492
491
|
let left = first;
|
|
@@ -771,8 +770,7 @@ export class ReRewriter {
|
|
|
771
770
|
};
|
|
772
771
|
const isEveryInterArmEndingWithFullSeq = (regex: number) => {
|
|
773
772
|
const todo = [regex];
|
|
774
|
-
|
|
775
|
-
const current = todo.pop()!;
|
|
773
|
+
for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
|
|
776
774
|
const split = this.getSplit(current, OP_RE_INTERSECT);
|
|
777
775
|
if (split !== undefined) todo.push(split.head, split.tail);
|
|
778
776
|
else if (!isEndingWithFullSeq(current)) return false;
|
|
@@ -1170,11 +1168,4 @@ export class ReRewriter {
|
|
|
1170
1168
|
? manager.falseExpr
|
|
1171
1169
|
: undefined;
|
|
1172
1170
|
}
|
|
1173
|
-
|
|
1174
|
-
someStringInRe(regex: number) {
|
|
1175
|
-
const witness = new RegexWitness(this.manager, this);
|
|
1176
|
-
const result = witness.getWitness(regex);
|
|
1177
|
-
witness.release();
|
|
1178
|
-
return result;
|
|
1179
|
-
}
|
|
1180
1171
|
}
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/ast/seq_decl_plugin.cpp, src/ast/char_decl_plugin.cpp,
|
|
2
|
-
// src/util/len_abs.cpp), MIT license, see z3-license.txt.
|
|
3
1
|
import { SmtUnsupportedError } from "../../../errors";
|
|
4
2
|
import {
|
|
5
3
|
type AstManager,
|
|
@@ -59,7 +57,7 @@ export interface LenAbs {
|
|
|
59
57
|
residues: bigint;
|
|
60
58
|
}
|
|
61
59
|
|
|
62
|
-
|
|
60
|
+
interface ReInfo extends LenAbs {
|
|
63
61
|
isKnown: boolean;
|
|
64
62
|
isInterpreted: boolean;
|
|
65
63
|
nullable: number;
|
|
@@ -651,8 +649,7 @@ const getLengthShape = (manager: AstManager, seq: number) => {
|
|
|
651
649
|
let stride = 0;
|
|
652
650
|
const multiplicities = new Map<number, number>();
|
|
653
651
|
const todo = [seq];
|
|
654
|
-
|
|
655
|
-
const expr = todo.pop()!;
|
|
652
|
+
for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
|
|
656
653
|
if (isBinaryApp(manager, expr, OP_SEQ_CONCAT)) {
|
|
657
654
|
todo.push(manager.getArg(expr, 0), manager.getArg(expr, 1));
|
|
658
655
|
continue;
|
|
@@ -1,4 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/ast/rewriter/seq_regex_bisim.cpp), MIT license, see z3-license.txt.
|
|
2
1
|
import { type AstManager, OP_RE_XOR } from "./ast";
|
|
3
2
|
import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
|
|
4
3
|
import { RefVector } from "./ref-vector";
|
|
@@ -59,7 +58,7 @@ export class RegexBisim {
|
|
|
59
58
|
return (
|
|
60
59
|
manager.isReSort(manager.sorts[regex]) &&
|
|
61
60
|
this.info.getInfo(regex).isKnown &&
|
|
62
|
-
manager.
|
|
61
|
+
manager.isGroundApp(regex)
|
|
63
62
|
);
|
|
64
63
|
}
|
|
65
64
|
|
|
@@ -118,7 +117,7 @@ export class RegexBisim {
|
|
|
118
117
|
this.worklist.pop();
|
|
119
118
|
const cofactors = new RefVector(manager);
|
|
120
119
|
derive.derivativeCofactors(regex, cofactors);
|
|
121
|
-
const leaves = cofactors.items.filter((
|
|
120
|
+
const leaves = cofactors.items.filter((_value, index) => index % 2 === 1);
|
|
122
121
|
const status = this.areLeavesEquivalent(leaves);
|
|
123
122
|
if (status === L_TRUE)
|
|
124
123
|
for (const leaf of leaves) {
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/ast/seq/seq_regex_live.cpp, src/ast/seq/seq_regex_live.h), MIT license, see
|
|
2
|
-
// z3-license.txt.
|
|
3
1
|
import type { AstManager } from "./ast";
|
|
4
2
|
import { L_FALSE, L_TRUE } from "./lbool";
|
|
5
3
|
import { RefVector } from "./ref-vector";
|
|
@@ -7,8 +5,8 @@ import type { ReRewriter } from "./seq-re-rewriter";
|
|
|
7
5
|
import { isReEmpty } from "./seq-re-util";
|
|
8
6
|
|
|
9
7
|
export const LIVE_FAILURE_NONE = 0;
|
|
10
|
-
|
|
11
|
-
|
|
8
|
+
const LIVE_FAILURE_STATE_CAP = 1;
|
|
9
|
+
const LIVE_FAILURE_RESOURCE = 2;
|
|
12
10
|
|
|
13
11
|
const NULLABLE_UNKNOWN = 2;
|
|
14
12
|
const NULLABLE_UNDEF = 3;
|
|
@@ -76,8 +74,7 @@ export class LiveStates {
|
|
|
76
74
|
|
|
77
75
|
private markLive(search: LiveSearch, start: number) {
|
|
78
76
|
const todo = [start];
|
|
79
|
-
|
|
80
|
-
const id = todo.pop()!;
|
|
77
|
+
for (let id = todo.pop(); id !== undefined; id = todo.pop()) {
|
|
81
78
|
if (!search.seen.has(id) || search.live[id]) continue;
|
|
82
79
|
search.live[id] = true;
|
|
83
80
|
search.liveFrontier.push(id);
|
|
@@ -175,8 +172,9 @@ export class LiveStates {
|
|
|
175
172
|
if (target === -1) this.membershipSearches.set(state, search);
|
|
176
173
|
else {
|
|
177
174
|
search.targetId = this.intern(target);
|
|
178
|
-
|
|
179
|
-
this.reachSearches.
|
|
175
|
+
const searches = this.reachSearches.get(state);
|
|
176
|
+
if (searches === undefined) this.reachSearches.set(state, new Map([[target, search]]));
|
|
177
|
+
else searches.set(target, search);
|
|
180
178
|
}
|
|
181
179
|
this.addState(search, search.rootId);
|
|
182
180
|
return search;
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/ast/rewriter/seq_rewriter.cpp, src/ast/rewriter/char_rewriter.cpp), MIT
|
|
2
|
-
// license, see z3-license.txt.
|
|
3
1
|
import { mkArrayApp } from "./array-decl-plugin";
|
|
4
2
|
import {
|
|
5
3
|
type AstManager,
|
|
@@ -71,6 +69,7 @@ import {
|
|
|
71
69
|
import { mkBvApp } from "./bv-decl-plugin";
|
|
72
70
|
import { getCompositeHash } from "./hash";
|
|
73
71
|
import { ObjMap } from "./hashtable";
|
|
72
|
+
import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
|
|
74
73
|
import type { Rewrite } from "./rewriter-tpl";
|
|
75
74
|
import {
|
|
76
75
|
getConcat,
|
|
@@ -99,10 +98,6 @@ const SIGN_ZERO = 0;
|
|
|
99
98
|
const SIGN_POS = 1;
|
|
100
99
|
const SIGN_NEG = 2;
|
|
101
100
|
|
|
102
|
-
const L_FALSE = -1;
|
|
103
|
-
const L_UNDEF = 0;
|
|
104
|
-
const L_TRUE = 1;
|
|
105
|
-
|
|
106
101
|
const NON_LIFTING_OPS = new Set([
|
|
107
102
|
OP_SEQ_EMPTY,
|
|
108
103
|
OP_RE_EMPTY_SET,
|
|
@@ -504,8 +499,7 @@ export class SeqRewriter {
|
|
|
504
499
|
return manager.mkString([...firstChars, ...secondChars]);
|
|
505
500
|
const elements: number[] = [];
|
|
506
501
|
const todo = [second, first];
|
|
507
|
-
|
|
508
|
-
const expr = todo.pop()!;
|
|
502
|
+
for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
|
|
509
503
|
if (this.isConcat2(expr)) {
|
|
510
504
|
todo.push(this.getArg(expr, 1), this.getArg(expr, 0));
|
|
511
505
|
continue;
|
|
@@ -515,7 +509,8 @@ export class SeqRewriter {
|
|
|
515
509
|
if (elements.length === 0) return this.mkEmpty(manager.sorts[first]);
|
|
516
510
|
const coalesced: number[] = [];
|
|
517
511
|
for (const element of elements) {
|
|
518
|
-
const previous =
|
|
512
|
+
const previous =
|
|
513
|
+
coalesced.length > 0 ? manager.getString(coalesced[coalesced.length - 1]) : undefined;
|
|
519
514
|
const chars = manager.getString(element);
|
|
520
515
|
if (this.isCoalescingChars && previous !== undefined && chars !== undefined)
|
|
521
516
|
coalesced[coalesced.length - 1] = manager.mkString([...previous, ...chars]);
|
|
@@ -523,7 +518,10 @@ export class SeqRewriter {
|
|
|
523
518
|
}
|
|
524
519
|
return coalesced
|
|
525
520
|
.slice(0, -1)
|
|
526
|
-
.reduceRight(
|
|
521
|
+
.reduceRight(
|
|
522
|
+
(tail, element) => this.mkConcat(element, tail),
|
|
523
|
+
coalesced[coalesced.length - 1],
|
|
524
|
+
);
|
|
527
525
|
}
|
|
528
526
|
|
|
529
527
|
private mkSeqLength(seq: number): Result {
|
|
@@ -770,8 +768,7 @@ export class SeqRewriter {
|
|
|
770
768
|
let isOtherFactorAtLeastOne = true;
|
|
771
769
|
const todo = [offset];
|
|
772
770
|
const visited = new Set<number>();
|
|
773
|
-
|
|
774
|
-
const arg = todo.pop()!;
|
|
771
|
+
for (let arg = todo.pop(); arg !== undefined; arg = todo.pop()) {
|
|
775
772
|
if (visited.has(arg)) continue;
|
|
776
773
|
visited.add(arg);
|
|
777
774
|
if (this.isOp(arg, OP_MUL)) todo.push(...manager.getArgs(arg));
|
|
@@ -961,7 +958,7 @@ export class SeqRewriter {
|
|
|
961
958
|
let start = 0;
|
|
962
959
|
let end = seqUnits.length;
|
|
963
960
|
const first = otherUnits[0];
|
|
964
|
-
const last = otherUnits.
|
|
961
|
+
const last = otherUnits[otherUnits.length - 1];
|
|
965
962
|
while (start < seqUnits.length && this.isNotContainingPrefix(seqUnits[start], first)) start++;
|
|
966
963
|
while (end > start && this.isNotContainingSuffix(seqUnits[end - 1], last)) end--;
|
|
967
964
|
if (start === end) return rewrite(this.mkIsEmpty(other), BR_REWRITE2);
|
|
@@ -1706,7 +1703,7 @@ export class SeqRewriter {
|
|
|
1706
1703
|
const seq = this.getArg(value, 0);
|
|
1707
1704
|
const maxLength = this.getMaxLength(seq);
|
|
1708
1705
|
if (!maxLength.isBounded || maxLength.length > 1n) return undefined;
|
|
1709
|
-
const eqs = Array.from({ length: 10 }, (
|
|
1706
|
+
const eqs = Array.from({ length: 10 }, (_value, digit) =>
|
|
1710
1707
|
this.mkEq(seq, manager.mkString([48 + digit])),
|
|
1711
1708
|
);
|
|
1712
1709
|
const isDigitString = manager.mkApp(OP_OR, eqs, SORT_BOOL);
|
|
@@ -1743,8 +1740,8 @@ export class SeqRewriter {
|
|
|
1743
1740
|
}
|
|
1744
1741
|
const units = getConcatUnits(manager, seq, []);
|
|
1745
1742
|
if (units.length === 0) return this.minusOne();
|
|
1746
|
-
if (this.isUnit(units.
|
|
1747
|
-
const tail = this.mkSeq(OP_STRING_STOI, [units.
|
|
1743
|
+
if (this.isUnit(units[units.length - 1])) {
|
|
1744
|
+
const tail = this.mkSeq(OP_STRING_STOI, [units[units.length - 1]]);
|
|
1748
1745
|
const head = this.mkConcatOf(units.slice(0, -1), manager.sorts[seq]);
|
|
1749
1746
|
const headValue = this.mkSeq(OP_STRING_STOI, [head]);
|
|
1750
1747
|
const isHeadValid = this.mkGe(headValue, this.zero());
|
|
@@ -1794,24 +1791,20 @@ export class SeqRewriter {
|
|
|
1794
1791
|
if (isVisited) cache.set(expr, { isBounded: isValid, length: count });
|
|
1795
1792
|
return isVisited;
|
|
1796
1793
|
} else if (this.isOp(expr, OP_ITE)) {
|
|
1797
|
-
const size = pending.length;
|
|
1798
1794
|
const thenLength = cache.get(this.getArg(expr, 1));
|
|
1799
1795
|
const elseLength = cache.get(this.getArg(expr, 2));
|
|
1800
1796
|
if (thenLength === undefined) pending.push(this.getArg(expr, 1));
|
|
1801
1797
|
if (elseLength === undefined) pending.push(this.getArg(expr, 2));
|
|
1802
|
-
if (
|
|
1798
|
+
if (thenLength === undefined || elseLength === undefined) return false;
|
|
1803
1799
|
cache.set(expr, {
|
|
1804
1800
|
isBounded:
|
|
1805
|
-
thenLength
|
|
1806
|
-
|
|
1807
|
-
thenLength!.length === elseLength!.length,
|
|
1808
|
-
length: Math.min(thenLength!.length, elseLength!.length),
|
|
1801
|
+
thenLength.isBounded && elseLength.isBounded && thenLength.length === elseLength.length,
|
|
1802
|
+
length: Math.min(thenLength.length, elseLength.length),
|
|
1809
1803
|
});
|
|
1810
1804
|
} else cache.set(expr, { isBounded: false, length: 0 });
|
|
1811
1805
|
return true;
|
|
1812
1806
|
};
|
|
1813
|
-
|
|
1814
|
-
const expr = todo.pop()!;
|
|
1807
|
+
for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
|
|
1815
1808
|
const chars = manager.getString(expr);
|
|
1816
1809
|
if (this.isUnit(expr)) length++;
|
|
1817
1810
|
else if (this.isEmpty(expr)) continue;
|
|
@@ -1821,7 +1814,7 @@ export class SeqRewriter {
|
|
|
1821
1814
|
const thenExpr = this.getArg(expr, 1);
|
|
1822
1815
|
const elseExpr = this.getArg(expr, 2);
|
|
1823
1816
|
pending.push(thenExpr, elseExpr);
|
|
1824
|
-
while (pending.length > 0) if (visit(pending.
|
|
1817
|
+
while (pending.length > 0) if (visit(pending[pending.length - 1])) pending.pop();
|
|
1825
1818
|
const thenLength = cache.get(thenExpr) ?? { isBounded: false, length: 0 };
|
|
1826
1819
|
const elseLength = cache.get(elseExpr) ?? { isBounded: false, length: 0 };
|
|
1827
1820
|
if (
|
|
@@ -1840,8 +1833,7 @@ export class SeqRewriter {
|
|
|
1840
1833
|
const manager = this.manager;
|
|
1841
1834
|
const todo = [seq];
|
|
1842
1835
|
let length = 0n;
|
|
1843
|
-
|
|
1844
|
-
const expr = todo.pop()!;
|
|
1836
|
+
for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
|
|
1845
1837
|
const chars = manager.getString(expr);
|
|
1846
1838
|
if (this.isUnit(expr) || this.isApp(expr, OP_SEQ_AT, 2)) length += 1n;
|
|
1847
1839
|
else if (chars !== undefined) length += BigInt(chars.length);
|
|
@@ -2041,8 +2033,7 @@ export class SeqRewriter {
|
|
|
2041
2033
|
const manager = this.manager;
|
|
2042
2034
|
const elements: number[] = [];
|
|
2043
2035
|
const todo = [seq];
|
|
2044
|
-
|
|
2045
|
-
const expr = todo.pop()!;
|
|
2036
|
+
for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
|
|
2046
2037
|
if (this.isOp(expr, OP_SEQ_CONCAT)) {
|
|
2047
2038
|
todo.push(...manager.getArgs(expr));
|
|
2048
2039
|
continue;
|
|
@@ -2118,10 +2109,13 @@ export class SeqRewriter {
|
|
|
2118
2109
|
private reduceBack(pair: SeqPair, eqs: EqPair[]) {
|
|
2119
2110
|
const manager = this.manager;
|
|
2120
2111
|
while (pair.left.length > 0 && pair.right.length > 0) {
|
|
2121
|
-
if (
|
|
2112
|
+
if (
|
|
2113
|
+
this.isUnit(pair.right[pair.right.length - 1]) &&
|
|
2114
|
+
manager.getString(pair.left[pair.left.length - 1]) !== undefined
|
|
2115
|
+
)
|
|
2122
2116
|
this.swap(pair);
|
|
2123
|
-
const left = pair.left.
|
|
2124
|
-
const right = pair.right.
|
|
2117
|
+
const left = pair.left[pair.left.length - 1];
|
|
2118
|
+
const right = pair.right[pair.right.length - 1];
|
|
2125
2119
|
const rightChars = manager.getString(right);
|
|
2126
2120
|
const leftChars = manager.getString(left);
|
|
2127
2121
|
if (left === right) {
|
|
@@ -2133,7 +2127,10 @@ export class SeqRewriter {
|
|
|
2133
2127
|
pair.left.pop();
|
|
2134
2128
|
pair.right.pop();
|
|
2135
2129
|
} else if (this.isUnit(left) && rightChars !== undefined) {
|
|
2136
|
-
eqs.push({
|
|
2130
|
+
eqs.push({
|
|
2131
|
+
left: manager.mkChar(rightChars[rightChars.length - 1]),
|
|
2132
|
+
right: this.getArg(left, 0),
|
|
2133
|
+
});
|
|
2137
2134
|
pair.left.pop();
|
|
2138
2135
|
if (rightChars.length === 1) pair.right.pop();
|
|
2139
2136
|
else pair.right[pair.right.length - 1] = manager.mkString(rightChars.slice(0, -1));
|
|
@@ -2234,7 +2231,7 @@ export class SeqRewriter {
|
|
|
2234
2231
|
for (const expr of right) {
|
|
2235
2232
|
const index = remaining.indexOf(expr);
|
|
2236
2233
|
if (index !== -1) {
|
|
2237
|
-
remaining[index] = remaining.
|
|
2234
|
+
remaining[index] = remaining[remaining.length - 1];
|
|
2238
2235
|
remaining.pop();
|
|
2239
2236
|
continue;
|
|
2240
2237
|
}
|
|
@@ -1,4 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/ast/seq/seq_skolem.cpp, src/ast/seq/seq_skolem.h), MIT license, see z3-license.txt.
|
|
2
1
|
import {
|
|
3
2
|
type AstManager,
|
|
4
3
|
OP_SEQ_CONCAT,
|
|
@@ -49,10 +48,6 @@ export class SeqSkolem {
|
|
|
49
48
|
return this.manager.mkNumeral(BigInt(value));
|
|
50
49
|
}
|
|
51
50
|
|
|
52
|
-
mkAlign(args: number[]) {
|
|
53
|
-
return this.mk("seq.align", args);
|
|
54
|
-
}
|
|
55
|
-
|
|
56
51
|
mkAlignL(args: number[]) {
|
|
57
52
|
return this.mk("seq.align.l", args);
|
|
58
53
|
}
|
|
@@ -202,12 +197,6 @@ export class SeqSkolem {
|
|
|
202
197
|
return this.isNamed(expr, TAIL);
|
|
203
198
|
}
|
|
204
199
|
|
|
205
|
-
getTailIndex(expr: number) {
|
|
206
|
-
if (!this.isTail(expr)) return undefined;
|
|
207
|
-
const index = this.manager.getNumeral(this.manager.getArg(expr, 1));
|
|
208
|
-
return index !== undefined && index >= 0n && index <= 0xffffffffn ? Number(index) : undefined;
|
|
209
|
-
}
|
|
210
|
-
|
|
211
200
|
isSeqFirst(expr: number) {
|
|
212
201
|
return this.isNamed(expr, SEQ_FIRST);
|
|
213
202
|
}
|
|
@@ -232,10 +221,6 @@ export class SeqSkolem {
|
|
|
232
221
|
return this.isNamed(expr, EQ) && this.manager.getNumArgs(expr) === 2;
|
|
233
222
|
}
|
|
234
223
|
|
|
235
|
-
isDigit(expr: number) {
|
|
236
|
-
return this.isNamed(expr, "seq.is_digit");
|
|
237
|
-
}
|
|
238
|
-
|
|
239
224
|
isMaxUnfolding(expr: number) {
|
|
240
225
|
return this.isNamed(expr, MAX_UNFOLDING);
|
|
241
226
|
}
|
|
@@ -258,15 +243,6 @@ export class SeqSkolem {
|
|
|
258
243
|
return this.isNamed(expr, "seq.align.r");
|
|
259
244
|
}
|
|
260
245
|
|
|
261
|
-
isRegexSkolem(expr: number) {
|
|
262
|
-
return (
|
|
263
|
-
this.isNamed(expr, ACCEPT) ||
|
|
264
|
-
this.isNamed(expr, "re.is_empty") ||
|
|
265
|
-
this.isNamed(expr, "re.is_non_empty") ||
|
|
266
|
-
this.isNamed(expr, "aut.step")
|
|
267
|
-
);
|
|
268
|
-
}
|
|
269
|
-
|
|
270
246
|
decompose(input: number): Decomposition {
|
|
271
247
|
const manager = this.manager;
|
|
272
248
|
const mkNthUnit = (seq: number, index: number | bigint) =>
|