Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r338-smll-178021499200284.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 ErlangenMainframeV2-PT-bP10C08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499200284
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 101M
-rw-r--r-- 1 mcc users 5.8K May 27 09:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 27 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 27 09:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 27 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 27 10:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 27 10:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 27 10:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 10:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 17K May 27 09:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 190K May 27 09:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 27 09:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K May 27 09:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 8 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 100M May 26 18:17 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1780402815067

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV2-PT-bP10C08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-06-02 12:20:17] [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-06-02 12:20:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-02 12:20:22] [INFO ] Load time of PNML (sax parser for PT used): 5350 ms
[2026-06-02 12:20:22] [INFO ] Transformed 345 places.
[2026-06-02 12:20:23] [INFO ] Transformed 79094 transitions.
[2026-06-02 12:20:23] [INFO ] Found NUPN structural information;
[2026-06-02 12:20:23] [INFO ] Parsed PT model containing 345 places and 79094 transitions and 1995500 arcs in 6443 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 39 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ErlangenMainframeV2-PT-bP10C08-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP10C08-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP10C08-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP10C08-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 62 out of 345 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 345/345 places, 79094/79094 transitions.
Discarding 77 places :
Symmetric choice reduction at 0 with 77 rule applications. Total rules 77 place count 268 transition count 79017
Iterating global reduction 0 with 77 rules applied. Total rules applied 154 place count 268 transition count 79017
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 203 place count 219 transition count 78968
Iterating global reduction 0 with 49 rules applied. Total rules applied 252 place count 219 transition count 78968
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 255 place count 216 transition count 78965
Iterating global reduction 0 with 3 rules applied. Total rules applied 258 place count 216 transition count 78965
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 261 place count 213 transition count 78946
Iterating global reduction 0 with 3 rules applied. Total rules applied 264 place count 213 transition count 78946
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 267 place count 210 transition count 78943
Iterating global reduction 0 with 3 rules applied. Total rules applied 270 place count 210 transition count 78943
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 273 place count 207 transition count 78940
Iterating global reduction 0 with 3 rules applied. Total rules applied 276 place count 207 transition count 78940
Applied a total of 276 rules in 5106 ms. Remains 207 /345 variables (removed 138) and now considering 78940/79094 (removed 154) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11117633784549309919.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8695465143678658332.kers'
[2026-06-02 12:20:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11117633784549309919.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8695465143678658332.kers]
Culled 0 columns in 443 ms.
// Phase 1: matrix 78940 rows 207 cols 1995116 entries
Finished phase 1 with 176 SingleSign rule and 3 generalized
[2026-06-02 12:20:32] [INFO ] Computed 28 invariants in 1986 ms
Computed 28 P flows in 1992 ms.
Exported basis to /tmp/petrispot-output-8695465143678658332.kers
Total runtime 2263 ms.
[2026-06-02 12:20:33] [INFO ] Implicit Places using invariants in 3202 ms returned []
Implicit Place search using SMT only with invariants took 3294 ms to find 0 implicit places.
Running 78939 sub problems to find dead transitions.
[2026-06-02 12:20:34] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
SMT process timed out in 785250ms, After SMT, problems are : Problem set: 0 solved, 78939 unsolved
Search for dead transitions found 0 dead transitions in 785822ms
Starting structural reductions in LTL mode, iteration 1 : 207/345 places, 78940/79094 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 794641 ms. Remains : 207/345 places, 78940/79094 transitions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 78940/78940 transitions.
Applied a total of 0 rules in 454 ms. Remains 207 /207 variables (removed 0) and now considering 78940/78940 (removed 0) transitions.
[2026-06-02 12:33:39] [INFO ] Invariant cache hit.
[2026-06-02 12:33:40] [INFO ] Implicit Places using invariants in 214 ms returned []
Implicit Place search using SMT only with invariants took 216 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 679 ms. Remains : 207/207 places, 78940/78940 transitions.
Support contains 62 out of 207 places after structural reductions.
[2026-06-02 12:33:56] [INFO ] Flatten gal took : 14466 ms
[2026-06-02 12:34:11] [INFO ] Flatten gal took : 14499 ms
[2026-06-02 12:34:30] [INFO ] Input system was already deterministic with 78940 transitions.
Reduction of identical properties reduced properties to check from 33 to 32
RANDOM walk for 31702 steps (8 resets) in 120020 ms. (0 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 442 ms. (9 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 362 ms. (11 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 473 ms. (8 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 477 ms. (8 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 291 ms. (13 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 360 ms. (11 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 283 ms. (14 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 265 ms. (15 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 303 ms. (13 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 329 ms. (12 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 281 ms. (14 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 366 ms. (10 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 313 ms. (12 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 269 ms. (14 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 432 ms. (9 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 241 ms. (16 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 304 ms. (13 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 303 ms. (13 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 354 ms. (11 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 382 ms. (10 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 280 ms. (14 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 348 ms. (11 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 242 ms. (16 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 323 ms. (12 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 345 ms. (11 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 336 ms. (11 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 305 ms. (13 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 435 ms. (9 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 266 ms. (14 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 289 ms. (13 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 250 ms. (15 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 284 ms. (14 steps per ms) remains 32/32 properties
Interrupted probabilistic random walk after 104006 steps, run timeout after 99001 ms. (steps per millisecond=1 ) properties seen :0 out of 32
Probabilistic random walk after 104006 steps, saw 18498 distinct states, run finished after 99017 ms. (steps per millisecond=1 ) properties seen :0
[2026-06-02 12:36:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 1 (OVERLAPS) 24/86 variables, 13/13 constraints. Problems are: Problem set: 1 solved, 31 unsolved
SMT process timed out in 26409ms, After SMT, problems are : Problem set: 1 solved, 31 unsolved
Fused 31 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 61 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 78940/78940 transitions.
Graph (trivial) has 128 edges and 207 vertex of which 9 / 207 are part of one of the 4 SCC in 35 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 202 transition count 78903
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 36 rules applied. Total rules applied 64 place count 175 transition count 78894
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 70 place count 169 transition count 78894
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 70 place count 169 transition count 78879
Deduced a syphon composed of 15 places in 107 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 100 place count 154 transition count 78879
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 39 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 166 place count 121 transition count 78846
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 172 place count 121 transition count 78840
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 175 place count 118 transition count 78833
Iterating global reduction 4 with 3 rules applied. Total rules applied 178 place count 118 transition count 78833
Performed 7 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 7 places in 33 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 192 place count 111 transition count 78862
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 204 place count 111 transition count 78850
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 206 place count 109 transition count 78844
Iterating global reduction 5 with 2 rules applied. Total rules applied 208 place count 109 transition count 78844
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 218 place count 109 transition count 78834
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 34 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 220 place count 108 transition count 78847
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 221 place count 108 transition count 78846
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 224 place count 108 transition count 78843
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 227 place count 105 transition count 78843
Partial Post-agglomeration rule applied 10 times.
Drop transitions (Partial Post agglomeration) removed 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 237 place count 105 transition count 78843
Applied a total of 237 rules in 23293 ms. Remains 105 /207 variables (removed 102) and now considering 78843/78940 (removed 97) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23297 ms. Remains : 105/207 places, 78843/78940 transitions.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA ErlangenMainframeV2-PT-bP10C08-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 22 stabilizing places and 22 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((F(p0)||X((F((p1||X(p1))) U X(!p2))))))'
Support contains 32 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 78940/78940 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 205 transition count 64360
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 205 transition count 64360
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 204 transition count 46864
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 204 transition count 46864
Applied a total of 6 rules in 6079 ms. Remains 204 /207 variables (removed 3) and now considering 46864/78940 (removed 32076) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12682703186658319971.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6046745037800218553.kers'
[2026-06-02 12:37:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12682703186658319971.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6046745037800218553.kers]
Culled 0 columns in 227 ms.
// Phase 1: matrix 46864 rows 204 cols 1190300 entries
Finished phase 1 with 173 SingleSign rule and 3 generalized
[2026-06-02 12:37:44] [INFO ] Computed 28 invariants in 1081 ms
Computed 28 P flows in 1082 ms.
Exported basis to /tmp/petrispot-output-6046745037800218553.kers
Total runtime 1283 ms.
[2026-06-02 12:38:01] [INFO ] Implicit Places using invariants in 18379 ms returned []
Implicit Place search using SMT only with invariants took 18392 ms to find 0 implicit places.
Running 46863 sub problems to find dead transitions.
[2026-06-02 12:38:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 46863 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 203/47068 variables, and 11 constraints, problems are : Problem set: 0 solved, 46863 unsolved in 31590 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/204 constraints, PredecessorRefiner: 46863/167 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46863 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 46863 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 203/47068 variables, and 11 constraints, problems are : Problem set: 0 solved, 46863 unsolved in 30990 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/204 constraints, PredecessorRefiner: 46696/167 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 322110ms problems are : Problem set: 0 solved, 46863 unsolved
Search for dead transitions found 0 dead transitions in 322498ms
Starting structural reductions in LTL mode, iteration 1 : 204/207 places, 46864/78940 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 347100 ms. Remains : 204/207 places, 46864/78940 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)||X((F((p1||X(p1))) U X(!p2))))))'
Stuttering acceptance computed with spot in 557 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP10C08-LTLFireability-03
Product exploration timeout after 6340 steps with 0 reset in 10012 ms.
Product exploration timeout after 7840 steps with 0 reset in 10014 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge based reduction with 9 factoid took 72 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 88111 ms. (0 steps per ms) remains 6/6 properties
BEST_FIRST walk for 18849 steps (3 resets) in 20014 ms. (0 steps per ms) remains 6/6 properties
BEST_FIRST walk for 12028 steps (1 resets) in 20012 ms. (0 steps per ms) remains 6/6 properties
BEST_FIRST walk for 13234 steps (1 resets) in 20004 ms. (0 steps per ms) remains 6/6 properties
BEST_FIRST walk for 12689 steps (1 resets) in 20009 ms. (0 steps per ms) remains 6/6 properties
BEST_FIRST walk for 16137 steps (2 resets) in 20009 ms. (0 steps per ms) remains 6/6 properties
BEST_FIRST walk for 13095 steps (1 resets) in 20018 ms. (0 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 372859 steps, run timeout after 159003 ms. (steps per millisecond=2 ) properties seen :0 out of 6
Probabilistic random walk after 372859 steps, saw 54347 distinct states, run finished after 159004 ms. (steps per millisecond=2 ) properties seen :0
[2026-06-02 12:47:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf2 is UNSAT
Problem apf5 is UNSAT
At refinement iteration 1 (OVERLAPS) 34/66 variables, 13/13 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 63/129 variables, 4/17 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/17 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 75/204 variables, 11/28 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/28 constraints. Problems are: Problem set: 2 solved, 4 unsolved
SMT process timed out in 5461ms, After SMT, problems are : Problem set: 2 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 32 out of 204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 204/204 places, 46864/46864 transitions.
Graph (trivial) has 146 edges and 204 vertex of which 9 / 204 are part of one of the 4 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 199 transition count 46827
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 36 rules applied. Total rules applied 64 place count 172 transition count 46818
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 70 place count 166 transition count 46818
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 70 place count 166 transition count 46803
Deduced a syphon composed of 15 places in 78 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 100 place count 151 transition count 46803
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 21 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 188 place count 107 transition count 46759
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 194 place count 107 transition count 46753
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 197 place count 104 transition count 46746
Iterating global reduction 4 with 3 rules applied. Total rules applied 200 place count 104 transition count 46746
Performed 6 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 6 places in 24 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 212 place count 98 transition count 46764
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 224 place count 98 transition count 46752
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 226 place count 96 transition count 46748
Iterating global reduction 5 with 2 rules applied. Total rules applied 228 place count 96 transition count 46748
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 238 place count 96 transition count 46738
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 25 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 240 place count 95 transition count 46751
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 241 place count 95 transition count 46750
Free-agglomeration rule applied 11 times.
Iterating global reduction 7 with 11 rules applied. Total rules applied 252 place count 95 transition count 46739
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 263 place count 84 transition count 46739
Partial Post-agglomeration rule applied 7 times.
Drop transitions (Partial Post agglomeration) removed 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 270 place count 84 transition count 46739
Applied a total of 270 rules in 19550 ms. Remains 84 /204 variables (removed 120) and now considering 46739/46864 (removed 125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19554 ms. Remains : 84/204 places, 46739/46864 transitions.
Found 2 invariant AP formulas.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 11 factoid took 16 ms. Proved property starting from automaton with 5 states, 8 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 238854 ms.
FORMULA ErlangenMainframeV2-PT-bP10C08-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV2-PT-bP10C08-LTLFireability-03 finished in 607005 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(X((F(p2)||p1)))||p0))&&F(p3)))'
Support contains 25 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 78940/78940 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 189 transition count 52697
Ensure Unique test removed 10 places
Iterating global reduction 0 with 28 rules applied. Total rules applied 46 place count 179 transition count 52697
Applied a total of 46 rules in 10980 ms. Remains 179 /207 variables (removed 28) and now considering 52697/78940 (removed 26243) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2674844909178995742.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12462093839136537413.kers'
[2026-06-02 12:47:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2674844909178995742.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12462093839136537413.kers]
Culled 0 columns in 143 ms.
// Phase 1: matrix 52697 rows 179 cols 840394 entries
Finished phase 1 with 160 SingleSign rule and 1 generalized
[2026-06-02 12:47:55] [INFO ] Computed 18 invariants in 649 ms
Computed 18 P flows in 651 ms.
Exported basis to /tmp/petrispot-output-12462093839136537413.kers
Total runtime 759 ms.
[2026-06-02 12:48:03] [INFO ] Implicit Places using invariants in 8928 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 8998 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 178/207 places, 52697/78940 transitions.
Applied a total of 0 rules in 208 ms. Remains 178 /178 variables (removed 0) and now considering 52697/52697 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 20189 ms. Remains : 178/207 places, 52697/78940 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(X((F(p2)||p1)))||p0))&&F(p3)))'
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p3), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP10C08-LTLFireability-05
Product exploration timeout after 3720 steps with 2 reset in 10023 ms.
Stack based approach found an accepted trace after 39 steps with 0 reset with depth 40 and stack size 40 in 21 ms.
FORMULA ErlangenMainframeV2-PT-bP10C08-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV2-PT-bP10C08-LTLFireability-05 finished in 30743 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X((X(!p1) U ((X(!p1)&&(!p2||F(!p3)))||X(G(!p1))))))))'
Support contains 35 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 78940/78940 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 199 transition count 53720
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 199 transition count 53720
Applied a total of 16 rules in 5917 ms. Remains 199 /207 variables (removed 8) and now considering 53720/78940 (removed 25220) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10489905288608741894.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-459193523557035771.kers'
[2026-06-02 12:48:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10489905288608741894.kers, --Pflows, --basisKERS=/tmp/petrispot-output-459193523557035771.kers]
Culled 0 columns in 252 ms.
// Phase 1: matrix 53720 rows 199 cols 1389836 entries
Finished phase 1 with 169 SingleSign rule and 2 generalized
[2026-06-02 12:48:21] [INFO ] Computed 28 invariants in 1338 ms
Computed 28 P flows in 1339 ms.
Exported basis to /tmp/petrispot-output-459193523557035771.kers
Total runtime 1508 ms.
[2026-06-02 12:48:33] [INFO ] Implicit Places using invariants in 13421 ms returned []
Implicit Place search using SMT only with invariants took 13423 ms to find 0 implicit places.
Running 53719 sub problems to find dead transitions.
[2026-06-02 12:48:34] [INFO ] Invariant cache hit.
SMT process timed out in 331040ms, After SMT, problems are : Problem set: 0 solved, 53719 unsolved
Search for dead transitions found 0 dead transitions in 331353ms
Starting structural reductions in LTL mode, iteration 1 : 199/207 places, 53720/78940 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 350901 ms. Remains : 199/207 places, 53720/78940 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X((X(!p1) U ((X(!p1)&&(!p2||F(!p3)))||X(G(!p1))))))))'
Stuttering acceptance computed with spot in 527 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), p1, p1, (AND p1 p3), true, (AND p3 p1), p3]
Running random walk in product with property : ErlangenMainframeV2-PT-bP10C08-LTLFireability-06
Product exploration timeout after 20050 steps with 5012 reset in 10003 ms.
Product exploration timeout after 17860 steps with 4465 reset in 10036 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge based reduction with 6 factoid took 65 ms. Reduced automaton from 9 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 36423 steps (8 resets) in 120016 ms. (0 steps per ms) remains 1/1 properties
BEST_FIRST walk for 7339 steps (0 resets) in 20022 ms. (0 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 168866 steps, run timeout after 105006 ms. (steps per millisecond=1 ) properties seen :0 out of 1
Probabilistic random walk after 168866 steps, saw 27206 distinct states, run finished after 105007 ms. (steps per millisecond=1 ) properties seen :0
[2026-06-02 12:56:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/60 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/123 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 76/199 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 5520ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 13 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 53720/53720 transitions.
Graph (trivial) has 147 edges and 199 vertex of which 9 / 199 are part of one of the 4 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 194 transition count 53683
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 36 rules applied. Total rules applied 64 place count 167 transition count 53674
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 70 place count 161 transition count 53674
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 70 place count 161 transition count 53658
Deduced a syphon composed of 16 places in 75 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 33 rules applied. Total rules applied 103 place count 144 transition count 53658
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 116 place count 131 transition count 15699
Ensure Unique test removed 10 places
Iterating global reduction 3 with 23 rules applied. Total rules applied 139 place count 121 transition count 15699
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 144 place count 116 transition count 2195
Iterating global reduction 3 with 5 rules applied. Total rules applied 149 place count 116 transition count 2195
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 152 place count 113 transition count 2189
Iterating global reduction 3 with 3 rules applied. Total rules applied 155 place count 113 transition count 2189
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 237 place count 72 transition count 2148
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 243 place count 72 transition count 2142
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 246 place count 69 transition count 2135
Iterating global reduction 4 with 3 rules applied. Total rules applied 249 place count 69 transition count 2135
Performed 10 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 269 place count 59 transition count 2168
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 281 place count 59 transition count 2156
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 283 place count 57 transition count 2150
Iterating global reduction 5 with 2 rules applied. Total rules applied 285 place count 57 transition count 2150
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 295 place count 57 transition count 2140
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 297 place count 56 transition count 2153
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 298 place count 56 transition count 2152
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 7 with 21 rules applied. Total rules applied 319 place count 56 transition count 2131
Free-agglomeration rule applied 8 times.
Iterating global reduction 7 with 8 rules applied. Total rules applied 327 place count 56 transition count 2123
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 335 place count 48 transition count 2123
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 8 with 17 rules applied. Total rules applied 352 place count 48 transition count 2106
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 353 place count 48 transition count 2106
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 354 place count 48 transition count 2105
Applied a total of 354 rules in 13702 ms. Remains 48 /199 variables (removed 151) and now considering 2105/53720 (removed 51615) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13702 ms. Remains : 48/199 places, 2105/53720 transitions.
Knowledge based reduction with 6 factoid took 72 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[p1, p1, p1, p1, true]
Knowledge-based reduction took 161184 ms.
Stuttering acceptance computed with spot in 192 ms :[p1, p1, p1, p1, true]
Support contains 13 out of 199 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 53720/53720 transitions.
Applied a total of 0 rules in 327 ms. Remains 199 /199 variables (removed 0) and now considering 53720/53720 (removed 0) transitions.
[2026-06-02 12:57:07] [INFO ] Invariant cache hit.
[2026-06-02 12:57:19] [INFO ] Implicit Places using invariants in 11518 ms returned []
Implicit Place search using SMT only with invariants took 11520 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 11851 ms. Remains : 199/199 places, 53720/53720 transitions.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge based reduction with 1 factoid took 50 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 34899 steps (8 resets) in 120008 ms. (0 steps per ms) remains 1/1 properties
BEST_FIRST walk for 10038 steps (1 resets) in 20009 ms. (0 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 180922 steps, run timeout after 105004 ms. (steps per millisecond=1 ) properties seen :0 out of 1
Probabilistic random walk after 180922 steps, saw 28936 distinct states, run finished after 105009 ms. (steps per millisecond=1 ) properties seen :0
[2026-06-02 12:59:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/60 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/123 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 76/199 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 5452ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 13 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 53720/53720 transitions.
Graph (trivial) has 147 edges and 199 vertex of which 9 / 199 are part of one of the 4 SCC in 5 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 194 transition count 53683
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 36 rules applied. Total rules applied 64 place count 167 transition count 53674
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 70 place count 161 transition count 53674
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 70 place count 161 transition count 53658
Deduced a syphon composed of 16 places in 99 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 33 rules applied. Total rules applied 103 place count 144 transition count 53658
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 116 place count 131 transition count 15699
Ensure Unique test removed 10 places
Iterating global reduction 3 with 23 rules applied. Total rules applied 139 place count 121 transition count 15699
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 144 place count 116 transition count 2195
Iterating global reduction 3 with 5 rules applied. Total rules applied 149 place count 116 transition count 2195
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 152 place count 113 transition count 2189
Iterating global reduction 3 with 3 rules applied. Total rules applied 155 place count 113 transition count 2189
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 237 place count 72 transition count 2148
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 243 place count 72 transition count 2142
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 246 place count 69 transition count 2135
Iterating global reduction 4 with 3 rules applied. Total rules applied 249 place count 69 transition count 2135
Performed 10 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 269 place count 59 transition count 2168
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 281 place count 59 transition count 2156
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 283 place count 57 transition count 2150
Iterating global reduction 5 with 2 rules applied. Total rules applied 285 place count 57 transition count 2150
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 295 place count 57 transition count 2140
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 297 place count 56 transition count 2153
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 298 place count 56 transition count 2152
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 7 with 21 rules applied. Total rules applied 319 place count 56 transition count 2131
Free-agglomeration rule applied 8 times.
Iterating global reduction 7 with 8 rules applied. Total rules applied 327 place count 56 transition count 2123
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 335 place count 48 transition count 2123
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 8 with 17 rules applied. Total rules applied 352 place count 48 transition count 2106
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 353 place count 48 transition count 2106
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 354 place count 48 transition count 2105
Applied a total of 354 rules in 12736 ms. Remains 48 /199 variables (removed 151) and now considering 2105/53720 (removed 51615) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12736 ms. Remains : 48/199 places, 2105/53720 transitions.
Knowledge based reduction with 1 factoid took 60 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[p1, p1, p1, p1, true]
Knowledge-based reduction took 159832 ms.
Stuttering acceptance computed with spot in 185 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 200 ms :[p1, p1, p1, p1, true]
Product exploration timeout after 25710 steps with 6427 reset in 10001 ms.
Product exploration timeout after 27310 steps with 6827 reset in 10001 ms.
Spot run failed in 144 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/ltsmin10179085992501668702
[2026-06-02 13:00:21] [INFO ] Built C files in 1733ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10179085992501668702
Running compilation step : cd /tmp/ltsmin10179085992501668702;'/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/ltsmin10179085992501668702;'/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/ltsmin10179085992501668702;'/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 13 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 53720/53720 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 186 transition count 15761
Ensure Unique test removed 10 places
Iterating global reduction 0 with 23 rules applied. Total rules applied 36 place count 176 transition count 15761
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 171 transition count 2257
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 171 transition count 2257
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 168 transition count 2251
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 168 transition count 2251
Applied a total of 52 rules in 6304 ms. Remains 168 /199 variables (removed 31) and now considering 2251/53720 (removed 51469) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6473317093002112266.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-926068250378321905.kers'
[2026-06-02 13:00:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6473317093002112266.kers, --Pflows, --basisKERS=/tmp/petrispot-output-926068250378321905.kers]
Culled 0 columns in 6 ms.
// Phase 1: matrix 2251 rows 168 cols 33342 entries
Finished phase 1 with 149 SingleSign rule and 1 generalized
[2026-06-02 13:00:31] [INFO ] Computed 18 invariants in 26 ms
Computed 18 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-926068250378321905.kers
Total runtime 31 ms.
[2026-06-02 13:00:32] [INFO ] Implicit Places using invariants in 1126 ms returned [77]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1150 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 167/199 places, 2251/53720 transitions.
Applied a total of 0 rules in 17 ms. Remains 167 /167 variables (removed 0) and now considering 2251/2251 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7472 ms. Remains : 167/199 places, 2251/53720 transitions.
Built C files in :
/tmp/ltsmin13726335615709369706
[2026-06-02 13:00:32] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13726335615709369706
Running compilation step : cd /tmp/ltsmin13726335615709369706;'/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/ltsmin13726335615709369706;'/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/ltsmin13726335615709369706;'/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-06-02 13:00:45] [INFO ] Flatten gal took : 220 ms
[2026-06-02 13:00:45] [INFO ] Flatten gal took : 459 ms
[2026-06-02 13:00:45] [INFO ] Time to serialize gal into /tmp/LTL7388558729320729004.gal : 89 ms
[2026-06-02 13:00:45] [INFO ] Time to serialize properties into /tmp/LTL2066528366482921867.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/LTL7388558729320729004.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14055193374857080122.hoa' '-atoms' '/tmp/LTL2066528366482921867.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...318
Loading property file /tmp/LTL2066528366482921867.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14055193374857080122.hoa
Detected timeout of ITS tools.
[2026-06-02 13:01:20] [INFO ] Flatten gal took : 9967 ms
[2026-06-02 13:01:29] [INFO ] Flatten gal took : 9372 ms
[2026-06-02 13:01:31] [INFO ] Time to serialize gal into /tmp/LTL457668986402520792.gal : 1338 ms
[2026-06-02 13:01:31] [INFO ] Time to serialize properties into /tmp/LTL17831508167983113150.ltl : 7 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/LTL457668986402520792.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17831508167983113150.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-06-02 13:01:57] [INFO ] Flatten gal took : 10222 ms
[2026-06-02 13:01:57] [INFO ] Applying decomposition
[2026-06-02 13:02:07] [INFO ] Flatten gal took : 9910 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/graph6892032983939521328.txt' '-o' '/tmp/graph6892032983939521328.bin' '-w' '/tmp/graph6892032983939521328.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6892032983939521328.bin' '-l' '-1' '-v' '-w' '/tmp/graph6892032983939521328.weights' '-q' '0' '-e' '0.001'
[2026-06-02 13:02:33] [INFO ] Decomposing Gal with order
[2026-06-02 13:02:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-02 13:02:56] [INFO ] Removed a total of 703446 redundant transitions.
[2026-06-02 13:02:57] [INFO ] Flatten gal took : 17156 ms
[2026-06-02 13:03:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 14373 ms.
[2026-06-02 13:03:13] [INFO ] Time to serialize gal into /tmp/LTL13344822064317642316.gal : 117 ms
[2026-06-02 13:03:13] [INFO ] Time to serialize properties into /tmp/LTL1389668196484669042.ltl : 2 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/LTL13344822064317642316.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1389668196484669042.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 : !((X((F("(((((i1.u1.p2==0)||(i1.u9.p27==0))||((i1.u11.p35==0)||(i3.u59.p58==0)))||(((i1.u16.p66==0)||(i1.u19.p85==0))||((i1.u43.p104==...1569
Formula 0 simplified : X(G!"(((((i1.u1.p2==0)||(i1.u9.p27==0))||((i1.u11.p35==0)||(i3.u59.p58==0)))||(((i1.u16.p66==0)||(i1.u19.p85==0))||((i1.u43.p104==0)...1532
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV2-PT-bP10C08-LTLFireability-06 finished in 914710 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 12 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 78940/78940 transitions.
Graph (trivial) has 159 edges and 207 vertex of which 11 / 207 are part of one of the 5 SCC in 4 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 200 transition count 78906
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 35 rules applied. Total rules applied 62 place count 174 transition count 78897
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 68 place count 168 transition count 78897
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 68 place count 168 transition count 78885
Deduced a syphon composed of 12 places in 116 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 92 place count 156 transition count 78885
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 100 place count 148 transition count 53665
Iterating global reduction 3 with 8 rules applied. Total rules applied 108 place count 148 transition count 53665
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 116 place count 140 transition count 3225
Iterating global reduction 3 with 8 rules applied. Total rules applied 124 place count 140 transition count 3225
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 127 place count 137 transition count 3219
Iterating global reduction 3 with 3 rules applied. Total rules applied 130 place count 137 transition count 3219
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 226 place count 89 transition count 3171
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 232 place count 89 transition count 3165
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 235 place count 86 transition count 3158
Iterating global reduction 4 with 3 rules applied. Total rules applied 238 place count 86 transition count 3158
Performed 9 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 256 place count 77 transition count 3176
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 268 place count 77 transition count 3164
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 270 place count 75 transition count 3160
Iterating global reduction 5 with 2 rules applied. Total rules applied 272 place count 75 transition count 3160
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 282 place count 75 transition count 3150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 284 place count 74 transition count 3163
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 6 with 20 rules applied. Total rules applied 304 place count 74 transition count 3143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 305 place count 73 transition count 3142
Applied a total of 305 rules in 29463 ms. Remains 73 /207 variables (removed 134) and now considering 3142/78940 (removed 75798) transitions.
[2026-06-02 13:03:58] [INFO ] Flow matrix only has 3122 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11977851565972153292.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10897391980668212823.kers'
[2026-06-02 13:03:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11977851565972153292.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10897391980668212823.kers]
Normalized transition count is 3121 out of 3122 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 13 ms.
// Phase 1: matrix 3121 rows 69 cols 71830 entries
Finished phase 1 with 43 SingleSign rule and 2 generalized
[2026-06-02 13:03:58] [INFO ] Computed 28 invariants in 46 ms
Computed 28 P flows in 47 ms.
Exported basis to /tmp/petrispot-output-10897391980668212823.kers
Total runtime 58 ms.
[2026-06-02 13:04:01] [INFO ] Implicit Places using invariants in 2502 ms returned []
[2026-06-02 13:04:01] [INFO ] Flow matrix only has 3122 transitions (discarded 20 similar events)
[2026-06-02 13:04:01] [INFO ] Invariant cache hit.
[2026-06-02 13:04:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-06-02 13:04:04] [INFO ] Implicit Places using invariants and state equation in 3387 ms returned []
Implicit Place search using SMT with State Equation took 5892 ms to find 0 implicit places.
[2026-06-02 13:04:05] [INFO ] Redundant transitions in 627 ms returned []
Running 3116 sub problems to find dead transitions.
[2026-06-02 13:04:05] [INFO ] Flow matrix only has 3122 transitions (discarded 20 similar events)
[2026-06-02 13:04:05] [INFO ] Invariant cache hit.
[2026-06-02 13:04:05] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 3116 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 68/3195 variables, and 23 constraints, problems are : Problem set: 0 solved, 3116 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 12/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/73 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 3116/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 3116 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 68/3195 variables, and 23 constraints, problems are : Problem set: 0 solved, 3116 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 12/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/73 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 3112/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65108ms problems are : Problem set: 0 solved, 3116 unsolved
Search for dead transitions found 0 dead transitions in 65131ms
Starting structural reductions in SI_LTL mode, iteration 1 : 73/207 places, 3142/78940 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 101152 ms. Remains : 73/207 places, 3142/78940 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 46 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP10C08-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 165 ms.
Product exploration explored 100000 steps with 0 reset in 239 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (1015 resets) in 4611 ms. (8 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (115 resets) in 418 ms. (95 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 113398 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 1
Probabilistic random walk after 113398 steps, saw 21961 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
[2026-06-02 13:05:15] [INFO ] Flow matrix only has 3122 transitions (discarded 20 similar events)
[2026-06-02 13:05:15] [INFO ] Invariant cache hit.
[2026-06-02 13:05:15] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/24 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/55 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3151/3195 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2087 ms.
Refiners :[Positive P Invariants (semi-flows): 12/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 55/73 constraints, ReadFeed: 0/2 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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/24 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/55 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3151/3195 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1910 ms.
Refiners :[Positive P Invariants (semi-flows): 12/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 55/73 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4025ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 77 ms.
Support contains 12 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 3142/3142 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 73 transition count 3135
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 71 transition count 3135
Free-agglomeration rule applied 15 times.
Iterating global reduction 2 with 15 rules applied. Total rules applied 24 place count 71 transition count 3120
Reduce places removed 17 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 64 place count 54 transition count 3097
Applied a total of 64 rules in 1781 ms. Remains 54 /73 variables (removed 19) and now considering 3097/3142 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1782 ms. Remains : 54/73 places, 3097/3142 transitions.
RANDOM walk for 40000 steps (8 resets) in 6753 ms. (5 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 846 ms. (47 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 95006 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :0 out of 1
Probabilistic random walk after 95006 steps, saw 18154 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4249068157930795064.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12965092787487825662.kers'
[2026-06-02 13:05:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4249068157930795064.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12965092787487825662.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 21 ms.
// Phase 1: matrix 3097 rows 50 cols 71736 entries
Finished phase 1 with 26 SingleSign rule and 2 generalized
[2026-06-02 13:05:26] [INFO ] Computed 26 invariants in 71 ms
Computed 26 P flows in 71 ms.
Exported basis to /tmp/petrispot-output-12965092787487825662.kers
Total runtime 81 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/24 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/45 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3083/3128 variables, 45/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3128 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 16/3144 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3144 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/3145 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3145 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3145 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/3151 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3151 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3151 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/3151 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3151/3151 variables, and 80 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2251 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 54/54 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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/24 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/45 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3083/3128 variables, 45/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3128 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 16/3144 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3144 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/3145 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3145 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3145 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/3151 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3151 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3151 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/3151 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3151/3151 variables, and 80 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2598 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4971ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 397 ms.
Support contains 12 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 3097/3097 transitions.
Applied a total of 0 rules in 1044 ms. Remains 54 /54 variables (removed 0) and now considering 3097/3097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1044 ms. Remains : 54/54 places, 3097/3097 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 3097/3097 transitions.
Applied a total of 0 rules in 950 ms. Remains 54 /54 variables (removed 0) and now considering 3097/3097 (removed 0) transitions.
[2026-06-02 13:05:33] [INFO ] Invariant cache hit.
[2026-06-02 13:05:36] [INFO ] Implicit Places using invariants in 2956 ms returned []
[2026-06-02 13:05:36] [INFO ] Invariant cache hit.
[2026-06-02 13:05:40] [INFO ] Implicit Places using invariants and state equation in 3477 ms returned []
Implicit Place search using SMT with State Equation took 6435 ms to find 0 implicit places.
[2026-06-02 13:05:40] [INFO ] Redundant transitions in 565 ms returned []
Running 3079 sub problems to find dead transitions.
[2026-06-02 13:05:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3079 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 3079 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 51/3151 variables, and 23 constraints, problems are : Problem set: 0 solved, 3079 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/54 constraints, PredecessorRefiner: 3079/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3079 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3079 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 3079 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 51/3151 variables, and 23 constraints, problems are : Problem set: 0 solved, 3079 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/54 constraints, PredecessorRefiner: 3079/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64850ms problems are : Problem set: 0 solved, 3079 unsolved
Search for dead transitions found 0 dead transitions in 64866ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72837 ms. Remains : 54/54 places, 3097/3097 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 18 edges and 54 vertex of which 3 / 54 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 817 edges and 52 vertex of which 48 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.17 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 47 transition count 3085
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 46 transition count 2061
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 46 transition count 2061
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 46 transition count 2060
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 9 place count 46 transition count 2059
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 12 place count 44 transition count 2059
Free-agglomeration rule applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 44 transition count 2049
Ensure Unique test removed 10 places
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 42 place count 24 transition count 2049
Applied a total of 42 rules in 2008 ms. Remains 24 /54 variables (removed 30) and now considering 2049/3097 (removed 1048) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6307406653677894249.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10595737298928143122.kers'
[2026-06-02 13:06:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6307406653677894249.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10595737298928143122.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 4 ms.
// Phase 1: matrix 2049 rows 23 cols 24578 entries
Finished phase 1 with 10 SingleSign rule and 2 generalized
[2026-06-02 13:06:47] [INFO ] Computed 12 invariants in 15 ms
Computed 12 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-10595737298928143122.kers
Total runtime 23 ms.
[2026-06-02 13:06:47] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-06-02 13:06:47] [INFO ] [Real]Absence check using 1 positive and 11 generalized place invariants in 6 ms returned sat
[2026-06-02 13:06:48] [INFO ] After 616ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-06-02 13:06:48] [INFO ] After 705ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2026-06-02 13:06:48] [INFO ] After 806ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 2882 ms.
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Knowledge-based reduction took 97716 ms.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 12 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 3142/3142 transitions.
Applied a total of 0 rules in 1133 ms. Remains 73 /73 variables (removed 0) and now considering 3142/3142 (removed 0) transitions.
[2026-06-02 13:06:49] [INFO ] Flow matrix only has 3122 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4300147234522113304.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14761936474743146317.kers'
[2026-06-02 13:06:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4300147234522113304.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14761936474743146317.kers]
Normalized transition count is 3121 out of 3122 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 13 ms.
// Phase 1: matrix 3121 rows 69 cols 71830 entries
Finished phase 1 with 43 SingleSign rule and 2 generalized
[2026-06-02 13:06:49] [INFO ] Computed 28 invariants in 50 ms
Computed 28 P flows in 50 ms.
Exported basis to /tmp/petrispot-output-14761936474743146317.kers
Total runtime 61 ms.
[2026-06-02 13:06:52] [INFO ] Implicit Places using invariants in 2356 ms returned []
[2026-06-02 13:06:52] [INFO ] Flow matrix only has 3122 transitions (discarded 20 similar events)
[2026-06-02 13:06:52] [INFO ] Invariant cache hit.
[2026-06-02 13:06:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-06-02 13:06:55] [INFO ] Implicit Places using invariants and state equation in 3482 ms returned []
Implicit Place search using SMT with State Equation took 5842 ms to find 0 implicit places.
[2026-06-02 13:06:56] [INFO ] Redundant transitions in 665 ms returned []
Running 3116 sub problems to find dead transitions.
[2026-06-02 13:06:56] [INFO ] Flow matrix only has 3122 transitions (discarded 20 similar events)
[2026-06-02 13:06:56] [INFO ] Invariant cache hit.
[2026-06-02 13:06:56] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 3116 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 68/3195 variables, and 23 constraints, problems are : Problem set: 0 solved, 3116 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 12/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/73 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 3116/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 3116 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 68/3195 variables, and 23 constraints, problems are : Problem set: 0 solved, 3116 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 12/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/73 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 3112/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65286ms problems are : Problem set: 0 solved, 3116 unsolved
Search for dead transitions found 0 dead transitions in 65311ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 72974 ms. Remains : 73/73 places, 3142/3142 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 54 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (1006 resets) in 3887 ms. (10 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (113 resets) in 344 ms. (115 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 108141 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 1
Probabilistic random walk after 108141 steps, saw 21150 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
[2026-06-02 13:08:05] [INFO ] Flow matrix only has 3122 transitions (discarded 20 similar events)
[2026-06-02 13:08:05] [INFO ] Invariant cache hit.
[2026-06-02 13:08:05] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/24 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/55 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3096/3151 variables, 55/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3151 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/3185 variables, 9/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3185 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3185 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/3190 variables, 3/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3190 variables, 5/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3190 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/3194 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3194 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3194 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/3194 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3194/3195 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2471 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 73/73 constraints, ReadFeed: 2/2 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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/24 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/55 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3096/3151 variables, 55/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3151 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/3185 variables, 9/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3185 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3185 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/3190 variables, 3/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3190 variables, 5/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3190 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/3194 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3194 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3194 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/3194 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3194/3195 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2236 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 73/73 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4740ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 156 ms.
Support contains 12 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 3142/3142 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 73 transition count 3135
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 71 transition count 3135
Free-agglomeration rule applied 15 times.
Iterating global reduction 2 with 15 rules applied. Total rules applied 24 place count 71 transition count 3120
Reduce places removed 17 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 64 place count 54 transition count 3097
Applied a total of 64 rules in 2109 ms. Remains 54 /73 variables (removed 19) and now considering 3097/3142 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2109 ms. Remains : 54/73 places, 3097/3142 transitions.
RANDOM walk for 40000 steps (8 resets) in 7196 ms. (5 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 871 ms. (45 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 199731 steps, run timeout after 6001 ms. (steps per millisecond=33 ) properties seen :0 out of 1
Probabilistic random walk after 199731 steps, saw 36354 distinct states, run finished after 6001 ms. (steps per millisecond=33 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13481853506018711823.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12326811067577752087.kers'
[2026-06-02 13:08:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13481853506018711823.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12326811067577752087.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 12 ms.
// Phase 1: matrix 3097 rows 50 cols 71736 entries
Finished phase 1 with 26 SingleSign rule and 2 generalized
[2026-06-02 13:08:21] [INFO ] Computed 26 invariants in 42 ms
Computed 26 P flows in 43 ms.
Exported basis to /tmp/petrispot-output-12326811067577752087.kers
Total runtime 63 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/24 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/45 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3083/3128 variables, 45/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3128 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 16/3144 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3144 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/3145 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3145 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3145 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/3151 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3151 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3151 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/3151 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3151/3151 variables, and 80 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2448 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 54/54 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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/24 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/45 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3083/3128 variables, 45/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3128 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 16/3144 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3144 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/3145 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3145 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3145 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/3151 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3151 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3151 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/3151 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3151/3151 variables, and 80 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2735 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5287ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 371 ms.
Support contains 12 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 3097/3097 transitions.
Applied a total of 0 rules in 1016 ms. Remains 54 /54 variables (removed 0) and now considering 3097/3097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1016 ms. Remains : 54/54 places, 3097/3097 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 3097/3097 transitions.
Applied a total of 0 rules in 900 ms. Remains 54 /54 variables (removed 0) and now considering 3097/3097 (removed 0) transitions.
[2026-06-02 13:08:28] [INFO ] Invariant cache hit.
[2026-06-02 13:08:31] [INFO ] Implicit Places using invariants in 2684 ms returned []
[2026-06-02 13:08:31] [INFO ] Invariant cache hit.
[2026-06-02 13:08:35] [INFO ] Implicit Places using invariants and state equation in 4384 ms returned []
Implicit Place search using SMT with State Equation took 7071 ms to find 0 implicit places.
[2026-06-02 13:08:36] [INFO ] Redundant transitions in 568 ms returned []
Running 3079 sub problems to find dead transitions.
[2026-06-02 13:08:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3079 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 3079 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 51/3151 variables, and 23 constraints, problems are : Problem set: 0 solved, 3079 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/54 constraints, PredecessorRefiner: 3079/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3079 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3079 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 3079 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 51/3151 variables, and 23 constraints, problems are : Problem set: 0 solved, 3079 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/54 constraints, PredecessorRefiner: 3079/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65056ms problems are : Problem set: 0 solved, 3079 unsolved
Search for dead transitions found 0 dead transitions in 65071ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73635 ms. Remains : 54/54 places, 3097/3097 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 18 edges and 54 vertex of which 3 / 54 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 817 edges and 52 vertex of which 48 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.17 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 47 transition count 3085
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 46 transition count 2061
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 46 transition count 2061
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 46 transition count 2060
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 9 place count 46 transition count 2059
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 12 place count 44 transition count 2059
Free-agglomeration rule applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 44 transition count 2049
Ensure Unique test removed 10 places
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 42 place count 24 transition count 2049
Applied a total of 42 rules in 1911 ms. Remains 24 /54 variables (removed 30) and now considering 2049/3097 (removed 1048) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9048229511110088620.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18077202810879181505.kers'
[2026-06-02 13:09:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9048229511110088620.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18077202810879181505.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 4 ms.
// Phase 1: matrix 2049 rows 23 cols 24578 entries
Finished phase 1 with 10 SingleSign rule and 2 generalized
[2026-06-02 13:09:43] [INFO ] Computed 12 invariants in 17 ms
Computed 12 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-18077202810879181505.kers
Total runtime 26 ms.
[2026-06-02 13:09:43] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-06-02 13:09:43] [INFO ] [Real]Absence check using 1 positive and 11 generalized place invariants in 4 ms returned sat
[2026-06-02 13:09:43] [INFO ] After 676ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-06-02 13:09:44] [INFO ] After 764ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2026-06-02 13:09:44] [INFO ] After 847ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 2812 ms.
Knowledge based reduction with 3 factoid took 53 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Knowledge-based reduction took 102601 ms.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 77 ms.
Product exploration explored 100000 steps with 0 reset in 98 ms.
Built C files in :
/tmp/ltsmin1551993940414334345
[2026-06-02 13:09:44] [INFO ] Too many transitions (3142) to apply POR reductions. Disabling POR matrices.
[2026-06-02 13:09:44] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1551993940414334345
Running compilation step : cd /tmp/ltsmin1551993940414334345;'/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/ltsmin1551993940414334345;'/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/ltsmin1551993940414334345;'/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 12 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 3142/3142 transitions.
Applied a total of 0 rules in 807 ms. Remains 73 /73 variables (removed 0) and now considering 3142/3142 (removed 0) transitions.
[2026-06-02 13:09:48] [INFO ] Flow matrix only has 3122 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9662193339378251697.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10965311904125580692.kers'
[2026-06-02 13:09:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9662193339378251697.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10965311904125580692.kers]
Normalized transition count is 3121 out of 3122 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 12 ms.
// Phase 1: matrix 3121 rows 69 cols 71830 entries
Finished phase 1 with 43 SingleSign rule and 2 generalized
[2026-06-02 13:09:48] [INFO ] Computed 28 invariants in 45 ms
Computed 28 P flows in 46 ms.
Exported basis to /tmp/petrispot-output-10965311904125580692.kers
Total runtime 56 ms.
[2026-06-02 13:09:50] [INFO ] Implicit Places using invariants in 2441 ms returned []
[2026-06-02 13:09:50] [INFO ] Flow matrix only has 3122 transitions (discarded 20 similar events)
[2026-06-02 13:09:50] [INFO ] Invariant cache hit.
[2026-06-02 13:09:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-06-02 13:09:54] [INFO ] Implicit Places using invariants and state equation in 3468 ms returned []
Implicit Place search using SMT with State Equation took 5911 ms to find 0 implicit places.
[2026-06-02 13:09:54] [INFO ] Redundant transitions in 537 ms returned []
Running 3116 sub problems to find dead transitions.
[2026-06-02 13:09:54] [INFO ] Flow matrix only has 3122 transitions (discarded 20 similar events)
[2026-06-02 13:09:54] [INFO ] Invariant cache hit.
[2026-06-02 13:09:54] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 3116 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 68/3195 variables, and 23 constraints, problems are : Problem set: 0 solved, 3116 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 12/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/73 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 3116/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 3116 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 68/3195 variables, and 23 constraints, problems are : Problem set: 0 solved, 3116 unsolved in 30105 ms.
Refiners :[Positive P Invariants (semi-flows): 12/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/73 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 3112/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65483ms problems are : Problem set: 0 solved, 3116 unsolved
Search for dead transitions found 0 dead transitions in 65500ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 72766 ms. Remains : 73/73 places, 3142/3142 transitions.
Built C files in :
/tmp/ltsmin1549426267883189790
[2026-06-02 13:11:00] [INFO ] Too many transitions (3142) to apply POR reductions. Disabling POR matrices.
[2026-06-02 13:11:00] [INFO ] Built C files in 105ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1549426267883189790
Running compilation step : cd /tmp/ltsmin1549426267883189790;'/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/ltsmin1549426267883189790;'/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/ltsmin1549426267883189790;'/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-06-02 13:11:12] [INFO ] Flatten gal took : 1950 ms
[2026-06-02 13:11:13] [INFO ] Flatten gal took : 532 ms
[2026-06-02 13:11:13] [INFO ] Time to serialize gal into /tmp/LTL17740264154062892260.gal : 72 ms
[2026-06-02 13:11:13] [INFO ] Time to serialize properties into /tmp/LTL13233015085789038457.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/LTL17740264154062892260.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13324313013146431032.hoa' '-atoms' '/tmp/LTL13233015085789038457.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/LTL13233015085789038457.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13324313013146431032.hoa
Detected timeout of ITS tools.
[2026-06-02 13:11:38] [INFO ] Flatten gal took : 756 ms
[2026-06-02 13:11:39] [INFO ] Flatten gal took : 590 ms
[2026-06-02 13:11:39] [INFO ] Time to serialize gal into /tmp/LTL11815422194805838047.gal : 131 ms
[2026-06-02 13:11:39] [INFO ] Time to serialize properties into /tmp/LTL10785224597564435985.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/LTL11815422194805838047.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10785224597564435985.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...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((p4!=1)||(p26!=1))||((p38!=1)||(p50!=1)))||(((p69!=1)||(p84!=1))||((p107!=1)||(p126!=1))))||(((p152!=1)||(p160!=1))||((p17...179
Formula 0 simplified : GF!"(((((p4!=1)||(p26!=1))||((p38!=1)||(p50!=1)))||(((p69!=1)||(p84!=1))||((p107!=1)||(p126!=1))))||(((p152!=1)||(p160!=1))||((p179!...173
Detected timeout of ITS tools.
[2026-06-02 13:11:55] [INFO ] Flatten gal took : 718 ms
[2026-06-02 13:11:55] [INFO ] Applying decomposition
[2026-06-02 13:11:55] [INFO ] Flatten gal took : 599 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/graph7608594055027559480.txt' '-o' '/tmp/graph7608594055027559480.bin' '-w' '/tmp/graph7608594055027559480.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7608594055027559480.bin' '-l' '-1' '-v' '-w' '/tmp/graph7608594055027559480.weights' '-q' '0' '-e' '0.001'
[2026-06-02 13:11:57] [INFO ] Decomposing Gal with order
[2026-06-02 13:11:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-02 13:11:58] [INFO ] Removed a total of 32634 redundant transitions.
[2026-06-02 13:11:58] [INFO ] Flatten gal took : 878 ms
[2026-06-02 13:11:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 352 ms.
[2026-06-02 13:11:59] [INFO ] Time to serialize gal into /tmp/LTL63176111239709471.gal : 26 ms
[2026-06-02 13:11:59] [INFO ] Time to serialize properties into /tmp/LTL15825588461976868891.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/LTL63176111239709471.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15825588461976868891.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...253
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((i0.u1.p4!=1)||(i2.u15.p26!=1))||((i4.u4.p38!=1)||(i2.u15.p50!=1)))||(((i1.u5.p69!=1)||(i2.u15.p84!=1))||((i1.u8.p107!=1)|...255
Formula 0 simplified : GF!"(((((i0.u1.p4!=1)||(i2.u15.p26!=1))||((i4.u4.p38!=1)||(i2.u15.p50!=1)))||(((i1.u5.p69!=1)||(i2.u15.p84!=1))||((i1.u8.p107!=1)||(...249
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV2-PT-bP10C08-LTLFireability-07 finished in 525208 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(p1) U X(p2))&&p0)))))'
Support contains 34 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 78940/78940 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 206 transition count 70192
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 206 transition count 70192
Applied a total of 2 rules in 2833 ms. Remains 206 /207 variables (removed 1) and now considering 70192/78940 (removed 8748) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14731882217068751276.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7276522740662075192.kers'
[2026-06-02 13:12:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14731882217068751276.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7276522740662075192.kers]
Culled 0 columns in 307 ms.
// Phase 1: matrix 70192 rows 206 cols 1785164 entries
Finished phase 1 with 175 SingleSign rule and 3 generalized
[2026-06-02 13:12:19] [INFO ] Computed 28 invariants in 1660 ms
Computed 28 P flows in 1661 ms.
Exported basis to /tmp/petrispot-output-7276522740662075192.kers
Total runtime 1882 ms.
[2026-06-02 13:12:49] [INFO ] Implicit Places using invariants in 31930 ms returned []
Implicit Place search using SMT only with invariants took 31935 ms to find 0 implicit places.
Running 70191 sub problems to find dead transitions.
[2026-06-02 13:12:49] [INFO ] Invariant cache hit.

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="ErlangenMainframeV2-PT-bP10C08"
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 ErlangenMainframeV2-PT-bP10C08, 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 r338-smll-178021499200284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ErlangenMainframeV2-PT-bP10C08.tgz
mv ErlangenMainframeV2-PT-bP10C08 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 ;