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.r114-smll-177955740600452.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 ErlangenMainframeV0-PT-0909, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-177955740600452
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 64M
-rw-r--r-- 1 mcc users 6.5K Mar 7 04:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 7 04:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 7 04:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Mar 7 04:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 09:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 09:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 09:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 04:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Mar 7 04:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 7 04:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Mar 7 04:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 09:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 64M Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ErlangenMainframeV0-PT-0909-LTLFireability-00
FORMULA_NAME ErlangenMainframeV0-PT-0909-LTLFireability-01
FORMULA_NAME ErlangenMainframeV0-PT-0909-LTLFireability-02
FORMULA_NAME ErlangenMainframeV0-PT-0909-LTLFireability-03
FORMULA_NAME ErlangenMainframeV0-PT-0909-LTLFireability-04
FORMULA_NAME ErlangenMainframeV0-PT-0909-LTLFireability-05
FORMULA_NAME ErlangenMainframeV0-PT-0909-LTLFireability-06
FORMULA_NAME ErlangenMainframeV0-PT-0909-LTLFireability-07
FORMULA_NAME ErlangenMainframeV0-PT-0909-LTLFireability-08
FORMULA_NAME ErlangenMainframeV0-PT-0909-LTLFireability-09
FORMULA_NAME ErlangenMainframeV0-PT-0909-LTLFireability-10
FORMULA_NAME ErlangenMainframeV0-PT-0909-LTLFireability-11
FORMULA_NAME ErlangenMainframeV0-PT-0909-LTLFireability-12
FORMULA_NAME ErlangenMainframeV0-PT-0909-LTLFireability-13
FORMULA_NAME ErlangenMainframeV0-PT-0909-LTLFireability-14
FORMULA_NAME ErlangenMainframeV0-PT-0909-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779871101880

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV0-PT-0909
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-27 08:38:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-27 08:38:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 08:38:27] [INFO ] Load time of PNML (sax parser for PT used): 3695 ms
[2026-05-27 08:38:27] [INFO ] Transformed 283 places.
[2026-05-27 08:38:28] [INFO ] Transformed 59341 transitions.
[2026-05-27 08:38:28] [INFO ] Found NUPN structural information;
[2026-05-27 08:38:28] [INFO ] Parsed PT model containing 283 places and 59341 transitions and 1260524 arcs in 4323 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 44 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ErlangenMainframeV0-PT-0909-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 59341/59341 transitions.
Discarding 73 places :
Symmetric choice reduction at 0 with 73 rule applications. Total rules 73 place count 210 transition count 59268
Iterating global reduction 0 with 73 rules applied. Total rules applied 146 place count 210 transition count 59268
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 186 place count 170 transition count 59228
Iterating global reduction 0 with 40 rules applied. Total rules applied 226 place count 170 transition count 59228
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 229 place count 167 transition count 59225
Iterating global reduction 0 with 3 rules applied. Total rules applied 232 place count 167 transition count 59225
Applied a total of 232 rules in 1857 ms. Remains 167 /283 variables (removed 116) and now considering 59225/59341 (removed 116) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10133598991316281118.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4938510289478273461.kers'
[2026-05-27 08:38:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10133598991316281118.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4938510289478273461.kers]
Culled 0 columns in 216 ms.
// Phase 1: matrix 59225 rows 167 cols 1260292 entries
Finished phase 1 with 140 SingleSign rule and 3 generalized
[2026-05-27 08:38:33] [INFO ] Computed 24 invariants in 1068 ms
Computed 24 P flows in 1070 ms.
Exported basis to /tmp/petrispot-output-4938510289478273461.kers
Total runtime 1243 ms.
[2026-05-27 08:38:33] [INFO ] Implicit Places using invariants in 2538 ms returned []
Implicit Place search using SMT only with invariants took 2589 ms to find 0 implicit places.
Running 59224 sub problems to find dead transitions.
[2026-05-27 08:38:34] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
SMT process timed out in 357202ms, After SMT, problems are : Problem set: 0 solved, 59224 unsolved
Search for dead transitions found 0 dead transitions in 357818ms
Starting structural reductions in LTL mode, iteration 1 : 167/283 places, 59225/59341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 362632 ms. Remains : 167/283 places, 59225/59341 transitions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 59225/59225 transitions.
Applied a total of 0 rules in 353 ms. Remains 167 /167 variables (removed 0) and now considering 59225/59225 (removed 0) transitions.
[2026-05-27 08:44:32] [INFO ] Invariant cache hit.
[2026-05-27 08:44:32] [INFO ] Implicit Places using invariants in 157 ms returned []
Implicit Place search using SMT only with invariants took 158 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 526 ms. Remains : 167/167 places, 59225/59225 transitions.
Support contains 58 out of 167 places after structural reductions.
[2026-05-27 08:44:40] [INFO ] Flatten gal took : 7270 ms
[2026-05-27 08:44:48] [INFO ] Flatten gal took : 7822 ms
[2026-05-27 08:45:00] [INFO ] Input system was already deterministic with 59225 transitions.
RANDOM walk for 40000 steps (8 resets) in 30554 ms. (1 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 156 ms. (25 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 162 ms. (24 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 183 ms. (21 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 150 ms. (26 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 162 ms. (24 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 158 ms. (25 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 218 ms. (18 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 148 ms. (26 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 119 ms. (33 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 108 ms. (36 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 132 ms. (30 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 120 ms. (33 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 109 ms. (36 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 123 ms. (32 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 122 ms. (32 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 116 ms. (34 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 144 ms. (27 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 122 ms. (32 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 152 ms. (26 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 230 ms. (17 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 135 ms. (29 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 136 ms. (29 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 124 ms. (32 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 135 ms. (29 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 123 ms. (32 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 156 ms. (25 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 143 ms. (27 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 116 ms. (34 steps per ms) remains 35/35 properties
Interrupted probabilistic random walk after 50180 steps, run timeout after 27002 ms. (steps per millisecond=1 ) properties seen :0 out of 35
Probabilistic random walk after 50180 steps, saw 32353 distinct states, run finished after 27014 ms. (steps per millisecond=1 ) properties seen :0
[2026-05-27 08:45:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 1 (OVERLAPS) 28/86 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 34 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 86/59392 variables, and 11 constraints, problems are : Problem set: 1 solved, 34 unsolved in 5739 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 0/9 constraints, State Equation: 0/167 constraints, PredecessorRefiner: 35/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 28/86 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 34 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 86/59392 variables, and 11 constraints, problems are : Problem set: 1 solved, 34 unsolved in 5378 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 0/9 constraints, State Equation: 0/167 constraints, PredecessorRefiner: 34/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12007ms problems are : Problem set: 1 solved, 34 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 58 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 59225/59225 transitions.
Graph (trivial) has 82 edges and 167 vertex of which 4 / 167 are part of one of the 2 SCC in 26 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 165 transition count 59208
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 152 transition count 59208
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 27 place count 152 transition count 59191
Deduced a syphon composed of 17 places in 73 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 61 place count 135 transition count 59191
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 133 transition count 59174
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 133 transition count 59174
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 133 transition count 59172
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 25 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 125 place count 104 transition count 59143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 2 places in 23 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 129 place count 102 transition count 59164
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 134 place count 102 transition count 59159
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 141 place count 97 transition count 59157
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 143 place count 97 transition count 59157
Partial Post-agglomeration rule applied 9 times.
Drop transitions (Partial Post agglomeration) removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 152 place count 97 transition count 59157
Applied a total of 152 rules in 11061 ms. Remains 97 /167 variables (removed 70) and now considering 59157/59225 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11065 ms. Remains : 97/167 places, 59157/59225 transitions.
RANDOM walk for 40000 steps (8 resets) in 50244 ms. (0 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 462 ms. (8 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 597 ms. (6 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 746 ms. (5 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 574 ms. (6 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 685 ms. (5 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 538 ms. (7 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 480 ms. (8 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 549 ms. (7 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 532 ms. (7 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 477 ms. (8 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 562 ms. (7 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 411 ms. (9 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 483 ms. (8 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 480 ms. (8 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 495 ms. (8 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 451 ms. (8 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 516 ms. (7 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 474 ms. (8 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 551 ms. (7 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 563 ms. (7 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 533 ms. (7 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 544 ms. (7 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 558 ms. (7 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 524 ms. (7 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 512 ms. (7 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 478 ms. (8 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 538 ms. (7 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 464 ms. (8 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 386 ms. (10 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 472 ms. (8 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 481 ms. (8 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 560 ms. (7 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 521 ms. (7 steps per ms) remains 33/33 properties
Interrupted probabilistic random walk after 175945 steps, run timeout after 54001 ms. (steps per millisecond=3 ) properties seen :0 out of 33
Probabilistic random walk after 175945 steps, saw 26680 distinct states, run finished after 54001 ms. (steps per millisecond=3 ) properties seen :0
[2026-05-27 08:47:14] [INFO ] Flow matrix only has 59141 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4632304989267333376.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7396510275233031037.kers'
[2026-05-27 08:47:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4632304989267333376.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7396510275233031037.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 326 ms.
// Phase 1: matrix 59141 rows 96 cols 1260054 entries
Finished phase 1 with 70 SingleSign rule and 3 generalized
[2026-05-27 08:47:16] [INFO ] Computed 24 invariants in 1309 ms
Computed 24 P flows in 1310 ms.
Exported basis to /tmp/petrispot-output-7396510275233031037.kers
Total runtime 1595 ms.
[2026-05-27 08:47:16] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 7/65 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 7/72 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 25/97 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 59238/59238 variables, and 121 constraints, problems are : Problem set: 0 solved, 33 unsolved in 45015 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 97/97 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 33/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 7/65 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 7/72 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 25/97 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 97/59238 variables, and 24 constraints, problems are : Problem set: 0 solved, 33 unsolved in 45058 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/97 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 33/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 92512ms problems are : Problem set: 0 solved, 33 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 58 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 59157/59157 transitions.
Applied a total of 0 rules in 1242 ms. Remains 97 /97 variables (removed 0) and now considering 59157/59157 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1242 ms. Remains : 97/97 places, 59157/59157 transitions.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Computed a total of 21 stabilizing places and 21 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))'
Support contains 16 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 59225/59225 transitions.
Graph (trivial) has 113 edges and 167 vertex of which 6 / 167 are part of one of the 3 SCC in 3 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 163 transition count 59209
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 151 transition count 59209
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 25 place count 151 transition count 59191
Deduced a syphon composed of 18 places in 57 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 61 place count 133 transition count 59191
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 67 place count 127 transition count 25636
Iterating global reduction 2 with 6 rules applied. Total rules applied 73 place count 127 transition count 25636
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 76 place count 127 transition count 25633
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 79 place count 124 transition count 11782
Iterating global reduction 3 with 3 rules applied. Total rules applied 82 place count 124 transition count 11782
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 83 place count 123 transition count 11780
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 123 transition count 11780
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 3 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 176 place count 77 transition count 11734
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 180 place count 75 transition count 11741
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 182 place count 75 transition count 11739
Applied a total of 182 rules in 48966 ms. Remains 75 /167 variables (removed 92) and now considering 11739/59225 (removed 47486) transitions.
[2026-05-27 08:49:38] [INFO ] Flow matrix only has 11717 transitions (discarded 22 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17232868871026786595.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-654020516832725472.kers'
[2026-05-27 08:49:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17232868871026786595.kers, --Pflows, --basisKERS=/tmp/petrispot-output-654020516832725472.kers]
Normalized transition count is 11716 out of 11717 initially.
Culled 0 columns in 67 ms.
// Phase 1: matrix 11716 rows 75 cols 233502 entries
Finished phase 1 with 48 SingleSign rule and 3 generalized
[2026-05-27 08:49:38] [INFO ] Computed 24 invariants in 252 ms
Computed 24 P flows in 253 ms.
Exported basis to /tmp/petrispot-output-654020516832725472.kers
Total runtime 297 ms.
[2026-05-27 08:49:43] [INFO ] Implicit Places using invariants in 4929 ms returned []
Implicit Place search using SMT only with invariants took 4934 ms to find 0 implicit places.
Running 11737 sub problems to find dead transitions.
[2026-05-27 08:49:43] [INFO ] Flow matrix only has 11717 transitions (discarded 22 similar events)
[2026-05-27 08:49:43] [INFO ] Invariant cache hit.
[2026-05-27 08:49:43] [INFO ] State equation strengthened by 5857 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 11737 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 74/11792 variables, and 9 constraints, problems are : Problem set: 0 solved, 11737 unsolved in 30310 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/75 constraints, ReadFeed: 0/5857 constraints, PredecessorRefiner: 11737/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11737 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 11737 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 74/11792 variables, and 9 constraints, problems are : Problem set: 0 solved, 11737 unsolved in 30248 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/75 constraints, ReadFeed: 0/5857 constraints, PredecessorRefiner: 11710/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 83682ms problems are : Problem set: 0 solved, 11737 unsolved
Search for dead transitions found 0 dead transitions in 83766ms
Starting structural reductions in SI_LTL mode, iteration 1 : 75/167 places, 11739/59225 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 137738 ms. Remains : 75/167 places, 11739/59225 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))'
Stuttering acceptance computed with spot in 224 ms :[true, (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0909-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 8576 ms.
Product exploration explored 100000 steps with 0 reset in 8514 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 6611 ms. (6 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1000 ms. (39 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 127213 steps, run timeout after 6001 ms. (steps per millisecond=21 ) properties seen :0 out of 1
Probabilistic random walk after 127213 steps, saw 33984 distinct states, run finished after 6001 ms. (steps per millisecond=21 ) properties seen :0
[2026-05-27 08:51:32] [INFO ] Flow matrix only has 11717 transitions (discarded 22 similar events)
[2026-05-27 08:51:32] [INFO ] Invariant cache hit.
[2026-05-27 08:51:32] [INFO ] State equation strengthened by 5857 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/29 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/44 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/75 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 11791/11792 variables, and 99 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3973 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, ReadFeed: 0/5857 constraints, PredecessorRefiner: 1/0 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/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/29 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/44 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/75 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 11791/11792 variables, and 99 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4139 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 75/75 constraints, ReadFeed: 0/5857 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8317ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 11739/11739 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 75 transition count 11736
Free-agglomeration rule applied 16 times.
Iterating global reduction 1 with 16 rules applied. Total rules applied 19 place count 75 transition count 11720
Reduce places removed 16 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 57 place count 59 transition count 11698
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 65 place count 59 transition count 11690
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 59 transition count 11689
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 71 place count 58 transition count 11685
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 57 transition count 11684
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 75 place count 54 transition count 11684
Applied a total of 75 rules in 63433 ms. Remains 54 /75 variables (removed 21) and now considering 11684/11739 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63433 ms. Remains : 54/75 places, 11684/11739 transitions.
RANDOM walk for 39621 steps (8 resets) in 14721 ms. (2 steps per ms) remains 0/1 properties
Negative knowledge disproves property using: (G p0)
Knowledge based reduction with 3 factoid took 43 ms. Proved property starting from automaton with 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 84208 ms.
FORMULA ErlangenMainframeV0-PT-0909-LTLFireability-00 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-0909-LTLFireability-00 finished in 239407 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' '!(((!p0||X(X(!p1))) U (G((!p0||X(X(!p1))))||((!p0||X(X(!p1)))&&(p1||G(p2))))))'
Support contains 21 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 59225/59225 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 149 transition count 39543
Ensure Unique test removed 9 places
Iterating global reduction 0 with 27 rules applied. Total rules applied 45 place count 140 transition count 39543
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 46 place count 139 transition count 26421
Iterating global reduction 0 with 1 rules applied. Total rules applied 47 place count 139 transition count 26421
Applied a total of 47 rules in 5949 ms. Remains 139 /167 variables (removed 28) and now considering 26421/59225 (removed 32804) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14481804796756216890.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7936746577302894796.kers'
[2026-05-27 08:52:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14481804796756216890.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7936746577302894796.kers]
Culled 0 columns in 59 ms.
// Phase 1: matrix 26421 rows 139 cols 341763 entries
Finished phase 1 with 124 SingleSign rule and 0 generalized
[2026-05-27 08:52:55] [INFO ] Computed 15 invariants in 438 ms
Computed 15 P flows in 440 ms.
Exported basis to /tmp/petrispot-output-7936746577302894796.kers
Total runtime 498 ms.
[2026-05-27 08:52:59] [INFO ] Implicit Places using invariants in 4701 ms returned []
Implicit Place search using SMT only with invariants took 4703 ms to find 0 implicit places.
Running 26420 sub problems to find dead transitions.
[2026-05-27 08:52:59] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 138/26560 variables, and 0 constraints, problems are : Problem set: 0 solved, 26420 unsolved in 30628 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, State Equation: 0/139 constraints, PredecessorRefiner: 26420/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26420 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 138/26560 variables, and 0 constraints, problems are : Problem set: 0 solved, 26420 unsolved in 30599 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, State Equation: 0/139 constraints, PredecessorRefiner: 26288/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 148777ms problems are : Problem set: 0 solved, 26420 unsolved
Search for dead transitions found 0 dead transitions in 148883ms
Starting structural reductions in LTL mode, iteration 1 : 139/167 places, 26421/59225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 159593 ms. Remains : 139/167 places, 26421/59225 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' '!(((!p0||X(X(!p1))) U (G((!p0||X(X(!p1))))||((!p0||X(X(!p1)))&&(G(p2)||p1)))))'
Stuttering acceptance computed with spot in 355 ms :[(AND p0 p1), p1, (AND p1 (NOT p2) p0), p1, true, (AND p1 (NOT p2)), (AND (NOT p2) p1), (NOT p2)]
Running random walk in product with property : ErlangenMainframeV0-PT-0909-LTLFireability-01
Product exploration timeout after 49400 steps with 0 reset in 10001 ms.
Product exploration timeout after 53740 steps with 0 reset in 10004 ms.
Computed a total of 21 stabilizing places and 21 stable transitions
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge based reduction with 15 factoid took 98 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 8 states, 16 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 13219 ms. (3 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 933 ms. (42 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 836 ms. (47 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 976 ms. (40 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 838 ms. (47 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1074 ms. (37 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1247 ms. (32 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1417 ms. (28 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 773 ms. (51 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 844 ms. (47 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 119262 steps, run timeout after 21001 ms. (steps per millisecond=5 ) properties seen :0 out of 9
Probabilistic random walk after 119262 steps, saw 74711 distinct states, run finished after 21001 ms. (steps per millisecond=5 ) properties seen :0
[2026-05-27 08:56:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem apf2 is UNSAT
Problem apf5 is UNSAT
At refinement iteration 1 (OVERLAPS) 81/102 variables, 11/11 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 37/139 variables, 4/15 constraints. Problems are: Problem set: 2 solved, 7 unsolved
SMT process timed out in 14609ms, After SMT, problems are : Problem set: 2 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 21 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 26421/26421 transitions.
Graph (trivial) has 91 edges and 139 vertex of which 4 / 139 are part of one of the 2 SCC in 7 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 137 transition count 26404
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 124 transition count 26404
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 27 place count 124 transition count 26387
Deduced a syphon composed of 17 places in 28 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 61 place count 107 transition count 26387
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 105 transition count 26370
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 105 transition count 26370
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 105 transition count 26368
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 13 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 139 place count 69 transition count 26332
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 17 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 143 place count 67 transition count 26355
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 150 place count 67 transition count 26348
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 159 place count 60 transition count 26346
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 161 place count 60 transition count 26346
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 166 place count 60 transition count 26346
Applied a total of 166 rules in 5131 ms. Remains 60 /139 variables (removed 79) and now considering 26346/26421 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5133 ms. Remains : 60/139 places, 26346/26421 transitions.
RANDOM walk for 40000 steps (8 resets) in 21836 ms. (1 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3266 ms. (12 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3752 ms. (10 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3560 ms. (11 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3584 ms. (11 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3401 ms. (11 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 3646 ms. (10 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 3349 ms. (11 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 418950 steps, run timeout after 39001 ms. (steps per millisecond=10 ) properties seen :0 out of 7
Probabilistic random walk after 418950 steps, saw 52847 distinct states, run finished after 39002 ms. (steps per millisecond=10 ) properties seen :0
[2026-05-27 08:57:29] [INFO ] Flow matrix only has 26327 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15976450541357997509.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8615626735219113982.kers'
[2026-05-27 08:57:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15976450541357997509.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8615626735219113982.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 90 ms.
// Phase 1: matrix 26327 rows 59 cols 542702 entries
Finished phase 1 with 45 SingleSign rule and 0 generalized
[2026-05-27 08:57:30] [INFO ] Computed 15 invariants in 323 ms
Computed 15 P flows in 324 ms.
Exported basis to /tmp/petrispot-output-8615626735219113982.kers
Total runtime 409 ms.
[2026-05-27 08:59:24] [INFO ] State equation strengthened by 14622 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 32/53 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 7/60 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 26327/26387 variables, 60/75 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SMT process timed out in 159759ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 3 different solutions.
Finished Parikh walk after 24 steps, including 0 resets, run visited all 2 properties in 23 ms. (steps per millisecond=1 )
Parikh walk visited 7 properties in 3957 ms.
Found 2 invariant AP formulas.
Knowledge based reduction with 17 factoid took 163 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND p1 p0), p1, p1, true]
Knowledge-based reduction took 264924 ms.
Stuttering acceptance computed with spot in 158 ms :[(AND p1 p0), p1, p1, true]
Support contains 17 out of 139 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 26421/26421 transitions.
Applied a total of 0 rules in 88 ms. Remains 139 /139 variables (removed 0) and now considering 26421/26421 (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-1733481808811520266.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12806331904381021062.kers'
[2026-05-27 09:00:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1733481808811520266.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12806331904381021062.kers]
Culled 0 columns in 101 ms.
// Phase 1: matrix 26421 rows 139 cols 341763 entries
Finished phase 1 with 124 SingleSign rule and 0 generalized
[2026-05-27 09:00:14] [INFO ] Computed 15 invariants in 531 ms
Computed 15 P flows in 533 ms.
Exported basis to /tmp/petrispot-output-12806331904381021062.kers
Total runtime 579 ms.
[2026-05-27 09:00:19] [INFO ] Implicit Places using invariants in 5337 ms returned []
Implicit Place search using SMT only with invariants took 5338 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 5429 ms. Remains : 139/139 places, 26421/26421 transitions.
Computed a total of 21 stabilizing places and 21 stable transitions
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge based reduction with 5 factoid took 74 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 12034 ms. (3 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 895 ms. (44 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 800 ms. (49 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 51815 steps, run timeout after 9001 ms. (steps per millisecond=5 ) properties seen :0 out of 2
Probabilistic random walk after 51815 steps, saw 33243 distinct states, run finished after 9001 ms. (steps per millisecond=5 ) properties seen :0
[2026-05-27 09:00:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 85/102 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 37/139 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 5144ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 17 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 26421/26421 transitions.
Graph (trivial) has 95 edges and 139 vertex of which 4 / 139 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 137 transition count 26404
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 124 transition count 26404
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 27 place count 124 transition count 26387
Deduced a syphon composed of 17 places in 30 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 61 place count 107 transition count 26387
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 66 place count 102 transition count 7902
Iterating global reduction 2 with 5 rules applied. Total rules applied 71 place count 102 transition count 7902
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 102 transition count 7900
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 75 place count 100 transition count 7896
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 100 transition count 7896
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 3 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 149 place count 64 transition count 7860
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 157 place count 60 transition count 7885
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 160 place count 60 transition count 7882
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 168 place count 60 transition count 7874
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 178 place count 52 transition count 7872
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 203 place count 52 transition count 7847
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 205 place count 52 transition count 7847
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 208 place count 52 transition count 7847
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 211 place count 52 transition count 7844
Applied a total of 211 rules in 29966 ms. Remains 52 /139 variables (removed 87) and now considering 7844/26421 (removed 18577) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29966 ms. Remains : 52/139 places, 7844/26421 transitions.
RANDOM walk for 40000 steps (8 resets) in 5937 ms. (6 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1225 ms. (32 steps per ms) remains 1/1 properties
[2026-05-27 09:01:09] [INFO ] Flow matrix only has 7841 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16382248838831928589.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9381811530724384362.kers'
[2026-05-27 09:01:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16382248838831928589.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9381811530724384362.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 24 ms.
// Phase 1: matrix 7841 rows 51 cols 150578 entries
Finished phase 1 with 37 SingleSign rule and 0 generalized
[2026-05-27 09:01:09] [INFO ] Computed 15 invariants in 70 ms
Computed 15 P flows in 71 ms.
Exported basis to /tmp/petrispot-output-9381811530724384362.kers
Total runtime 97 ms.
[2026-05-27 09:01:25] [INFO ] State equation strengthened by 6515 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/45 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/52 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7841/7893 variables, 52/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 61344ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 11 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 7844/7844 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 52 transition count 7843
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 51 transition count 7843
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 6 place count 47 transition count 1603
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 47 transition count 1603
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 46 transition count 1602
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 45 transition count 1602
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 17 place count 45 transition count 1599
Applied a total of 17 rules in 1452 ms. Remains 45 /52 variables (removed 7) and now considering 1599/7844 (removed 6245) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1453 ms. Remains : 45/52 places, 1599/7844 transitions.
Knowledge based reduction with 5 factoid took 66 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND p1 p0), p1, p1, true]
Knowledge-based reduction took 113156 ms.
Stuttering acceptance computed with spot in 116 ms :[(AND p1 p0), p1, p1, true]
Stuttering acceptance computed with spot in 149 ms :[(AND p1 p0), p1, p1, true]
Product exploration timeout after 52050 steps with 0 reset in 10001 ms.
Product exploration timeout after 50820 steps with 0 reset in 10004 ms.
Spot run failed in 141 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/ltsmin13140955791123157704
[2026-05-27 09:02:33] [INFO ] Built C files in 627ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13140955791123157704
Running compilation step : cd /tmp/ltsmin13140955791123157704;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13140955791123157704;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13140955791123157704;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 17 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 26421/26421 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 136 transition count 7953
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 136 transition count 7953
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 134 transition count 7949
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 134 transition count 7949
Applied a total of 10 rules in 1413 ms. Remains 134 /139 variables (removed 5) and now considering 7949/26421 (removed 18472) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7403648963062860398.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1776892404839036510.kers'
[2026-05-27 09:02:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7403648963062860398.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1776892404839036510.kers]
Culled 0 columns in 16 ms.
// Phase 1: matrix 7949 rows 134 cols 101671 entries
Finished phase 1 with 119 SingleSign rule and 0 generalized
[2026-05-27 09:02:38] [INFO ] Computed 15 invariants in 78 ms
Computed 15 P flows in 79 ms.
Exported basis to /tmp/petrispot-output-1776892404839036510.kers
Total runtime 93 ms.
[2026-05-27 09:02:40] [INFO ] Implicit Places using invariants in 2540 ms returned []
[2026-05-27 09:02:40] [INFO ] Invariant cache hit.
[2026-05-27 09:02:45] [INFO ] Implicit Places using invariants and state equation in 5145 ms returned []
Implicit Place search using SMT with State Equation took 7687 ms to find 0 implicit places.
Running 7948 sub problems to find dead transitions.
[2026-05-27 09:02:45] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/8083 variables, and 0 constraints, problems are : Problem set: 0 solved, 7948 unsolved in 30349 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, State Equation: 0/134 constraints, PredecessorRefiner: 7948/128 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7948 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/8083 variables, and 0 constraints, problems are : Problem set: 0 solved, 7948 unsolved in 30157 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, State Equation: 0/134 constraints, PredecessorRefiner: 7820/128 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 77198ms problems are : Problem set: 0 solved, 7948 unsolved
Search for dead transitions found 0 dead transitions in 77235ms
Starting structural reductions in LTL mode, iteration 1 : 134/139 places, 7949/26421 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86358 ms. Remains : 134/139 places, 7949/26421 transitions.
Built C files in :
/tmp/ltsmin18015197764076059924
[2026-05-27 09:04:03] [INFO ] Built C files in 683ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18015197764076059924
Running compilation step : cd /tmp/ltsmin18015197764076059924;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18015197764076059924;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18015197764076059924;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-27 09:04:14] [INFO ] Flatten gal took : 2063 ms
[2026-05-27 09:04:15] [INFO ] Flatten gal took : 432 ms
[2026-05-27 09:04:15] [INFO ] Time to serialize gal into /tmp/LTL10389863421591038866.gal : 290 ms
[2026-05-27 09:04:15] [INFO ] Time to serialize properties into /tmp/LTL16381067980786913214.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10389863421591038866.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16082684014527185749.hoa' '-atoms' '/tmp/LTL16381067980786913214.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL16381067980786913214.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16082684014527185749.hoa
Detected timeout of ITS tools.
[2026-05-27 09:04:39] [INFO ] Flatten gal took : 1795 ms
[2026-05-27 09:04:40] [INFO ] Flatten gal took : 1527 ms
[2026-05-27 09:04:41] [INFO ] Time to serialize gal into /tmp/LTL1889318690796155355.gal : 362 ms
[2026-05-27 09:04:41] [INFO ] Time to serialize properties into /tmp/LTL6409662451022798078.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1889318690796155355.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6409662451022798078.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Detected timeout of ITS tools.
[2026-05-27 09:04:58] [INFO ] Flatten gal took : 1959 ms
[2026-05-27 09:04:58] [INFO ] Applying decomposition
[2026-05-27 09:04:59] [INFO ] Flatten gal took : 1495 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9792814604003006084.txt' '-o' '/tmp/graph9792814604003006084.bin' '-w' '/tmp/graph9792814604003006084.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9792814604003006084.bin' '-l' '-1' '-v' '-w' '/tmp/graph9792814604003006084.weights' '-q' '0' '-e' '0.001'
[2026-05-27 09:05:06] [INFO ] Decomposing Gal with order
[2026-05-27 09:05:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 09:05:23] [INFO ] Removed a total of 75697 redundant transitions.
[2026-05-27 09:05:24] [INFO ] Flatten gal took : 16696 ms
[2026-05-27 09:05:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 3830 labels/synchronizations in 3570 ms.
[2026-05-27 09:05:31] [INFO ] Time to serialize gal into /tmp/LTL1324050386685071018.gal : 49 ms
[2026-05-27 09:05:31] [INFO ] Time to serialize properties into /tmp/LTL8069457401301910266.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1324050386685071018.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8069457401301910266.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((((!("(((((i1.u31.p16==1)&&(i1.u19.p39==1))&&((i1.u31.p58==1)&&(i1.u19.p77==1)))&&(((u32.p96==1)&&(i1.u31.p121==1))&&((i1.u19.p140==...1769
Formula 0 simplified : (!"(((((i1.u31.p16==1)&&(i1.u31.p35==1))&&((i1.u19.p54==1)&&(i1.u19.p77==1)))&&(((u32.p96==1)&&(i1.u19.p115==1))&&((u32.p130==1)&&(i...873
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV0-PT-0909-LTLFireability-01 finished in 777738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(((p0 U p1)&&X(!p0))) U (G(p0) U p2)))'
Support contains 21 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 59225/59225 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 149 transition count 39543
Ensure Unique test removed 9 places
Iterating global reduction 0 with 27 rules applied. Total rules applied 45 place count 140 transition count 39543
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 47 place count 138 transition count 17673
Iterating global reduction 0 with 2 rules applied. Total rules applied 49 place count 138 transition count 17673
Applied a total of 49 rules in 5415 ms. Remains 138 /167 variables (removed 29) and now considering 17673/59225 (removed 41552) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5306419475036148872.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8836026153775867341.kers'
[2026-05-27 09:05:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5306419475036148872.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8836026153775867341.kers]
Culled 0 columns in 40 ms.
// Phase 1: matrix 17673 rows 138 cols 228039 entries
Finished phase 1 with 123 SingleSign rule and 0 generalized
[2026-05-27 09:05:52] [INFO ] Computed 15 invariants in 227 ms
Computed 15 P flows in 228 ms.
Exported basis to /tmp/petrispot-output-8836026153775867341.kers
Total runtime 264 ms.
[2026-05-27 09:05:56] [INFO ] Implicit Places using invariants in 4755 ms returned []
Implicit Place search using SMT only with invariants took 4757 ms to find 0 implicit places.
Running 17672 sub problems to find dead transitions.
[2026-05-27 09:05:56] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 137/17811 variables, and 0 constraints, problems are : Problem set: 0 solved, 17672 unsolved in 30403 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, State Equation: 0/138 constraints, PredecessorRefiner: 17672/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17672 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 137/17811 variables, and 0 constraints, problems are : Problem set: 0 solved, 17672 unsolved in 30399 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, State Equation: 0/138 constraints, PredecessorRefiner: 17540/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 116101ms problems are : Problem set: 0 solved, 17672 unsolved
Search for dead transitions found 0 dead transitions in 116295ms
Starting structural reductions in LTL mode, iteration 1 : 138/167 places, 17673/59225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126522 ms. Remains : 138/167 places, 17673/59225 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(((p0 U p1)&&X(!p0))) U (G(p0) U p2)))'
Stuttering acceptance computed with spot in 290 ms :[(NOT p2), (OR (NOT p1) p0), p0, (AND (NOT p0) (NOT p1)), false]
Running random walk in product with property : ErlangenMainframeV0-PT-0909-LTLFireability-02
Product exploration timeout after 65550 steps with 0 reset in 10001 ms.
Stack based approach found an accepted trace after 63 steps with 0 reset with depth 64 and stack size 64 in 7 ms.
FORMULA ErlangenMainframeV0-PT-0909-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-0909-LTLFireability-02 finished in 137119 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 10 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 59225/59225 transitions.
Graph (trivial) has 113 edges and 167 vertex of which 6 / 167 are part of one of the 3 SCC in 21 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 163 transition count 59209
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 151 transition count 59209
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 25 place count 151 transition count 59191
Deduced a syphon composed of 18 places in 74 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 61 place count 133 transition count 59191
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 73 place count 121 transition count 20316
Iterating global reduction 2 with 12 rules applied. Total rules applied 85 place count 121 transition count 20316
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 88 place count 121 transition count 20313
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 97 place count 112 transition count 1142
Iterating global reduction 3 with 9 rules applied. Total rules applied 106 place count 112 transition count 1142
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 111 place count 107 transition count 1132
Iterating global reduction 3 with 5 rules applied. Total rules applied 116 place count 107 transition count 1132
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 192 place count 69 transition count 1094
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 204 place count 63 transition count 1101
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 208 place count 63 transition count 1097
Applied a total of 208 rules in 16623 ms. Remains 63 /167 variables (removed 104) and now considering 1097/59225 (removed 58128) transitions.
[2026-05-27 09:08:20] [INFO ] Flow matrix only has 1075 transitions (discarded 22 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15776890419825944009.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8768310014628909897.kers'
[2026-05-27 09:08:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15776890419825944009.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8768310014628909897.kers]
Normalized transition count is 1074 out of 1075 initially.
Culled 0 columns in 3 ms.
// Phase 1: matrix 1074 rows 63 cols 20692 entries
Finished phase 1 with 37 SingleSign rule and 2 generalized
[2026-05-27 09:08:20] [INFO ] Computed 24 invariants in 11 ms
Computed 24 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-8768310014628909897.kers
Total runtime 15 ms.
[2026-05-27 09:08:20] [INFO ] Implicit Places using invariants in 497 ms returned []
[2026-05-27 09:08:20] [INFO ] Flow matrix only has 1075 transitions (discarded 22 similar events)
[2026-05-27 09:08:20] [INFO ] Invariant cache hit.
[2026-05-27 09:08:21] [INFO ] State equation strengthened by 535 read => feed constraints.
[2026-05-27 09:08:25] [INFO ] Implicit Places using invariants and state equation in 4868 ms returned []
Implicit Place search using SMT with State Equation took 5367 ms to find 0 implicit places.
[2026-05-27 09:08:25] [INFO ] Redundant transitions in 122 ms returned []
Running 1095 sub problems to find dead transitions.
[2026-05-27 09:08:25] [INFO ] Flow matrix only has 1075 transitions (discarded 22 similar events)
[2026-05-27 09:08:25] [INFO ] Invariant cache hit.
[2026-05-27 09:08:25] [INFO ] State equation strengthened by 535 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1095 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1095 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 1095 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1095 unsolved
At refinement iteration 4 (OVERLAPS) 1074/1137 variables, 63/87 constraints. Problems are: Problem set: 0 solved, 1095 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1137 variables, 534/621 constraints. Problems are: Problem set: 0 solved, 1095 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1137/1138 variables, and 621 constraints, problems are : Problem set: 0 solved, 1095 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 534/535 constraints, PredecessorRefiner: 1095/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1095 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1095 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1095 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 1095 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1095 unsolved
At refinement iteration 4 (OVERLAPS) 1074/1137 variables, 63/87 constraints. Problems are: Problem set: 0 solved, 1095 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1137 variables, 534/621 constraints. Problems are: Problem set: 0 solved, 1095 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1137/1138 variables, and 648 constraints, problems are : Problem set: 0 solved, 1095 unsolved in 30082 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 534/535 constraints, PredecessorRefiner: 1095/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62331ms problems are : Problem set: 0 solved, 1095 unsolved
Search for dead transitions found 0 dead transitions in 62336ms
Starting structural reductions in SI_LTL mode, iteration 1 : 63/167 places, 1097/59225 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 84462 ms. Remains : 63/167 places, 1097/59225 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 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0909-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 1154 ms.
Product exploration explored 100000 steps with 0 reset in 1146 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge based reduction with 3 factoid took 56 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 1199 ms. (33 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 644 ms. (62 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 604986 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :0 out of 1
Probabilistic random walk after 604986 steps, saw 92604 distinct states, run finished after 3001 ms. (steps per millisecond=201 ) properties seen :0
[2026-05-27 09:09:33] [INFO ] Flow matrix only has 1075 transitions (discarded 22 similar events)
[2026-05-27 09:09:33] [INFO ] Invariant cache hit.
[2026-05-27 09:09:33] [INFO ] State equation strengthened by 535 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/23 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/38 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/63 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1074/1137 variables, 63/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1137 variables, 534/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1137 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1138/1138 variables, and 622 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1639 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 535/535 constraints, PredecessorRefiner: 1/0 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/23 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/38 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/63 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1074/1137 variables, 63/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1137 variables, 534/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1137 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1138 variables, 1/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1138 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1138 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1138/1138 variables, and 622 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1295 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 535/535 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2958ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 58 ms.
Support contains 10 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 1097/1097 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 63 transition count 1094
Free-agglomeration rule applied 16 times.
Iterating global reduction 1 with 16 rules applied. Total rules applied 19 place count 63 transition count 1078
Reduce places removed 16 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 57 place count 47 transition count 1056
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 69 place count 47 transition count 1044
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 47 transition count 1043
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 75 place count 46 transition count 1039
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 45 transition count 1038
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 79 place count 42 transition count 1038
Applied a total of 79 rules in 810 ms. Remains 42 /63 variables (removed 21) and now considering 1038/1097 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 811 ms. Remains : 42/63 places, 1038/1097 transitions.
RANDOM walk for 40000 steps (8 resets) in 2256 ms. (17 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4910 steps, run visited all 1 properties in 46 ms. (steps per millisecond=106 )
Probabilistic random walk after 4910 steps, saw 1031 distinct states, run finished after 58 ms. (steps per millisecond=84 ) properties seen :1
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 8327 ms.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Support contains 10 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 1097/1097 transitions.
Applied a total of 0 rules in 200 ms. Remains 63 /63 variables (removed 0) and now considering 1097/1097 (removed 0) transitions.
[2026-05-27 09:09:38] [INFO ] Flow matrix only has 1075 transitions (discarded 22 similar events)
[2026-05-27 09:09:38] [INFO ] Invariant cache hit.
[2026-05-27 09:09:39] [INFO ] Implicit Places using invariants in 486 ms returned []
[2026-05-27 09:09:39] [INFO ] Flow matrix only has 1075 transitions (discarded 22 similar events)
[2026-05-27 09:09:39] [INFO ] Invariant cache hit.
[2026-05-27 09:09:39] [INFO ] State equation strengthened by 535 read => feed constraints.
[2026-05-27 09:09:43] [INFO ] Implicit Places using invariants and state equation in 4023 ms returned []
Implicit Place search using SMT with State Equation took 4515 ms to find 0 implicit places.
[2026-05-27 09:09:43] [INFO ] Redundant transitions in 38 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4768 ms. Remains : 63/63 places, 1097/1097 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge based reduction with 3 factoid took 51 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 724 ms. (55 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 108 ms. (367 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 636097 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :0 out of 1
Probabilistic random walk after 636097 steps, saw 96528 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :0
[2026-05-27 09:09:46] [INFO ] Flow matrix only has 1075 transitions (discarded 22 similar events)
[2026-05-27 09:09:46] [INFO ] Invariant cache hit.
[2026-05-27 09:09:46] [INFO ] State equation strengthened by 535 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/23 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/38 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/63 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1074/1137 variables, 63/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1137 variables, 534/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1137 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1138/1138 variables, and 622 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1547 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 535/535 constraints, PredecessorRefiner: 1/0 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/23 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/38 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/63 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1074/1137 variables, 63/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1137 variables, 534/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1137 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1138 variables, 1/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1138 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1138 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1138/1138 variables, and 622 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1108 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 535/535 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2681ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 56 ms.
Support contains 10 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 1097/1097 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 63 transition count 1094
Free-agglomeration rule applied 16 times.
Iterating global reduction 1 with 16 rules applied. Total rules applied 19 place count 63 transition count 1078
Reduce places removed 16 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 57 place count 47 transition count 1056
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 69 place count 47 transition count 1044
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 47 transition count 1043
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 75 place count 46 transition count 1039
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 45 transition count 1038
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 79 place count 42 transition count 1038
Applied a total of 79 rules in 773 ms. Remains 42 /63 variables (removed 21) and now considering 1038/1097 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 773 ms. Remains : 42/63 places, 1038/1097 transitions.
RANDOM walk for 40000 steps (8 resets) in 2044 ms. (19 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4910 steps, run visited all 1 properties in 41 ms. (steps per millisecond=119 )
Probabilistic random walk after 4910 steps, saw 1031 distinct states, run finished after 42 ms. (steps per millisecond=116 ) properties seen :1
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 7666 ms.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1069 ms.
Product exploration explored 100000 steps with 0 reset in 1132 ms.
Built C files in :
/tmp/ltsmin4527781679647790427
[2026-05-27 09:09:53] [INFO ] Computing symmetric may disable matrix : 1097 transitions.
[2026-05-27 09:09:53] [INFO ] Computation of Complete disable matrix. took 238 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 09:09:53] [INFO ] Computing symmetric may enable matrix : 1097 transitions.
[2026-05-27 09:09:54] [INFO ] Computation of Complete enable matrix. took 150 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 09:09:54] [INFO ] Computing Do-Not-Accords matrix : 1097 transitions.
[2026-05-27 09:09:54] [INFO ] Computation of Completed DNA matrix. took 106 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 09:09:54] [INFO ] Built C files in 1018ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4527781679647790427
Running compilation step : cd /tmp/ltsmin4527781679647790427;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4527781679647790427;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4527781679647790427;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 10 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 1097/1097 transitions.
Applied a total of 0 rules in 172 ms. Remains 63 /63 variables (removed 0) and now considering 1097/1097 (removed 0) transitions.
[2026-05-27 09:09:57] [INFO ] Flow matrix only has 1075 transitions (discarded 22 similar events)
[2026-05-27 09:09:57] [INFO ] Invariant cache hit.
[2026-05-27 09:09:58] [INFO ] Implicit Places using invariants in 563 ms returned []
[2026-05-27 09:09:58] [INFO ] Flow matrix only has 1075 transitions (discarded 22 similar events)
[2026-05-27 09:09:58] [INFO ] Invariant cache hit.
[2026-05-27 09:09:58] [INFO ] State equation strengthened by 535 read => feed constraints.
[2026-05-27 09:10:02] [INFO ] Implicit Places using invariants and state equation in 4578 ms returned []
Implicit Place search using SMT with State Equation took 5147 ms to find 0 implicit places.
[2026-05-27 09:10:02] [INFO ] Redundant transitions in 39 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5367 ms. Remains : 63/63 places, 1097/1097 transitions.
Built C files in :
/tmp/ltsmin8291731736779530003
[2026-05-27 09:10:02] [INFO ] Computing symmetric may disable matrix : 1097 transitions.
[2026-05-27 09:10:03] [INFO ] Computation of Complete disable matrix. took 211 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 09:10:03] [INFO ] Computing symmetric may enable matrix : 1097 transitions.
[2026-05-27 09:10:03] [INFO ] Computation of Complete enable matrix. took 188 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 09:10:03] [INFO ] Computing Do-Not-Accords matrix : 1097 transitions.
[2026-05-27 09:10:03] [INFO ] Computation of Completed DNA matrix. took 78 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 09:10:03] [INFO ] Built C files in 903ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8291731736779530003
Running compilation step : cd /tmp/ltsmin8291731736779530003;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8291731736779530003;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8291731736779530003;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-27 09:10:14] [INFO ] Flatten gal took : 212 ms
[2026-05-27 09:10:14] [INFO ] Flatten gal took : 210 ms
[2026-05-27 09:10:14] [INFO ] Time to serialize gal into /tmp/LTL14342178940790474586.gal : 24 ms
[2026-05-27 09:10:14] [INFO ] Time to serialize properties into /tmp/LTL7679653252301931722.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14342178940790474586.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11890739092245939705.hoa' '-atoms' '/tmp/LTL7679653252301931722.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL7679653252301931722.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11890739092245939705.hoa
Detected timeout of ITS tools.
[2026-05-27 09:10:36] [INFO ] Flatten gal took : 134 ms
[2026-05-27 09:10:36] [INFO ] Flatten gal took : 137 ms
[2026-05-27 09:10:36] [INFO ] Time to serialize gal into /tmp/LTL10081404384622404531.gal : 22 ms
[2026-05-27 09:10:36] [INFO ] Time to serialize properties into /tmp/LTL1005792966650616584.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10081404384622404531.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1005792966650616584.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((p25==0)||(p34==0))||((p63==0)||(p72==0)))||(((p95==0)||(p114==0))||((p129==0)||(p148==0))))||((p167==0)||(p216==0)))"))))
Formula 0 simplified : FG!"(((((p25==0)||(p34==0))||((p63==0)||(p72==0)))||(((p95==0)||(p114==0))||((p129==0)||(p148==0))))||((p167==0)||(p216==0)))"
Detected timeout of ITS tools.
[2026-05-27 09:10:52] [INFO ] Flatten gal took : 244 ms
[2026-05-27 09:10:52] [INFO ] Applying decomposition
[2026-05-27 09:10:52] [INFO ] Flatten gal took : 136 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14899659932770592515.txt' '-o' '/tmp/graph14899659932770592515.bin' '-w' '/tmp/graph14899659932770592515.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14899659932770592515.bin' '-l' '-1' '-v' '-w' '/tmp/graph14899659932770592515.weights' '-q' '0' '-e' '0.001'
[2026-05-27 09:10:52] [INFO ] Decomposing Gal with order
[2026-05-27 09:10:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 09:10:53] [INFO ] Removed a total of 13090 redundant transitions.
[2026-05-27 09:10:53] [INFO ] Flatten gal took : 209 ms
[2026-05-27 09:10:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 144 ms.
[2026-05-27 09:10:53] [INFO ] Time to serialize gal into /tmp/LTL5830592883834239837.gal : 17 ms
[2026-05-27 09:10:53] [INFO ] Time to serialize properties into /tmp/LTL9711562373982293994.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5830592883834239837.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9711562373982293994.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((i0.i1.i0.u1.p25==0)||(i2.u2.p34==0))||((i0.i1.i0.u5.p63==0)||(i0.i1.i0.u6.p72==0)))||(((i2.u9.p95==0)||(i0.i1.i1.u10.p114...250
Formula 0 simplified : FG!"(((((i0.i1.i0.u1.p25==0)||(i2.u2.p34==0))||((i0.i1.i0.u5.p63==0)||(i0.i1.i0.u6.p72==0)))||(((i2.u9.p95==0)||(i0.i1.i1.u10.p114==...244
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV0-PT-0909-LTLFireability-03 finished in 185039 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' '!((((p0||X(X(F(p1)))) U p2) U p1))'
Support contains 31 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 59225/59225 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 158 transition count 40054
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 158 transition count 40054
Applied a total of 18 rules in 2743 ms. Remains 158 /167 variables (removed 9) and now considering 40054/59225 (removed 19171) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17324138043990374945.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2118898268397547515.kers'
[2026-05-27 09:11:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17324138043990374945.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2118898268397547515.kers]
Culled 0 columns in 155 ms.
// Phase 1: matrix 40054 rows 158 cols 876872 entries
Finished phase 1 with 132 SingleSign rule and 2 generalized
[2026-05-27 09:11:12] [INFO ] Computed 24 invariants in 764 ms
Computed 24 P flows in 765 ms.
Exported basis to /tmp/petrispot-output-2118898268397547515.kers
Total runtime 895 ms.
[2026-05-27 09:11:19] [INFO ] Implicit Places using invariants in 7998 ms returned []
Implicit Place search using SMT only with invariants took 8001 ms to find 0 implicit places.
Running 40053 sub problems to find dead transitions.
[2026-05-27 09:11:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 40053 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 157/40212 variables, and 9 constraints, problems are : Problem set: 0 solved, 40053 unsolved in 31176 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/158 constraints, PredecessorRefiner: 40053/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40053 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 40053 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 157/40212 variables, and 9 constraints, problems are : Problem set: 0 solved, 40053 unsolved in 30718 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/158 constraints, PredecessorRefiner: 39931/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 226764ms problems are : Problem set: 0 solved, 40053 unsolved
Search for dead transitions found 0 dead transitions in 226926ms
Starting structural reductions in LTL mode, iteration 1 : 158/167 places, 40054/59225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 237798 ms. Remains : 158/167 places, 40054/59225 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(F(p0)))||p1) U p2) U p0))'
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p2), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0909-LTLFireability-05
Product exploration timeout after 25290 steps with 0 reset in 10004 ms.
Stack based approach found an accepted trace after 48 steps with 0 reset with depth 49 and stack size 49 in 11 ms.
FORMULA ErlangenMainframeV0-PT-0909-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-0909-LTLFireability-05 finished in 248197 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 10 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 59225/59225 transitions.
Graph (trivial) has 113 edges and 167 vertex of which 6 / 167 are part of one of the 3 SCC in 4 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 163 transition count 59209
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 151 transition count 59209
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 25 place count 151 transition count 59191
Deduced a syphon composed of 18 places in 79 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 61 place count 133 transition count 59191
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 73 place count 121 transition count 20316
Iterating global reduction 2 with 12 rules applied. Total rules applied 85 place count 121 transition count 20316
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 88 place count 121 transition count 20313
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 97 place count 112 transition count 1142
Iterating global reduction 3 with 9 rules applied. Total rules applied 106 place count 112 transition count 1142
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 108 place count 110 transition count 1138
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 110 transition count 1138
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 198 place count 66 transition count 1094
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 204 place count 63 transition count 1101
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 211 place count 63 transition count 1094
Applied a total of 211 rules in 17444 ms. Remains 63 /167 variables (removed 104) and now considering 1094/59225 (removed 58131) transitions.
[2026-05-27 09:15:34] [INFO ] Flow matrix only has 1072 transitions (discarded 22 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10588635623057428127.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18046671838070323856.kers'
[2026-05-27 09:15:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10588635623057428127.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18046671838070323856.kers]
Normalized transition count is 1071 out of 1072 initially.
Culled 0 columns in 3 ms.
// Phase 1: matrix 1071 rows 63 cols 20676 entries
Finished phase 1 with 37 SingleSign rule and 2 generalized
[2026-05-27 09:15:34] [INFO ] Computed 24 invariants in 14 ms
Computed 24 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-18046671838070323856.kers
Total runtime 18 ms.
[2026-05-27 09:15:34] [INFO ] Implicit Places using invariants in 525 ms returned []
[2026-05-27 09:15:34] [INFO ] Flow matrix only has 1072 transitions (discarded 22 similar events)
[2026-05-27 09:15:34] [INFO ] Invariant cache hit.
[2026-05-27 09:15:35] [INFO ] State equation strengthened by 532 read => feed constraints.
[2026-05-27 09:15:38] [INFO ] Implicit Places using invariants and state equation in 3682 ms returned []
Implicit Place search using SMT with State Equation took 4211 ms to find 0 implicit places.
[2026-05-27 09:15:38] [INFO ] Redundant transitions in 37 ms returned []
Running 1092 sub problems to find dead transitions.
[2026-05-27 09:15:38] [INFO ] Flow matrix only has 1072 transitions (discarded 22 similar events)
[2026-05-27 09:15:38] [INFO ] Invariant cache hit.
[2026-05-27 09:15:38] [INFO ] State equation strengthened by 532 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 4 (OVERLAPS) 1071/1134 variables, 63/87 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1134 variables, 531/618 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1134/1135 variables, and 618 constraints, problems are : Problem set: 0 solved, 1092 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 531/532 constraints, PredecessorRefiner: 1092/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1092 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 4 (OVERLAPS) 1071/1134 variables, 63/87 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1134 variables, 531/618 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1134/1135 variables, and 645 constraints, problems are : Problem set: 0 solved, 1092 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 531/532 constraints, PredecessorRefiner: 1092/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61577ms problems are : Problem set: 0 solved, 1092 unsolved
Search for dead transitions found 0 dead transitions in 61582ms
Starting structural reductions in SI_LTL mode, iteration 1 : 63/167 places, 1094/59225 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83293 ms. Remains : 63/167 places, 1094/59225 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0909-LTLFireability-06
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0909-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0909-LTLFireability-06 finished in 83395 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(p1)&&p0)))'
Support contains 28 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 59225/59225 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 158 transition count 40054
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 158 transition count 40054
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 157 transition count 26932
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 157 transition count 26932
Applied a total of 20 rules in 3889 ms. Remains 157 /167 variables (removed 10) and now considering 26932/59225 (removed 32293) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9348887855516290126.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8117435575988845317.kers'
[2026-05-27 09:16:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9348887855516290126.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8117435575988845317.kers]
Culled 0 columns in 100 ms.
// Phase 1: matrix 26932 rows 157 cols 588188 entries
Finished phase 1 with 131 SingleSign rule and 2 generalized
[2026-05-27 09:16:44] [INFO ] Computed 24 invariants in 474 ms
Computed 24 P flows in 475 ms.
Exported basis to /tmp/petrispot-output-8117435575988845317.kers
Total runtime 570 ms.
[2026-05-27 09:16:49] [INFO ] Implicit Places using invariants in 6038 ms returned []
Implicit Place search using SMT only with invariants took 6046 ms to find 0 implicit places.
Running 26931 sub problems to find dead transitions.
[2026-05-27 09:16:50] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 26931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 156/27089 variables, and 9 constraints, problems are : Problem set: 0 solved, 26931 unsolved in 30470 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/157 constraints, PredecessorRefiner: 26931/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26931 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 26931 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 156/27089 variables, and 9 constraints, problems are : Problem set: 0 solved, 26931 unsolved in 30461 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/157 constraints, PredecessorRefiner: 26809/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 147725ms problems are : Problem set: 0 solved, 26931 unsolved
Search for dead transitions found 0 dead transitions in 147827ms
Starting structural reductions in LTL mode, iteration 1 : 157/167 places, 26932/59225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 157818 ms. Remains : 157/167 places, 26932/59225 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(p1)&&p0)))'
Stuttering acceptance computed with spot in 138 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV0-PT-0909-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-0909-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0909-LTLFireability-07 finished in 158109 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 16 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 59225/59225 transitions.
Graph (trivial) has 96 edges and 167 vertex of which 4 / 167 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 164 transition count 59210
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 152 transition count 59210
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 25 place count 152 transition count 59193
Deduced a syphon composed of 17 places in 69 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 59 place count 135 transition count 59193
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 79 place count 115 transition count 39494
Ensure Unique test removed 9 places
Iterating global reduction 2 with 29 rules applied. Total rules applied 108 place count 106 transition count 39494
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 110 place count 106 transition count 39492
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 114 place count 102 transition count 7902
Iterating global reduction 3 with 4 rules applied. Total rules applied 118 place count 102 transition count 7902
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 3 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 190 place count 66 transition count 7866
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 192 place count 65 transition count 7877
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 196 place count 65 transition count 7873
Partial Post-agglomeration rule applied 13 times.
Drop transitions (Partial Post agglomeration) removed 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 209 place count 65 transition count 7873
Applied a total of 209 rules in 20736 ms. Remains 65 /167 variables (removed 102) and now considering 7873/59225 (removed 51352) transitions.
[2026-05-27 09:19:38] [INFO ] Flow matrix only has 7850 transitions (discarded 23 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17272350480122972972.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2081915709551532074.kers'
[2026-05-27 09:19:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17272350480122972972.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2081915709551532074.kers]
Normalized transition count is 7849 out of 7850 initially.
Culled 0 columns in 27 ms.
// Phase 1: matrix 7849 rows 65 cols 163612 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-27 09:19:39] [INFO ] Computed 15 invariants in 89 ms
Computed 15 P flows in 90 ms.
Exported basis to /tmp/petrispot-output-2081915709551532074.kers
Total runtime 118 ms.
[2026-05-27 09:19:40] [INFO ] Implicit Places using invariants in 1889 ms returned []
[2026-05-27 09:19:40] [INFO ] Flow matrix only has 7850 transitions (discarded 23 similar events)
[2026-05-27 09:19:40] [INFO ] Invariant cache hit.
[2026-05-27 09:19:44] [INFO ] State equation strengthened by 3899 read => feed constraints.
[2026-05-27 09:19:47] [INFO ] Implicit Places using invariants and state equation in 6544 ms returned []
Implicit Place search using SMT with State Equation took 8438 ms to find 0 implicit places.
[2026-05-27 09:19:50] [INFO ] Redundant transitions in 2679 ms returned []
Running 7871 sub problems to find dead transitions.
[2026-05-27 09:19:50] [INFO ] Flow matrix only has 7850 transitions (discarded 23 similar events)
[2026-05-27 09:19:50] [INFO ] Invariant cache hit.
[2026-05-27 09:19:50] [INFO ] State equation strengthened by 3899 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 64/7915 variables, and 0 constraints, problems are : Problem set: 0 solved, 7871 unsolved in 30143 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, State Equation: 0/65 constraints, ReadFeed: 0/3899 constraints, PredecessorRefiner: 7871/41 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7871 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 64/7915 variables, and 0 constraints, problems are : Problem set: 0 solved, 7871 unsolved in 30147 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, State Equation: 0/65 constraints, ReadFeed: 0/3899 constraints, PredecessorRefiner: 7830/41 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 75038ms problems are : Problem set: 0 solved, 7871 unsolved
Search for dead transitions found 0 dead transitions in 75074ms
Starting structural reductions in SI_LTL mode, iteration 1 : 65/167 places, 7873/59225 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106974 ms. Remains : 65/167 places, 7873/59225 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0909-LTLFireability-08
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-0909-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0909-LTLFireability-08 finished in 107107 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' '!(((p0 U p1)||X(p2)))'
Support contains 23 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 59225/59225 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 149 transition count 39543
Ensure Unique test removed 9 places
Iterating global reduction 0 with 27 rules applied. Total rules applied 45 place count 140 transition count 39543
Applied a total of 45 rules in 4505 ms. Remains 140 /167 variables (removed 27) and now considering 39543/59225 (removed 19682) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6219685085079922296.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15191353929789627462.kers'
[2026-05-27 09:21:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6219685085079922296.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15191353929789627462.kers]
Culled 0 columns in 87 ms.
// Phase 1: matrix 39543 rows 140 cols 512349 entries
Finished phase 1 with 125 SingleSign rule and 0 generalized
[2026-05-27 09:21:10] [INFO ] Computed 15 invariants in 627 ms
Computed 15 P flows in 629 ms.
Exported basis to /tmp/petrispot-output-15191353929789627462.kers
Total runtime 706 ms.
[2026-05-27 09:21:15] [INFO ] Implicit Places using invariants in 6056 ms returned []
Implicit Place search using SMT only with invariants took 6058 ms to find 0 implicit places.
Running 39542 sub problems to find dead transitions.
[2026-05-27 09:21:16] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 139/39683 variables, and 0 constraints, problems are : Problem set: 0 solved, 39542 unsolved in 30719 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, State Equation: 0/140 constraints, PredecessorRefiner: 39542/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39542 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 139/39683 variables, and 0 constraints, problems are : Problem set: 0 solved, 39542 unsolved in 30687 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, State Equation: 0/140 constraints, PredecessorRefiner: 39410/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 230768ms problems are : Problem set: 0 solved, 39542 unsolved
Search for dead transitions found 0 dead transitions in 230915ms
Starting structural reductions in LTL mode, iteration 1 : 140/167 places, 39543/59225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 241550 ms. Remains : 140/167 places, 39543/59225 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' '!(((p0 U p1)||X(p2)))'
Stuttering acceptance computed with spot in 189 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-0909-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ErlangenMainframeV0-PT-0909-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0909-LTLFireability-09 finished in 241915 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 21 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 59225/59225 transitions.
Graph (trivial) has 101 edges and 167 vertex of which 4 / 167 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 164 transition count 59210
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 152 transition count 59210
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 25 place count 152 transition count 59193
Deduced a syphon composed of 17 places in 70 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 59 place count 135 transition count 59193
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 70 place count 124 transition count 40005
Iterating global reduction 2 with 11 rules applied. Total rules applied 81 place count 124 transition count 40005
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 83 place count 124 transition count 40003
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 85 place count 122 transition count 18133
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 122 transition count 18133
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 121 transition count 18131
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 121 transition count 18131
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 6 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 171 place count 80 transition count 18090
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 175 place count 78 transition count 18101
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 176 place count 78 transition count 18100
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 181 place count 78 transition count 18100
Applied a total of 181 rules in 45069 ms. Remains 78 /167 variables (removed 89) and now considering 18100/59225 (removed 41125) transitions.
[2026-05-27 09:25:52] [INFO ] Flow matrix only has 18077 transitions (discarded 23 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2023877623484059387.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5784913441535519253.kers'
[2026-05-27 09:25:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2023877623484059387.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5784913441535519253.kers]
Normalized transition count is 18076 out of 18077 initially.
Culled 0 columns in 63 ms.
// Phase 1: matrix 18076 rows 78 cols 377974 entries
Finished phase 1 with 52 SingleSign rule and 2 generalized
[2026-05-27 09:25:52] [INFO ] Computed 24 invariants in 265 ms
Computed 24 P flows in 266 ms.
Exported basis to /tmp/petrispot-output-5784913441535519253.kers
Total runtime 328 ms.
[2026-05-27 09:25:58] [INFO ] Implicit Places using invariants in 5954 ms returned []
Implicit Place search using SMT only with invariants took 5955 ms to find 0 implicit places.
Running 18098 sub problems to find dead transitions.
[2026-05-27 09:25:58] [INFO ] Flow matrix only has 18077 transitions (discarded 23 similar events)
[2026-05-27 09:25:58] [INFO ] Invariant cache hit.
[2026-05-27 09:25:58] [INFO ] State equation strengthened by 8759 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 18098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 77/18155 variables, and 9 constraints, problems are : Problem set: 0 solved, 18098 unsolved in 30327 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/78 constraints, ReadFeed: 0/8759 constraints, PredecessorRefiner: 18098/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 18098 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 77/18155 variables, and 9 constraints, problems are : Problem set: 0 solved, 18098 unsolved in 30318 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/78 constraints, ReadFeed: 0/8759 constraints, PredecessorRefiner: 18065/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 106148ms problems are : Problem set: 0 solved, 18098 unsolved
Search for dead transitions found 0 dead transitions in 106220ms
Starting structural reductions in SI_LTL mode, iteration 1 : 78/167 places, 18100/59225 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 157279 ms. Remains : 78/167 places, 18100/59225 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-0909-LTLFireability-10
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-0909-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0909-LTLFireability-10 finished in 157484 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((X(X(!p0))&&F(!p1)))||(F(!p1)&&X(X((!p0&&F(G(p0)))))))))'
Support contains 21 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 59225/59225 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 158 transition count 40054
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 158 transition count 40054
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 155 transition count 12352
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 155 transition count 12352
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 154 transition count 12350
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 154 transition count 12350
Applied a total of 26 rules in 5718 ms. Remains 154 /167 variables (removed 13) and now considering 12350/59225 (removed 46875) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18025922474126990371.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-798157041022207124.kers'
[2026-05-27 09:27:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18025922474126990371.kers, --Pflows, --basisKERS=/tmp/petrispot-output-798157041022207124.kers]
Culled 0 columns in 45 ms.
// Phase 1: matrix 12350 rows 154 cols 267424 entries
Finished phase 1 with 128 SingleSign rule and 2 generalized
[2026-05-27 09:27:50] [INFO ] Computed 24 invariants in 193 ms
Computed 24 P flows in 194 ms.
Exported basis to /tmp/petrispot-output-798157041022207124.kers
Total runtime 233 ms.
[2026-05-27 09:27:54] [INFO ] Implicit Places using invariants in 4162 ms returned []
Implicit Place search using SMT only with invariants took 4180 ms to find 0 implicit places.
Running 12349 sub problems to find dead transitions.
[2026-05-27 09:27:54] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 12349 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 153/12504 variables, and 9 constraints, problems are : Problem set: 0 solved, 12349 unsolved in 30216 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/154 constraints, PredecessorRefiner: 12349/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12349 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 12349 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 153/12504 variables, and 9 constraints, problems are : Problem set: 0 solved, 12349 unsolved in 30244 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/154 constraints, PredecessorRefiner: 12229/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 88361ms problems are : Problem set: 0 solved, 12349 unsolved
Search for dead transitions found 0 dead transitions in 88415ms
Starting structural reductions in LTL mode, iteration 1 : 154/167 places, 12350/59225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98338 ms. Remains : 154/167 places, 12350/59225 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((X(X(p0))&&F(p1)))||(F(p1)&&X(X((p0&&F(G(!p0)))))))))'
Stuttering acceptance computed with spot in 436 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0909-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 9458 ms.
Product exploration explored 100000 steps with 0 reset in 9436 ms.
Computed a total of 21 stabilizing places and 21 stable transitions
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge based reduction with 9 factoid took 79 ms. Reduced automaton from 9 states, 21 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 5061 ms. (7 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 342 ms. (116 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 283 ms. (140 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 287 ms. (138 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 32530 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :0 out of 4
Probabilistic random walk after 32530 steps, saw 21043 distinct states, run finished after 3001 ms. (steps per millisecond=10 ) properties seen :0
[2026-05-27 09:29:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 88/109 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 37/146 variables, 4/16 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 8/154 variables, 8/24 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 12504/12504 variables, and 178 constraints, problems are : Problem set: 1 solved, 3 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 88/109 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 37/146 variables, 4/16 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SMT process timed out in 11358ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 21 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 12350/12350 transitions.
Graph (trivial) has 99 edges and 154 vertex of which 4 / 154 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 152 transition count 12333
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 139 transition count 12333
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 27 place count 139 transition count 12315
Deduced a syphon composed of 18 places in 15 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 63 place count 121 transition count 12315
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 119 transition count 12298
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 119 transition count 12298
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 119 transition count 12296
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 4 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 147 place count 80 transition count 12257
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 151 place count 78 transition count 12268
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 153 place count 78 transition count 12266
Free-agglomeration rule applied 13 times.
Iterating global reduction 3 with 13 rules applied. Total rules applied 166 place count 78 transition count 12253
Reduce places removed 13 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 181 place count 65 transition count 12251
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 4 with 26 rules applied. Total rules applied 207 place count 65 transition count 12225
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 208 place count 65 transition count 12224
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 215 place count 64 transition count 12218
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 216 place count 64 transition count 12218
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 222 place count 64 transition count 12218
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 228 place count 64 transition count 12212
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 229 place count 63 transition count 12211
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 232 place count 60 transition count 12211
Applied a total of 232 rules in 46973 ms. Remains 60 /154 variables (removed 94) and now considering 12211/12350 (removed 139) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46974 ms. Remains : 60/154 places, 12211/12350 transitions.
RANDOM walk for 40000 steps (8 resets) in 11052 ms. (3 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 987 ms. (40 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-5079217295684141630.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17538396851735923382.kers'
[2026-05-27 09:30:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5079217295684141630.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17538396851735923382.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 42 ms.
// Phase 1: matrix 12211 rows 59 cols 255284 entries
Finished phase 1 with 37 SingleSign rule and 2 generalized
[2026-05-27 09:30:49] [INFO ] Computed 21 invariants in 170 ms
Computed 21 P flows in 170 ms.
Exported basis to /tmp/petrispot-output-17538396851735923382.kers
Total runtime 216 ms.
[2026-05-27 09:30:49] [INFO ] State equation strengthened by 5832 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/46 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/54 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 12202/12256 variables, 54/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/12256 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/12262 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/12262 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/12264 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/12264 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/12271 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/12271 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/12271 variables, 5832/5913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/12271 variables, 0/5913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/12271 variables, 0/5913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12271/12271 variables, and 5913 constraints, problems are : Problem set: 0 solved, 1 unsolved in 11730 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 60/60 constraints, ReadFeed: 5832/5832 constraints, PredecessorRefiner: 1/0 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/46 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/54 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 12202/12256 variables, 54/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/12256 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/12262 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/12262 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/12264 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/12264 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/12271 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/12271 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/12271 variables, 5832/5913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/12271 variables, 0/5913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/12271 variables, 0/5913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12271/12271 variables, and 5913 constraints, problems are : Problem set: 0 solved, 1 unsolved in 11842 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 60/60 constraints, ReadFeed: 5832/5832 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23936ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 893 ms.
Support contains 10 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 12211/12211 transitions.
Graph (trivial) has 14 edges and 60 vertex of which 2 / 60 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 59 transition count 12203
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 53 transition count 12203
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 16 place count 50 transition count 3995
Iterating global reduction 0 with 3 rules applied. Total rules applied 19 place count 50 transition count 3995
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 50 transition count 3994
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 49 transition count 3993
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 48 transition count 2263
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 48 transition count 2263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 48 transition count 2262
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 48 transition count 2260
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 48 transition count 2257
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 33 place count 45 transition count 2257
Applied a total of 33 rules in 4116 ms. Remains 45 /60 variables (removed 15) and now considering 2257/12211 (removed 9954) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4120 ms. Remains : 45/60 places, 2257/12211 transitions.
RANDOM walk for 35636 steps (7 resets) in 3497 ms. (10 steps per ms) remains 0/1 properties
Found 1 invariant AP formulas.
Knowledge based reduction with 10 factoid took 94 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p1)]
Knowledge-based reduction took 96692 ms.
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
Support contains 21 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 12350/12350 transitions.
Graph (trivial) has 99 edges and 154 vertex of which 4 / 154 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 151 transition count 12335
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 139 transition count 12335
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 25 place count 139 transition count 12318
Deduced a syphon composed of 17 places in 13 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 59 place count 122 transition count 12318
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 120 transition count 12301
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 120 transition count 12301
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 120 transition count 12299
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 5 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 145 place count 80 transition count 12259
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 149 place count 78 transition count 12270
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 151 place count 78 transition count 12268
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 157 place count 78 transition count 12268
Applied a total of 157 rules in 16432 ms. Remains 78 /154 variables (removed 76) and now considering 12268/12350 (removed 82) transitions.
[2026-05-27 09:31:35] [INFO ] Flow matrix only has 12245 transitions (discarded 23 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-212446560422950085.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15422128084041966100.kers'
[2026-05-27 09:31:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-212446560422950085.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15422128084041966100.kers]
Normalized transition count is 12244 out of 12245 initially.
Culled 0 columns in 73 ms.
// Phase 1: matrix 12244 rows 78 cols 255496 entries
Finished phase 1 with 52 SingleSign rule and 2 generalized
[2026-05-27 09:31:35] [INFO ] Computed 24 invariants in 266 ms
Computed 24 P flows in 267 ms.
Exported basis to /tmp/petrispot-output-15422128084041966100.kers
Total runtime 336 ms.
[2026-05-27 09:31:41] [INFO ] Implicit Places using invariants in 5666 ms returned []
Implicit Place search using SMT only with invariants took 5667 ms to find 0 implicit places.
Running 12266 sub problems to find dead transitions.
[2026-05-27 09:31:41] [INFO ] Flow matrix only has 12245 transitions (discarded 23 similar events)
[2026-05-27 09:31:41] [INFO ] Invariant cache hit.
[2026-05-27 09:31:41] [INFO ] State equation strengthened by 5843 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 12266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 77/12323 variables, and 9 constraints, problems are : Problem set: 0 solved, 12266 unsolved in 30211 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/78 constraints, ReadFeed: 0/5843 constraints, PredecessorRefiner: 12266/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 12266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 77/12323 variables, and 9 constraints, problems are : Problem set: 0 solved, 12266 unsolved in 30358 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/78 constraints, ReadFeed: 0/5843 constraints, PredecessorRefiner: 12232/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 86394ms problems are : Problem set: 0 solved, 12266 unsolved
Search for dead transitions found 0 dead transitions in 86442ms
Starting structural reductions in SI_LTL mode, iteration 1 : 78/154 places, 12268/12350 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108564 ms. Remains : 78/154 places, 12268/12350 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge based reduction with 5 factoid took 56 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 7523 ms. (5 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 786 ms. (50 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 496 ms. (80 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 89899 steps, run timeout after 6001 ms. (steps per millisecond=14 ) properties seen :0 out of 2
Probabilistic random walk after 89899 steps, saw 30875 distinct states, run finished after 6003 ms. (steps per millisecond=14 ) properties seen :0
[2026-05-27 09:33:16] [INFO ] Flow matrix only has 12245 transitions (discarded 23 similar events)
[2026-05-27 09:33:16] [INFO ] Invariant cache hit.
[2026-05-27 09:33:16] [INFO ] State equation strengthened by 5843 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 37/58 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 12/70 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 8/78 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 12322/12323 variables, and 102 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 78/78 constraints, ReadFeed: 0/5843 constraints, PredecessorRefiner: 2/0 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/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 37/58 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 12/70 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 8/78 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 12322/12323 variables, and 102 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5004 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 78/78 constraints, ReadFeed: 0/5843 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10124ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 21 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 12268/12268 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 78 transition count 12266
Free-agglomeration rule applied 13 times.
Iterating global reduction 1 with 13 rules applied. Total rules applied 15 place count 78 transition count 12253
Reduce places removed 13 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 65 transition count 12251
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 2 with 32 rules applied. Total rules applied 62 place count 65 transition count 12219
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 65 transition count 12218
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 70 place count 64 transition count 12212
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 64 transition count 12212
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 63 transition count 12211
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 75 place count 60 transition count 12211
Applied a total of 75 rules in 30824 ms. Remains 60 /78 variables (removed 18) and now considering 12211/12268 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30826 ms. Remains : 60/78 places, 12211/12268 transitions.
RANDOM walk for 40000 steps (8 resets) in 10650 ms. (3 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 994 ms. (40 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-10947816150960466384.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11165497714706947748.kers'
[2026-05-27 09:34:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10947816150960466384.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11165497714706947748.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 52 ms.
// Phase 1: matrix 12211 rows 59 cols 255284 entries
Finished phase 1 with 37 SingleSign rule and 2 generalized
[2026-05-27 09:34:00] [INFO ] Computed 21 invariants in 194 ms
Computed 21 P flows in 194 ms.
Exported basis to /tmp/petrispot-output-11165497714706947748.kers
Total runtime 236 ms.
[2026-05-27 09:34:00] [INFO ] State equation strengthened by 5832 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/46 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/54 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 12202/12256 variables, 54/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/12256 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/12262 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/12262 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/12264 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/12264 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/12271 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/12271 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/12271 variables, 5832/5913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/12271 variables, 0/5913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/12271 variables, 0/5913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12271/12271 variables, and 5913 constraints, problems are : Problem set: 0 solved, 1 unsolved in 11135 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 60/60 constraints, ReadFeed: 5832/5832 constraints, PredecessorRefiner: 1/0 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/46 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/54 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 12202/12256 variables, 54/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/12256 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/12262 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/12262 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/12264 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/12264 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/12271 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/12271 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/12271 variables, 5832/5913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/12271 variables, 0/5913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/12271 variables, 0/5913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12271/12271 variables, and 5913 constraints, problems are : Problem set: 0 solved, 1 unsolved in 10124 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 60/60 constraints, ReadFeed: 5832/5832 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21621ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 874 ms.
Support contains 10 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 12211/12211 transitions.
Graph (trivial) has 14 edges and 60 vertex of which 2 / 60 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 59 transition count 12203
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 53 transition count 12203
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 16 place count 50 transition count 3995
Iterating global reduction 0 with 3 rules applied. Total rules applied 19 place count 50 transition count 3995
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 50 transition count 3994
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 49 transition count 3993
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 48 transition count 2263
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 48 transition count 2263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 48 transition count 2262
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 48 transition count 2260
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 48 transition count 2257
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 33 place count 45 transition count 2257
Applied a total of 33 rules in 3844 ms. Remains 45 /60 variables (removed 15) and now considering 2257/12211 (removed 9954) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3844 ms. Remains : 45/60 places, 2257/12211 transitions.
RANDOM walk for 27801 steps (5 resets) in 2854 ms. (9 steps per ms) remains 0/1 properties
Knowledge based reduction with 5 factoid took 74 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Knowledge-based reduction took 80129 ms.
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Product exploration timeout after 66860 steps with 0 reset in 10001 ms.
Product exploration timeout after 65500 steps with 0 reset in 10001 ms.
Built C files in :
/tmp/ltsmin782577194948374116
[2026-05-27 09:34:48] [INFO ] Too many transitions (12268) to apply POR reductions. Disabling POR matrices.
[2026-05-27 09:34:48] [INFO ] Built C files in 208ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin782577194948374116
Running compilation step : cd /tmp/ltsmin782577194948374116;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin782577194948374116;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin782577194948374116;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 21 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 12268/12268 transitions.
Applied a total of 0 rules in 5122 ms. Remains 78 /78 variables (removed 0) and now considering 12268/12268 (removed 0) transitions.
[2026-05-27 09:34:56] [INFO ] Flow matrix only has 12245 transitions (discarded 23 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12969643538917252814.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10571163646476696926.kers'
[2026-05-27 09:34:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12969643538917252814.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10571163646476696926.kers]
Normalized transition count is 12244 out of 12245 initially.
Culled 0 columns in 42 ms.
// Phase 1: matrix 12244 rows 78 cols 255496 entries
Finished phase 1 with 52 SingleSign rule and 2 generalized
[2026-05-27 09:34:56] [INFO ] Computed 24 invariants in 165 ms
Computed 24 P flows in 166 ms.
Exported basis to /tmp/petrispot-output-10571163646476696926.kers
Total runtime 226 ms.
[2026-05-27 09:35:01] [INFO ] Implicit Places using invariants in 5271 ms returned []
Implicit Place search using SMT only with invariants took 5273 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10396 ms. Remains : 78/78 places, 12268/12268 transitions.
Built C files in :
/tmp/ltsmin8851947930215243780
[2026-05-27 09:35:01] [INFO ] Too many transitions (12268) to apply POR reductions. Disabling POR matrices.
[2026-05-27 09:35:02] [INFO ] Built C files in 339ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8851947930215243780
Running compilation step : cd /tmp/ltsmin8851947930215243780;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8851947930215243780;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8851947930215243780;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-27 09:35:12] [INFO ] Flatten gal took : 2451 ms
[2026-05-27 09:35:14] [INFO ] Flatten gal took : 1563 ms
[2026-05-27 09:35:14] [INFO ] Time to serialize gal into /tmp/LTL5291322399146065527.gal : 229 ms
[2026-05-27 09:35:14] [INFO ] Time to serialize properties into /tmp/LTL17971790132325730771.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5291322399146065527.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12966143352124538809.hoa' '-atoms' '/tmp/LTL17971790132325730771.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17971790132325730771.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12966143352124538809.hoa
Detected timeout of ITS tools.
[2026-05-27 09:35:37] [INFO ] Flatten gal took : 2530 ms
[2026-05-27 09:35:39] [INFO ] Flatten gal took : 1685 ms
[2026-05-27 09:35:39] [INFO ] Time to serialize gal into /tmp/LTL13337777608715616058.gal : 257 ms
[2026-05-27 09:35:39] [INFO ] Time to serialize properties into /tmp/LTL9420339069671667342.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13337777608715616058.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9420339069671667342.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G((X(X("(((((p19!=1)||(p34!=1))||((p63!=1)||(p72!=1)))||(((p95!=1)||(p114!=1))||((p139!=1)||(p152!=1))))||((p177!=1)||(p216!=1))...723
Formula 0 simplified : G(F(XX!"(((((p19!=1)||(p34!=1))||((p63!=1)||(p72!=1)))||(((p95!=1)||(p114!=1))||((p139!=1)||(p152!=1))))||((p177!=1)||(p216!=1)))" |...701
Detected timeout of ITS tools.
[2026-05-27 09:35:56] [INFO ] Flatten gal took : 1698 ms
[2026-05-27 09:35:56] [INFO ] Applying decomposition
[2026-05-27 09:35:58] [INFO ] Flatten gal took : 1665 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9027264600778806235.txt' '-o' '/tmp/graph9027264600778806235.bin' '-w' '/tmp/graph9027264600778806235.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9027264600778806235.bin' '-l' '-1' '-v' '-w' '/tmp/graph9027264600778806235.weights' '-q' '0' '-e' '0.001'
[2026-05-27 09:36:03] [INFO ] Decomposing Gal with order
[2026-05-27 09:36:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 09:36:07] [INFO ] Removed a total of 134109 redundant transitions.
[2026-05-27 09:36:08] [INFO ] Flatten gal took : 2864 ms
[2026-05-27 09:36:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 1627 ms.
[2026-05-27 09:36:10] [INFO ] Time to serialize gal into /tmp/LTL1219393930006655891.gal : 45 ms
[2026-05-27 09:36:10] [INFO ] Time to serialize properties into /tmp/LTL15098808025664715938.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1219393930006655891.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15098808025664715938.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G((X(X("(((((i1.u1.p19!=1)||(i1.u2.p34!=1))||((i2.u5.p63!=1)||(i1.u6.p72!=1)))||(((i1.u9.p95!=1)||(i1.u10.p114!=1))||((i2.u12.p1...1062
Formula 0 simplified : G(F(XX!"(((((i1.u1.p19!=1)||(i1.u2.p34!=1))||((i2.u5.p63!=1)||(i1.u6.p72!=1)))||(((i1.u9.p95!=1)||(i1.u10.p114!=1))||((i2.u12.p139!=...1040
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV0-PT-0909-LTLFireability-11 finished in 520579 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((F(G(p0))||G(p1)))))'
Support contains 21 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 59225/59225 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 158 transition count 40054
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 158 transition count 40054
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 155 transition count 12352
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 155 transition count 12352
Applied a total of 24 rules in 5890 ms. Remains 155 /167 variables (removed 12) and now considering 12352/59225 (removed 46873) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11680982233101540617.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3651490011366339653.kers'
[2026-05-27 09:36:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11680982233101540617.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3651490011366339653.kers]
Culled 0 columns in 77 ms.
// Phase 1: matrix 12352 rows 155 cols 267428 entries
Finished phase 1 with 129 SingleSign rule and 2 generalized
[2026-05-27 09:36:31] [INFO ] Computed 24 invariants in 294 ms
Computed 24 P flows in 296 ms.
Exported basis to /tmp/petrispot-output-3651490011366339653.kers
Total runtime 335 ms.
[2026-05-27 09:36:35] [INFO ] Implicit Places using invariants in 4714 ms returned []
Implicit Place search using SMT only with invariants took 4718 ms to find 0 implicit places.
Running 12351 sub problems to find dead transitions.
[2026-05-27 09:36:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 12351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 154/12507 variables, and 9 constraints, problems are : Problem set: 0 solved, 12351 unsolved in 30222 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/155 constraints, PredecessorRefiner: 12351/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 12351 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 154/12507 variables, and 9 constraints, problems are : Problem set: 0 solved, 12351 unsolved in 30302 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/155 constraints, PredecessorRefiner: 12229/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 89519ms problems are : Problem set: 0 solved, 12351 unsolved
Search for dead transitions found 0 dead transitions in 89598ms
Starting structural reductions in LTL mode, iteration 1 : 155/167 places, 12352/59225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100258 ms. Remains : 155/167 places, 12352/59225 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((F(G(p0))||G(p1)))))'
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV0-PT-0909-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 8908 ms.

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="ErlangenMainframeV0-PT-0909"
export BK_EXAMINATION="LTLFireability"
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 ErlangenMainframeV0-PT-0909, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-smll-177955740600452"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ErlangenMainframeV0-PT-0909.tgz
mv ErlangenMainframeV0-PT-0909 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;