Benchmark
non-incremental/QF_UFBV/20210312-Bouvier/vlsat3_j56.smt2
Publications:
[1] Pierre Bouvier, Hubert Garavel, and Hernan Ponce de Leon.
"Automatic Decomposition of Petri Nets into Automata Networks -
A Synthetic Account". Proceedings PETRI NETS 2020, LNCS 12152,
Springer. https://doi.org/10.1007/978-3-030-51831-8_1
[2] Hubert Garavel. "Nested-Unit Petri Nets". Journal of Logical
and Algebraic Methods in Programming, vol. 104, Elsevier, 2019.
https://doi.org/10.1016/j.jlamp.2018.11.005
In [1], several methods for decomposing an ordinary, safe Petri net
into a flat, unit-safe NUPN [2], have been proposed. These methods
are implemented in a complete tool chain involving SAT solvers, SMT
solvers, and tools for graph coloring and finding maximal cliques.
From a data set of 12,000+ NUPN models, 51,000+ SMT formulas have
been generated, out of which a subset of 1200 interesting formulas
to be used as SMT-LIB 2.6 benchmarks was carefully selected.
Original filename: vlsat3_j56.smt2
Specific parameters for the present benchmark:
- number of places: 581
- number of units: 63
- number of edges in the concurrency graph: 81537
- number of variables: 0
- number of uninterpreted functions: 1
- number of asserts: 82118
- total number of operators in asserts: 573207
| Benchmark |
|---|
| Size | 9932079 |
| Compressed Size | 547284 |
| License |
Creative Commons Attribution 4.0 International
(CC-BY-4.0)
|
| Category | industrial |
| First Occurrence | 2021-07-18 |
| Generated By | Pierre Bouvier |
| Generated On | 2021-03-12 00:00:00 |
| Generator | — |
| Dolmen OK | 1 |
| strict Dolmen OK | 1 |
| check-sat calls | 1 |
| Status | sat |
| Inferred Status | None |
| Size | 9932071 |
| Compressed Size | 547294 |
| Max. Term Depth | 3 |
| Asserts | 82118 |
| Declared Functions | 1 |
| Declared Constants | 0 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
= | 81537 |
distinct | 581 |
bvand | 81599 |
| |