About the Execution of ITS-Tools for ErlangenMainframeV0-PT-1007
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9888.955 | 3600000.00 | 4513710.00 | 8160.90 | ?FFTTFFF?FF?T??F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r114-smll-177955740600476.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is ErlangenMainframeV0-PT-1007, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-177955740600476
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 62M
-rw-r--r-- 1 mcc users 8.3K Mar 7 05:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Mar 7 05:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 7 05:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 7 05:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 09:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 09:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 09:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Mar 7 05:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 189K Mar 7 05:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 7 05:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 7 05:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 09:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 62M Mar 3 18:30 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ErlangenMainframeV0-PT-1007-LTLFireability-00
FORMULA_NAME ErlangenMainframeV0-PT-1007-LTLFireability-01
FORMULA_NAME ErlangenMainframeV0-PT-1007-LTLFireability-02
FORMULA_NAME ErlangenMainframeV0-PT-1007-LTLFireability-03
FORMULA_NAME ErlangenMainframeV0-PT-1007-LTLFireability-04
FORMULA_NAME ErlangenMainframeV0-PT-1007-LTLFireability-05
FORMULA_NAME ErlangenMainframeV0-PT-1007-LTLFireability-06
FORMULA_NAME ErlangenMainframeV0-PT-1007-LTLFireability-07
FORMULA_NAME ErlangenMainframeV0-PT-1007-LTLFireability-08
FORMULA_NAME ErlangenMainframeV0-PT-1007-LTLFireability-09
FORMULA_NAME ErlangenMainframeV0-PT-1007-LTLFireability-10
FORMULA_NAME ErlangenMainframeV0-PT-1007-LTLFireability-11
FORMULA_NAME ErlangenMainframeV0-PT-1007-LTLFireability-12
FORMULA_NAME ErlangenMainframeV0-PT-1007-LTLFireability-13
FORMULA_NAME ErlangenMainframeV0-PT-1007-LTLFireability-14
FORMULA_NAME ErlangenMainframeV0-PT-1007-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779891132668
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV0-PT-1007
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-27 14:12:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-27 14:12:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 14:12:18] [INFO ] Load time of PNML (sax parser for PT used): 3368 ms
[2026-05-27 14:12:18] [INFO ] Transformed 285 places.
[2026-05-27 14:12:18] [INFO ] Transformed 52780 transitions.
[2026-05-27 14:12:18] [INFO ] Found NUPN structural information;
[2026-05-27 14:12:18] [INFO ] Parsed PT model containing 285 places and 52780 transitions and 1225525 arcs in 3977 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ErlangenMainframeV0-PT-1007-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1007-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1007-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1007-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1007-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 57 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 52780/52780 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 213 transition count 52708
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 213 transition count 52708
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 184 place count 173 transition count 52668
Iterating global reduction 0 with 40 rules applied. Total rules applied 224 place count 173 transition count 52668
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 227 place count 170 transition count 52665
Iterating global reduction 0 with 3 rules applied. Total rules applied 230 place count 170 transition count 52665
Applied a total of 230 rules in 1962 ms. Remains 170 /285 variables (removed 115) and now considering 52665/52780 (removed 115) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10918268798288423978.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15945399650074912232.kers'
[2026-05-27 14:12:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10918268798288423978.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15945399650074912232.kers]
Culled 0 columns in 209 ms.
// Phase 1: matrix 52665 rows 170 cols 1225295 entries
Finished phase 1 with 141 SingleSign rule and 3 generalized
[2026-05-27 14:12:23] [INFO ] Computed 26 invariants in 1091 ms
Computed 26 P flows in 1093 ms.
Exported basis to /tmp/petrispot-output-15945399650074912232.kers
Total runtime 1259 ms.
[2026-05-27 14:12:24] [INFO ] Implicit Places using invariants in 3041 ms returned []
Implicit Place search using SMT only with invariants took 3097 ms to find 0 implicit places.
Running 52664 sub problems to find dead transitions.
[2026-05-27 14:12:25] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
SMT process timed out in 298901ms, After SMT, problems are : Problem set: 0 solved, 52664 unsolved
Search for dead transitions found 0 dead transitions in 299617ms
Starting structural reductions in LTL mode, iteration 1 : 170/285 places, 52665/52780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 305119 ms. Remains : 170/285 places, 52665/52780 transitions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 52665/52665 transitions.
Applied a total of 0 rules in 321 ms. Remains 170 /170 variables (removed 0) and now considering 52665/52665 (removed 0) transitions.
[2026-05-27 14:17:24] [INFO ] Invariant cache hit.
[2026-05-27 14:17:25] [INFO ] Implicit Places using invariants in 509 ms returned []
Implicit Place search using SMT only with invariants took 511 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 845 ms. Remains : 170/170 places, 52665/52665 transitions.
Support contains 57 out of 170 places after structural reductions.
[2026-05-27 14:17:34] [INFO ] Flatten gal took : 7527 ms
[2026-05-27 14:17:41] [INFO ] Flatten gal took : 6922 ms
[2026-05-27 14:17:51] [INFO ] Input system was already deterministic with 52665 transitions.
Reduction of identical properties reduced properties to check from 28 to 27
RANDOM walk for 40000 steps (8 resets) in 31005 ms. (1 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 120 ms. (33 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 151 ms. (26 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 163 ms. (24 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 162 ms. (24 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 109 ms. (36 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 262 ms. (15 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 118 ms. (33 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 100 ms. (39 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 121 ms. (32 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 142 ms. (28 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 126 ms. (31 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 142 ms. (27 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 109 ms. (36 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 95 ms. (41 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 27/27 properties
Interrupted probabilistic random walk after 49105 steps, run timeout after 27002 ms. (steps per millisecond=1 ) properties seen :0 out of 27
Probabilistic random walk after 49105 steps, saw 32703 distinct states, run finished after 27015 ms. (steps per millisecond=1 ) properties seen :0
[2026-05-27 14:18:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 75/132 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 132/52835 variables, and 21 constraints, problems are : Problem set: 0 solved, 27 unsolved in 5126 ms.
Refiners :[Positive P Invariants (semi-flows): 12/16 constraints, Generalized P Invariants (flows): 9/10 constraints, State Equation: 0/170 constraints, PredecessorRefiner: 27/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 75/132 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 132/52835 variables, and 21 constraints, problems are : Problem set: 0 solved, 27 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 12/16 constraints, Generalized P Invariants (flows): 9/10 constraints, State Equation: 0/170 constraints, PredecessorRefiner: 27/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10885ms problems are : Problem set: 0 solved, 27 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 57 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 52665/52665 transitions.
Graph (trivial) has 83 edges and 170 vertex of which 4 / 170 are part of one of the 2 SCC in 26 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 168 transition count 52648
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 155 transition count 52648
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 27 place count 155 transition count 52630
Deduced a syphon composed of 18 places in 91 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 63 place count 137 transition count 52630
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 135 transition count 52613
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 135 transition count 52613
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 135 transition count 52611
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 23 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 131 place count 104 transition count 52580
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 2 places in 21 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 135 place count 102 transition count 52599
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 140 place count 102 transition count 52594
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 147 place count 97 transition count 52592
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 149 place count 97 transition count 52592
Partial Post-agglomeration rule applied 10 times.
Drop transitions (Partial Post agglomeration) removed 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 159 place count 97 transition count 52592
Applied a total of 159 rules in 11973 ms. Remains 97 /170 variables (removed 73) and now considering 52592/52665 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11980 ms. Remains : 97/170 places, 52592/52665 transitions.
RANDOM walk for 40000 steps (8 resets) in 53474 ms. (0 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 452 ms. (8 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 599 ms. (6 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 671 ms. (5 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 653 ms. (6 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 597 ms. (6 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 474 ms. (8 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 568 ms. (7 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 495 ms. (8 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 448 ms. (8 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 460 ms. (8 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 446 ms. (8 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 542 ms. (7 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 491 ms. (8 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 534 ms. (7 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 479 ms. (8 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 624 ms. (6 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 652 ms. (6 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 664 ms. (6 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 537 ms. (7 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 513 ms. (7 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 565 ms. (7 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 581 ms. (6 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 609 ms. (6 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 598 ms. (6 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 478 ms. (8 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 471 ms. (8 steps per ms) remains 26/26 properties
Interrupted probabilistic random walk after 154749 steps, run timeout after 54002 ms. (steps per millisecond=2 ) properties seen :0 out of 26
Probabilistic random walk after 154749 steps, saw 23854 distinct states, run finished after 54003 ms. (steps per millisecond=2 ) properties seen :0
[2026-05-27 14:20:04] [INFO ] Flow matrix only has 52575 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6721187261290732779.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4189516670953256685.kers'
[2026-05-27 14:20:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6721187261290732779.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4189516670953256685.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 217 ms.
// Phase 1: matrix 52575 rows 96 cols 1225046 entries
Finished phase 1 with 68 SingleSign rule and 3 generalized
[2026-05-27 14:20:05] [INFO ] Computed 26 invariants in 1105 ms
Computed 26 P flows in 1106 ms.
Exported basis to /tmp/petrispot-output-4189516670953256685.kers
Total runtime 1378 ms.
[2026-05-27 14:20:06] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 7/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 7/71 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 26/97 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 52672/52672 variables, and 123 constraints, problems are : Problem set: 0 solved, 26 unsolved in 45024 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 97/97 constraints, ReadFeed: 0/38 constraints, PredecessorRefiner: 26/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 7/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 7/71 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 26/97 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 26 unsolved
SMT process timed out in 92308ms, After SMT, problems are : Problem set: 0 solved, 26 unsolved
Fused 26 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 57 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 52592/52592 transitions.
Applied a total of 0 rules in 1327 ms. Remains 97 /97 variables (removed 0) and now considering 52592/52592 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1327 ms. Remains : 97/97 places, 52592/52592 transitions.
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((p0&&X((G((p0&&F(G(p2))))||p1)))))'
Support contains 19 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 52665/52665 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 153 transition count 35170
Ensure Unique test removed 10 places
Iterating global reduction 0 with 27 rules applied. Total rules applied 44 place count 143 transition count 35170
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 142 transition count 23506
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 142 transition count 23506
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 141 transition count 23504
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 141 transition count 23504
Applied a total of 48 rules in 6339 ms. Remains 141 /170 variables (removed 29) and now considering 23504/52665 (removed 29161) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11118230076965197144.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10395421976437901816.kers'
[2026-05-27 14:21:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11118230076965197144.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10395421976437901816.kers]
Culled 0 columns in 55 ms.
// Phase 1: matrix 23504 rows 141 cols 327175 entries
Finished phase 1 with 125 SingleSign rule and 0 generalized
[2026-05-27 14:21:45] [INFO ] Computed 16 invariants in 325 ms
Computed 16 P flows in 326 ms.
Exported basis to /tmp/petrispot-output-10395421976437901816.kers
Total runtime 373 ms.
[2026-05-27 14:21:51] [INFO ] Implicit Places using invariants in 6159 ms returned []
Implicit Place search using SMT only with invariants took 6168 ms to find 0 implicit places.
Running 23503 sub problems to find dead transitions.
[2026-05-27 14:21:51] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 140/23645 variables, and 0 constraints, problems are : Problem set: 0 solved, 23503 unsolved in 30463 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, State Equation: 0/141 constraints, PredecessorRefiner: 23503/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 140/23645 variables, and 0 constraints, problems are : Problem set: 0 solved, 23503 unsolved in 30449 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, State Equation: 0/141 constraints, PredecessorRefiner: 23371/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 126275ms problems are : Problem set: 0 solved, 23503 unsolved
Search for dead transitions found 0 dead transitions in 126399ms
Starting structural reductions in LTL mode, iteration 1 : 141/170 places, 23504/52665 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138998 ms. Remains : 141/170 places, 23504/52665 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((X((G((p1&&F(G(p2))))||p0))&&p1)))'
Stuttering acceptance computed with spot in 389 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), true, (AND p1 (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) p1 p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1007-LTLFireability-00
Product exploration explored 100000 steps with 33350 reset in 2072 ms.
Product exploration explored 100000 steps with 33371 reset in 1554 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 13 factoid took 80 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (8 resets) in 12760 ms. (3 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1058 ms. (37 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1045 ms. (38 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 909 ms. (43 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 879 ms. (45 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1018 ms. (39 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 682 ms. (58 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 57777 steps, run timeout after 12001 ms. (steps per millisecond=4 ) properties seen :0 out of 6
Probabilistic random walk after 57777 steps, saw 38675 distinct states, run finished after 12002 ms. (steps per millisecond=4 ) properties seen :0
[2026-05-27 14:24:19] [INFO ] Invariant cache hit.
Problem apf3 is UNSAT
Problem apf4 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 85/104 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 37/141 variables, 4/16 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 4 unsolved
SMT process timed out in 5167ms, After SMT, problems are : Problem set: 2 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 23504/23504 transitions.
Graph (trivial) has 92 edges and 141 vertex of which 4 / 141 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 139 transition count 23487
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 126 transition count 23487
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 27 place count 126 transition count 23468
Deduced a syphon composed of 19 places in 24 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 65 place count 107 transition count 23468
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 105 transition count 23451
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 105 transition count 23451
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 105 transition count 23449
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 12 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 141 place count 70 transition count 23414
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 3 places in 12 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 147 place count 67 transition count 23435
Free-agglomeration rule applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 157 place count 67 transition count 23425
Reduce places removed 10 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 169 place count 57 transition count 23423
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 170 place count 57 transition count 23423
Partial Post-agglomeration rule applied 7 times.
Drop transitions (Partial Post agglomeration) removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 177 place count 57 transition count 23423
Applied a total of 177 rules in 6570 ms. Remains 57 /141 variables (removed 84) and now considering 23423/23504 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6571 ms. Remains : 57/141 places, 23423/23504 transitions.
RANDOM walk for 40000 steps (8 resets) in 21687 ms. (1 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 3133 ms. (12 steps per ms) remains 1/1 properties
[2026-05-27 14:24:38] [INFO ] Flow matrix only has 23402 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4500807125866944101.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5522760653949784342.kers'
[2026-05-27 14:24:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4500807125866944101.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5522760653949784342.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 74 ms.
// Phase 1: matrix 23402 rows 56 cols 443532 entries
Finished phase 1 with 41 SingleSign rule and 0 generalized
[2026-05-27 14:24:38] [INFO ] Computed 16 invariants in 241 ms
Computed 16 P flows in 242 ms.
Exported basis to /tmp/petrispot-output-5522760653949784342.kers
Total runtime 305 ms.
[2026-05-27 14:32:25] [INFO ] State equation strengthened by 22502 read => feed constraints.
All remaining problems are real, not stopping.
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) 38/50 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/57 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23402/23459 variables, 57/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 512658ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 23423/23423 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 57 transition count 23421
Deduced a syphon composed of 2 places in 89 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 55 transition count 23421
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 7 place count 52 transition count 7005
Iterating global reduction 0 with 3 rules applied. Total rules applied 10 place count 52 transition count 7005
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 51 transition count 7005
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 0 with 29 rules applied. Total rules applied 41 place count 51 transition count 6976
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 51 transition count 6975
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 50 transition count 6975
Applied a total of 43 rules in 24808 ms. Remains 50 /57 variables (removed 7) and now considering 6975/23423 (removed 16448) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24808 ms. Remains : 50/57 places, 6975/23423 transitions.
Found 2 invariant AP formulas.
Knowledge based reduction with 15 factoid took 102 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p1)]
Knowledge-based reduction took 573465 ms.
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p1)]
Support contains 12 out of 141 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 23504/23504 transitions.
Graph (trivial) has 92 edges and 141 vertex of which 4 / 141 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 138 transition count 23489
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 126 transition count 23489
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 25 place count 126 transition count 23471
Deduced a syphon composed of 18 places in 22 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 61 place count 108 transition count 23471
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 106 transition count 23454
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 106 transition count 23454
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 106 transition count 23452
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 14 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 139 place count 70 transition count 23416
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 14 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 143 place count 68 transition count 23427
Partial Post-agglomeration rule applied 12 times.
Drop transitions (Partial Post agglomeration) removed 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 155 place count 68 transition count 23427
Applied a total of 155 rules in 2817 ms. Remains 68 /141 variables (removed 73) and now considering 23427/23504 (removed 77) transitions.
[2026-05-27 14:33:38] [INFO ] Flow matrix only has 23405 transitions (discarded 22 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16006200373454244064.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2131941193746390394.kers'
[2026-05-27 14:33:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16006200373454244064.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2131941193746390394.kers]
Normalized transition count is 23404 out of 23405 initially.
Culled 0 columns in 91 ms.
// Phase 1: matrix 23404 rows 68 cols 536878 entries
Finished phase 1 with 52 SingleSign rule and 0 generalized
[2026-05-27 14:33:39] [INFO ] Computed 16 invariants in 310 ms
Computed 16 P flows in 311 ms.
Exported basis to /tmp/petrispot-output-2131941193746390394.kers
Total runtime 382 ms.
[2026-05-27 14:33:46] [INFO ] Implicit Places using invariants in 7548 ms returned []
Implicit Place search using SMT only with invariants took 7551 ms to find 0 implicit places.
Running 23425 sub problems to find dead transitions.
[2026-05-27 14:33:46] [INFO ] Flow matrix only has 23405 transitions (discarded 22 similar events)
[2026-05-27 14:33:46] [INFO ] Invariant cache hit.
[2026-05-27 14:33:47] [INFO ] State equation strengthened by 11675 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 67/23473 variables, and 0 constraints, problems are : Problem set: 0 solved, 23425 unsolved in 30676 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, State Equation: 0/68 constraints, ReadFeed: 0/11675 constraints, PredecessorRefiner: 23425/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23425 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 67/23473 variables, and 0 constraints, problems are : Problem set: 0 solved, 23425 unsolved in 30453 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, State Equation: 0/68 constraints, ReadFeed: 0/11675 constraints, PredecessorRefiner: 23385/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 129478ms problems are : Problem set: 0 solved, 23425 unsolved
Search for dead transitions found 0 dead transitions in 129659ms
Starting structural reductions in SI_LTL mode, iteration 1 : 68/141 places, 23427/23504 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140163 ms. Remains : 68/141 places, 23427/23504 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge based reduction with 3 factoid took 55 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 19042 ms. (2 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2353 ms. (16 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 125206 steps, run timeout after 15001 ms. (steps per millisecond=8 ) properties seen :0 out of 1
Probabilistic random walk after 125206 steps, saw 31383 distinct states, run finished after 15001 ms. (steps per millisecond=8 ) properties seen :0
[2026-05-27 14:36:17] [INFO ] Flow matrix only has 23405 transitions (discarded 22 similar events)
[2026-05-27 14:36:17] [INFO ] Invariant cache hit.
[2026-05-27 14:36:17] [INFO ] State equation strengthened by 11675 read => feed constraints.
All remaining problems are real, not stopping.
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) 44/56 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/68 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 5304ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 23427/23427 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 68 transition count 23425
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 2 place count 68 transition count 23422
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 65 transition count 23422
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 14 place count 59 transition count 2142
Iterating global reduction 1 with 6 rules applied. Total rules applied 20 place count 59 transition count 2142
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 59 transition count 2136
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 1 with 2 rules applied. Total rules applied 28 place count 58 transition count 2149
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 58 transition count 2148
Free-agglomeration rule applied 14 times.
Iterating global reduction 1 with 14 rules applied. Total rules applied 43 place count 58 transition count 2134
Reduce places removed 14 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 59 place count 44 transition count 2132
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 2 with 31 rules applied. Total rules applied 90 place count 44 transition count 2101
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 44 transition count 2101
Applied a total of 91 rules in 9992 ms. Remains 44 /68 variables (removed 24) and now considering 2101/23427 (removed 21326) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9992 ms. Remains : 44/68 places, 2101/23427 transitions.
RANDOM walk for 2427 steps (0 resets) in 136 ms. (17 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p1)]
Knowledge-based reduction took 36858 ms.
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p1)]
Product exploration timeout after 31860 steps with 0 reset in 10003 ms.
Product exploration timeout after 32350 steps with 0 reset in 10002 ms.
Built C files in :
/tmp/ltsmin3768789728331073543
[2026-05-27 14:36:52] [INFO ] Too many transitions (23427) to apply POR reductions. Disabling POR matrices.
[2026-05-27 14:36:53] [INFO ] Built C files in 731ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3768789728331073543
Running compilation step : cd /tmp/ltsmin3768789728331073543;'/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/ltsmin3768789728331073543;'/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/ltsmin3768789728331073543;'/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 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 23427/23427 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 68 transition count 23424
Deduced a syphon composed of 3 places in 10 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 65 transition count 23424
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 12 place count 59 transition count 2144
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 59 transition count 2144
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 59 transition count 2138
Applied a total of 24 rules in 7294 ms. Remains 59 /68 variables (removed 9) and now considering 2138/23427 (removed 21289) transitions.
[2026-05-27 14:37:04] [INFO ] Flow matrix only has 2116 transitions (discarded 22 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2702089821383178491.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11785200386980749462.kers'
[2026-05-27 14:37:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2702089821383178491.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11785200386980749462.kers]
Normalized transition count is 2115 out of 2116 initially.
Culled 0 columns in 7 ms.
// Phase 1: matrix 2115 rows 59 cols 47392 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-05-27 14:37:04] [INFO ] Computed 16 invariants in 27 ms
Computed 16 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-11785200386980749462.kers
Total runtime 34 ms.
[2026-05-27 14:37:04] [INFO ] Implicit Places using invariants in 769 ms returned []
[2026-05-27 14:37:04] [INFO ] Flow matrix only has 2116 transitions (discarded 22 similar events)
[2026-05-27 14:37:04] [INFO ] Invariant cache hit.
[2026-05-27 14:37:05] [INFO ] State equation strengthened by 1035 read => feed constraints.
[2026-05-27 14:37:06] [INFO ] Implicit Places using invariants and state equation in 2093 ms returned []
Implicit Place search using SMT with State Equation took 2875 ms to find 0 implicit places.
[2026-05-27 14:37:07] [INFO ] Redundant transitions in 248 ms returned []
Running 2136 sub problems to find dead transitions.
[2026-05-27 14:37:07] [INFO ] Flow matrix only has 2116 transitions (discarded 22 similar events)
[2026-05-27 14:37:07] [INFO ] Invariant cache hit.
[2026-05-27 14:37:07] [INFO ] State equation strengthened by 1035 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2136 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2136 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 59/2175 variables, and 16 constraints, problems are : Problem set: 0 solved, 2136 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/59 constraints, ReadFeed: 0/1035 constraints, PredecessorRefiner: 2136/37 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2136 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2136 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 59/2175 variables, and 16 constraints, problems are : Problem set: 0 solved, 2136 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/59 constraints, ReadFeed: 0/1035 constraints, PredecessorRefiner: 2099/37 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63145ms problems are : Problem set: 0 solved, 2136 unsolved
Search for dead transitions found 0 dead transitions in 63154ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/68 places, 2138/23427 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73584 ms. Remains : 59/68 places, 2138/23427 transitions.
Built C files in :
/tmp/ltsmin4562995556005609743
[2026-05-27 14:38:10] [INFO ] Too many transitions (2138) to apply POR reductions. Disabling POR matrices.
[2026-05-27 14:38:10] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4562995556005609743
Running compilation step : cd /tmp/ltsmin4562995556005609743;'/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/ltsmin4562995556005609743;'/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/ltsmin4562995556005609743;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-27 14:38:19] [INFO ] Flatten gal took : 1122 ms
[2026-05-27 14:38:19] [INFO ] Flatten gal took : 320 ms
[2026-05-27 14:38:19] [INFO ] Time to serialize gal into /tmp/LTL15734919969231894539.gal : 185 ms
[2026-05-27 14:38:19] [INFO ] Time to serialize properties into /tmp/LTL16353341516351688438.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/LTL15734919969231894539.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5400455937642567406.hoa' '-atoms' '/tmp/LTL16353341516351688438.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16353341516351688438.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5400455937642567406.hoa
Detected timeout of ITS tools.
[2026-05-27 14:38:44] [INFO ] Flatten gal took : 5080 ms
[2026-05-27 14:38:47] [INFO ] Flatten gal took : 3641 ms
[2026-05-27 14:38:48] [INFO ] Time to serialize gal into /tmp/LTL2627971088379284962.gal : 474 ms
[2026-05-27 14:38:48] [INFO ] Time to serialize properties into /tmp/LTL11432980150770333240.ltl : 4 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/LTL2627971088379284962.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11432980150770333240.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Detected timeout of ITS tools.
[2026-05-27 14:39:07] [INFO ] Flatten gal took : 3951 ms
[2026-05-27 14:39:07] [INFO ] Applying decomposition
[2026-05-27 14:39:11] [INFO ] Flatten gal took : 3576 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/graph12592211334632844699.txt' '-o' '/tmp/graph12592211334632844699.bin' '-w' '/tmp/graph12592211334632844699.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12592211334632844699.bin' '-l' '-1' '-v' '-w' '/tmp/graph12592211334632844699.weights' '-q' '0' '-e' '0.001'
[2026-05-27 14:39:22] [INFO ] Decomposing Gal with order
[2026-05-27 14:39:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 14:39:31] [INFO ] Removed a total of 268385 redundant transitions.
[2026-05-27 14:39:32] [INFO ] Flatten gal took : 7644 ms
[2026-05-27 14:39:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 3670 ms.
[2026-05-27 14:39:37] [INFO ] Time to serialize gal into /tmp/LTL8326348019664808533.gal : 96 ms
[2026-05-27 14:39:37] [INFO ] Time to serialize properties into /tmp/LTL4970614903699376692.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8326348019664808533.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4970614903699376692.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G((X(("((((i2.u1.p21==0)||(i2.u6.p34==0))||((i2.u1.p47==0)||(i2.u5.p60==0)))||(((i2.u0.p79==0)||(i2.u3.p98==0))||((i2.u4.p123==0)||...957
Formula 0 simplified : F(!"(((((i2.u1.p21==0)||(i2.u6.p34==0))||((i2.u1.p47==0)||(i2.u5.p60==0)))||(((i2.u0.p79==0)||(i2.u3.p98==0))||((i2.u4.p123==0)||(i2...943
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV0-PT-1007-LTLFireability-00 finished in 1093299 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((G((F(p0) U p1))&&X(X((X(p3)&&p2)))))))'
Support contains 35 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 52665/52665 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 166 transition count 38625
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 166 transition count 38625
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 165 transition count 26961
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 165 transition count 26961
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 164 transition count 26959
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 164 transition count 26959
Applied a total of 12 rules in 3656 ms. Remains 164 /170 variables (removed 6) and now considering 26959/52665 (removed 25706) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17090815162358126030.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6687988273315268781.kers'
[2026-05-27 14:39:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17090815162358126030.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6687988273315268781.kers]
Culled 0 columns in 113 ms.
// Phase 1: matrix 26959 rows 164 cols 636475 entries
Finished phase 1 with 135 SingleSign rule and 3 generalized
[2026-05-27 14:39:57] [INFO ] Computed 26 invariants in 578 ms
Computed 26 P flows in 579 ms.
Exported basis to /tmp/petrispot-output-6687988273315268781.kers
Total runtime 666 ms.
[2026-05-27 14:40:04] [INFO ] Implicit Places using invariants in 8554 ms returned []
Implicit Place search using SMT only with invariants took 8562 ms to find 0 implicit places.
Running 26958 sub problems to find dead transitions.
[2026-05-27 14:40:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 26958 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 163/27123 variables, and 10 constraints, problems are : Problem set: 0 solved, 26958 unsolved in 30735 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/164 constraints, PredecessorRefiner: 26958/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26958 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 26958 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 163/27123 variables, and 10 constraints, problems are : Problem set: 0 solved, 26958 unsolved in 30566 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/164 constraints, PredecessorRefiner: 26837/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 160737ms problems are : Problem set: 0 solved, 26958 unsolved
Search for dead transitions found 0 dead transitions in 161051ms
Starting structural reductions in LTL mode, iteration 1 : 164/170 places, 26959/52665 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 173456 ms. Remains : 164/170 places, 26959/52665 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((G((F(p0) U p1))&&X(X((X(p3)&&p2)))))))'
Stuttering acceptance computed with spot in 1141 ms :[(OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p1), (NOT p1), (OR (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ErlangenMainframeV0-PT-1007-LTLFireability-01
Product exploration timeout after 49370 steps with 0 reset in 10001 ms.
Stack based approach found an accepted trace after 119 steps with 0 reset with depth 120 and stack size 120 in 9 ms.
FORMULA ErlangenMainframeV0-PT-1007-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-1007-LTLFireability-01 finished in 184980 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1) U X(X(p2))))'
Support contains 31 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 52665/52665 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 163 transition count 36193
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 163 transition count 36193
Applied a total of 14 rules in 1721 ms. Remains 163 /170 variables (removed 7) and now considering 36193/52665 (removed 16472) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14981474645555579552.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5016340364214380781.kers'
[2026-05-27 14:42:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14981474645555579552.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5016340364214380781.kers]
Culled 0 columns in 192 ms.
// Phase 1: matrix 36193 rows 163 cols 862911 entries
Finished phase 1 with 135 SingleSign rule and 2 generalized
[2026-05-27 14:43:00] [INFO ] Computed 26 invariants in 870 ms
Computed 26 P flows in 870 ms.
Exported basis to /tmp/petrispot-output-5016340364214380781.kers
Total runtime 1002 ms.
[2026-05-27 14:43:08] [INFO ] Implicit Places using invariants in 9247 ms returned []
Implicit Place search using SMT only with invariants took 9249 ms to find 0 implicit places.
Running 36192 sub problems to find dead transitions.
[2026-05-27 14:43:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 36192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 162/36356 variables, and 10 constraints, problems are : Problem set: 0 solved, 36192 unsolved in 30841 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/163 constraints, PredecessorRefiner: 36192/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 36192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 162/36356 variables, and 10 constraints, problems are : Problem set: 0 solved, 36192 unsolved in 30622 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/163 constraints, PredecessorRefiner: 36069/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 207865ms problems are : Problem set: 0 solved, 36192 unsolved
Search for dead transitions found 0 dead transitions in 208056ms
Starting structural reductions in LTL mode, iteration 1 : 163/170 places, 36193/52665 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 219103 ms. Remains : 163/170 places, 36193/52665 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1) U X(X(p2))))'
Stuttering acceptance computed with spot in 512 ms :[(NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), true, (AND (NOT p0) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p0), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-1007-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 9 ms.
FORMULA ErlangenMainframeV0-PT-1007-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1007-LTLFireability-02 finished in 219909 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(p0)&&F(p1)))))'
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 52665/52665 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 153 transition count 35170
Ensure Unique test removed 10 places
Iterating global reduction 0 with 27 rules applied. Total rules applied 44 place count 143 transition count 35170
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 140 transition count 10546
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 140 transition count 10546
Applied a total of 50 rules in 6193 ms. Remains 140 /170 variables (removed 30) and now considering 10546/52665 (removed 42119) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8513365182294870665.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16487110123929895010.kers'
[2026-05-27 14:46:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8513365182294870665.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16487110123929895010.kers]
Culled 0 columns in 25 ms.
// Phase 1: matrix 10546 rows 140 cols 145739 entries
Finished phase 1 with 124 SingleSign rule and 0 generalized
[2026-05-27 14:46:43] [INFO ] Computed 16 invariants in 118 ms
Computed 16 P flows in 120 ms.
Exported basis to /tmp/petrispot-output-16487110123929895010.kers
Total runtime 139 ms.
[2026-05-27 14:46:45] [INFO ] Implicit Places using invariants in 1870 ms returned []
Implicit Place search using SMT only with invariants took 1872 ms to find 0 implicit places.
Running 10545 sub problems to find dead transitions.
[2026-05-27 14:46:45] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 139/10686 variables, and 0 constraints, problems are : Problem set: 0 solved, 10545 unsolved in 30294 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, State Equation: 0/140 constraints, PredecessorRefiner: 10545/134 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10545 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 139/10686 variables, and 0 constraints, problems are : Problem set: 0 solved, 10545 unsolved in 30195 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, State Equation: 0/140 constraints, PredecessorRefiner: 10411/134 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 84733ms problems are : Problem set: 0 solved, 10545 unsolved
Search for dead transitions found 0 dead transitions in 84823ms
Starting structural reductions in LTL mode, iteration 1 : 140/170 places, 10546/52665 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92917 ms. Remains : 140/170 places, 10546/52665 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&F(p1)))))'
Stuttering acceptance computed with spot in 219 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV0-PT-1007-LTLFireability-04
Product exploration explored 100000 steps with 33333 reset in 685 ms.
Product exploration explored 100000 steps with 33333 reset in 618 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 6 factoid took 19 ms. Proved property starting from automaton with 5 states, 7 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 529 ms.
FORMULA ErlangenMainframeV0-PT-1007-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-1007-LTLFireability-04 finished in 95068 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)&&((p1 U G(p2))||X(X(p3)))) U G(p4))))'
Support contains 36 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 52665/52665 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 163 transition count 36193
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 163 transition count 36193
Applied a total of 14 rules in 1663 ms. Remains 163 /170 variables (removed 7) and now considering 36193/52665 (removed 16472) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-403398145042628098.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7255023623900340980.kers'
[2026-05-27 14:48:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-403398145042628098.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7255023623900340980.kers]
Culled 0 columns in 144 ms.
// Phase 1: matrix 36193 rows 163 cols 862911 entries
Finished phase 1 with 135 SingleSign rule and 2 generalized
[2026-05-27 14:48:14] [INFO ] Computed 26 invariants in 719 ms
Computed 26 P flows in 719 ms.
Exported basis to /tmp/petrispot-output-7255023623900340980.kers
Total runtime 853 ms.
[2026-05-27 14:48:18] [INFO ] Implicit Places using invariants in 4832 ms returned []
Implicit Place search using SMT only with invariants took 4834 ms to find 0 implicit places.
Running 36192 sub problems to find dead transitions.
[2026-05-27 14:48:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 36192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 162/36356 variables, and 10 constraints, problems are : Problem set: 0 solved, 36192 unsolved in 30846 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/163 constraints, PredecessorRefiner: 36192/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 36192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 162/36356 variables, and 10 constraints, problems are : Problem set: 0 solved, 36192 unsolved in 31035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/163 constraints, PredecessorRefiner: 36069/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 203029ms problems are : Problem set: 0 solved, 36192 unsolved
Search for dead transitions found 0 dead transitions in 203266ms
Starting structural reductions in LTL mode, iteration 1 : 163/170 places, 36193/52665 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 209857 ms. Remains : 163/170 places, 36193/52665 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)&&((p1 U G(p2))||X(X(p3)))) U G(p4))))'
Stuttering acceptance computed with spot in 1266 ms :[(NOT p4), (NOT p4), (NOT p0), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p4)), (AND (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4) (NOT p2)), (NOT p3), true, (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p4) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p4) (NOT p2) (NOT p3)), (NOT p2), (NOT p2), (NOT p4), (AND (NOT p2) p3 (NOT p4)), (AND (NOT p2) (NOT p4))]
Running random walk in product with property : ErlangenMainframeV0-PT-1007-LTLFireability-07
Product exploration timeout after 31260 steps with 0 reset in 10005 ms.
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 2 ms.
FORMULA ErlangenMainframeV0-PT-1007-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1007-LTLFireability-07 finished in 221568 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0&&X((F((p1||G(p2)))||G(!p0))))))'
Support contains 23 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 52665/52665 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 153 transition count 35170
Ensure Unique test removed 10 places
Iterating global reduction 0 with 27 rules applied. Total rules applied 44 place count 143 transition count 35170
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 142 transition count 23506
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 142 transition count 23506
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 141 transition count 23504
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 141 transition count 23504
Applied a total of 48 rules in 5312 ms. Remains 141 /170 variables (removed 29) and now considering 23504/52665 (removed 29161) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10206560405920433348.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7401417975659049298.kers'
[2026-05-27 14:51:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10206560405920433348.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7401417975659049298.kers]
Culled 0 columns in 59 ms.
// Phase 1: matrix 23504 rows 141 cols 327175 entries
Finished phase 1 with 125 SingleSign rule and 0 generalized
[2026-05-27 14:51:59] [INFO ] Computed 16 invariants in 448 ms
Computed 16 P flows in 451 ms.
Exported basis to /tmp/petrispot-output-7401417975659049298.kers
Total runtime 505 ms.
[2026-05-27 14:52:03] [INFO ] Implicit Places using invariants in 4445 ms returned []
Implicit Place search using SMT only with invariants took 4447 ms to find 0 implicit places.
Running 23503 sub problems to find dead transitions.
[2026-05-27 14:52:03] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 140/23645 variables, and 0 constraints, problems are : Problem set: 0 solved, 23503 unsolved in 30436 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, State Equation: 0/141 constraints, PredecessorRefiner: 23503/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23503 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 140/23645 variables, and 0 constraints, problems are : Problem set: 0 solved, 23503 unsolved in 30676 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, State Equation: 0/141 constraints, PredecessorRefiner: 23371/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 139553ms problems are : Problem set: 0 solved, 23503 unsolved
Search for dead transitions found 0 dead transitions in 139706ms
Starting structural reductions in LTL mode, iteration 1 : 141/170 places, 23504/52665 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149527 ms. Remains : 141/170 places, 23504/52665 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F((p0||G(p1)))||G(p2)))&&p2)))'
Stuttering acceptance computed with spot in 207 ms :[(NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV0-PT-1007-LTLFireability-08
Product exploration timeout after 53220 steps with 0 reset in 10003 ms.
Product exploration timeout after 54750 steps with 0 reset in 10002 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 75 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 14731 ms. (2 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1105 ms. (36 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 863 ms. (46 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 910 ms. (43 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1037 ms. (38 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 856 ms. (46 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 814 ms. (49 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 790 ms. (50 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 57224 steps, run timeout after 15002 ms. (steps per millisecond=3 ) properties seen :0 out of 7
Probabilistic random walk after 57224 steps, saw 38231 distinct states, run finished after 15002 ms. (steps per millisecond=3 ) properties seen :0
[2026-05-27 14:55:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 81/104 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 37/141 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SMT process timed out in 14703ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 23504/23504 transitions.
Graph (trivial) has 88 edges and 141 vertex of which 4 / 141 are part of one of the 2 SCC in 8 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 139 transition count 23487
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 126 transition count 23487
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 27 place count 126 transition count 23469
Deduced a syphon composed of 18 places in 29 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 63 place count 108 transition count 23469
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 106 transition count 23452
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 106 transition count 23452
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 106 transition count 23450
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 16 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 141 place count 70 transition count 23414
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 3 places in 15 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 147 place count 67 transition count 23434
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 153 place count 67 transition count 23428
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 161 place count 61 transition count 23426
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 163 place count 61 transition count 23426
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 168 place count 61 transition count 23426
Applied a total of 168 rules in 5452 ms. Remains 61 /141 variables (removed 80) and now considering 23426/23504 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5453 ms. Remains : 61/141 places, 23426/23504 transitions.
RANDOM walk for 40000 steps (8 resets) in 23217 ms. (1 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 3531 ms. (11 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4069 ms. (9 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4016 ms. (9 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 4201 ms. (9 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4221 ms. (9 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 3921 ms. (10 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 4066 ms. (9 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 479832 steps, run timeout after 45001 ms. (steps per millisecond=10 ) properties seen :0 out of 7
Probabilistic random walk after 479832 steps, saw 59696 distinct states, run finished after 45002 ms. (steps per millisecond=10 ) properties seen :0
[2026-05-27 14:56:25] [INFO ] Flow matrix only has 23407 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4418893633078204704.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16374212122707294663.kers'
[2026-05-27 14:56:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4418893633078204704.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16374212122707294663.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 93 ms.
// Phase 1: matrix 23407 rows 60 cols 544630 entries
Finished phase 1 with 45 SingleSign rule and 0 generalized
[2026-05-27 14:56:25] [INFO ] Computed 16 invariants in 337 ms
Computed 16 P flows in 341 ms.
Exported basis to /tmp/petrispot-output-16374212122707294663.kers
Total runtime 441 ms.
[2026-05-27 14:57:04] [INFO ] State equation strengthened by 7814 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 31/54 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 7/61 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 23407/23468 variables, 61/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SMT process timed out in 84291ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 6812 ms.
Support contains 23 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 23426/23426 transitions.
Applied a total of 0 rules in 743 ms. Remains 61 /61 variables (removed 0) and now considering 23426/23426 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 743 ms. Remains : 61/61 places, 23426/23426 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 23426/23426 transitions.
Applied a total of 0 rules in 708 ms. Remains 61 /61 variables (removed 0) and now considering 23426/23426 (removed 0) transitions.
[2026-05-27 14:57:57] [INFO ] Flow matrix only has 23407 transitions (discarded 19 similar events)
[2026-05-27 14:57:57] [INFO ] Invariant cache hit.
[2026-05-27 14:58:01] [INFO ] Implicit Places using invariants in 3637 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3684 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/61 places, 23426/23426 transitions.
Applied a total of 0 rules in 636 ms. Remains 60 /60 variables (removed 0) and now considering 23426/23426 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5042 ms. Remains : 60/61 places, 23426/23426 transitions.
Knowledge based reduction with 6 factoid took 64 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 198885 ms.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 23 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 23504/23504 transitions.
Applied a total of 0 rules in 91 ms. Remains 141 /141 variables (removed 0) and now considering 23504/23504 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15686850793169192286.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4254908520121998827.kers'
[2026-05-27 14:58:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15686850793169192286.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4254908520121998827.kers]
Culled 0 columns in 56 ms.
// Phase 1: matrix 23504 rows 141 cols 327175 entries
Finished phase 1 with 125 SingleSign rule and 0 generalized
[2026-05-27 14:58:03] [INFO ] Computed 16 invariants in 393 ms
Computed 16 P flows in 396 ms.
Exported basis to /tmp/petrispot-output-4254908520121998827.kers
Total runtime 466 ms.
[2026-05-27 14:58:07] [INFO ] Implicit Places using invariants in 4480 ms returned []
Implicit Place search using SMT only with invariants took 4487 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 4580 ms. Remains : 141/141 places, 23504/23504 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 5 factoid took 57 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 13187 ms. (3 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 960 ms. (41 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 834 ms. (47 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 862 ms. (46 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 898 ms. (44 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 896 ms. (44 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 783 ms. (51 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 963 ms. (41 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 64256 steps, run timeout after 15001 ms. (steps per millisecond=4 ) properties seen :0 out of 7
Probabilistic random walk after 64256 steps, saw 42874 distinct states, run finished after 15004 ms. (steps per millisecond=4 ) properties seen :0
[2026-05-27 14:58:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 81/104 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 37/141 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SMT process timed out in 13157ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 23504/23504 transitions.
Graph (trivial) has 88 edges and 141 vertex of which 4 / 141 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 139 transition count 23487
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 126 transition count 23487
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 27 place count 126 transition count 23469
Deduced a syphon composed of 18 places in 24 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 63 place count 108 transition count 23469
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 106 transition count 23452
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 106 transition count 23452
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 106 transition count 23450
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 13 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 141 place count 70 transition count 23414
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 3 places in 13 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 147 place count 67 transition count 23434
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 153 place count 67 transition count 23428
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 161 place count 61 transition count 23426
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 163 place count 61 transition count 23426
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 168 place count 61 transition count 23426
Applied a total of 168 rules in 5039 ms. Remains 61 /141 variables (removed 80) and now considering 23426/23504 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5041 ms. Remains : 61/141 places, 23426/23504 transitions.
RANDOM walk for 40000 steps (8 resets) in 28771 ms. (1 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 4503 ms. (8 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 5067 ms. (7 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4301 ms. (9 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4232 ms. (9 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 4235 ms. (9 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 4722 ms. (8 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3255 ms. (12 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 540913 steps, run timeout after 48001 ms. (steps per millisecond=11 ) properties seen :0 out of 7
Probabilistic random walk after 540913 steps, saw 66611 distinct states, run finished after 48001 ms. (steps per millisecond=11 ) properties seen :0
[2026-05-27 14:59:51] [INFO ] Flow matrix only has 23407 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2087287550683141201.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14632447559437561775.kers'
[2026-05-27 14:59:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2087287550683141201.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14632447559437561775.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 98 ms.
// Phase 1: matrix 23407 rows 60 cols 544630 entries
Finished phase 1 with 45 SingleSign rule and 0 generalized
[2026-05-27 14:59:51] [INFO ] Computed 16 invariants in 351 ms
Computed 16 P flows in 352 ms.
Exported basis to /tmp/petrispot-output-14632447559437561775.kers
Total runtime 448 ms.
[2026-05-27 15:00:32] [INFO ] State equation strengthened by 7814 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 31/54 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 7/61 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 23407/23468 variables, 61/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SMT process timed out in 86041ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4907 ms.
Support contains 23 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 23426/23426 transitions.
Applied a total of 0 rules in 639 ms. Remains 61 /61 variables (removed 0) and now considering 23426/23426 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 642 ms. Remains : 61/61 places, 23426/23426 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 23426/23426 transitions.
Applied a total of 0 rules in 996 ms. Remains 61 /61 variables (removed 0) and now considering 23426/23426 (removed 0) transitions.
[2026-05-27 15:01:23] [INFO ] Flow matrix only has 23407 transitions (discarded 19 similar events)
[2026-05-27 15:01:23] [INFO ] Invariant cache hit.
[2026-05-27 15:01:28] [INFO ] Implicit Places using invariants in 4504 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4577 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/61 places, 23426/23426 transitions.
Applied a total of 0 rules in 888 ms. Remains 60 /60 variables (removed 0) and now considering 23426/23426 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6472 ms. Remains : 60/61 places, 23426/23426 transitions.
Knowledge based reduction with 5 factoid took 54 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 202114 ms.
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 51780 steps with 0 reset in 10001 ms.
Product exploration timeout after 39630 steps with 0 reset in 10002 ms.
Spot run failed in 156 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/ltsmin3113269656256719935
[2026-05-27 15:01:50] [INFO ] Built C files in 660ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3113269656256719935
Running compilation step : cd /tmp/ltsmin3113269656256719935;'/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/ltsmin3113269656256719935;'/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/ltsmin3113269656256719935;'/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 23 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 23504/23504 transitions.
Applied a total of 0 rules in 99 ms. Remains 141 /141 variables (removed 0) and now considering 23504/23504 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17327515025407031077.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11180500533672787712.kers'
[2026-05-27 15:01:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17327515025407031077.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11180500533672787712.kers]
Culled 0 columns in 60 ms.
// Phase 1: matrix 23504 rows 141 cols 327175 entries
Finished phase 1 with 125 SingleSign rule and 0 generalized
[2026-05-27 15:01:54] [INFO ] Computed 16 invariants in 438 ms
Computed 16 P flows in 440 ms.
Exported basis to /tmp/petrispot-output-11180500533672787712.kers
Total runtime 488 ms.
[2026-05-27 15:01:58] [INFO ] Implicit Places using invariants in 4236 ms returned []
Implicit Place search using SMT only with invariants took 4237 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 4339 ms. Remains : 141/141 places, 23504/23504 transitions.
Built C files in :
/tmp/ltsmin972306057251307125
[2026-05-27 15:01:58] [INFO ] Built C files in 395ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin972306057251307125
Running compilation step : cd /tmp/ltsmin972306057251307125;'/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/ltsmin972306057251307125;'/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/ltsmin972306057251307125;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-27 15:02:10] [INFO ] Flatten gal took : 3670 ms
[2026-05-27 15:02:12] [INFO ] Flatten gal took : 1817 ms
[2026-05-27 15:02:13] [INFO ] Time to serialize gal into /tmp/LTL6665504598644301159.gal : 639 ms
[2026-05-27 15:02:13] [INFO ] Time to serialize properties into /tmp/LTL14287958812300855027.prop : 4 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/LTL6665504598644301159.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2456194131627889497.hoa' '-atoms' '/tmp/LTL14287958812300855027.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
Detected timeout of ITS tools.
[2026-05-27 15:02:35] [INFO ] Flatten gal took : 1929 ms
[2026-05-27 15:02:37] [INFO ] Flatten gal took : 1880 ms
[2026-05-27 15:02:37] [INFO ] Time to serialize gal into /tmp/LTL7552375865201681998.gal : 401 ms
[2026-05-27 15:02:37] [INFO ] Time to serialize properties into /tmp/LTL16484784953287838072.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7552375865201681998.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16484784953287838072.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Detected timeout of ITS tools.
[2026-05-27 15:02:54] [INFO ] Flatten gal took : 2074 ms
[2026-05-27 15:02:54] [INFO ] Applying decomposition
[2026-05-27 15:02:56] [INFO ] Flatten gal took : 1425 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/graph11684254233823080359.txt' '-o' '/tmp/graph11684254233823080359.bin' '-w' '/tmp/graph11684254233823080359.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11684254233823080359.bin' '-l' '-1' '-v' '-w' '/tmp/graph11684254233823080359.weights' '-q' '0' '-e' '0.001'
[2026-05-27 15:03:02] [INFO ] Decomposing Gal with order
[2026-05-27 15:03:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 15:03:19] [INFO ] Removed a total of 67976 redundant transitions.
[2026-05-27 15:03:20] [INFO ] Flatten gal took : 16487 ms
[2026-05-27 15:03:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 3687 labels/synchronizations in 1600 ms.
[2026-05-27 15:03:24] [INFO ] Time to serialize gal into /tmp/LTL15836671787396132149.gal : 26 ms
[2026-05-27 15:03:24] [INFO ] Time to serialize properties into /tmp/LTL13263937665551699630.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15836671787396132149.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13263937665551699630.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...256
Read 1 LTL properties
Checking formula 0 : !((X((X((F(("(((((i1.u21.p17==1)&&(i1.u21.p30==1))&&((i1.u33.p43==1)&&(u34.p60==1)))&&(((u34.p75==1)&&(i1.u21.p104==1))&&((i1.u33.p113...949
Formula 0 simplified : X(!"(((((i1.u21.p17!=1)||(u34.p34!=1))||((i1.u33.p43!=1)||(u34.p60!=1)))||(((u34.p75!=1)||(i1.u21.p98!=1))||((i1.u33.p123!=1)||(i1.u...937
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV0-PT-1007-LTLFireability-08 finished in 705553 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(p0))&&F((G(F(p1))||(!p2&&F(p1))))))'
Support contains 23 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 52665/52665 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 153 transition count 35170
Ensure Unique test removed 10 places
Iterating global reduction 0 with 27 rules applied. Total rules applied 44 place count 143 transition count 35170
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 141 transition count 15730
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 141 transition count 15730
Applied a total of 48 rules in 5428 ms. Remains 141 /170 variables (removed 29) and now considering 15730/52665 (removed 36935) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8461413236201524465.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3159997702508368293.kers'
[2026-05-27 15:03:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8461413236201524465.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3159997702508368293.kers]
Culled 0 columns in 38 ms.
// Phase 1: matrix 15730 rows 141 cols 218315 entries
Finished phase 1 with 125 SingleSign rule and 0 generalized
[2026-05-27 15:03:45] [INFO ] Computed 16 invariants in 211 ms
Computed 16 P flows in 231 ms.
Exported basis to /tmp/petrispot-output-3159997702508368293.kers
Total runtime 266 ms.
[2026-05-27 15:03:46] [INFO ] Implicit Places using invariants in 2178 ms returned []
Implicit Place search using SMT only with invariants took 2188 ms to find 0 implicit places.
Running 15729 sub problems to find dead transitions.
[2026-05-27 15:03:47] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 140/15871 variables, and 0 constraints, problems are : Problem set: 0 solved, 15729 unsolved in 30449 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, State Equation: 0/141 constraints, PredecessorRefiner: 15729/134 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15729 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 140/15871 variables, and 0 constraints, problems are : Problem set: 0 solved, 15729 unsolved in 30287 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, State Equation: 0/141 constraints, PredecessorRefiner: 15595/134 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 107665ms problems are : Problem set: 0 solved, 15729 unsolved
Search for dead transitions found 0 dead transitions in 107741ms
Starting structural reductions in LTL mode, iteration 1 : 141/170 places, 15730/52665 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115400 ms. Remains : 141/170 places, 15730/52665 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&F((G(F(p1))||(p2&&F(p1))))))'
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p0), true]
Running random walk in product with property : ErlangenMainframeV0-PT-1007-LTLFireability-09
Product exploration timeout after 79930 steps with 3 reset in 10001 ms.
Stack based approach found an accepted trace after 34 steps with 1 reset with depth 32 and stack size 32 in 1 ms.
FORMULA ErlangenMainframeV0-PT-1007-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-1007-LTLFireability-09 finished in 125789 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 23 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 52665/52665 transitions.
Graph (trivial) has 101 edges and 170 vertex of which 4 / 170 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 167 transition count 52650
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 155 transition count 52650
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 25 place count 155 transition count 52632
Deduced a syphon composed of 18 places in 68 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 61 place count 137 transition count 52632
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 70 place count 128 transition count 36143
Iterating global reduction 2 with 9 rules applied. Total rules applied 79 place count 128 transition count 36143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 81 place count 128 transition count 36141
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 15 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 167 place count 85 transition count 36098
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 169 place count 84 transition count 36109
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 175 place count 84 transition count 36109
Applied a total of 175 rules in 10581 ms. Remains 84 /170 variables (removed 86) and now considering 36109/52665 (removed 16556) transitions.
[2026-05-27 15:05:55] [INFO ] Flow matrix only has 36087 transitions (discarded 22 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8653856312835863962.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2308779628875650752.kers'
[2026-05-27 15:05:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8653856312835863962.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2308779628875650752.kers]
Normalized transition count is 36086 out of 36087 initially.
Culled 0 columns in 148 ms.
// Phase 1: matrix 36086 rows 84 cols 827666 entries
Finished phase 1 with 56 SingleSign rule and 2 generalized
[2026-05-27 15:05:56] [INFO ] Computed 26 invariants in 823 ms
Computed 26 P flows in 824 ms.
Exported basis to /tmp/petrispot-output-2308779628875650752.kers
Total runtime 961 ms.
[2026-05-27 15:06:12] [INFO ] Implicit Places using invariants in 16893 ms returned []
Implicit Place search using SMT only with invariants took 16899 ms to find 0 implicit places.
Running 36107 sub problems to find dead transitions.
[2026-05-27 15:06:12] [INFO ] Flow matrix only has 36087 transitions (discarded 22 similar events)
[2026-05-27 15:06:12] [INFO ] Invariant cache hit.
[2026-05-27 15:06:13] [INFO ] State equation strengthened by 17507 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 36107 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 83/36171 variables, and 10 constraints, problems are : Problem set: 0 solved, 36107 unsolved in 31082 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/84 constraints, ReadFeed: 0/17507 constraints, PredecessorRefiner: 36107/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 36107 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 83/36171 variables, and 10 constraints, problems are : Problem set: 0 solved, 36107 unsolved in 31007 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/84 constraints, ReadFeed: 0/17507 constraints, PredecessorRefiner: 36073/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 216401ms problems are : Problem set: 0 solved, 36107 unsolved
Search for dead transitions found 0 dead transitions in 216648ms
Starting structural reductions in SI_LTL mode, iteration 1 : 84/170 places, 36109/52665 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 244221 ms. Remains : 84/170 places, 36109/52665 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1007-LTLFireability-10
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA ErlangenMainframeV0-PT-1007-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1007-LTLFireability-10 finished in 244486 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 23 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 52665/52665 transitions.
Graph (trivial) has 101 edges and 170 vertex of which 4 / 170 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 167 transition count 52650
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 155 transition count 52650
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 25 place count 155 transition count 52632
Deduced a syphon composed of 18 places in 77 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 61 place count 137 transition count 52632
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 70 place count 128 transition count 36143
Iterating global reduction 2 with 9 rules applied. Total rules applied 79 place count 128 transition count 36143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 81 place count 128 transition count 36141
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 83 place count 126 transition count 16701
Iterating global reduction 3 with 2 rules applied. Total rules applied 85 place count 126 transition count 16701
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 86 place count 125 transition count 16699
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 125 transition count 16699
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 6 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 169 place count 84 transition count 16658
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 173 place count 82 transition count 16669
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 174 place count 82 transition count 16668
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 180 place count 82 transition count 16668
Applied a total of 180 rules in 42567 ms. Remains 82 /170 variables (removed 88) and now considering 16668/52665 (removed 35997) transitions.
[2026-05-27 15:10:32] [INFO ] Flow matrix only has 16646 transitions (discarded 22 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1391205856001221945.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14389873811164795721.kers'
[2026-05-27 15:10:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1391205856001221945.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14389873811164795721.kers]
Normalized transition count is 16645 out of 16646 initially.
Culled 0 columns in 109 ms.
// Phase 1: matrix 16645 rows 82 cols 380538 entries
Finished phase 1 with 54 SingleSign rule and 2 generalized
[2026-05-27 15:10:32] [INFO ] Computed 26 invariants in 394 ms
Computed 26 P flows in 399 ms.
Exported basis to /tmp/petrispot-output-14389873811164795721.kers
Total runtime 497 ms.
[2026-05-27 15:10:41] [INFO ] Implicit Places using invariants in 9428 ms returned []
Implicit Place search using SMT only with invariants took 9429 ms to find 0 implicit places.
Running 16666 sub problems to find dead transitions.
[2026-05-27 15:10:41] [INFO ] Flow matrix only has 16646 transitions (discarded 22 similar events)
[2026-05-27 15:10:41] [INFO ] Invariant cache hit.
[2026-05-27 15:10:41] [INFO ] State equation strengthened by 7787 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 16666 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 81/16728 variables, and 10 constraints, problems are : Problem set: 0 solved, 16666 unsolved in 30311 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/82 constraints, ReadFeed: 0/7787 constraints, PredecessorRefiner: 16666/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16666 unsolved
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ErlangenMainframeV0-PT-1007"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is ErlangenMainframeV0-PT-1007, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-smll-177955740600476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ErlangenMainframeV0-PT-1007.tgz
mv ErlangenMainframeV0-PT-1007 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 '
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 ;