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.r050-smll-177946901000084.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 Champagne-PT-H07T1U, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r050-smll-177946901000084
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 840K
-rw-r--r-- 1 mcc users 8.6K Mar 6 10:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Mar 6 10:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 6 10:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 6 10:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Mar 6 10:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 213K Mar 6 10:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Mar 6 10:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 123K Mar 6 10:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 208K 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 Champagne-PT-H07T1U-LTLFireability-00
FORMULA_NAME Champagne-PT-H07T1U-LTLFireability-01
FORMULA_NAME Champagne-PT-H07T1U-LTLFireability-02
FORMULA_NAME Champagne-PT-H07T1U-LTLFireability-03
FORMULA_NAME Champagne-PT-H07T1U-LTLFireability-04
FORMULA_NAME Champagne-PT-H07T1U-LTLFireability-05
FORMULA_NAME Champagne-PT-H07T1U-LTLFireability-06
FORMULA_NAME Champagne-PT-H07T1U-LTLFireability-07
FORMULA_NAME Champagne-PT-H07T1U-LTLFireability-08
FORMULA_NAME Champagne-PT-H07T1U-LTLFireability-09
FORMULA_NAME Champagne-PT-H07T1U-LTLFireability-10
FORMULA_NAME Champagne-PT-H07T1U-LTLFireability-11
FORMULA_NAME Champagne-PT-H07T1U-LTLFireability-12
FORMULA_NAME Champagne-PT-H07T1U-LTLFireability-13
FORMULA_NAME Champagne-PT-H07T1U-LTLFireability-14
FORMULA_NAME Champagne-PT-H07T1U-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779505321058

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H07T1U
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 03:02:03] [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-23 03:02:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 03:02:03] [INFO ] Load time of PNML (sax parser for PT used): 259 ms
[2026-05-23 03:02:04] [INFO ] Transformed 701 places.
[2026-05-23 03:02:04] [INFO ] Transformed 931 transitions.
[2026-05-23 03:02:04] [INFO ] Found NUPN structural information;
[2026-05-23 03:02:04] [INFO ] Parsed PT model containing 701 places and 931 transitions and 2312 arcs in 501 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Champagne-PT-H07T1U-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H07T1U-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H07T1U-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 701 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 701/701 places, 931/931 transitions.
Discarding 155 places :
Symmetric choice reduction at 0 with 155 rule applications. Total rules 155 place count 546 transition count 776
Iterating global reduction 0 with 155 rules applied. Total rules applied 310 place count 546 transition count 776
Discarding 97 places :
Symmetric choice reduction at 0 with 97 rule applications. Total rules 407 place count 449 transition count 679
Iterating global reduction 0 with 97 rules applied. Total rules applied 504 place count 449 transition count 679
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 558 place count 395 transition count 625
Iterating global reduction 0 with 54 rules applied. Total rules applied 612 place count 395 transition count 625
Applied a total of 612 rules in 284 ms. Remains 395 /701 variables (removed 306) and now considering 625/931 (removed 306) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5936054242556319483.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17229304108372110755.kers'
[2026-05-23 03:02:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5936054242556319483.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17229304108372110755.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 625 rows 395 cols 1700 entries
Finished phase 1 with 368 SingleSign rule and 0 generalized
[2026-05-23 03:02:04] [INFO ] Computed 27 invariants in 5 ms
Computed 27 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-17229304108372110755.kers
Total runtime 8 ms.
[2026-05-23 03:02:05] [INFO ] Implicit Places using invariants in 717 ms returned []
[2026-05-23 03:02:05] [INFO ] Invariant cache hit.
[2026-05-23 03:02:06] [INFO ] Implicit Places using invariants and state equation in 825 ms returned []
Implicit Place search using SMT with State Equation took 1635 ms to find 0 implicit places.
Running 624 sub problems to find dead transitions.
[2026-05-23 03:02:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 1 (OVERLAPS) 1/395 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 624 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 395/1020 variables, and 28 constraints, problems are : Problem set: 0 solved, 624 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/395 constraints, PredecessorRefiner: 624/624 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 624 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 1 (OVERLAPS) 1/395 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/395 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/395 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 4 (OVERLAPS) 625/1020 variables, 395/423 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1020 variables, 624/1047 constraints. Problems are: Problem set: 0 solved, 624 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1020/1020 variables, and 1049 constraints, problems are : Problem set: 0 solved, 624 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 395/395 constraints, PredecessorRefiner: 624/624 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60532ms problems are : Problem set: 0 solved, 624 unsolved
Search for dead transitions found 0 dead transitions in 60571ms
Starting structural reductions in LTL mode, iteration 1 : 395/701 places, 625/931 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62574 ms. Remains : 395/701 places, 625/931 transitions.
Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 625/625 transitions.
Applied a total of 0 rules in 21 ms. Remains 395 /395 variables (removed 0) and now considering 625/625 (removed 0) transitions.
[2026-05-23 03:03:07] [INFO ] Invariant cache hit.
[2026-05-23 03:03:07] [INFO ] Implicit Places using invariants in 283 ms returned []
[2026-05-23 03:03:07] [INFO ] Invariant cache hit.
[2026-05-23 03:03:07] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 909 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 933 ms. Remains : 395/395 places, 625/625 transitions.
Support contains 42 out of 395 places after structural reductions.
[2026-05-23 03:03:08] [INFO ] Flatten gal took : 103 ms
[2026-05-23 03:03:08] [INFO ] Flatten gal took : 67 ms
[2026-05-23 03:03:08] [INFO ] Input system was already deterministic with 625 transitions.
RANDOM walk for 40000 steps (89 resets) in 1690 ms. (23 steps per ms) remains 1/36 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
[2026-05-23 03:03:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 374/395 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 625/1020 variables, 395/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1020 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1020 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1020 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1020/1020 variables, and 424 constraints, problems are : Problem set: 0 solved, 1 unsolved in 849 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 395/395 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 374/395 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 625/1020 variables, 395/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1020 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1020 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1020 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1020/1020 variables, and 425 constraints, problems are : Problem set: 0 solved, 1 unsolved in 600 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 395/395 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1468ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 135 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=27 )
Parikh walk visited 1 properties in 15 ms.
FORMULA Champagne-PT-H07T1U-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 32 stabilizing places and 32 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' '!(F(G(((p0 U p1)&&X(p0)&&F(p0)))))'
Support contains 3 out of 395 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 395/395 places, 625/625 transitions.
Graph (trivial) has 403 edges and 395 vertex of which 191 / 395 are part of one of the 25 SCC in 6 ms
Free SCC test removed 166 places
Ensure Unique test removed 184 transitions
Reduce isomorphic transitions removed 184 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 228 transition count 400
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 90 rules applied. Total rules applied 131 place count 188 transition count 350
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 156 place count 163 transition count 350
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 156 place count 163 transition count 348
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 160 place count 161 transition count 348
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 183 place count 138 transition count 276
Iterating global reduction 3 with 23 rules applied. Total rules applied 206 place count 138 transition count 276
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 219 place count 138 transition count 263
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 220 place count 137 transition count 259
Iterating global reduction 4 with 1 rules applied. Total rules applied 221 place count 137 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 222 place count 137 transition count 258
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 324 place count 86 transition count 207
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 327 place count 83 transition count 191
Iterating global reduction 5 with 3 rules applied. Total rules applied 330 place count 83 transition count 191
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 333 place count 83 transition count 188
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 337 place count 81 transition count 194
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 345 place count 81 transition count 186
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 347 place count 79 transition count 178
Iterating global reduction 6 with 2 rules applied. Total rules applied 349 place count 79 transition count 178
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 351 place count 79 transition count 176
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 353 place count 77 transition count 174
Applied a total of 353 rules in 193 ms. Remains 77 /395 variables (removed 318) and now considering 174/625 (removed 451) transitions.
[2026-05-23 03:03:11] [INFO ] Flow matrix only has 81 transitions (discarded 93 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15111092369727188386.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9110765562046618994.kers'
[2026-05-23 03:03:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15111092369727188386.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9110765562046618994.kers]
Normalized transition count is 80 out of 81 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 80 rows 70 cols 210 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-23 03:03:11] [INFO ] Computed 27 invariants in 0 ms
Computed 27 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9110765562046618994.kers
Total runtime 1 ms.
[2026-05-23 03:03:11] [INFO ] Implicit Places using invariants in 140 ms returned []
[2026-05-23 03:03:11] [INFO ] Flow matrix only has 81 transitions (discarded 93 similar events)
[2026-05-23 03:03:11] [INFO ] Invariant cache hit.
[2026-05-23 03:03:11] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2026-05-23 03:03:11] [INFO ] Redundant transitions in 11 ms returned []
Running 103 sub problems to find dead transitions.
[2026-05-23 03:03:11] [INFO ] Flow matrix only has 81 transitions (discarded 93 similar events)
[2026-05-23 03:03:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (OVERLAPS) 4/77 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 80/157 variables, 77/104 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 0/157 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/158 variables, and 104 constraints, problems are : Problem set: 0 solved, 103 unsolved in 5078 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (OVERLAPS) 4/77 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 80/157 variables, 77/104 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 103/207 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/157 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/158 variables, and 207 constraints, problems are : Problem set: 0 solved, 103 unsolved in 5254 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10362ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 10364ms
Starting structural reductions in SI_LTL mode, iteration 1 : 77/395 places, 174/625 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10927 ms. Remains : 77/395 places, 174/625 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0 U p1)&&X(p0)&&F(p0)))))'
Stuttering acceptance computed with spot in 438 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Champagne-PT-H07T1U-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA Champagne-PT-H07T1U-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T1U-LTLFireability-00 finished in 11514 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 2 out of 395 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 395/395 places, 625/625 transitions.
Graph (trivial) has 407 edges and 395 vertex of which 198 / 395 are part of one of the 26 SCC in 3 ms
Free SCC test removed 172 places
Ensure Unique test removed 190 transitions
Reduce isomorphic transitions removed 190 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 222 transition count 395
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 89 rules applied. Total rules applied 129 place count 183 transition count 345
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 154 place count 158 transition count 345
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 154 place count 158 transition count 344
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 156 place count 157 transition count 344
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 179 place count 134 transition count 269
Iterating global reduction 3 with 23 rules applied. Total rules applied 202 place count 134 transition count 269
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 216 place count 134 transition count 255
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 217 place count 133 transition count 251
Iterating global reduction 4 with 1 rules applied. Total rules applied 218 place count 133 transition count 251
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 219 place count 133 transition count 250
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 5 with 100 rules applied. Total rules applied 319 place count 83 transition count 200
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 322 place count 80 transition count 184
Iterating global reduction 5 with 3 rules applied. Total rules applied 325 place count 80 transition count 184
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 328 place count 80 transition count 181
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 330 place count 79 transition count 184
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 334 place count 79 transition count 180
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 335 place count 78 transition count 176
Iterating global reduction 6 with 1 rules applied. Total rules applied 336 place count 78 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 337 place count 78 transition count 175
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 339 place count 76 transition count 173
Applied a total of 339 rules in 128 ms. Remains 76 /395 variables (removed 319) and now considering 173/625 (removed 452) transitions.
[2026-05-23 03:03:22] [INFO ] Flow matrix only has 76 transitions (discarded 97 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2537630631839227505.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14649413597043150510.kers'
[2026-05-23 03:03:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2537630631839227505.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14649413597043150510.kers]
Normalized transition count is 75 out of 76 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 75 rows 69 cols 194 entries
Finished phase 1 with 49 SingleSign rule and 0 generalized
[2026-05-23 03:03:22] [INFO ] Computed 27 invariants in 1 ms
Computed 27 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14649413597043150510.kers
Total runtime 2 ms.
[2026-05-23 03:03:23] [INFO ] Implicit Places using invariants in 169 ms returned []
[2026-05-23 03:03:23] [INFO ] Flow matrix only has 76 transitions (discarded 97 similar events)
[2026-05-23 03:03:23] [INFO ] Invariant cache hit.
[2026-05-23 03:03:23] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2026-05-23 03:03:23] [INFO ] Redundant transitions in 11 ms returned []
Running 100 sub problems to find dead transitions.
[2026-05-23 03:03:23] [INFO ] Flow matrix only has 76 transitions (discarded 97 similar events)
[2026-05-23 03:03:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 3/76 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 75/151 variables, 76/103 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 0/151 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/152 variables, and 103 constraints, problems are : Problem set: 0 solved, 100 unsolved in 4793 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 3/76 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 75/151 variables, 76/103 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 100/203 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/151 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/152 variables, and 203 constraints, problems are : Problem set: 0 solved, 100 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9837ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 9845ms
Starting structural reductions in SI_LTL mode, iteration 1 : 76/395 places, 173/625 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10377 ms. Remains : 76/395 places, 173/625 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 110 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H07T1U-LTLFireability-01
Stuttering criterion allowed to conclude after 115 steps with 2 reset in 5 ms.
FORMULA Champagne-PT-H07T1U-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T1U-LTLFireability-01 finished in 10534 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0)||(F(G(p1))&&(F(p2) U p3))))))'
Support contains 5 out of 395 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 625/625 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 382 transition count 612
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 382 transition count 612
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 374 transition count 604
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 374 transition count 604
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 373 transition count 603
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 373 transition count 603
Applied a total of 44 rules in 79 ms. Remains 373 /395 variables (removed 22) and now considering 603/625 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3805869176190760774.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13417490710693436603.kers'
[2026-05-23 03:03:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3805869176190760774.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13417490710693436603.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 603 rows 373 cols 1656 entries
Finished phase 1 with 346 SingleSign rule and 0 generalized
[2026-05-23 03:03:33] [INFO ] Computed 27 invariants in 4 ms
Computed 27 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-13417490710693436603.kers
Total runtime 5 ms.
[2026-05-23 03:03:33] [INFO ] Implicit Places using invariants in 264 ms returned []
[2026-05-23 03:03:33] [INFO ] Invariant cache hit.
[2026-05-23 03:03:34] [INFO ] Implicit Places using invariants and state equation in 580 ms returned []
Implicit Place search using SMT with State Equation took 847 ms to find 0 implicit places.
Running 602 sub problems to find dead transitions.
[2026-05-23 03:03:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (OVERLAPS) 1/373 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 373/976 variables, and 27 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/373 constraints, PredecessorRefiner: 602/602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (OVERLAPS) 1/373 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 3 (OVERLAPS) 603/976 variables, 373/400 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/976 variables, 602/1002 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 976/976 variables, and 1002 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 373/373 constraints, PredecessorRefiner: 602/602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60174ms problems are : Problem set: 0 solved, 602 unsolved
Search for dead transitions found 0 dead transitions in 60177ms
Starting structural reductions in LTL mode, iteration 1 : 373/395 places, 603/625 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61110 ms. Remains : 373/395 places, 603/625 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0)||(F(G(p1))&&(F(p2) U p3))))))'
Stuttering acceptance computed with spot in 531 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1) (NOT p3)), false, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : Champagne-PT-H07T1U-LTLFireability-02
Product exploration explored 100000 steps with 40078 reset in 434 ms.
Product exploration explored 100000 steps with 39928 reset in 445 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge based reduction with 38 factoid took 2115 ms. Reduced automaton from 10 states, 45 edges and 4 AP (stutter sensitive) to 10 states, 42 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (88 resets) in 1115 ms. (35 steps per ms) remains 3/24 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 295 ms. (135 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 3/3 properties
[2026-05-23 03:04:38] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 79/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 289/373 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 603/976 variables, 373/400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/976 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/976 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 976/976 variables, and 400 constraints, problems are : Problem set: 0 solved, 3 unsolved in 567 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 373/373 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf5 is UNSAT
Problem apf16 is UNSAT
Problem apf23 is UNSAT
After SMT solving in domain Int declared 84/976 variables, and 5 constraints, problems are : Problem set: 3 solved, 0 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 5/27 constraints, State Equation: 0/373 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 654ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge based reduction with 41 factoid took 2656 ms. Reduced automaton from 10 states, 42 edges and 4 AP (stutter sensitive) to 8 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 364 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0) (NOT p1)), false, (AND (NOT p3) (NOT p0) (NOT p1))]
Knowledge-based reduction took 6361 ms.
Stuttering acceptance computed with spot in 448 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0) (NOT p1)), false, (AND (NOT p3) (NOT p0) (NOT p1))]
Support contains 5 out of 373 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 373/373 places, 603/603 transitions.
Applied a total of 0 rules in 10 ms. Remains 373 /373 variables (removed 0) and now considering 603/603 (removed 0) transitions.
[2026-05-23 03:04:42] [INFO ] Invariant cache hit.
[2026-05-23 03:04:43] [INFO ] Implicit Places using invariants in 271 ms returned []
[2026-05-23 03:04:43] [INFO ] Invariant cache hit.
[2026-05-23 03:04:43] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 898 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 909 ms. Remains : 373/373 places, 603/603 transitions.
Computed a total of 26 stabilizing places and 26 stable transitions
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge based reduction with 31 factoid took 1234 ms. Reduced automaton from 8 states, 28 edges and 4 AP (stutter sensitive) to 8 states, 28 edges and 4 AP (stutter sensitive).
RANDOM walk for 38085 steps (86 resets) in 268 ms. (141 steps per ms) remains 0/18 properties
Knowledge based reduction with 31 factoid took 1777 ms. Reduced automaton from 8 states, 28 edges and 4 AP (stutter sensitive) to 8 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 412 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0) (NOT p1)), false, (AND (NOT p3) (NOT p0) (NOT p1))]
Knowledge-based reduction took 3534 ms.
Stuttering acceptance computed with spot in 453 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0) (NOT p1)), false, (AND (NOT p3) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 443 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0) (NOT p1)), false, (AND (NOT p3) (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 39986 reset in 290 ms.
Product exploration explored 100000 steps with 40042 reset in 302 ms.
Spot run failed in 149 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/ltsmin16961235628684276131
[2026-05-23 03:04:49] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16961235628684276131
Running compilation step : cd /tmp/ltsmin16961235628684276131;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2050 ms.
Running link step : cd /tmp/ltsmin16961235628684276131;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin16961235628684276131;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased11137035647174371850.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 373 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 373/373 places, 603/603 transitions.
Applied a total of 0 rules in 5 ms. Remains 373 /373 variables (removed 0) and now considering 603/603 (removed 0) transitions.
[2026-05-23 03:05:04] [INFO ] Invariant cache hit.
[2026-05-23 03:05:04] [INFO ] Implicit Places using invariants in 171 ms returned []
[2026-05-23 03:05:04] [INFO ] Invariant cache hit.
[2026-05-23 03:05:04] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 755 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 761 ms. Remains : 373/373 places, 603/603 transitions.
Built C files in :
/tmp/ltsmin11297689722073148905
[2026-05-23 03:05:04] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11297689722073148905
Running compilation step : cd /tmp/ltsmin11297689722073148905;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1865 ms.
Running link step : cd /tmp/ltsmin11297689722073148905;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin11297689722073148905;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased5750076884152768216.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-23 03:05:19] [INFO ] Flatten gal took : 38 ms
[2026-05-23 03:05:19] [INFO ] Flatten gal took : 36 ms
[2026-05-23 03:05:19] [INFO ] Time to serialize gal into /tmp/LTL12248554684263432562.gal : 9 ms
[2026-05-23 03:05:19] [INFO ] Time to serialize properties into /tmp/LTL4351605665549734056.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/LTL12248554684263432562.gal' '-t' 'CGAL' '-hoa' '/tmp/aut894793860761972247.hoa' '-atoms' '/tmp/LTL4351605665549734056.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...317
Loading property file /tmp/LTL4351605665549734056.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut894793860761972247.hoa
Detected timeout of ITS tools.
[2026-05-23 03:05:35] [INFO ] Flatten gal took : 49 ms
[2026-05-23 03:05:35] [INFO ] Flatten gal took : 51 ms
[2026-05-23 03:05:35] [INFO ] Time to serialize gal into /tmp/LTL769614867761822417.gal : 9 ms
[2026-05-23 03:05:35] [INFO ] Time to serialize properties into /tmp/LTL11671600933666151922.ltl : 11 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/LTL769614867761822417.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11671600933666151922.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G((X("((p595==0)||(p611==0))"))||((F(G("(p60==0)")))&&((F("(p60==1)"))U("((p388==1)&&(p481==1))")))))))
Formula 0 simplified : GF((X!"((p595==0)||(p611==0))" & (G!"(p60==1)" R !"((p388==1)&&(p481==1))")) | (!"((p595==0)||(p611==0))" & GF!"(p60==0)"))
Detected timeout of ITS tools.
[2026-05-23 03:05:50] [INFO ] Flatten gal took : 27 ms
[2026-05-23 03:05:50] [INFO ] Applying decomposition
[2026-05-23 03:05:50] [INFO ] Flatten gal took : 27 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/graph10644316387865108075.txt' '-o' '/tmp/graph10644316387865108075.bin' '-w' '/tmp/graph10644316387865108075.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10644316387865108075.bin' '-l' '-1' '-v' '-w' '/tmp/graph10644316387865108075.weights' '-q' '0' '-e' '0.001'
[2026-05-23 03:05:50] [INFO ] Decomposing Gal with order
[2026-05-23 03:05:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 03:05:50] [INFO ] Removed a total of 481 redundant transitions.
[2026-05-23 03:05:50] [INFO ] Flatten gal took : 146 ms
[2026-05-23 03:05:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 20 ms.
[2026-05-23 03:05:50] [INFO ] Time to serialize gal into /tmp/LTL17993980723081451048.gal : 15 ms
[2026-05-23 03:05:50] [INFO ] Time to serialize properties into /tmp/LTL10579944025256455887.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/LTL17993980723081451048.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10579944025256455887.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 : !((F(G((X("((i24.u102.p595==0)||(i25.u109.p611==0))"))||((F(G("(i3.u15.p60==0)")))&&((F("(i3.u15.p60==1)"))U("((i15.i0.u70.p388==1)&&(...180
Formula 0 simplified : GF((X!"((i24.u102.p595==0)||(i25.u109.p611==0))" & (G!"(i3.u15.p60==1)" R !"((i15.i0.u70.p388==1)&&(i19.u87.p481==1))")) | (!"((i24....215
Reverse transition relation is NOT exact ! Due to transitions t6, t35, t68, t115, t179, t244, i1.i1.t418, i2.i1.t404, i3.t387, i4.i1.t372, i5.t357, i6.i1.t...458
Computing Next relation with stutter on 3.48678e+09 deadlock states
12 unique states visited
11 strongly connected components in search stack
16 transitions explored
12 items max in DFS search stack
819 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.28494,184268,1,0,434767,523,5190,452743,283,1403,853444
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Champagne-PT-H07T1U-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Champagne-PT-H07T1U-LTLFireability-02 finished in 146513 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0)) U (p1&&X(G(p0))))))'
Support contains 2 out of 395 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 625/625 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 383 transition count 613
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 383 transition count 613
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 375 transition count 605
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 375 transition count 605
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 373 transition count 603
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 373 transition count 603
Applied a total of 44 rules in 19 ms. Remains 373 /395 variables (removed 22) and now considering 603/625 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15151149905365270044.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12870766095657476751.kers'
[2026-05-23 03:05:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15151149905365270044.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12870766095657476751.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 603 rows 373 cols 1656 entries
Finished phase 1 with 346 SingleSign rule and 0 generalized
[2026-05-23 03:05:59] [INFO ] Computed 27 invariants in 3 ms
Computed 27 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12870766095657476751.kers
Total runtime 4 ms.
[2026-05-23 03:06:00] [INFO ] Implicit Places using invariants in 201 ms returned []
[2026-05-23 03:06:00] [INFO ] Invariant cache hit.
[2026-05-23 03:06:00] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 373/395 places, 603/625 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 774 ms. Remains : 373/395 places, 603/625 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0)) U (p1&&X(G(p0))))))'
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : Champagne-PT-H07T1U-LTLFireability-04
Entered a terminal (fully accepting) state of product in 119 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H07T1U-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T1U-LTLFireability-04 finished in 999 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1) U G((X(!p2)||(p3&&F(!p0))))))'
Support contains 5 out of 395 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 625/625 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 383 transition count 613
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 383 transition count 613
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 376 transition count 606
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 376 transition count 606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 375 transition count 605
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 375 transition count 605
Applied a total of 40 rules in 28 ms. Remains 375 /395 variables (removed 20) and now considering 605/625 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5231748194890634816.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17434195063638757260.kers'
[2026-05-23 03:06:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5231748194890634816.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17434195063638757260.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 605 rows 375 cols 1660 entries
Finished phase 1 with 348 SingleSign rule and 0 generalized
[2026-05-23 03:06:00] [INFO ] Computed 27 invariants in 2 ms
Computed 27 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17434195063638757260.kers
Total runtime 4 ms.
[2026-05-23 03:06:01] [INFO ] Implicit Places using invariants in 240 ms returned []
[2026-05-23 03:06:01] [INFO ] Invariant cache hit.
[2026-05-23 03:06:01] [INFO ] Implicit Places using invariants and state equation in 597 ms returned []
Implicit Place search using SMT with State Equation took 840 ms to find 0 implicit places.
Running 604 sub problems to find dead transitions.
[2026-05-23 03:06:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (OVERLAPS) 1/375 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 375/980 variables, and 27 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/375 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (OVERLAPS) 1/375 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 3 (OVERLAPS) 605/980 variables, 375/402 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/980 variables, 604/1006 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 980/980 variables, and 1006 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60193ms problems are : Problem set: 0 solved, 604 unsolved
Search for dead transitions found 0 dead transitions in 60198ms
Starting structural reductions in LTL mode, iteration 1 : 375/395 places, 605/625 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61070 ms. Remains : 375/395 places, 605/625 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1) U G((X(!p2)||(p3&&F(!p0))))))'
Stuttering acceptance computed with spot in 634 ms :[(OR (AND p2 (NOT p3)) (AND p0 p2)), (AND (NOT p0) p2), (AND (NOT p1) p2), (OR (AND p2 (NOT p3)) (AND p0 p2)), (AND (NOT p3) (NOT p0) p1 p2), (AND p0 (NOT p1) p2), (AND p0 p2), (NOT p0), (NOT p1), (AND p0 (NOT p1)), false]
Running random walk in product with property : Champagne-PT-H07T1U-LTLFireability-05
Product exploration explored 100000 steps with 1747 reset in 548 ms.
Product exploration explored 100000 steps with 1743 reset in 506 ms.
Computed a total of 28 stabilizing places and 28 stable transitions
Computed a total of 28 stabilizing places and 28 stable transitions
Detected a total of 28/375 stabilizing places and 28/605 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge based reduction with 42 factoid took 664 ms. Reduced automaton from 11 states, 30 edges and 4 AP (stutter sensitive) to 11 states, 30 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (88 resets) in 498 ms. (80 steps per ms) remains 10/24 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 3/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 76 ms. (519 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 77 ms. (512 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 2/2 properties
[2026-05-23 03:07:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 77/82 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 293/375 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 605/980 variables, 375/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/980 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/980 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 980/980 variables, and 402 constraints, problems are : Problem set: 0 solved, 2 unsolved in 768 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 77/82 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 293/375 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 605/980 variables, 375/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/980 variables, 2/404 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/980 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/980 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 980/980 variables, and 404 constraints, problems are : Problem set: 0 solved, 2 unsolved in 531 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1307ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 136 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=68 )
Parikh walk visited 2 properties in 2 ms.
Knowledge based reduction with 42 factoid took 1579 ms. Reduced automaton from 11 states, 30 edges and 4 AP (stutter sensitive) to 11 states, 30 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 581 ms :[(OR (AND p2 (NOT p3)) (AND p0 p2)), (AND (NOT p0) p2), (AND (NOT p1) p2), (OR (AND p2 (NOT p3)) (AND p0 p2)), (AND (NOT p0) p1 (NOT p3) p2), (AND p0 (NOT p1) p2), (AND p0 p2), (NOT p0), (NOT p1), (AND p0 (NOT p1)), false]
Knowledge-based reduction took 4417 ms.
Stuttering acceptance computed with spot in 594 ms :[(OR (AND p2 (NOT p3)) (AND p0 p2)), (AND (NOT p0) p2), (AND (NOT p1) p2), (OR (AND p2 (NOT p3)) (AND p0 p2)), (AND (NOT p0) p1 (NOT p3) p2), (AND p0 (NOT p1) p2), (AND p0 p2), (NOT p0), (NOT p1), (AND p0 (NOT p1)), false]
Support contains 5 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 605/605 transitions.
Applied a total of 0 rules in 8 ms. Remains 375 /375 variables (removed 0) and now considering 605/605 (removed 0) transitions.
[2026-05-23 03:07:08] [INFO ] Invariant cache hit.
[2026-05-23 03:07:08] [INFO ] Implicit Places using invariants in 261 ms returned []
[2026-05-23 03:07:09] [INFO ] Invariant cache hit.
[2026-05-23 03:07:09] [INFO ] Implicit Places using invariants and state equation in 614 ms returned []
Implicit Place search using SMT with State Equation took 878 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 888 ms. Remains : 375/375 places, 605/605 transitions.
Computed a total of 28 stabilizing places and 28 stable transitions
Computed a total of 28 stabilizing places and 28 stable transitions
Detected a total of 28/375 stabilizing places and 28/605 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge based reduction with 42 factoid took 759 ms. Reduced automaton from 11 states, 30 edges and 4 AP (stutter sensitive) to 11 states, 30 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (88 resets) in 503 ms. (79 steps per ms) remains 10/24 properties
BEST_FIRST walk for 40003 steps (8 resets) in 148 ms. (268 steps per ms) remains 7/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 7/7 properties
[2026-05-23 03:07:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 77/82 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 293/375 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 605/980 variables, 375/402 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/980 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/980 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 980/980 variables, and 402 constraints, problems are : Problem set: 0 solved, 7 unsolved in 807 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 77/82 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 293/375 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 605/980 variables, 375/402 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/980 variables, 7/409 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/980 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/980 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 980/980 variables, and 409 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1465 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2283ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 3 different solutions.
Finished Parikh walk after 125 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=41 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 7 properties in 288 ms.
Knowledge based reduction with 42 factoid took 1641 ms. Reduced automaton from 11 states, 30 edges and 4 AP (stutter sensitive) to 11 states, 30 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 625 ms :[(OR (AND p2 (NOT p3)) (AND p0 p2)), (AND (NOT p0) p2), (AND (NOT p1) p2), (OR (AND p2 (NOT p3)) (AND p0 p2)), (AND (NOT p0) p1 (NOT p3) p2), (AND p0 (NOT p1) p2), (AND p0 p2), (NOT p0), (NOT p1), (AND p0 (NOT p1)), false]
Knowledge-based reduction took 6112 ms.
Stuttering acceptance computed with spot in 589 ms :[(OR (AND p2 (NOT p3)) (AND p0 p2)), (AND (NOT p0) p2), (AND (NOT p1) p2), (OR (AND p2 (NOT p3)) (AND p0 p2)), (AND (NOT p0) p1 (NOT p3) p2), (AND p0 (NOT p1) p2), (AND p0 p2), (NOT p0), (NOT p1), (AND p0 (NOT p1)), false]
Stuttering acceptance computed with spot in 592 ms :[(OR (AND p2 (NOT p3)) (AND p0 p2)), (AND (NOT p0) p2), (AND (NOT p1) p2), (OR (AND p2 (NOT p3)) (AND p0 p2)), (AND (NOT p0) p1 (NOT p3) p2), (AND p0 (NOT p1) p2), (AND p0 p2), (NOT p0), (NOT p1), (AND p0 (NOT p1)), false]
Product exploration explored 100000 steps with 1769 reset in 430 ms.
Product exploration explored 100000 steps with 1650 reset in 440 ms.
Spot run failed in 57 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/ltsmin9129650931536821178
[2026-05-23 03:07:17] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9129650931536821178
Running compilation step : cd /tmp/ltsmin9129650931536821178;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1486 ms.
Running link step : cd /tmp/ltsmin9129650931536821178;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin9129650931536821178;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased15550486661678250698.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 605/605 transitions.
Applied a total of 0 rules in 5 ms. Remains 375 /375 variables (removed 0) and now considering 605/605 (removed 0) transitions.
[2026-05-23 03:07:32] [INFO ] Invariant cache hit.
[2026-05-23 03:07:33] [INFO ] Implicit Places using invariants in 178 ms returned []
[2026-05-23 03:07:33] [INFO ] Invariant cache hit.
[2026-05-23 03:07:33] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 640 ms. Remains : 375/375 places, 605/605 transitions.
Built C files in :
/tmp/ltsmin18153234531300723851
[2026-05-23 03:07:33] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18153234531300723851
Running compilation step : cd /tmp/ltsmin18153234531300723851;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1513 ms.
Running link step : cd /tmp/ltsmin18153234531300723851;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin18153234531300723851;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased14295804055410579672.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-23 03:07:48] [INFO ] Flatten gal took : 30 ms
[2026-05-23 03:07:48] [INFO ] Flatten gal took : 25 ms
[2026-05-23 03:07:48] [INFO ] Time to serialize gal into /tmp/LTL14203100632265823401.gal : 9 ms
[2026-05-23 03:07:48] [INFO ] Time to serialize properties into /tmp/LTL3844756825514823160.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/LTL14203100632265823401.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15992570949690052463.hoa' '-atoms' '/tmp/LTL3844756825514823160.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/LTL3844756825514823160.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15992570949690052463.hoa
Detected timeout of ITS tools.
[2026-05-23 03:08:03] [INFO ] Flatten gal took : 19 ms
[2026-05-23 03:08:03] [INFO ] Flatten gal took : 18 ms
[2026-05-23 03:08:03] [INFO ] Time to serialize gal into /tmp/LTL3897005419293716012.gal : 9 ms
[2026-05-23 03:08:03] [INFO ] Time to serialize properties into /tmp/LTL16342279392892327619.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/LTL3897005419293716012.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16342279392892327619.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((((F("(p415==1)"))U("(p688!=1)"))U(G((X(!("((p154==1)&&(p273==1))")))||(("(p616!=1)")&&(F("(p415!=1)")))))))
Formula 0 simplified : (G!"(p415==1)" R !"(p688!=1)") R F(X"((p154==1)&&(p273==1))" & (!"(p616!=1)" | G!"(p415!=1)"))
Detected timeout of ITS tools.
[2026-05-23 03:08:18] [INFO ] Flatten gal took : 14 ms
[2026-05-23 03:08:18] [INFO ] Applying decomposition
[2026-05-23 03:08:18] [INFO ] Flatten gal took : 14 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/graph10316859629146953597.txt' '-o' '/tmp/graph10316859629146953597.bin' '-w' '/tmp/graph10316859629146953597.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10316859629146953597.bin' '-l' '-1' '-v' '-w' '/tmp/graph10316859629146953597.weights' '-q' '0' '-e' '0.001'
[2026-05-23 03:08:18] [INFO ] Decomposing Gal with order
[2026-05-23 03:08:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 03:08:18] [INFO ] Removed a total of 475 redundant transitions.
[2026-05-23 03:08:19] [INFO ] Flatten gal took : 51 ms
[2026-05-23 03:08:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 9 ms.
[2026-05-23 03:08:19] [INFO ] Time to serialize gal into /tmp/LTL7131719426255851905.gal : 6 ms
[2026-05-23 03:08:19] [INFO ] Time to serialize properties into /tmp/LTL16732186384222003930.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/LTL7131719426255851905.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16732186384222003930.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((((F("(i16.i0.u79.p415==1)"))U("(i27.u130.p688!=1)"))U(G((X(!("((i5.i1.u31.p154==1)&&(i10.i1.u55.p273==1))")))||(("(i25.u115.p616!=1...192
Formula 0 simplified : (G!"(i16.i0.u79.p415==1)" R !"(i27.u130.p688!=1)") R F(X"((i5.i1.u31.p154==1)&&(i10.i1.u55.p273==1))" & (!"(i25.u115.p616!=1)" | G!"...178
Detected timeout of ITS tools.
Treatment of property Champagne-PT-H07T1U-LTLFireability-05 finished in 153247 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) U ((X(!p0)&&G((p1||X(X(p1)))))||X(G(!p0))))))'
Support contains 2 out of 395 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 625/625 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 382 transition count 612
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 382 transition count 612
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 373 transition count 603
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 373 transition count 603
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 371 transition count 601
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 371 transition count 601
Applied a total of 48 rules in 26 ms. Remains 371 /395 variables (removed 24) and now considering 601/625 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16969070775229113537.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8486443373797404480.kers'
[2026-05-23 03:08:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16969070775229113537.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8486443373797404480.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 601 rows 371 cols 1652 entries
Finished phase 1 with 344 SingleSign rule and 0 generalized
[2026-05-23 03:08:34] [INFO ] Computed 27 invariants in 3 ms
Computed 27 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8486443373797404480.kers
Total runtime 4 ms.
[2026-05-23 03:08:34] [INFO ] Implicit Places using invariants in 212 ms returned []
[2026-05-23 03:08:34] [INFO ] Invariant cache hit.
[2026-05-23 03:08:34] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2026-05-23 03:08:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/371 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 371/972 variables, and 27 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/371 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/371 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 601/972 variables, 371/398 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/972 variables, 600/998 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 972/972 variables, and 998 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 371/371 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60130ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60133ms
Starting structural reductions in LTL mode, iteration 1 : 371/395 places, 601/625 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60868 ms. Remains : 371/395 places, 601/625 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) U (X(G(!p0))||(X(!p0)&&G((p1||X(X(p1)))))))))'
Stuttering acceptance computed with spot in 641 ms :[true, (NOT p1), p0, (AND (NOT p1) p0), p0, p0, (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (NOT p1), p0, (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : Champagne-PT-H07T1U-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H07T1U-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T1U-LTLFireability-07 finished in 61581 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)||G(p1)||X(G(p2))))'
Support contains 3 out of 395 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 625/625 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 381 transition count 611
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 381 transition count 611
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 372 transition count 602
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 372 transition count 602
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 370 transition count 600
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 370 transition count 600
Applied a total of 50 rules in 29 ms. Remains 370 /395 variables (removed 25) and now considering 600/625 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16761220230491514977.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5671736519702579899.kers'
[2026-05-23 03:09:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16761220230491514977.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5671736519702579899.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 600 rows 370 cols 1650 entries
Finished phase 1 with 343 SingleSign rule and 0 generalized
[2026-05-23 03:09:35] [INFO ] Computed 27 invariants in 4 ms
Computed 27 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-5671736519702579899.kers
Total runtime 6 ms.
[2026-05-23 03:09:36] [INFO ] Implicit Places using invariants in 277 ms returned []
[2026-05-23 03:09:36] [INFO ] Invariant cache hit.
[2026-05-23 03:09:36] [INFO ] Implicit Places using invariants and state equation in 612 ms returned []
Implicit Place search using SMT with State Equation took 892 ms to find 0 implicit places.
Running 599 sub problems to find dead transitions.
[2026-05-23 03:09:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/370 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/970 variables, and 27 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/370 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 599 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/370 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (OVERLAPS) 600/970 variables, 370/397 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/970 variables, 599/996 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 970/970 variables, and 996 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 370/370 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60143ms problems are : Problem set: 0 solved, 599 unsolved
Search for dead transitions found 0 dead transitions in 60146ms
Starting structural reductions in LTL mode, iteration 1 : 370/395 places, 600/625 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61072 ms. Remains : 370/395 places, 600/625 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)||G(p1)||X(G(p2))))'
Stuttering acceptance computed with spot in 430 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Champagne-PT-H07T1U-LTLFireability-08
Entered a terminal (fully accepting) state of product in 787 steps with 1 reset in 5 ms.
FORMULA Champagne-PT-H07T1U-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T1U-LTLFireability-08 finished in 61560 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((X(X(!p0))||(!p0 U (G(!p0)||(!p0&&G(p1))))) U (p2 U p3)))))'
Support contains 6 out of 395 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 625/625 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 382 transition count 612
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 382 transition count 612
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 373 transition count 603
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 373 transition count 603
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 371 transition count 601
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 371 transition count 601
Applied a total of 48 rules in 30 ms. Remains 371 /395 variables (removed 24) and now considering 601/625 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2095502320677170415.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2049770298687302730.kers'
[2026-05-23 03:10:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2095502320677170415.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2049770298687302730.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 601 rows 371 cols 1652 entries
Finished phase 1 with 344 SingleSign rule and 0 generalized
[2026-05-23 03:10:37] [INFO ] Computed 27 invariants in 4 ms
Computed 27 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-2049770298687302730.kers
Total runtime 7 ms.
[2026-05-23 03:10:37] [INFO ] Implicit Places using invariants in 271 ms returned []
[2026-05-23 03:10:37] [INFO ] Invariant cache hit.
[2026-05-23 03:10:38] [INFO ] Implicit Places using invariants and state equation in 607 ms returned []
Implicit Place search using SMT with State Equation took 883 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2026-05-23 03:10:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/371 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 371/972 variables, and 35 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/371 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/371 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/371 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (OVERLAPS) 601/972 variables, 371/406 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/972 variables, 600/1006 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 972/972 variables, and 1010 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 371/371 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60153ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60156ms
Starting structural reductions in LTL mode, iteration 1 : 371/395 places, 601/625 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61072 ms. Remains : 371/395 places, 601/625 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((X(X(!p0))||(!p0 U (G(!p0)||(!p0&&G(p1))))) U (p2 U p3)))))'
Stuttering acceptance computed with spot in 938 ms :[(NOT p3), (NOT p3), p0, (NOT p3), p0, (AND p0 (NOT p1)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p1) (NOT p3)), p0, true, (AND (NOT p1) p0), (AND p0 (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (NOT p1), (NOT p3), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : Champagne-PT-H07T1U-LTLFireability-09
Product exploration explored 100000 steps with 18186 reset in 327 ms.
Stack based approach found an accepted trace after 43442 steps with 7926 reset with depth 7 and stack size 7 in 146 ms.
FORMULA Champagne-PT-H07T1U-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Champagne-PT-H07T1U-LTLFireability-09 finished in 62611 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 395 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 395/395 places, 625/625 transitions.
Graph (trivial) has 401 edges and 395 vertex of which 191 / 395 are part of one of the 25 SCC in 2 ms
Free SCC test removed 166 places
Ensure Unique test removed 184 transitions
Reduce isomorphic transitions removed 184 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 228 transition count 401
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 87 rules applied. Total rules applied 127 place count 189 transition count 353
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 151 place count 165 transition count 353
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 151 place count 165 transition count 351
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 155 place count 163 transition count 351
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 178 place count 140 transition count 284
Iterating global reduction 3 with 23 rules applied. Total rules applied 201 place count 140 transition count 284
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 214 place count 140 transition count 271
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 215 place count 139 transition count 267
Iterating global reduction 4 with 1 rules applied. Total rules applied 216 place count 139 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 217 place count 139 transition count 266
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 319 place count 88 transition count 215
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 322 place count 85 transition count 199
Iterating global reduction 5 with 3 rules applied. Total rules applied 325 place count 85 transition count 199
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 328 place count 85 transition count 196
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 332 place count 83 transition count 205
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 342 place count 83 transition count 195
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 343 place count 82 transition count 191
Iterating global reduction 6 with 1 rules applied. Total rules applied 344 place count 82 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 345 place count 82 transition count 190
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 347 place count 80 transition count 188
Applied a total of 347 rules in 91 ms. Remains 80 /395 variables (removed 315) and now considering 188/625 (removed 437) transitions.
[2026-05-23 03:11:39] [INFO ] Flow matrix only has 95 transitions (discarded 93 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10243685275834552597.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15974346141228310698.kers'
[2026-05-23 03:11:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10243685275834552597.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15974346141228310698.kers]
Normalized transition count is 94 out of 95 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 94 rows 74 cols 256 entries
Finished phase 1 with 53 SingleSign rule and 0 generalized
[2026-05-23 03:11:39] [INFO ] Computed 27 invariants in 0 ms
Computed 27 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15974346141228310698.kers
Total runtime 1 ms.
[2026-05-23 03:11:40] [INFO ] Implicit Places using invariants in 127 ms returned []
[2026-05-23 03:11:40] [INFO ] Flow matrix only has 95 transitions (discarded 93 similar events)
[2026-05-23 03:11:40] [INFO ] Invariant cache hit.
[2026-05-23 03:11:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 03:11:40] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2026-05-23 03:11:40] [INFO ] Redundant transitions in 4 ms returned []
Running 117 sub problems to find dead transitions.
[2026-05-23 03:11:40] [INFO ] Flow matrix only has 95 transitions (discarded 93 similar events)
[2026-05-23 03:11:40] [INFO ] Invariant cache hit.
[2026-05-23 03:11:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 4/80 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 94/174 variables, 80/107 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/174 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/175 variables, and 108 constraints, problems are : Problem set: 0 solved, 117 unsolved in 6155 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 80/80 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 4/80 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 94/174 variables, 80/107 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 117/225 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/174 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/175 variables, and 225 constraints, problems are : Problem set: 0 solved, 117 unsolved in 6136 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 80/80 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12308ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 12309ms
Starting structural reductions in SI_LTL mode, iteration 1 : 80/395 places, 188/625 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12748 ms. Remains : 80/395 places, 188/625 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H07T1U-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H07T1U-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T1U-LTLFireability-11 finished in 12833 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((X((p1||F(G(p2))))||p0))))'
Support contains 6 out of 395 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 625/625 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 382 transition count 612
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 382 transition count 612
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 374 transition count 604
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 374 transition count 604
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 373 transition count 603
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 373 transition count 603
Applied a total of 44 rules in 28 ms. Remains 373 /395 variables (removed 22) and now considering 603/625 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16149907808820751893.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12504185040602037612.kers'
[2026-05-23 03:11:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16149907808820751893.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12504185040602037612.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 603 rows 373 cols 1656 entries
Finished phase 1 with 346 SingleSign rule and 0 generalized
[2026-05-23 03:11:52] [INFO ] Computed 27 invariants in 4 ms
Computed 27 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12504185040602037612.kers
Total runtime 5 ms.
[2026-05-23 03:11:52] [INFO ] Implicit Places using invariants in 246 ms returned []
[2026-05-23 03:11:52] [INFO ] Invariant cache hit.
[2026-05-23 03:11:53] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 745 ms to find 0 implicit places.
Running 602 sub problems to find dead transitions.
[2026-05-23 03:11:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (OVERLAPS) 1/373 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 373/976 variables, and 27 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/373 constraints, PredecessorRefiner: 602/602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (OVERLAPS) 1/373 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 3 (OVERLAPS) 603/976 variables, 373/400 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/976 variables, 602/1002 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 976/976 variables, and 1002 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 373/373 constraints, PredecessorRefiner: 602/602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60115ms problems are : Problem set: 0 solved, 602 unsolved
Search for dead transitions found 0 dead transitions in 60117ms
Starting structural reductions in LTL mode, iteration 1 : 373/395 places, 603/625 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60893 ms. Remains : 373/395 places, 603/625 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((X((p1||F(G(p2))))||p0))))'
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : Champagne-PT-H07T1U-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 219 ms.
Product exploration explored 100000 steps with 50000 reset in 262 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge based reduction with 7 factoid took 76 ms. Proved property starting from automaton with 3 states, 4 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 90 ms.
FORMULA Champagne-PT-H07T1U-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H07T1U-LTLFireability-12 finished in 61612 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&F(p1)) U (p0&&F(p1)&&X(X((p0&&X((p0 U (!p2||G(p0))))))))))'
Support contains 4 out of 395 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 625/625 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 383 transition count 613
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 383 transition count 613
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 376 transition count 606
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 376 transition count 606
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 374 transition count 604
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 374 transition count 604
Applied a total of 42 rules in 33 ms. Remains 374 /395 variables (removed 21) and now considering 604/625 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15154187341504727971.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1294199985090905552.kers'
[2026-05-23 03:12:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15154187341504727971.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1294199985090905552.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 604 rows 374 cols 1658 entries
Finished phase 1 with 347 SingleSign rule and 0 generalized
[2026-05-23 03:12:54] [INFO ] Computed 27 invariants in 4 ms
Computed 27 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1294199985090905552.kers
Total runtime 5 ms.
[2026-05-23 03:12:54] [INFO ] Implicit Places using invariants in 254 ms returned []
[2026-05-23 03:12:54] [INFO ] Invariant cache hit.
[2026-05-23 03:12:55] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
Running 603 sub problems to find dead transitions.
[2026-05-23 03:12:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/373 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (OVERLAPS) 1/374 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 603 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 374/978 variables, and 27 constraints, problems are : Problem set: 0 solved, 603 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/374 constraints, PredecessorRefiner: 603/603 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/373 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (OVERLAPS) 1/374 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/374 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 3 (OVERLAPS) 604/978 variables, 374/401 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/978 variables, 603/1004 constraints. Problems are: Problem set: 0 solved, 603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 978/978 variables, and 1004 constraints, problems are : Problem set: 0 solved, 603 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 374/374 constraints, PredecessorRefiner: 603/603 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60120ms problems are : Problem set: 0 solved, 603 unsolved
Search for dead transitions found 0 dead transitions in 60122ms
Starting structural reductions in LTL mode, iteration 1 : 374/395 places, 604/625 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60856 ms. Remains : 374/395 places, 604/625 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&F(p1)) U (p0&&F(p1)&&X(X((p0&&X((p0 U (!p2||G(p0))))))))))'
Stuttering acceptance computed with spot in 488 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) p2), (AND (NOT p1) (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : Champagne-PT-H07T1U-LTLFireability-13
Stuttering criterion allowed to conclude after 396 steps with 1 reset in 2 ms.
FORMULA Champagne-PT-H07T1U-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T1U-LTLFireability-13 finished in 61415 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) U (p1&&X(F(p2))))&&X(!p2)))'
Support contains 3 out of 395 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 625/625 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 383 transition count 613
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 383 transition count 613
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 375 transition count 605
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 375 transition count 605
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 373 transition count 603
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 373 transition count 603
Applied a total of 44 rules in 27 ms. Remains 373 /395 variables (removed 22) and now considering 603/625 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15162710294308276067.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1735920082888811497.kers'
[2026-05-23 03:13:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15162710294308276067.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1735920082888811497.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 603 rows 373 cols 1656 entries
Finished phase 1 with 346 SingleSign rule and 0 generalized
[2026-05-23 03:13:55] [INFO ] Computed 27 invariants in 4 ms
Computed 27 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-1735920082888811497.kers
Total runtime 6 ms.
[2026-05-23 03:13:56] [INFO ] Implicit Places using invariants in 270 ms returned []
[2026-05-23 03:13:56] [INFO ] Invariant cache hit.
[2026-05-23 03:13:56] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 894 ms to find 0 implicit places.
Running 602 sub problems to find dead transitions.
[2026-05-23 03:13:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (OVERLAPS) 1/373 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 373/976 variables, and 27 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/373 constraints, PredecessorRefiner: 602/602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (OVERLAPS) 1/373 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 3 (OVERLAPS) 603/976 variables, 373/400 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/976 variables, 602/1002 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 976/976 variables, and 1002 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 373/373 constraints, PredecessorRefiner: 602/602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60145ms problems are : Problem set: 0 solved, 602 unsolved
Search for dead transitions found 0 dead transitions in 60149ms
Starting structural reductions in LTL mode, iteration 1 : 373/395 places, 603/625 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61073 ms. Remains : 373/395 places, 603/625 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U (p1&&X(F(p2))))&&X(!p2)))'
Stuttering acceptance computed with spot in 239 ms :[true, p2, (OR (NOT p1) (NOT p0) (NOT p2)), (NOT p2), true]
Running random walk in product with property : Champagne-PT-H07T1U-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H07T1U-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T1U-LTLFireability-15 finished in 61366 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1) U G((X(!p2)||(p3&&F(!p0))))))'
Spot run failed in 84 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/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-23 03:14:57] [INFO ] Flatten gal took : 23 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18343485835510613414
[2026-05-23 03:14:57] [INFO ] Computing symmetric may disable matrix : 625 transitions.
[2026-05-23 03:14:57] [INFO ] Applying decomposition
[2026-05-23 03:14:57] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 03:14:57] [INFO ] Computing symmetric may enable matrix : 625 transitions.
[2026-05-23 03:14:57] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 03:14:57] [INFO ] Flatten gal took : 20 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/graph1159942094649653529.txt' '-o' '/tmp/graph1159942094649653529.bin' '-w' '/tmp/graph1159942094649653529.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1159942094649653529.bin' '-l' '-1' '-v' '-w' '/tmp/graph1159942094649653529.weights' '-q' '0' '-e' '0.001'
[2026-05-23 03:14:57] [INFO ] Decomposing Gal with order
[2026-05-23 03:14:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 03:14:57] [INFO ] Removed a total of 483 redundant transitions.
[2026-05-23 03:14:57] [INFO ] Flatten gal took : 57 ms
[2026-05-23 03:14:57] [INFO ] Computing Do-Not-Accords matrix : 625 transitions.
[2026-05-23 03:14:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 14 ms.
[2026-05-23 03:14:57] [INFO ] Time to serialize gal into /tmp/LTLFireability9215541259867012460.gal : 10 ms
[2026-05-23 03:14:57] [INFO ] Time to serialize properties into /tmp/LTLFireability7126626585464940245.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/LTLFireability9215541259867012460.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7126626585464940245.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...276
Read 1 LTL properties
[2026-05-23 03:14:57] [INFO ] Computation of Completed DNA matrix. took 106 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 03:14:57] [INFO ] Built C files in 335ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18343485835510613414
Running compilation step : cd /tmp/ltsmin18343485835510613414;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' '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'
Checking formula 0 : !((((F("(i16.i0.u80.p415==1)"))U("(i17.u141.p688!=1)"))U(G((X(!("((i5.i1.u32.p154==1)&&(i11.i0.u59.p273==1))")))||(("(i25.i1.u126.p616...195
Formula 0 simplified : (G!"(i16.i0.u80.p415==1)" R !"(i17.u141.p688!=1)") R F(X"((i5.i1.u32.p154==1)&&(i11.i0.u59.p273==1))" & (!"(i25.i1.u126.p616!=1)" | ...181
Compilation finished in 2500 ms.
Running link step : cd /tmp/ltsmin18343485835510613414;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin18343485835510613414;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '((<>((LTLAPp0==true)) U (LTLAPp1==true)) U []((X(!(LTLAPp2==true))||((LTLAPp3==true)&&<>(!(LTLAPp0==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t6, t35, t68, t115, t196, t211, t244, t322, t399, i0.t404, i1.i1.t418, i2.i1.t387, i3.i1.t372...638
Computing Next relation with stutter on 3.48678e+09 deadlock states
13 unique states visited
13 strongly connected components in search stack
14 transitions explored
13 items max in DFS search stack
1725 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,17.4204,363704,1,0,784914,652,6090,1.21248e+06,289,1882,1542433
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Champagne-PT-H07T1U-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 793221 ms.

BK_STOP 1779506116776

--------------------
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="Champagne-PT-H07T1U"
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 Champagne-PT-H07T1U, 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 r050-smll-177946901000084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Champagne-PT-H07T1U.tgz
mv Champagne-PT-H07T1U execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;