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.r338-smll-178021499100091.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 ErlangenMainframeV1-PT-bP06C06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499100091
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 5.1K May 27 08:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K May 27 08:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 27 08:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 27 08:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 27 10:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 27 10:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 27 10:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 9.4K May 27 08:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K May 27 08:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 27 08:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 27 08:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 8 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 1.8M May 26 18:17 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 ErlangenMainframeV1-PT-bP06C06-LTLCardinality-00
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-LTLCardinality-01
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-LTLCardinality-02
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-LTLCardinality-03
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-LTLCardinality-04
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-LTLCardinality-05
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-LTLCardinality-06
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-LTLCardinality-07
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-LTLCardinality-08
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-LTLCardinality-09
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-LTLCardinality-10
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-LTLCardinality-11
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-LTLCardinality-12
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-LTLCardinality-13
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-LTLCardinality-14
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1780268758286

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV1-PT-bP06C06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-31 23:06:00] [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-31 23:06:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-31 23:06:01] [INFO ] Load time of PNML (sax parser for PT used): 637 ms
[2026-05-31 23:06:01] [INFO ] Transformed 273 places.
[2026-05-31 23:06:01] [INFO ] Transformed 2487 transitions.
[2026-05-31 23:06:01] [INFO ] Found NUPN structural information;
[2026-05-31 23:06:01] [INFO ] Parsed PT model containing 273 places and 2487 transitions and 34329 arcs in 896 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA ErlangenMainframeV1-PT-bP06C06-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP06C06-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP06C06-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP06C06-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP06C06-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP06C06-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP06C06-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 2487/2487 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 222 transition count 2436
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 222 transition count 2436
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 124 place count 200 transition count 2414
Iterating global reduction 0 with 22 rules applied. Total rules applied 146 place count 200 transition count 2414
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 153 place count 193 transition count 1790
Iterating global reduction 0 with 7 rules applied. Total rules applied 160 place count 193 transition count 1790
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 164 place count 189 transition count 965
Iterating global reduction 0 with 4 rules applied. Total rules applied 168 place count 189 transition count 965
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 170 place count 187 transition count 963
Iterating global reduction 0 with 2 rules applied. Total rules applied 172 place count 187 transition count 963
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 174 place count 185 transition count 961
Iterating global reduction 0 with 2 rules applied. Total rules applied 176 place count 185 transition count 961
Applied a total of 176 rules in 268 ms. Remains 185 /273 variables (removed 88) and now considering 961/2487 (removed 1526) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14687376830765102080.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7022539604269363598.kers'
[2026-05-31 23:06:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14687376830765102080.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7022539604269363598.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 961 rows 185 cols 12425 entries
Finished phase 1 with 164 SingleSign rule and 3 generalized
[2026-05-31 23:06:02] [INFO ] Computed 18 invariants in 10 ms
Computed 18 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-7022539604269363598.kers
Total runtime 14 ms.
[2026-05-31 23:06:03] [INFO ] Implicit Places using invariants in 1298 ms returned [70]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1367 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/273 places, 961/2487 transitions.
Applied a total of 0 rules in 14 ms. Remains 184 /184 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1677 ms. Remains : 184/273 places, 961/2487 transitions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 961/961 transitions.
Applied a total of 0 rules in 14 ms. Remains 184 /184 variables (removed 0) and now considering 961/961 (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-943230894271009752.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15207749407930373778.kers'
[2026-05-31 23:06:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-943230894271009752.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15207749407930373778.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 961 rows 184 cols 11669 entries
Finished phase 1 with 164 SingleSign rule and 3 generalized
[2026-05-31 23:06:03] [INFO ] Computed 17 invariants in 13 ms
Computed 17 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-15207749407930373778.kers
Total runtime 17 ms.
[2026-05-31 23:06:04] [INFO ] Implicit Places using invariants in 663 ms returned []
[2026-05-31 23:06:04] [INFO ] Invariant cache hit.
[2026-05-31 23:06:05] [INFO ] Implicit Places using invariants and state equation in 983 ms returned []
Implicit Place search using SMT with State Equation took 1672 ms to find 0 implicit places.
Running 960 sub problems to find dead transitions.
[2026-05-31 23:06:05] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/1145 variables, and 27 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/184 constraints, PredecessorRefiner: 960/186 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/1145 variables, and 29 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/184 constraints, PredecessorRefiner: 774/186 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62196ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 62248ms
Finished structural reductions in LTL mode , in 1 iterations and 63992 ms. Remains : 184/184 places, 961/961 transitions.
Support contains 31 out of 184 places after structural reductions.
[2026-05-31 23:07:08] [INFO ] Flatten gal took : 486 ms
[2026-05-31 23:07:08] [INFO ] Flatten gal took : 196 ms
[2026-05-31 23:07:09] [INFO ] Input system was already deterministic with 961 transitions.
RANDOM walk for 40000 steps (8 resets) in 5195 ms. (7 steps per ms) remains 12/22 properties
BEST_FIRST walk for 40001 steps (8 resets) in 540 ms. (73 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (8 resets) in 540 ms. (73 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 358 ms. (111 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 736 ms. (54 steps per ms) remains 8/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 424 ms. (94 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (8 resets) in 722 ms. (55 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (8 resets) in 709 ms. (56 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (8 resets) in 721 ms. (55 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (8 resets) in 517 ms. (77 steps per ms) remains 7/8 properties
[2026-05-31 23:07:12] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 98/112 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 61/173 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 11/184 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 961/1145 variables, 184/201 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1145 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/1145 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1145/1145 variables, and 201 constraints, problems are : Problem set: 0 solved, 7 unsolved in 871 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 98/112 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 61/173 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 11/184 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 961/1145 variables, 184/201 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1145 variables, 7/208 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1145 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SMT process timed out in 6027ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 961/961 transitions.
Graph (trivial) has 141 edges and 184 vertex of which 9 / 184 are part of one of the 4 SCC in 10 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 179 transition count 924
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 38 rules applied. Total rules applied 66 place count 152 transition count 913
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 74 place count 145 transition count 912
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 77 place count 144 transition count 910
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 78 place count 143 transition count 910
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 78 place count 143 transition count 898
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 102 place count 131 transition count 898
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 112 place count 121 transition count 420
Iterating global reduction 5 with 10 rules applied. Total rules applied 122 place count 121 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 122 place count 121 transition count 418
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 126 place count 119 transition count 418
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 129 place count 116 transition count 308
Ensure Unique test removed 1 places
Iterating global reduction 5 with 4 rules applied. Total rules applied 133 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 134 place count 114 transition count 236
Iterating global reduction 5 with 1 rules applied. Total rules applied 135 place count 114 transition count 236
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 5 with 70 rules applied. Total rules applied 205 place count 79 transition count 201
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 209 place count 79 transition count 197
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 213 place count 75 transition count 178
Iterating global reduction 6 with 4 rules applied. Total rules applied 217 place count 75 transition count 178
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 218 place count 74 transition count 154
Iterating global reduction 6 with 1 rules applied. Total rules applied 219 place count 74 transition count 154
Performed 7 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 233 place count 67 transition count 172
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 245 place count 67 transition count 160
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 247 place count 65 transition count 156
Iterating global reduction 7 with 2 rules applied. Total rules applied 249 place count 65 transition count 156
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 259 place count 65 transition count 146
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 261 place count 64 transition count 159
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 262 place count 64 transition count 158
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 272 place count 64 transition count 148
Free-agglomeration rule applied 10 times.
Iterating global reduction 9 with 10 rules applied. Total rules applied 282 place count 64 transition count 138
Reduce places removed 10 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 297 place count 54 transition count 133
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 302 place count 54 transition count 128
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 303 place count 54 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 304 place count 53 transition count 150
Applied a total of 304 rules in 401 ms. Remains 53 /184 variables (removed 131) and now considering 150/961 (removed 811) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 401 ms. Remains : 53/184 places, 150/961 transitions.
RANDOM walk for 3493 steps (0 resets) in 153 ms. (22 steps per ms) remains 0/7 properties
FORMULA ErlangenMainframeV1-PT-bP06C06-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 20 stabilizing places and 20 stable 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&&(p1||X(X(p2)))))||X(p3)))'
Support contains 5 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 961/961 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 164 transition count 450
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 164 transition count 450
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 56 place count 148 transition count 275
Ensure Unique test removed 2 places
Iterating global reduction 0 with 18 rules applied. Total rules applied 74 place count 146 transition count 275
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 80 place count 140 transition count 184
Ensure Unique test removed 1 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 87 place count 139 transition count 184
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 90 place count 136 transition count 176
Iterating global reduction 0 with 3 rules applied. Total rules applied 93 place count 136 transition count 176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 94 place count 135 transition count 174
Iterating global reduction 0 with 1 rules applied. Total rules applied 95 place count 135 transition count 174
Applied a total of 95 rules in 20 ms. Remains 135 /184 variables (removed 49) and now considering 174/961 (removed 787) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7875354321300593178.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4532517639316588014.kers'
[2026-05-31 23:07:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7875354321300593178.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4532517639316588014.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 174 rows 135 cols 523 entries
Finished phase 1 with 119 SingleSign rule and 2 generalized
[2026-05-31 23:07:19] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4532517639316588014.kers
Total runtime 1 ms.
[2026-05-31 23:07:19] [INFO ] Implicit Places using invariants in 82 ms returned [43]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 84 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/184 places, 174/961 transitions.
Applied a total of 0 rules in 4 ms. Remains 134 /134 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 110 ms. Remains : 134/184 places, 174/961 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&&(p1||X(X(p2)))))||X(p3)))'
Stuttering acceptance computed with spot in 457 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p2)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), true, (NOT p2), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP06C06-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 2 ms.
FORMULA ErlangenMainframeV1-PT-bP06C06-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP06C06-LTLCardinality-00 finished in 677 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((F(p0) U p1)))'
Support contains 3 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 961/961 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 163 transition count 426
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 163 transition count 426
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 59 place count 146 transition count 225
Ensure Unique test removed 3 places
Iterating global reduction 0 with 20 rules applied. Total rules applied 79 place count 143 transition count 225
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 86 place count 136 transition count 177
Ensure Unique test removed 1 places
Iterating global reduction 0 with 8 rules applied. Total rules applied 94 place count 135 transition count 177
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 97 place count 132 transition count 171
Iterating global reduction 0 with 3 rules applied. Total rules applied 100 place count 132 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 101 place count 131 transition count 169
Iterating global reduction 0 with 1 rules applied. Total rules applied 102 place count 131 transition count 169
Applied a total of 102 rules in 22 ms. Remains 131 /184 variables (removed 53) and now considering 169/961 (removed 792) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-545817798071592032.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1361298958391414697.kers'
[2026-05-31 23:07:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-545817798071592032.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1361298958391414697.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 169 rows 131 cols 482 entries
Finished phase 1 with 117 SingleSign rule and 1 generalized
[2026-05-31 23:07:19] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1361298958391414697.kers
Total runtime 1 ms.
[2026-05-31 23:07:19] [INFO ] Implicit Places using invariants in 66 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 130/184 places, 169/961 transitions.
Applied a total of 0 rules in 2 ms. Remains 130 /130 variables (removed 0) and now considering 169/169 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 92 ms. Remains : 130/184 places, 169/961 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((F(p0) U p1)))'
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP06C06-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 393 ms.
Product exploration explored 100000 steps with 50000 reset in 172 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 7 factoid took 15 ms. Proved property starting from automaton with 3 states, 4 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 22 ms.
FORMULA ErlangenMainframeV1-PT-bP06C06-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV1-PT-bP06C06-LTLCardinality-02 finished in 817 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) U (p0&&X(X(p1))))))'
Support contains 3 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 961/961 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 163 transition count 652
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 163 transition count 652
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 57 place count 148 transition count 323
Ensure Unique test removed 2 places
Iterating global reduction 0 with 17 rules applied. Total rules applied 74 place count 146 transition count 323
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 80 place count 140 transition count 192
Ensure Unique test removed 1 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 87 place count 139 transition count 192
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 91 place count 135 transition count 178
Iterating global reduction 0 with 4 rules applied. Total rules applied 95 place count 135 transition count 178
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 96 place count 134 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 97 place count 134 transition count 176
Applied a total of 97 rules in 15 ms. Remains 134 /184 variables (removed 50) and now considering 176/961 (removed 785) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2862847648867909193.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6422341876129052745.kers'
[2026-05-31 23:07:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2862847648867909193.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6422341876129052745.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 176 rows 134 cols 567 entries
Finished phase 1 with 118 SingleSign rule and 2 generalized
[2026-05-31 23:07:20] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-6422341876129052745.kers
Total runtime 4 ms.
[2026-05-31 23:07:20] [INFO ] Implicit Places using invariants in 78 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 81 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/184 places, 176/961 transitions.
Applied a total of 0 rules in 2 ms. Remains 133 /133 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 99 ms. Remains : 133/184 places, 176/961 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) U (X(X(p1))&&p0))))'
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP06C06-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 208 ms.
Product exploration explored 100000 steps with 0 reset in 304 ms.
Computed a total of 17 stabilizing places and 17 stable transitions
Computed a total of 17 stabilizing places and 17 stable transitions
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 492 ms. (81 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 233 ms. (170 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (8 resets) in 190 ms. (209 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11222981638094437282.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15222960135151279999.kers'
[2026-05-31 23:07:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11222981638094437282.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15222960135151279999.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 176 rows 133 cols 557 entries
Finished phase 1 with 118 SingleSign rule and 2 generalized
[2026-05-31 23:07:21] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15222960135151279999.kers
Total runtime 2 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 84/102 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 31/133 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 176/309 variables, 133/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/309 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 146 constraints, problems are : Problem set: 0 solved, 2 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 84/102 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 31/133 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 176/309 variables, 133/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/309 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 148 constraints, problems are : Problem set: 0 solved, 2 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 459ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 173 steps, including 3 resets, run visited all 2 properties in 4 ms. (steps per millisecond=43 )
Parikh walk visited 2 properties in 12 ms.
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
[2026-05-31 23:07:22] [INFO ] Invariant cache hit.
[2026-05-31 23:07:22] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
Proved EG (NOT p1) asserting that LTL formula F !(NOT p1) is false.
Negative knowledge disproves property using: (F p1)
Knowledge-based reduction took 1373 ms.
FORMULA ErlangenMainframeV1-PT-bP06C06-LTLCardinality-03 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property ErlangenMainframeV1-PT-bP06C06-LTLCardinality-03 finished in 2248 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&&F(p1)))))))'
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 961/961 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 162 transition count 640
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 162 transition count 640
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 60 place count 146 transition count 273
Ensure Unique test removed 3 places
Iterating global reduction 0 with 19 rules applied. Total rules applied 79 place count 143 transition count 273
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 86 place count 136 transition count 181
Ensure Unique test removed 1 places
Iterating global reduction 0 with 8 rules applied. Total rules applied 94 place count 135 transition count 181
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 98 place count 131 transition count 171
Iterating global reduction 0 with 4 rules applied. Total rules applied 102 place count 131 transition count 171
Applied a total of 102 rules in 21 ms. Remains 131 /184 variables (removed 53) and now considering 171/961 (removed 790) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5014681835858487518.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7825641703522778165.kers'
[2026-05-31 23:07:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5014681835858487518.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7825641703522778165.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 171 rows 131 cols 504 entries
Finished phase 1 with 117 SingleSign rule and 1 generalized
[2026-05-31 23:07:22] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7825641703522778165.kers
Total runtime 2 ms.
[2026-05-31 23:07:23] [INFO ] Implicit Places using invariants in 112 ms returned [42]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 113 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 130/184 places, 171/961 transitions.
Applied a total of 0 rules in 2 ms. Remains 130 /130 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 137 ms. Remains : 130/184 places, 171/961 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((F(p0)&&p1))))))'
Stuttering acceptance computed with spot in 263 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP06C06-LTLCardinality-04
Product exploration explored 100000 steps with 25000 reset in 150 ms.
Product exploration explored 100000 steps with 25000 reset in 136 ms.
Computed a total of 17 stabilizing places and 17 stable transitions
Computed a total of 17 stabilizing places and 17 stable transitions
Knowledge based reduction with 1 factoid took 116 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 298 ms. (133 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6488145715076952588.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-285447201681439576.kers'
[2026-05-31 23:07:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6488145715076952588.kers, --Pflows, --basisKERS=/tmp/petrispot-output-285447201681439576.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 171 rows 130 cols 499 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-31 23:07:23] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-285447201681439576.kers
Total runtime 3 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 106/130 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 171/301 variables, 130/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/301 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 142 constraints, problems are : Problem set: 0 solved, 1 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 130/130 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 106/130 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 171/301 variables, 130/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/301 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 143 constraints, problems are : Problem set: 0 solved, 1 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 391ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 57 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=57 )
Parikh walk visited 1 properties in 6 ms.
Knowledge based reduction with 1 factoid took 109 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Knowledge-based reduction took 1018 ms.
Stuttering acceptance computed with spot in 259 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 171/171 transitions.
Applied a total of 0 rules in 1 ms. Remains 130 /130 variables (removed 0) and now considering 171/171 (removed 0) transitions.
[2026-05-31 23:07:24] [INFO ] Invariant cache hit.
[2026-05-31 23:07:25] [INFO ] Implicit Places using invariants in 112 ms returned []
[2026-05-31 23:07:25] [INFO ] Invariant cache hit.
[2026-05-31 23:07:25] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2026-05-31 23:07:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 171/301 variables, 130/143 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 0/301 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 143 constraints, problems are : Problem set: 0 solved, 170 unsolved in 13198 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 171/301 variables, 130/143 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 170/313 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 7/320 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (OVERLAPS) 0/301 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 321 constraints, problems are : Problem set: 0 solved, 170 unsolved in 20548 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 33779ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 33781ms
Finished structural reductions in LTL mode , in 1 iterations and 34129 ms. Remains : 130/130 places, 171/171 transitions.
Computed a total of 17 stabilizing places and 17 stable transitions
Computed a total of 17 stabilizing places and 17 stable transitions
Knowledge based reduction with 1 factoid took 75 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 114 ms. (347 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
[2026-05-31 23:07:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 106/130 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 171/301 variables, 130/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/301 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 142 constraints, problems are : Problem set: 0 solved, 1 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 130/130 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 106/130 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 171/301 variables, 130/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/301 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 143 constraints, problems are : Problem set: 0 solved, 1 unsolved in 202 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 385ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 52 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=26 )
Parikh walk visited 1 properties in 1 ms.
Knowledge based reduction with 1 factoid took 101 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Knowledge-based reduction took 860 ms.
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 253 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 106 ms.
Product exploration explored 100000 steps with 25000 reset in 120 ms.
Spot run failed in 147 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/ltsmin1237209802922769534
[2026-05-31 23:08:00] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1237209802922769534
Running compilation step : cd /tmp/ltsmin1237209802922769534;'/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 902 ms.
Running link step : cd /tmp/ltsmin1237209802922769534;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin1237209802922769534;'/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/stateBased1674295463949238218.hoa' '--buchi-type=spotba'
LTSmin run took 72 ms.
FORMULA ErlangenMainframeV1-PT-bP06C06-LTLCardinality-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ErlangenMainframeV1-PT-bP06C06-LTLCardinality-04 finished in 39027 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((F(p1)||p0)))'
Support contains 3 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 961/961 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 163 transition count 426
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 163 transition count 426
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 57 place count 148 transition count 228
Ensure Unique test removed 2 places
Iterating global reduction 0 with 17 rules applied. Total rules applied 74 place count 146 transition count 228
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 79 place count 141 transition count 185
Iterating global reduction 0 with 5 rules applied. Total rules applied 84 place count 141 transition count 185
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 86 place count 139 transition count 181
Iterating global reduction 0 with 2 rules applied. Total rules applied 88 place count 139 transition count 181
Applied a total of 88 rules in 19 ms. Remains 139 /184 variables (removed 45) and now considering 181/961 (removed 780) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2957613557620522524.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12337861162322347735.kers'
[2026-05-31 23:08:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2957613557620522524.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12337861162322347735.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 181 rows 139 cols 605 entries
Finished phase 1 with 122 SingleSign rule and 2 generalized
[2026-05-31 23:08:01] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12337861162322347735.kers
Total runtime 2 ms.
[2026-05-31 23:08:02] [INFO ] Implicit Places using invariants in 132 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 138 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 138/184 places, 181/961 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 181/181 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 160 ms. Remains : 138/184 places, 181/961 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((F(p1)||p0)))'
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP06C06-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 108 ms.
Product exploration explored 100000 steps with 50000 reset in 169 ms.
Computed a total of 17 stabilizing places and 17 stable transitions
Computed a total of 17 stabilizing places and 17 stable transitions
Knowledge based reduction with 5 factoid took 58 ms. Proved property starting from automaton with 3 states, 3 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 60 ms.
FORMULA ErlangenMainframeV1-PT-bP06C06-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV1-PT-bP06C06-LTLCardinality-05 finished in 682 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(G((p0||(F(p1) U X((p2 U X(p3)))))))))'
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 961/961 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 164 transition count 450
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 164 transition count 450
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 55 place count 149 transition count 276
Ensure Unique test removed 2 places
Iterating global reduction 0 with 17 rules applied. Total rules applied 72 place count 147 transition count 276
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 78 place count 141 transition count 185
Ensure Unique test removed 1 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 85 place count 140 transition count 185
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 88 place count 137 transition count 177
Iterating global reduction 0 with 3 rules applied. Total rules applied 91 place count 137 transition count 177
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 92 place count 136 transition count 175
Iterating global reduction 0 with 1 rules applied. Total rules applied 93 place count 136 transition count 175
Applied a total of 93 rules in 11 ms. Remains 136 /184 variables (removed 48) and now considering 175/961 (removed 786) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11984206250237299897.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1848370359369224635.kers'
[2026-05-31 23:08:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11984206250237299897.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1848370359369224635.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 175 rows 136 cols 525 entries
Finished phase 1 with 120 SingleSign rule and 2 generalized
[2026-05-31 23:08:02] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1848370359369224635.kers
Total runtime 2 ms.
[2026-05-31 23:08:02] [INFO ] Implicit Places using invariants in 84 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 135/184 places, 175/961 transitions.
Applied a total of 0 rules in 0 ms. Remains 135 /135 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 101 ms. Remains : 135/184 places, 175/961 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(G(((F(p0) U X((p1 U X(p2))))||p3)))))'
Stuttering acceptance computed with spot in 396 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP06C06-LTLCardinality-08
Product exploration explored 100000 steps with 16640 reset in 133 ms.
Product exploration explored 100000 steps with 16701 reset in 151 ms.
Computed a total of 17 stabilizing places and 17 stable transitions
Computed a total of 17 stabilizing places and 17 stable transitions
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 9 states, 13 edges and 4 AP (stutter sensitive) to 9 states, 13 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 200 ms. (199 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40000 steps (8 resets) in 119 ms. (333 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 124 ms. (320 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 216 ms. (184 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 98 ms. (404 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 110 ms. (360 steps per ms) remains 5/5 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2160564536561528020.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12730797539144960799.kers'
[2026-05-31 23:08:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2160564536561528020.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12730797539144960799.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 175 rows 135 cols 519 entries
Finished phase 1 with 120 SingleSign rule and 2 generalized
[2026-05-31 23:08:03] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12730797539144960799.kers
Total runtime 2 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 38/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 60/104 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 31/135 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 175/310 variables, 135/148 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/310 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 148 constraints, problems are : Problem set: 0 solved, 5 unsolved in 383 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 135/135 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 38/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 60/104 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf2 is UNSAT
Problem apf3 is UNSAT
At refinement iteration 5 (OVERLAPS) 31/135 variables, 6/13 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 175/310 variables, 135/148 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 3/151 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 1/152 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 0/152 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/310 variables, 0/152 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 152 constraints, problems are : Problem set: 2 solved, 3 unsolved in 567 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 963ms problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 55 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=55 )
Parikh walk visited 3 properties in 19 ms.
Found 2 invariant AP formulas.
Knowledge based reduction with 6 factoid took 181 ms. Reduced automaton from 9 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p2), (NOT p2)]
Knowledge-based reduction took 1854 ms.
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p2), (NOT p2)]
Support contains 2 out of 135 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 175/175 transitions.
Applied a total of 0 rules in 2 ms. Remains 135 /135 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2026-05-31 23:08:05] [INFO ] Invariant cache hit.
[2026-05-31 23:08:05] [INFO ] Implicit Places using invariants in 109 ms returned []
[2026-05-31 23:08:05] [INFO ] Invariant cache hit.
[2026-05-31 23:08:05] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2026-05-31 23:08:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/135 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 175/310 variables, 135/151 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 0/310 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 151 constraints, problems are : Problem set: 0 solved, 174 unsolved in 15475 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/135 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 175/310 variables, 135/152 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 174/326 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/310 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 12 (OVERLAPS) 0/310 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 331 constraints, problems are : Problem set: 0 solved, 174 unsolved in 27685 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 43189ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 43190ms
Finished structural reductions in LTL mode , in 1 iterations and 43520 ms. Remains : 135/135 places, 175/175 transitions.
Computed a total of 17 stabilizing places and 17 stable transitions
Computed a total of 17 stabilizing places and 17 stable transitions
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 7376 steps (2 resets) in 43 ms. (167 steps per ms) remains 0/2 properties
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p2), (NOT p2)]
Knowledge-based reduction took 471 ms.
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 16683 reset in 114 ms.
Product exploration explored 100000 steps with 16674 reset in 136 ms.
Spot run failed in 82 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/ltsmin3119029610239066249
[2026-05-31 23:08:50] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3119029610239066249
Running compilation step : cd /tmp/ltsmin3119029610239066249;'/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 646 ms.
Running link step : cd /tmp/ltsmin3119029610239066249;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin3119029610239066249;'/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/stateBased16612812291267510026.hoa' '--buchi-type=spotba'
LTSmin run took 45 ms.
FORMULA ErlangenMainframeV1-PT-bP06C06-LTLCardinality-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ErlangenMainframeV1-PT-bP06C06-LTLCardinality-08 finished in 48587 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)))'
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 961/961 transitions.
Graph (trivial) has 164 edges and 184 vertex of which 9 / 184 are part of one of the 4 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 178 transition count 917
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 50 rules applied. Total rules applied 88 place count 141 transition count 904
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 96 place count 133 transition count 904
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 96 place count 133 transition count 890
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 124 place count 119 transition count 890
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 138 place count 105 transition count 362
Ensure Unique test removed 1 places
Iterating global reduction 3 with 15 rules applied. Total rules applied 153 place count 104 transition count 362
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 153 place count 104 transition count 360
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 157 place count 102 transition count 360
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 166 place count 93 transition count 167
Ensure Unique test removed 4 places
Iterating global reduction 3 with 13 rules applied. Total rules applied 179 place count 89 transition count 167
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 185 place count 83 transition count 119
Iterating global reduction 3 with 6 rules applied. Total rules applied 191 place count 83 transition count 119
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 194 place count 80 transition count 113
Iterating global reduction 3 with 3 rules applied. Total rules applied 197 place count 80 transition count 113
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 257 place count 50 transition count 83
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 261 place count 50 transition count 79
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 264 place count 47 transition count 72
Iterating global reduction 4 with 3 rules applied. Total rules applied 267 place count 47 transition count 72
Performed 13 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 293 place count 34 transition count 90
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 307 place count 34 transition count 76
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 310 place count 31 transition count 70
Iterating global reduction 5 with 3 rules applied. Total rules applied 313 place count 31 transition count 70
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 324 place count 31 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 326 place count 30 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 345 place count 30 transition count 46
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 346 place count 29 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 347 place count 28 transition count 45
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 351 place count 28 transition count 41
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 7 with 1 rules applied. Total rules applied 352 place count 28 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 353 place count 27 transition count 40
Applied a total of 353 rules in 119 ms. Remains 27 /184 variables (removed 157) and now considering 40/961 (removed 921) transitions.
[2026-05-31 23:08:51] [INFO ] Flow matrix only has 30 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17959617088799323682.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3499126209241267962.kers'
[2026-05-31 23:08:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17959617088799323682.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3499126209241267962.kers]
Normalized transition count is 29 out of 30 initially.
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 29 rows 18 cols 63 entries
Finished phase 1 with 16 SingleSign rule and 0 generalized
[2026-05-31 23:08:51] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3499126209241267962.kers
Total runtime 0 ms.
[2026-05-31 23:08:51] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-31 23:08:51] [INFO ] Flow matrix only has 30 transitions (discarded 10 similar events)
[2026-05-31 23:08:51] [INFO ] Invariant cache hit.
[2026-05-31 23:08:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-31 23:08:51] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2026-05-31 23:08:51] [INFO ] Redundant transitions in 1 ms returned []
Running 21 sub problems to find dead transitions.
[2026-05-31 23:08:51] [INFO ] Flow matrix only has 30 transitions (discarded 10 similar events)
[2026-05-31 23:08:51] [INFO ] Invariant cache hit.
[2026-05-31 23:08:51] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 5/27 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 29/56 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/57 variables, and 41 constraints, problems are : Problem set: 0 solved, 21 unsolved in 685 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 27/27 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 5/27 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 29/56 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 21/62 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/56 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/57 variables, and 62 constraints, problems are : Problem set: 0 solved, 21 unsolved in 689 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 27/27 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1384ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 1384ms
Starting structural reductions in SI_LTL mode, iteration 1 : 27/184 places, 40/961 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1654 ms. Remains : 27/184 places, 40/961 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)))'
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP06C06-LTLCardinality-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV1-PT-bP06C06-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP06C06-LTLCardinality-12 finished in 1807 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)||F(((!p1||X(X((!p2&&X(!p1))))) U (G((!p1||X(X((!p2&&X(!p1))))))||(!p3&&(!p1||X(X((!p2&&X(!p1)))))))))))'
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 961/961 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 164 transition count 430
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 164 transition count 430
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 54 place count 150 transition count 233
Ensure Unique test removed 2 places
Iterating global reduction 0 with 16 rules applied. Total rules applied 70 place count 148 transition count 233
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 74 place count 144 transition count 191
Iterating global reduction 0 with 4 rules applied. Total rules applied 78 place count 144 transition count 191
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 143 transition count 189
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 143 transition count 189
Applied a total of 80 rules in 19 ms. Remains 143 /184 variables (removed 41) and now considering 189/961 (removed 772) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5872651018026140297.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-671232593025733930.kers'
[2026-05-31 23:08:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5872651018026140297.kers, --Pflows, --basisKERS=/tmp/petrispot-output-671232593025733930.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 189 rows 143 cols 637 entries
Finished phase 1 with 126 SingleSign rule and 2 generalized
[2026-05-31 23:08:53] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-671232593025733930.kers
Total runtime 2 ms.
[2026-05-31 23:08:53] [INFO ] Implicit Places using invariants in 138 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 139 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/184 places, 189/961 transitions.
Applied a total of 0 rules in 2 ms. Remains 142 /142 variables (removed 0) and now considering 189/189 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 160 ms. Remains : 142/184 places, 189/961 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)||F(((!p1||X(X((!p2&&X(!p1))))) U (G((!p1||X(X((!p2&&X(!p1))))))||(!p3&&(!p1||X(X((!p2&&X(!p1)))))))))))'
Stuttering acceptance computed with spot in 979 ms :[(AND (NOT p0) p1), p1, p1, (AND (NOT p0) p1), p1, p1, (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, p1, p1, (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP06C06-LTLCardinality-14
Product exploration explored 100000 steps with 0 reset in 165 ms.
Stack based approach found an accepted trace after 141 steps with 0 reset with depth 142 and stack size 141 in 1 ms.
FORMULA ErlangenMainframeV1-PT-bP06C06-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV1-PT-bP06C06-LTLCardinality-14 finished in 1398 ms.
All properties solved by simple procedures.
Total runtime 173661 ms.

BK_STOP 1780268934461

--------------------
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="ErlangenMainframeV1-PT-bP06C06"
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 ErlangenMainframeV1-PT-bP06C06, 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 r338-smll-178021499100091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ErlangenMainframeV1-PT-bP06C06.tgz
mv ErlangenMainframeV1-PT-bP06C06 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;