About the Execution of ITS-Tools for DoubleExponent-PT-004
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1327.640 | 486334.00 | 599308.00 | 6964.20 | TTFTTFFTFFFFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r098-tall-177955695800875.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is DoubleExponent-PT-004, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695800875
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 7.8K Mar 6 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Mar 6 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 6 16:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 6 16:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 17 09:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 17 09:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 17 09:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 17 09:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Mar 6 16:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Mar 6 16:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 6 16:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Mar 6 16:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 17 09:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 17 09:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 67K Mar 3 18:30 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DoubleExponent-PT-004-LTLCardinality-00
FORMULA_NAME DoubleExponent-PT-004-LTLCardinality-01
FORMULA_NAME DoubleExponent-PT-004-LTLCardinality-02
FORMULA_NAME DoubleExponent-PT-004-LTLCardinality-03
FORMULA_NAME DoubleExponent-PT-004-LTLCardinality-04
FORMULA_NAME DoubleExponent-PT-004-LTLCardinality-05
FORMULA_NAME DoubleExponent-PT-004-LTLCardinality-06
FORMULA_NAME DoubleExponent-PT-004-LTLCardinality-07
FORMULA_NAME DoubleExponent-PT-004-LTLCardinality-08
FORMULA_NAME DoubleExponent-PT-004-LTLCardinality-09
FORMULA_NAME DoubleExponent-PT-004-LTLCardinality-10
FORMULA_NAME DoubleExponent-PT-004-LTLCardinality-11
FORMULA_NAME DoubleExponent-PT-004-LTLCardinality-12
FORMULA_NAME DoubleExponent-PT-004-LTLCardinality-13
FORMULA_NAME DoubleExponent-PT-004-LTLCardinality-14
FORMULA_NAME DoubleExponent-PT-004-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1779677460881
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-004
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 02:51:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 02:51:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 02:51:02] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2026-05-25 02:51:02] [INFO ] Transformed 216 places.
[2026-05-25 02:51:02] [INFO ] Transformed 198 transitions.
[2026-05-25 02:51:02] [INFO ] Parsed PT model containing 216 places and 198 transitions and 558 arcs in 148 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DoubleExponent-PT-004-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 198/198 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 214 transition count 198
Applied a total of 2 rules in 40 ms. Remains 214 /216 variables (removed 2) and now considering 198/198 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14651623364689734191.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3920826852241019441.kers'
[2026-05-25 02:51:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14651623364689734191.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3920826852241019441.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 198 rows 214 cols 556 entries
Finished phase 1 with 180 SingleSign rule and 12 generalized
[2026-05-25 02:51:02] [INFO ] Computed 22 invariants in 2 ms
Computed 22 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3920826852241019441.kers
Total runtime 3 ms.
[2026-05-25 02:51:02] [INFO ] Implicit Places using invariants in 370 ms returned [84, 86]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 408 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/216 places, 198/198 transitions.
Applied a total of 0 rules in 17 ms. Remains 212 /212 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 479 ms. Remains : 212/216 places, 198/198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 198/198 transitions.
Applied a total of 0 rules in 10 ms. Remains 212 /212 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17493521560466706635.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6819875920491973674.kers'
[2026-05-25 02:51:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17493521560466706635.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6819875920491973674.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 198 rows 212 cols 550 entries
Finished phase 1 with 178 SingleSign rule and 14 generalized
[2026-05-25 02:51:02] [INFO ] Computed 20 invariants in 2 ms
Computed 20 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6819875920491973674.kers
Total runtime 2 ms.
[2026-05-25 02:51:03] [INFO ] Implicit Places using invariants in 202 ms returned []
[2026-05-25 02:51:03] [INFO ] Invariant cache hit.
[2026-05-25 02:51:03] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2026-05-25 02:51:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 2/211 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 6/44 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 11 (OVERLAPS) 198/409 variables, 211/260 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 6/266 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/409 variables, 5/271 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/409 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/409 variables, 3/275 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 409/410 variables, and 275 constraints, problems are : Problem set: 0 solved, 197 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 211/212 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 2/211 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 41/61 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (OVERLAPS) 198/409 variables, 211/273 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 195/468 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 3/471 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/409 variables, 3/475 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 409/410 variables, and 475 constraints, problems are : Problem set: 0 solved, 197 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 211/212 constraints, PredecessorRefiner: 195/197 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60086ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Finished structural reductions in LTL mode , in 1 iterations and 60723 ms. Remains : 212/212 places, 198/198 transitions.
Support contains 40 out of 212 places after structural reductions.
[2026-05-25 02:52:03] [INFO ] Flatten gal took : 36 ms
[2026-05-25 02:52:03] [INFO ] Flatten gal took : 14 ms
[2026-05-25 02:52:03] [INFO ] Input system was already deterministic with 198 transitions.
RANDOM walk for 40000 steps (1358 resets) in 1595 ms. (25 steps per ms) remains 23/28 properties
BEST_FIRST walk for 4001 steps (110 resets) in 92 ms. (43 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (120 resets) in 73 ms. (54 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (105 resets) in 57 ms. (68 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (114 resets) in 71 ms. (55 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (114 resets) in 65 ms. (60 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (103 resets) in 57 ms. (68 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (120 resets) in 44 ms. (88 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (109 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (110 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (109 resets) in 31 ms. (125 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (115 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (112 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (114 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (114 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (110 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (115 resets) in 28 ms. (138 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (111 resets) in 56 ms. (70 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (109 resets) in 37 ms. (105 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (116 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (115 resets) in 33 ms. (117 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (113 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (114 resets) in 34 ms. (114 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (117 resets) in 50 ms. (78 steps per ms) remains 23/23 properties
[2026-05-25 02:52:04] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 1 (OVERLAPS) 150/182 variables, 4/4 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/4 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 2/184 variables, 1/5 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/5 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 28/212 variables, 15/20 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 11/31 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 1/32 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 0/32 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 198/410 variables, 212/244 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 6/250 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 0/250 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 0/410 variables, 0/250 constraints. Problems are: Problem set: 6 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 250 constraints, problems are : Problem set: 6 solved, 17 unsolved in 2445 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 155/182 variables, 4/4 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/4 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 2/184 variables, 1/5 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/5 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 28/212 variables, 15/20 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 18/38 constraints. Problems are: Problem set: 6 solved, 17 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 4/42 constraints. Problems are: Problem set: 8 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 0/42 constraints. Problems are: Problem set: 8 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 198/410 variables, 212/254 constraints. Problems are: Problem set: 8 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 15/269 constraints. Problems are: Problem set: 8 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 3/272 constraints. Problems are: Problem set: 8 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/410 variables, 3/275 constraints. Problems are: Problem set: 8 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/410 variables, 1/276 constraints. Problems are: Problem set: 8 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/410 variables, 2/278 constraints. Problems are: Problem set: 8 solved, 15 unsolved
SMT process timed out in 7464ms, After SMT, problems are : Problem set: 8 solved, 15 unsolved
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2049 ms.
Support contains 24 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 198/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 212 transition count 172
Reduce places removed 26 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 33 rules applied. Total rules applied 59 place count 186 transition count 165
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 66 place count 179 transition count 165
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 66 place count 179 transition count 155
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 86 place count 169 transition count 155
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 146 place count 139 transition count 125
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 152 place count 136 transition count 125
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 154 place count 136 transition count 123
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 156 place count 134 transition count 123
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 4 with 18 rules applied. Total rules applied 174 place count 134 transition count 105
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 192 place count 116 transition count 105
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 206 place count 116 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 207 place count 115 transition count 104
Applied a total of 207 rules in 51 ms. Remains 115 /212 variables (removed 97) and now considering 104/198 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 115/212 places, 104/198 transitions.
RANDOM walk for 40000 steps (3526 resets) in 473 ms. (84 steps per ms) remains 9/15 properties
BEST_FIRST walk for 40002 steps (3475 resets) in 146 ms. (272 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (2416 resets) in 149 ms. (266 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (2337 resets) in 171 ms. (232 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (2464 resets) in 178 ms. (223 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (2425 resets) in 126 ms. (314 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (2469 resets) in 124 ms. (320 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (2372 resets) in 216 ms. (184 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (2423 resets) in 167 ms. (238 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (2459 resets) in 107 ms. (370 steps per ms) remains 9/9 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1668133419561693355.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8054237360578149446.kers'
[2026-05-25 02:52:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1668133419561693355.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8054237360578149446.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 104 rows 115 cols 443 entries
Finished phase 1 with 75 SingleSign rule and 20 generalized
[2026-05-25 02:52:14] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8054237360578149446.kers
Total runtime 1 ms.
[2026-05-25 02:52:14] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 58/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 38/113 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 2/115 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 104/219 variables, 115/149 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 9/158 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/219 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 158 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1076 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 115/115 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 58/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 38/113 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 11/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 2/115 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 104/219 variables, 115/149 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 9/158 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 9/167 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/219 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 0/219 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/219 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/219 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 0/219 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 172 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1489 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 115/115 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2573ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 0 properties in 7318 ms.
Support contains 17 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 104/104 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 115 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 114 transition count 103
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 110 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 109 transition count 99
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 109 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 108 transition count 98
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 17 place count 108 transition count 98
Applied a total of 17 rules in 17 ms. Remains 108 /115 variables (removed 7) and now considering 98/104 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 108/115 places, 98/104 transitions.
RANDOM walk for 40000 steps (3962 resets) in 131 ms. (303 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40001 steps (3807 resets) in 119 ms. (333 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (2618 resets) in 138 ms. (287 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (2538 resets) in 115 ms. (344 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (2640 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (2584 resets) in 132 ms. (300 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (2625 resets) in 103 ms. (384 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (2620 resets) in 100 ms. (396 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (2621 resets) in 68 ms. (579 steps per ms) remains 8/8 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14332701133757756587.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2388820107697128877.kers'
[2026-05-25 02:52:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14332701133757756587.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2388820107697128877.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 98 rows 108 cols 449 entries
Finished phase 1 with 68 SingleSign rule and 20 generalized
[2026-05-25 02:52:25] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2388820107697128877.kers
Total runtime 1 ms.
[2026-05-25 02:52:25] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 52/68 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 36/104 variables, 15/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/106 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 2/108 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 98/206 variables, 108/128 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 12/140 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/206 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 140 constraints, problems are : Problem set: 0 solved, 8 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 108/108 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 52/68 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 36/104 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 2/106 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 2/108 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/108 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 98/206 variables, 108/148 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/206 variables, 12/160 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/206 variables, 8/168 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/206 variables, 5/173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/206 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 0/206 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 173 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2225 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 108/108 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2509ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 8982 ms.
Support contains 16 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 98/98 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 108 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 107 transition count 97
Applied a total of 2 rules in 5 ms. Remains 107 /108 variables (removed 1) and now considering 97/98 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 107/108 places, 97/98 transitions.
RANDOM walk for 40000 steps (3991 resets) in 116 ms. (341 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3812 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (2589 resets) in 88 ms. (449 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (2532 resets) in 82 ms. (481 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (2615 resets) in 58 ms. (678 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (2572 resets) in 64 ms. (615 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (2602 resets) in 58 ms. (678 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (2639 resets) in 63 ms. (625 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (2596 resets) in 56 ms. (701 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 596822 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :6 out of 8
Probabilistic random walk after 596822 steps, saw 298537 distinct states, run finished after 3006 ms. (steps per millisecond=198 ) properties seen :6
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3520741958966178924.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6935538032592596304.kers'
[2026-05-25 02:52:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3520741958966178924.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6935538032592596304.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 97 rows 107 cols 447 entries
Finished phase 1 with 67 SingleSign rule and 20 generalized
[2026-05-25 02:52:39] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6935538032592596304.kers
Total runtime 1 ms.
[2026-05-25 02:52:39] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 54/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 40/98 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/102 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/106 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 97/203 variables, 106/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/203 variables, 12/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/203 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/204 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/204 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/204 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 144 constraints, problems are : Problem set: 0 solved, 2 unsolved in 356 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 107/107 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 54/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 40/98 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/102 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/106 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/106 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/106 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 97/203 variables, 106/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/203 variables, 12/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/203 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/203 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/204 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/204 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/204 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 151 constraints, problems are : Problem set: 0 solved, 2 unsolved in 470 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 107/107 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 833ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 642 ms.
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 97/97 transitions.
Graph (complete) has 400 edges and 107 vertex of which 104 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 104 transition count 94
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 102 transition count 94
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 102 transition count 93
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 101 transition count 93
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 22 place count 94 transition count 86
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 94 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 93 transition count 85
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 93 transition count 83
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 28 place count 91 transition count 83
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 30 place count 91 transition count 83
Applied a total of 30 rules in 23 ms. Remains 91 /107 variables (removed 16) and now considering 83/97 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 91/107 places, 83/97 transitions.
RANDOM walk for 40000 steps (4190 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (2956 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (2953 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 665120 steps, run timeout after 3001 ms. (steps per millisecond=221 ) properties seen :0 out of 2
Probabilistic random walk after 665120 steps, saw 333091 distinct states, run finished after 3001 ms. (steps per millisecond=221 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11305764660437855593.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17689541556405335365.kers'
[2026-05-25 02:52:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11305764660437855593.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17689541556405335365.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 83 rows 89 cols 397 entries
Finished phase 1 with 53 SingleSign rule and 19 generalized
[2026-05-25 02:52:44] [INFO ] Computed 19 invariants in 2 ms
Computed 19 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17689541556405335365.kers
Total runtime 3 ms.
[2026-05-25 02:52:44] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 38/82 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 4/86 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 83/169 variables, 86/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 18/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/169 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/174 variables, 5/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/174 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/174 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/174 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 131 constraints, problems are : Problem set: 0 solved, 2 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 91/91 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 38/82 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 4/86 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/86 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/86 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 83/169 variables, 86/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/169 variables, 18/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/169 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/169 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 5/174 variables, 5/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/174 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/174 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/174 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 142 constraints, problems are : Problem set: 0 solved, 2 unsolved in 583 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 91/91 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 860ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 358 ms.
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 83/83 transitions.
Applied a total of 0 rules in 3 ms. Remains 91 /91 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 91/91 places, 83/83 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 83/83 transitions.
Applied a total of 0 rules in 3 ms. Remains 91 /91 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2026-05-25 02:52:45] [INFO ] Invariant cache hit.
[2026-05-25 02:52:45] [INFO ] Implicit Places using invariants in 79 ms returned [19, 25, 60, 64, 82, 88]
[2026-05-25 02:52:45] [INFO ] Actually due to overlaps returned [64, 60]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 80 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 89/91 places, 83/83 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 89 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 88 transition count 82
Applied a total of 2 rules in 6 ms. Remains 88 /89 variables (removed 1) and now considering 82/83 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13651854682151576378.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15156636965177196351.kers'
[2026-05-25 02:52:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13651854682151576378.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15156636965177196351.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 82 rows 86 cols 377 entries
Finished phase 1 with 60 SingleSign rule and 11 generalized
[2026-05-25 02:52:45] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15156636965177196351.kers
Total runtime 1 ms.
[2026-05-25 02:52:45] [INFO ] Implicit Places using invariants in 75 ms returned [19, 25, 79, 85]
[2026-05-25 02:52:45] [INFO ] Actually due to overlaps returned [85, 79]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 76 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 86/91 places, 82/83 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 86 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 85 transition count 81
Applied a total of 2 rules in 7 ms. Remains 85 /86 variables (removed 1) and now considering 81/82 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11974086823436298578.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3301079925304558798.kers'
[2026-05-25 02:52:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11974086823436298578.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3301079925304558798.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 81 rows 83 cols 363 entries
Finished phase 1 with 63 SingleSign rule and 7 generalized
[2026-05-25 02:52:45] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3301079925304558798.kers
Total runtime 1 ms.
[2026-05-25 02:52:45] [INFO ] Implicit Places using invariants in 65 ms returned [19, 25]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 67 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 83/91 places, 81/83 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 83 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 82 transition count 80
Applied a total of 2 rules in 6 ms. Remains 82 /83 variables (removed 1) and now considering 80/81 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12737250954169811075.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15644558611835882069.kers'
[2026-05-25 02:52:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12737250954169811075.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15644558611835882069.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 80 rows 80 cols 355 entries
Finished phase 1 with 66 SingleSign rule and 3 generalized
[2026-05-25 02:52:45] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15644558611835882069.kers
Total runtime 1 ms.
[2026-05-25 02:52:45] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-25 02:52:45] [INFO ] Invariant cache hit.
[2026-05-25 02:52:45] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-25 02:52:46] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 82/91 places, 80/83 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 519 ms. Remains : 82/91 places, 80/83 transitions.
RANDOM walk for 40000 steps (4950 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3296 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3320 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 716129 steps, run timeout after 3001 ms. (steps per millisecond=238 ) properties seen :0 out of 2
Probabilistic random walk after 716129 steps, saw 358198 distinct states, run finished after 3001 ms. (steps per millisecond=238 ) properties seen :0
[2026-05-25 02:52:49] [INFO ] Invariant cache hit.
[2026-05-25 02:52:49] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 56/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 13/73 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 4/77 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 80/157 variables, 77/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 18/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/162 variables, 5/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/162 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 115 constraints, problems are : Problem set: 0 solved, 2 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 56/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 13/73 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/77 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 80/157 variables, 77/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/157 variables, 18/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/157 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/157 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 5/162 variables, 5/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/162 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/162 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/162 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 126 constraints, problems are : Problem set: 0 solved, 2 unsolved in 529 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 733ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 345 ms.
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 82/82 places, 80/80 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2026-05-25 02:52:50] [INFO ] Invariant cache hit.
[2026-05-25 02:52:50] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-25 02:52:50] [INFO ] Invariant cache hit.
[2026-05-25 02:52:50] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-25 02:52:50] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2026-05-25 02:52:50] [INFO ] Redundant transitions in 2 ms returned []
Running 79 sub problems to find dead transitions.
[2026-05-25 02:52:50] [INFO ] Invariant cache hit.
[2026-05-25 02:52:50] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (OVERLAPS) 1/82 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 80/162 variables, 82/96 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 18/114 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 79 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/162 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 115 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2211 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (OVERLAPS) 1/82 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 80/162 variables, 82/98 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 18/116 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 79/195 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 5/205 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/162 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/162 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/162 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/162 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 18 (OVERLAPS) 0/162 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/162 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/162 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 162/162 variables, and 216 constraints, problems are : Problem set: 0 solved, 79 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 9/9 constraints]
After SMT, in 32239ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 32239ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32516 ms. Remains : 82/82 places, 80/80 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 82 transition count 77
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 79 transition count 77
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 76 transition count 74
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 76 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 75 transition count 73
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 17 place count 75 transition count 70
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 20 place count 72 transition count 70
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 72 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 71 transition count 69
Applied a total of 22 rules in 16 ms. Remains 71 /82 variables (removed 11) and now considering 69/80 (removed 11) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4816238530397639751.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11547790122600948491.kers'
[2026-05-25 02:53:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4816238530397639751.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11547790122600948491.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 69 rows 69 cols 318 entries
Finished phase 1 with 55 SingleSign rule and 3 generalized
[2026-05-25 02:53:22] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11547790122600948491.kers
Total runtime 1 ms.
[2026-05-25 02:53:22] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 02:53:22] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2026-05-25 02:53:22] [INFO ] After 22ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2026-05-25 02:53:22] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-25 02:53:22] [INFO ] After 9ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-25 02:53:22] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-25 02:53:22] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 02:53:22] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2026-05-25 02:53:22] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2026-05-25 02:53:22] [INFO ] After 19ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 02:53:22] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-25 02:53:22] [INFO ] After 98ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 196 ms.
Successfully simplified 8 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA DoubleExponent-PT-004-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 352 edges and 212 vertex of which 208 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
FORMULA DoubleExponent-PT-004-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&F(p1)&&F(p2))))'
Support contains 6 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 198/198 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 210 transition count 198
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 209 transition count 197
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 209 transition count 197
Applied a total of 4 rules in 8 ms. Remains 209 /212 variables (removed 3) and now considering 197/198 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3219451641744700850.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-645488939670765449.kers'
[2026-05-25 02:53:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3219451641744700850.kers, --Pflows, --basisKERS=/tmp/petrispot-output-645488939670765449.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 197 rows 209 cols 546 entries
Finished phase 1 with 171 SingleSign rule and 19 generalized
[2026-05-25 02:53:23] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-645488939670765449.kers
Total runtime 2 ms.
[2026-05-25 02:53:23] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-25 02:53:23] [INFO ] Invariant cache hit.
[2026-05-25 02:53:23] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2026-05-25 02:53:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/229 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 9/238 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (OVERLAPS) 0/406 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/406 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 12 (OVERLAPS) 0/406 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 240 constraints, problems are : Problem set: 0 solved, 196 unsolved in 28365 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/240 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 196/436 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 5/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 441 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 58411ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 58413ms
Starting structural reductions in LTL mode, iteration 1 : 209/212 places, 197/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58988 ms. Remains : 209/212 places, 197/198 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&F(p1)&&F(p2))))'
Stuttering acceptance computed with spot in 357 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p2), true]
Running random walk in product with property : DoubleExponent-PT-004-LTLCardinality-01
Product exploration explored 100000 steps with 33333 reset in 176 ms.
Product exploration explored 100000 steps with 33333 reset in 131 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 349 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 6 factoid took 12 ms. Proved property starting from automaton with 6 states, 8 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 19 ms.
FORMULA DoubleExponent-PT-004-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-004-LTLCardinality-01 finished in 59754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 3 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 198/198 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 210 transition count 198
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 209 transition count 197
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 209 transition count 197
Applied a total of 4 rules in 10 ms. Remains 209 /212 variables (removed 3) and now considering 197/198 (removed 1) transitions.
[2026-05-25 02:54:23] [INFO ] Invariant cache hit.
[2026-05-25 02:54:23] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-25 02:54:23] [INFO ] Invariant cache hit.
[2026-05-25 02:54:23] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 209/212 places, 197/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 539 ms. Remains : 209/212 places, 197/198 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLCardinality-02
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-004-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLCardinality-02 finished in 729 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(F(p1) U X((G((p1 U p0))||F(p2))))))'
Support contains 5 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 198/198 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 198
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 210 transition count 197
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 210 transition count 197
Applied a total of 3 rules in 13 ms. Remains 210 /212 variables (removed 2) and now considering 197/198 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8125042132348988759.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16834942908120102534.kers'
[2026-05-25 02:54:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8125042132348988759.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16834942908120102534.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 197 rows 210 cols 547 entries
Finished phase 1 with 172 SingleSign rule and 19 generalized
[2026-05-25 02:54:23] [INFO ] Computed 19 invariants in 6 ms
Computed 19 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-16834942908120102534.kers
Total runtime 7 ms.
[2026-05-25 02:54:23] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-25 02:54:23] [INFO ] Invariant cache hit.
[2026-05-25 02:54:24] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2026-05-25 02:54:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/229 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 8/237 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (OVERLAPS) 1/407 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/407 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 13 (OVERLAPS) 0/407 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 240 constraints, problems are : Problem set: 0 solved, 196 unsolved in 28263 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/239 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 194/433 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 3/436 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/407 variables, and 438 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/210 constraints, PredecessorRefiner: 194/196 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 58304ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 58306ms
Starting structural reductions in LTL mode, iteration 1 : 210/212 places, 197/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58889 ms. Remains : 210/212 places, 197/198 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(F(p1) U X((G((p1 U p0))||F(p2))))))'
Stuttering acceptance computed with spot in 264 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-004-LTLCardinality-03
Product exploration explored 100000 steps with 3318 reset in 209 ms.
Product exploration explored 100000 steps with 3298 reset in 148 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 350 edges and 210 vertex of which 207 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge based reduction with 15 factoid took 66 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (1323 resets) in 123 ms. (322 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40001 steps (1113 resets) in 88 ms. (449 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (1120 resets) in 109 ms. (363 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (1123 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1141 resets) in 94 ms. (421 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (1109 resets) in 70 ms. (563 steps per ms) remains 5/5 properties
[2026-05-25 02:55:23] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 98/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 13/116 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 48/164 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 5/169 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 178/347 variables, 169/188 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 50/397 variables, 35/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/397 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 8/405 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/405 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 2/407 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/407 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/407 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 229 constraints, problems are : Problem set: 0 solved, 5 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 98/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 13/116 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 48/164 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 5/169 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 178/347 variables, 169/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/347 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 50/397 variables, 35/226 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/397 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/397 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 8/405 variables, 4/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/405 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 2/407 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/407 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/407 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/407 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/407 variables, and 236 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1482 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1799ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 990 ms.
Support contains 5 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 197/197 transitions.
Graph (complete) has 350 edges and 210 vertex of which 208 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 208 transition count 153
Reduce places removed 42 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 46 rules applied. Total rules applied 90 place count 166 transition count 149
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 94 place count 162 transition count 149
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 94 place count 162 transition count 139
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 114 place count 152 transition count 139
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 182 place count 118 transition count 105
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 190 place count 114 transition count 105
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 191 place count 114 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 192 place count 113 transition count 104
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 4 with 14 rules applied. Total rules applied 206 place count 113 transition count 90
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 220 place count 99 transition count 90
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 5 with 17 rules applied. Total rules applied 237 place count 99 transition count 90
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 238 place count 98 transition count 89
Applied a total of 238 rules in 32 ms. Remains 98 /210 variables (removed 112) and now considering 89/197 (removed 108) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 98/210 places, 89/197 transitions.
RANDOM walk for 40000 steps (5117 resets) in 139 ms. (285 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3271 resets) in 94 ms. (421 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3294 resets) in 72 ms. (547 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (3184 resets) in 69 ms. (571 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (3317 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (3218 resets) in 105 ms. (377 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 1026284 steps, run timeout after 3001 ms. (steps per millisecond=341 ) properties seen :4 out of 5
Probabilistic random walk after 1026284 steps, saw 513484 distinct states, run finished after 3001 ms. (steps per millisecond=341 ) properties seen :4
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6576374168064261131.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16630043870174111416.kers'
[2026-05-25 02:55:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6576374168064261131.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16630043870174111416.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 89 rows 96 cols 417 entries
Finished phase 1 with 58 SingleSign rule and 21 generalized
[2026-05-25 02:55:29] [INFO ] Computed 19 invariants in 2 ms
Computed 19 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16630043870174111416.kers
Total runtime 4 ms.
[2026-05-25 02:55:29] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/67 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/89 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/93 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 89/182 variables, 93/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 10/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/187 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/187 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/187 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/187 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 127 constraints, problems are : Problem set: 0 solved, 1 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 98/98 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/67 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/89 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 10/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/93 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 89/182 variables, 93/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 10/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/182 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/187 variables, 5/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/187 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/187 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/187 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/187 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/187 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 733 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 98/98 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 813ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 5 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 89/89 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 89/89 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 98/98 places, 89/89 transitions.
RANDOM walk for 40000 steps (5077 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3261 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1130950 steps, run timeout after 3001 ms. (steps per millisecond=376 ) properties seen :0 out of 1
Probabilistic random walk after 1130950 steps, saw 565817 distinct states, run finished after 3001 ms. (steps per millisecond=376 ) properties seen :0
[2026-05-25 02:55:33] [INFO ] Invariant cache hit.
[2026-05-25 02:55:33] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/67 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/89 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/93 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 89/182 variables, 93/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 10/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/187 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/187 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/187 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/187 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 127 constraints, problems are : Problem set: 0 solved, 1 unsolved in 91 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 98/98 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/67 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/89 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 10/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/93 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 89/182 variables, 93/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 10/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/182 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/187 variables, 5/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/187 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/187 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/187 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/187 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/187 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 721 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 98/98 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 816ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 5 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 89/89 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 89/89 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 98/98 places, 89/89 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 89/89 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 89/89 (removed 0) transitions.
[2026-05-25 02:55:34] [INFO ] Invariant cache hit.
[2026-05-25 02:55:34] [INFO ] Implicit Places using invariants in 92 ms returned [25, 32, 65, 70, 89, 95]
[2026-05-25 02:55:34] [INFO ] Actually due to overlaps returned [70, 65]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 93 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 96/98 places, 89/89 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 96 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 95 transition count 88
Applied a total of 2 rules in 5 ms. Remains 95 /96 variables (removed 1) and now considering 88/89 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-216462324011130126.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3249244518480545888.kers'
[2026-05-25 02:55:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-216462324011130126.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3249244518480545888.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 88 rows 93 cols 396 entries
Finished phase 1 with 61 SingleSign rule and 17 generalized
[2026-05-25 02:55:34] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3249244518480545888.kers
Total runtime 1 ms.
[2026-05-25 02:55:34] [INFO ] Implicit Places using invariants in 79 ms returned [25, 32, 86, 92]
[2026-05-25 02:55:34] [INFO ] Actually due to overlaps returned [92, 86]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 81 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 93/98 places, 88/89 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 93 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 92 transition count 87
Applied a total of 2 rules in 4 ms. Remains 92 /93 variables (removed 1) and now considering 87/88 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11164329859661288518.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18178524538622953872.kers'
[2026-05-25 02:55:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11164329859661288518.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18178524538622953872.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 87 rows 90 cols 381 entries
Finished phase 1 with 69 SingleSign rule and 8 generalized
[2026-05-25 02:55:34] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18178524538622953872.kers
Total runtime 1 ms.
[2026-05-25 02:55:34] [INFO ] Implicit Places using invariants in 66 ms returned [25, 32]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 67 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 90/98 places, 87/89 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 90 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 89 transition count 86
Applied a total of 2 rules in 4 ms. Remains 89 /90 variables (removed 1) and now considering 86/87 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7019147023857690227.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10313178785872856549.kers'
[2026-05-25 02:55:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7019147023857690227.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10313178785872856549.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 86 rows 87 cols 372 entries
Finished phase 1 with 73 SingleSign rule and 3 generalized
[2026-05-25 02:55:34] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10313178785872856549.kers
Total runtime 1 ms.
[2026-05-25 02:55:34] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-25 02:55:34] [INFO ] Invariant cache hit.
[2026-05-25 02:55:34] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:55:34] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 89/98 places, 86/89 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 511 ms. Remains : 89/98 places, 86/89 transitions.
RANDOM walk for 40000 steps (5618 resets) in 58 ms. (677 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3548 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Probably explored full state space saw : 363210 states, properties seen :0
Probabilistic random walk after 726442 steps, saw 363210 distinct states, run finished after 1765 ms. (steps per millisecond=411 ) properties seen :0
Interrupted probabilistic random walk after 1238564 steps, run timeout after 3001 ms. (steps per millisecond=412 ) properties seen :0 out of 1
Exhaustive walk after 1238564 steps, saw 619319 distinct states, run finished after 3001 ms. (steps per millisecond=412 ) properties seen :0
[2026-05-25 02:55:39] [INFO ] Invariant cache hit.
[2026-05-25 02:55:39] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/68 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/80 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/84 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 86/170 variables, 84/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 10/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/175 variables, 5/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/175 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/175 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/175 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 112 constraints, problems are : Problem set: 0 solved, 1 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 89/89 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 4/68 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/80 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/84 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/84 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 86/170 variables, 84/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/170 variables, 10/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/170 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/175 variables, 5/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/175 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/175 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/175 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/175 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/175 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 125 constraints, problems are : Problem set: 0 solved, 1 unsolved in 791 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 89/89 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 886ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 5 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 86/86 transitions.
Applied a total of 0 rules in 3 ms. Remains 89 /89 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 89/89 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 86/86 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2026-05-25 02:55:40] [INFO ] Invariant cache hit.
[2026-05-25 02:55:40] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-25 02:55:40] [INFO ] Invariant cache hit.
[2026-05-25 02:55:40] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:55:40] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2026-05-25 02:55:40] [INFO ] Redundant transitions in 2 ms returned []
Running 85 sub problems to find dead transitions.
[2026-05-25 02:55:40] [INFO ] Invariant cache hit.
[2026-05-25 02:55:40] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 1/88 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 86/174 variables, 88/112 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 10/122 constraints. Problems are: Problem set: 0 solved, 85 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 1/175 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/175 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 12 (OVERLAPS) 0/175 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 123 constraints, problems are : Problem set: 0 solved, 85 unsolved in 3488 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 89/89 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 1/88 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (OVERLAPS) 86/174 variables, 88/123 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/174 variables, 10/133 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/174 variables, 81/214 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/174 variables, 5/219 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/174 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/174 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/174 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 18 (OVERLAPS) 1/175 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/175 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/175 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 21 (OVERLAPS) 0/175 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 228 constraints, problems are : Problem set: 0 solved, 85 unsolved in 12925 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 89/89 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 16423ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 16423ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16702 ms. Remains : 89/89 places, 86/86 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 89 transition count 82
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 85 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 84 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 84 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 83 transition count 80
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 83 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 82 transition count 79
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 82 transition count 77
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 80 transition count 77
Applied a total of 18 rules in 16 ms. Remains 80 /89 variables (removed 9) and now considering 77/86 (removed 9) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14387684577138812069.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2424746615992861499.kers'
[2026-05-25 02:55:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14387684577138812069.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2424746615992861499.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 77 rows 78 cols 352 entries
Finished phase 1 with 55 SingleSign rule and 12 generalized
[2026-05-25 02:55:57] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2424746615992861499.kers
Total runtime 1 ms.
[2026-05-25 02:55:57] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 02:55:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-25 02:55:57] [INFO ] [Nat]Absence check using 5 positive and 8 generalized place invariants in 2 ms returned sat
[2026-05-25 02:55:57] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 02:55:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 125 ms
TRAPS : Iteration 1
[2026-05-25 02:55:57] [INFO ] After 186ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 02:55:57] [INFO ] After 225ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 275 ms.
Knowledge based reduction with 15 factoid took 165 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 34600 ms.
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 197/197 transitions.
Applied a total of 0 rules in 6 ms. Remains 210 /210 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10698619823802532020.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11055195724989360989.kers'
[2026-05-25 02:55:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10698619823802532020.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11055195724989360989.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 197 rows 210 cols 547 entries
Finished phase 1 with 172 SingleSign rule and 19 generalized
[2026-05-25 02:55:58] [INFO ] Computed 19 invariants in 4 ms
Computed 19 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-11055195724989360989.kers
Total runtime 4 ms.
[2026-05-25 02:55:58] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-25 02:55:58] [INFO ] Invariant cache hit.
[2026-05-25 02:55:58] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2026-05-25 02:55:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/229 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 8/237 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (OVERLAPS) 1/407 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/407 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 13 (OVERLAPS) 0/407 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 240 constraints, problems are : Problem set: 0 solved, 196 unsolved in 28442 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/239 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 194/433 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 3/436 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/407 variables, and 438 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/210 constraints, PredecessorRefiner: 194/196 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 58476ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 58477ms
Finished structural reductions in LTL mode , in 1 iterations and 59073 ms. Remains : 210/210 places, 197/197 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 350 edges and 210 vertex of which 207 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge based reduction with 15 factoid took 69 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (1302 resets) in 110 ms. (360 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1110 resets) in 73 ms. (540 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (1117 resets) in 135 ms. (294 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (1129 resets) in 70 ms. (563 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1092 resets) in 71 ms. (555 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1130 resets) in 132 ms. (300 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (1137 resets) in 115 ms. (344 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1109 resets) in 70 ms. (563 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 686390 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :6 out of 7
Probabilistic random walk after 686390 steps, saw 343247 distinct states, run finished after 3001 ms. (steps per millisecond=228 ) properties seen :6
[2026-05-25 02:57:00] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/116 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 48/164 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/169 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 178/347 variables, 169/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 50/397 variables, 35/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/397 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/405 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/405 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/407 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/407 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/407 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 229 constraints, problems are : Problem set: 0 solved, 1 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/116 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 48/164 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/169 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 178/347 variables, 169/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 50/397 variables, 35/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/397 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/397 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/397 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/405 variables, 4/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/405 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/407 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/407 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/407 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/407 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/407 variables, and 233 constraints, problems are : Problem set: 0 solved, 1 unsolved in 888 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1051ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 29 ms.
Support contains 5 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 197/197 transitions.
Graph (complete) has 350 edges and 210 vertex of which 208 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 208 transition count 153
Reduce places removed 42 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 46 rules applied. Total rules applied 90 place count 166 transition count 149
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 94 place count 162 transition count 149
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 94 place count 162 transition count 139
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 114 place count 152 transition count 139
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 182 place count 118 transition count 105
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 190 place count 114 transition count 105
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 191 place count 114 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 192 place count 113 transition count 104
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 4 with 14 rules applied. Total rules applied 206 place count 113 transition count 90
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 220 place count 99 transition count 90
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 5 with 17 rules applied. Total rules applied 237 place count 99 transition count 90
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 238 place count 98 transition count 89
Applied a total of 238 rules in 15 ms. Remains 98 /210 variables (removed 112) and now considering 89/197 (removed 108) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 98/210 places, 89/197 transitions.
RANDOM walk for 40000 steps (5082 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3320 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1140692 steps, run timeout after 3001 ms. (steps per millisecond=380 ) properties seen :0 out of 1
Probabilistic random walk after 1140692 steps, saw 570684 distinct states, run finished after 3001 ms. (steps per millisecond=380 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16548188277187733590.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8894349414444394108.kers'
[2026-05-25 02:57:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16548188277187733590.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8894349414444394108.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 89 rows 96 cols 417 entries
Finished phase 1 with 58 SingleSign rule and 21 generalized
[2026-05-25 02:57:04] [INFO ] Computed 19 invariants in 2 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8894349414444394108.kers
Total runtime 3 ms.
[2026-05-25 02:57:04] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/67 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/89 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/93 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 89/182 variables, 93/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 10/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/187 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/187 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/187 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/187 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 127 constraints, problems are : Problem set: 0 solved, 1 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 98/98 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/67 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/89 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 10/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/93 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 89/182 variables, 93/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 10/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/182 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/187 variables, 5/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/187 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/187 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/187 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/187 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/187 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 745 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 98/98 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 830ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 5 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 89/89 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 89/89 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 98/98 places, 89/89 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 89/89 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 89/89 (removed 0) transitions.
[2026-05-25 02:57:05] [INFO ] Invariant cache hit.
[2026-05-25 02:57:05] [INFO ] Implicit Places using invariants in 95 ms returned [25, 32, 65, 70, 89, 95]
[2026-05-25 02:57:05] [INFO ] Actually due to overlaps returned [70, 65]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 96 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 96/98 places, 89/89 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 96 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 95 transition count 88
Applied a total of 2 rules in 4 ms. Remains 95 /96 variables (removed 1) and now considering 88/89 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13220141260655883615.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8140176130290572179.kers'
[2026-05-25 02:57:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13220141260655883615.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8140176130290572179.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 88 rows 93 cols 396 entries
Finished phase 1 with 61 SingleSign rule and 17 generalized
[2026-05-25 02:57:05] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8140176130290572179.kers
Total runtime 1 ms.
[2026-05-25 02:57:05] [INFO ] Implicit Places using invariants in 72 ms returned [25, 32, 86, 92]
[2026-05-25 02:57:05] [INFO ] Actually due to overlaps returned [92, 86]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 74 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 93/98 places, 88/89 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 93 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 92 transition count 87
Applied a total of 2 rules in 4 ms. Remains 92 /93 variables (removed 1) and now considering 87/88 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4820097046341680318.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16468394329898058986.kers'
[2026-05-25 02:57:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4820097046341680318.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16468394329898058986.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 87 rows 90 cols 381 entries
Finished phase 1 with 69 SingleSign rule and 8 generalized
[2026-05-25 02:57:05] [INFO ] Computed 15 invariants in 2 ms
Computed 15 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16468394329898058986.kers
Total runtime 3 ms.
[2026-05-25 02:57:05] [INFO ] Implicit Places using invariants in 68 ms returned [25, 32]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 69 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 90/98 places, 87/89 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 90 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 89 transition count 86
Applied a total of 2 rules in 3 ms. Remains 89 /90 variables (removed 1) and now considering 86/87 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4609792754469366996.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4971904301694315334.kers'
[2026-05-25 02:57:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4609792754469366996.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4971904301694315334.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 86 rows 87 cols 372 entries
Finished phase 1 with 73 SingleSign rule and 3 generalized
[2026-05-25 02:57:05] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4971904301694315334.kers
Total runtime 1 ms.
[2026-05-25 02:57:05] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-25 02:57:05] [INFO ] Invariant cache hit.
[2026-05-25 02:57:05] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:57:06] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 89/98 places, 86/89 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 498 ms. Remains : 89/98 places, 86/89 transitions.
RANDOM walk for 40000 steps (5653 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3488 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Probably explored full state space saw : 363210 states, properties seen :0
Probabilistic random walk after 726442 steps, saw 363210 distinct states, run finished after 1742 ms. (steps per millisecond=417 ) properties seen :0
Interrupted probabilistic random walk after 1336748 steps, run timeout after 3001 ms. (steps per millisecond=445 ) properties seen :0 out of 1
Exhaustive walk after 1336748 steps, saw 668427 distinct states, run finished after 3001 ms. (steps per millisecond=445 ) properties seen :0
[2026-05-25 02:57:10] [INFO ] Invariant cache hit.
[2026-05-25 02:57:10] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/68 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/80 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/84 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 86/170 variables, 84/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 10/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/175 variables, 5/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/175 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/175 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/175 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 112 constraints, problems are : Problem set: 0 solved, 1 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 89/89 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 4/68 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/80 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/84 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/84 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 86/170 variables, 84/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/170 variables, 10/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/170 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/175 variables, 5/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/175 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/175 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/175 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/175 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/175 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 125 constraints, problems are : Problem set: 0 solved, 1 unsolved in 741 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 89/89 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 807ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 5 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 86/86 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 89/89 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 86/86 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2026-05-25 02:57:11] [INFO ] Invariant cache hit.
[2026-05-25 02:57:11] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-25 02:57:11] [INFO ] Invariant cache hit.
[2026-05-25 02:57:11] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:57:11] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2026-05-25 02:57:11] [INFO ] Redundant transitions in 2 ms returned []
Running 85 sub problems to find dead transitions.
[2026-05-25 02:57:11] [INFO ] Invariant cache hit.
[2026-05-25 02:57:11] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 1/88 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 86/174 variables, 88/112 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 10/122 constraints. Problems are: Problem set: 0 solved, 85 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 1/175 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/175 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 12 (OVERLAPS) 0/175 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 123 constraints, problems are : Problem set: 0 solved, 85 unsolved in 3544 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 89/89 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 1/88 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (OVERLAPS) 86/174 variables, 88/123 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/174 variables, 10/133 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/174 variables, 81/214 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/174 variables, 5/219 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/174 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/174 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/174 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 18 (OVERLAPS) 1/175 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/175 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/175 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 21 (OVERLAPS) 0/175 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 228 constraints, problems are : Problem set: 0 solved, 85 unsolved in 12994 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 89/89 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 16551ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 16551ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16840 ms. Remains : 89/89 places, 86/86 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 89 transition count 82
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 85 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 84 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 84 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 83 transition count 80
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 83 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 82 transition count 79
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 82 transition count 77
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 80 transition count 77
Applied a total of 18 rules in 16 ms. Remains 80 /89 variables (removed 9) and now considering 77/86 (removed 9) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4898522408619602509.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6139324223627796602.kers'
[2026-05-25 02:57:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4898522408619602509.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6139324223627796602.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 77 rows 78 cols 352 entries
Finished phase 1 with 55 SingleSign rule and 12 generalized
[2026-05-25 02:57:28] [INFO ] Computed 13 invariants in 2 ms
Computed 13 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6139324223627796602.kers
Total runtime 3 ms.
[2026-05-25 02:57:28] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 02:57:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2026-05-25 02:57:28] [INFO ] [Nat]Absence check using 5 positive and 8 generalized place invariants in 3 ms returned sat
[2026-05-25 02:57:28] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 02:57:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 111 ms
TRAPS : Iteration 1
[2026-05-25 02:57:28] [INFO ] After 172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 02:57:28] [INFO ] After 214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 270 ms.
Knowledge based reduction with 15 factoid took 140 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 31893 ms.
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 3322 reset in 103 ms.
Product exploration explored 100000 steps with 3268 reset in 107 ms.
Spot run failed in 72 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin2021620716234260543
[2026-05-25 02:57:29] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2021620716234260543
Running compilation step : cd /tmp/ltsmin2021620716234260543;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 406 ms.
Running link step : cd /tmp/ltsmin2021620716234260543;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin2021620716234260543;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased3524200092965964356.hoa' '--buchi-type=spotba'
LTSmin run took 43 ms.
FORMULA DoubleExponent-PT-004-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-004-LTLCardinality-03 finished in 186630 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G(p0)||X(p1))))))'
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 198/198 transitions.
Graph (complete) has 352 edges and 212 vertex of which 211 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 210 transition count 147
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 101 place count 160 transition count 147
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 101 place count 160 transition count 140
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 115 place count 153 transition count 140
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 191 place count 115 transition count 102
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 203 place count 109 transition count 102
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 204 place count 109 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 205 place count 108 transition count 101
Applied a total of 205 rules in 25 ms. Remains 108 /212 variables (removed 104) and now considering 101/198 (removed 97) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6505310873390971612.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18216139806236548929.kers'
[2026-05-25 02:57:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6505310873390971612.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18216139806236548929.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 101 rows 106 cols 375 entries
Finished phase 1 with 66 SingleSign rule and 22 generalized
[2026-05-25 02:57:30] [INFO ] Computed 20 invariants in 2 ms
Computed 20 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-18216139806236548929.kers
Total runtime 2 ms.
[2026-05-25 02:57:30] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-25 02:57:30] [INFO ] Invariant cache hit.
[2026-05-25 02:57:30] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-25 02:57:30] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2026-05-25 02:57:30] [INFO ] Redundant transitions in 3 ms returned []
Running 100 sub problems to find dead transitions.
[2026-05-25 02:57:30] [INFO ] Invariant cache hit.
[2026-05-25 02:57:30] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 2/108 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 101/209 variables, 108/128 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 6/134 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 9/143 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/209 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (OVERLAPS) 0/209 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 147 constraints, problems are : Problem set: 0 solved, 100 unsolved in 5921 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 108/108 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 2/108 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 101/209 variables, 108/141 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 6/147 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 100/247 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/209 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (OVERLAPS) 0/209 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 249 constraints, problems are : Problem set: 0 solved, 100 unsolved in 7483 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 108/108 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13413ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 13413ms
Starting structural reductions in SI_LTL mode, iteration 1 : 108/212 places, 101/198 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13710 ms. Remains : 108/212 places, 101/198 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G(p0)||X(p1))))))'
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-004-LTLCardinality-05
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-004-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLCardinality-05 finished in 13862 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 198/198 transitions.
Graph (complete) has 352 edges and 212 vertex of which 209 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 208 transition count 147
Reduce places removed 49 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 159 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 101 place count 158 transition count 146
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 101 place count 158 transition count 139
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 115 place count 151 transition count 139
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 193 place count 112 transition count 100
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 205 place count 106 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 206 place count 105 transition count 99
Applied a total of 206 rules in 19 ms. Remains 105 /212 variables (removed 107) and now considering 99/198 (removed 99) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5051804600318575039.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10926938111694743180.kers'
[2026-05-25 02:57:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5051804600318575039.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10926938111694743180.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 99 rows 103 cols 369 entries
Finished phase 1 with 62 SingleSign rule and 24 generalized
[2026-05-25 02:57:44] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10926938111694743180.kers
Total runtime 2 ms.
[2026-05-25 02:57:44] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-25 02:57:44] [INFO ] Invariant cache hit.
[2026-05-25 02:57:44] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-25 02:57:44] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2026-05-25 02:57:44] [INFO ] Redundant transitions in 4 ms returned []
Running 98 sub problems to find dead transitions.
[2026-05-25 02:57:44] [INFO ] Invariant cache hit.
[2026-05-25 02:57:44] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 99/203 variables, 104/123 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 6/129 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 1/204 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 0/204 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 130 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4600 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 105/105 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 99/203 variables, 104/123 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 6/129 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 95/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 1/204 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (OVERLAPS) 0/204 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 231 constraints, problems are : Problem set: 0 solved, 98 unsolved in 14942 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 105/105 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 19562ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 19564ms
Starting structural reductions in SI_LTL mode, iteration 1 : 105/212 places, 99/198 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19876 ms. Remains : 105/212 places, 99/198 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLCardinality-06
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-004-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLCardinality-06 finished in 19954 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(p1))))'
Support contains 3 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 198/198 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 210 transition count 198
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 209 transition count 197
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 209 transition count 197
Applied a total of 4 rules in 11 ms. Remains 209 /212 variables (removed 3) and now considering 197/198 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3557573005629466349.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17702777036003548283.kers'
[2026-05-25 02:58:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3557573005629466349.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17702777036003548283.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 197 rows 209 cols 546 entries
Finished phase 1 with 171 SingleSign rule and 19 generalized
[2026-05-25 02:58:04] [INFO ] Computed 19 invariants in 2 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17702777036003548283.kers
Total runtime 2 ms.
[2026-05-25 02:58:04] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-25 02:58:04] [INFO ] Invariant cache hit.
[2026-05-25 02:58:04] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2026-05-25 02:58:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/229 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 9/238 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (OVERLAPS) 0/406 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/406 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 12 (OVERLAPS) 0/406 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 240 constraints, problems are : Problem set: 0 solved, 196 unsolved in 28333 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/406 variables, 209/240 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 196/436 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 5/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 441 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 58362ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 58365ms
Starting structural reductions in LTL mode, iteration 1 : 209/212 places, 197/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58915 ms. Remains : 209/212 places, 197/198 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(p1))))'
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : DoubleExponent-PT-004-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-004-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLCardinality-09 finished in 59085 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(G(!p0))))))'
Support contains 1 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 198/198 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 210 transition count 198
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 209 transition count 197
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 209 transition count 197
Applied a total of 4 rules in 9 ms. Remains 209 /212 variables (removed 3) and now considering 197/198 (removed 1) transitions.
[2026-05-25 02:59:03] [INFO ] Invariant cache hit.
[2026-05-25 02:59:03] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-25 02:59:03] [INFO ] Invariant cache hit.
[2026-05-25 02:59:03] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 209/212 places, 197/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 580 ms. Remains : 209/212 places, 197/198 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(G(!p0))))))'
Stuttering acceptance computed with spot in 138 ms :[true, p0, false, false]
Running random walk in product with property : DoubleExponent-PT-004-LTLCardinality-10
Product exploration explored 100000 steps with 3319 reset in 121 ms.
Product exploration explored 100000 steps with 3327 reset in 122 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 349 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge based reduction with 3 factoid took 46 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (1322 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (1129 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 555196 steps, run visited all 1 properties in 1943 ms. (steps per millisecond=285 )
Probabilistic random walk after 555196 steps, saw 277649 distinct states, run finished after 1947 ms. (steps per millisecond=285 ) properties seen :1
Negative knowledge disproves property using: (G (NOT p0))
Knowledge based reduction with 3 factoid took 36 ms. Proved property starting from automaton with 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 2073 ms.
FORMULA DoubleExponent-PT-004-LTLCardinality-10 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property DoubleExponent-PT-004-LTLCardinality-10 finished in 3071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1) U X(p2)))'
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 198/198 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 210 transition count 198
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 209 transition count 197
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 209 transition count 197
Applied a total of 4 rules in 11 ms. Remains 209 /212 variables (removed 3) and now considering 197/198 (removed 1) transitions.
[2026-05-25 02:59:06] [INFO ] Invariant cache hit.
[2026-05-25 02:59:06] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-25 02:59:06] [INFO ] Invariant cache hit.
[2026-05-25 02:59:06] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 209/212 places, 197/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 560 ms. Remains : 209/212 places, 197/198 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1) U X(p2)))'
Stuttering acceptance computed with spot in 256 ms :[(NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), true, (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-004-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-004-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLCardinality-15 finished in 852 ms.
All properties solved by simple procedures.
Total runtime 485164 ms.
BK_STOP 1779677947215
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-004"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-004, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r098-tall-177955695800875"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-004.tgz
mv DoubleExponent-PT-004 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;