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.r146-tall-177961074100386.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 GPUForwardProgress-PT-04b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074100386
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.4K Mar 7 11:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Mar 7 11:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 7 11:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 7 11:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 10:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 11:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Mar 7 11:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 7 11:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Mar 7 11:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 27K 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 GPUForwardProgress-PT-04b-CTLFireability-2024-00
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2024-01
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2024-02
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2024-03
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2024-04
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2024-05
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2024-06
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2024-07
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2024-08
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2024-09
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2024-10
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2024-11
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2024-12
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2024-13
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2024-14
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779724437868

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 15:53:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 15:53:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 15:53:59] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2026-05-25 15:53:59] [INFO ] Transformed 112 places.
[2026-05-25 15:53:59] [INFO ] Transformed 117 transitions.
[2026-05-25 15:53:59] [INFO ] Found NUPN structural information;
[2026-05-25 15:53:59] [INFO ] Parsed PT model containing 112 places and 117 transitions and 277 arcs in 140 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 69 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 117/117 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 117
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 110 transition count 116
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 110 transition count 116
Applied a total of 3 rules in 23 ms. Remains 110 /112 variables (removed 2) and now considering 116/117 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3157917896106816900.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17426855393098026944.kers'
[2026-05-25 15:53:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3157917896106816900.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17426855393098026944.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 116 rows 110 cols 273 entries
Finished phase 1 with 104 SingleSign rule and 1 generalized
[2026-05-25 15:53:59] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17426855393098026944.kers
Total runtime 2 ms.
[2026-05-25 15:53:59] [INFO ] Implicit Places using invariants in 211 ms returned []
[2026-05-25 15:53:59] [INFO ] Invariant cache hit.
[2026-05-25 15:53:59] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2026-05-25 15:53:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 116/225 variables, 109/114 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 1/226 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 0/226 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 115 constraints, problems are : Problem set: 0 solved, 115 unsolved in 4621 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 116/225 variables, 109/114 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 115/229 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 1/226 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/226 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 226/226 variables, and 230 constraints, problems are : Problem set: 0 solved, 115 unsolved in 5497 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10167ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 10180ms
Starting structural reductions in LTL mode, iteration 1 : 110/112 places, 116/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10592 ms. Remains : 110/112 places, 116/117 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 110 /110 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2026-05-25 15:54:09] [INFO ] Invariant cache hit.
[2026-05-25 15:54:09] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-25 15:54:09] [INFO ] Invariant cache hit.
[2026-05-25 15:54:09] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 134 ms. Remains : 110/110 places, 116/116 transitions.
Support contains 69 out of 110 places after structural reductions.
[2026-05-25 15:54:10] [INFO ] Flatten gal took : 41 ms
[2026-05-25 15:54:10] [INFO ] Flatten gal took : 19 ms
[2026-05-25 15:54:10] [INFO ] Input system was already deterministic with 116 transitions.
RANDOM walk for 40000 steps (849 resets) in 1216 ms. (32 steps per ms) remains 6/73 properties
BEST_FIRST walk for 40003 steps (250 resets) in 238 ms. (167 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (174 resets) in 147 ms. (270 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (176 resets) in 61 ms. (645 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (110 resets) in 62 ms. (634 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (176 resets) in 62 ms. (634 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (160 resets) in 63 ms. (625 steps per ms) remains 5/6 properties
[2026-05-25 15:54:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 95/109 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 116/225 variables, 109/114 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp58 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/226 variables, 1/115 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/115 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/226 variables, 0/115 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 115 constraints, problems are : Problem set: 4 solved, 1 unsolved in 187 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/58 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/109 variables, 3/5 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 116/225 variables, 109/114 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 1/115 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/115 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/226 variables, 1/116 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 0/116 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/226 variables, 0/116 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 226/226 variables, and 116 constraints, problems are : Problem set: 4 solved, 1 unsolved in 103 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 1/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 294ms problems are : Problem set: 4 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 116/116 transitions.
Graph (trivial) has 98 edges and 110 vertex of which 7 / 110 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 153 edges and 104 vertex of which 96 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 57 rules applied. Total rules applied 59 place count 96 transition count 48
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 62 rules applied. Total rules applied 121 place count 41 transition count 41
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 124 place count 39 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 125 place count 38 transition count 40
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 125 place count 38 transition count 32
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 141 place count 30 transition count 32
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 147 place count 24 transition count 26
Iterating global reduction 4 with 6 rules applied. Total rules applied 153 place count 24 transition count 26
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 153 place count 24 transition count 25
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 155 place count 23 transition count 25
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 177 place count 12 transition count 14
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 19 edges and 12 vertex of which 8 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 4 rules applied. Total rules applied 181 place count 8 transition count 11
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 185 place count 8 transition count 7
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 186 place count 8 transition count 7
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 187 place count 8 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 188 place count 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 189 place count 6 transition count 5
Applied a total of 189 rules in 24 ms. Remains 6 /110 variables (removed 104) and now considering 5/116 (removed 111) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 6/110 places, 5/116 transitions.
RANDOM walk for 40000 steps (6664 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (6664 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 11 steps, saw 6 distinct states, run finished after 10 ms. (steps per millisecond=1 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 11 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=11 ) properties seen :0
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 15:54:11] [INFO ] Flatten gal took : 7 ms
[2026-05-25 15:54:11] [INFO ] Flatten gal took : 7 ms
[2026-05-25 15:54:11] [INFO ] Input system was already deterministic with 116 transitions.
Support contains 59 out of 110 places (down from 62) after GAL structural reductions.
Computed a total of 24 stabilizing places and 24 stable transitions
Graph (complete) has 161 edges and 110 vertex of which 102 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 116/116 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 98 transition count 104
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 98 transition count 104
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 93 transition count 99
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 93 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 93 transition count 96
Applied a total of 37 rules in 9 ms. Remains 93 /110 variables (removed 17) and now considering 96/116 (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-4221514780883931992.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5982886696553537552.kers'
[2026-05-25 15:54:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4221514780883931992.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5982886696553537552.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 96 rows 93 cols 233 entries
Finished phase 1 with 87 SingleSign rule and 1 generalized
[2026-05-25 15:54:11] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5982886696553537552.kers
Total runtime 1 ms.
[2026-05-25 15:54:11] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-25 15:54:11] [INFO ] Invariant cache hit.
[2026-05-25 15:54:11] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 95 sub problems to find dead transitions.
[2026-05-25 15:54:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 96/188 variables, 92/97 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 1/189 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 0/189 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 98 constraints, problems are : Problem set: 0 solved, 95 unsolved in 2818 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 96/188 variables, 92/97 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 95/192 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 1/189 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 0/189 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 193 constraints, problems are : Problem set: 0 solved, 95 unsolved in 3517 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6346ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 6346ms
Starting structural reductions in LTL mode, iteration 1 : 93/110 places, 96/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6455 ms. Remains : 93/110 places, 96/116 transitions.
[2026-05-25 15:54:17] [INFO ] Flatten gal took : 9 ms
[2026-05-25 15:54:17] [INFO ] Flatten gal took : 5 ms
[2026-05-25 15:54:17] [INFO ] Input system was already deterministic with 96 transitions.
[2026-05-25 15:54:17] [INFO ] Flatten gal took : 4 ms
[2026-05-25 15:54:17] [INFO ] Flatten gal took : 4 ms
[2026-05-25 15:54:17] [INFO ] Time to serialize gal into /tmp/CTLFireability4757394441439202654.gal : 3 ms
[2026-05-25 15:54:17] [INFO ] Time to serialize properties into /tmp/CTLFireability1552823446220990438.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4757394441439202654.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1552823446220990438.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.58128e+06,0.12216,9696,2,2533,5,25094,6,0,470,25116,0


Converting to forward existential form...Done !
original formula: !(A((((!(AX(((p82==1)&&(p101==1)))) * (p76==1)) * (E((((p70==1)&&(p93==1))&&(p108==1)) U (p2==1)) + EG((p68==1)))) + A((AF((p76==1)) + (A...218
=> equivalent forward existential formula: ((([(((FwdU(Init,!((p8==1))) * !((p8==1))) * !(!((E(!((p36!=1)) U (!((!(EG(!((p76==1)))) + (!(EX(!((p91==1)))) *...762
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t6, t10, t13, t23, t24, t25, t30, t39, t46, t53, t60, t67, t74, t82, t86, Inters...246
Hit Full ! (commute/partial/dont) 94/0/2
(forward)formula 0,1,7.59752,272004,1,0,940,1.76274e+06,238,445,2778,1.62024e+06,1067
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 116/116 transitions.
Graph (complete) has 161 edges and 110 vertex of which 102 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 101 transition count 69
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 50 rules applied. Total rules applied 94 place count 58 transition count 62
Reduce places removed 2 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 6 rules applied. Total rules applied 100 place count 56 transition count 58
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 105 place count 52 transition count 57
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 105 place count 52 transition count 45
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 129 place count 40 transition count 45
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 136 place count 33 transition count 38
Iterating global reduction 4 with 7 rules applied. Total rules applied 143 place count 33 transition count 38
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 155 place count 27 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 156 place count 26 transition count 31
Applied a total of 156 rules in 22 ms. Remains 26 /110 variables (removed 84) and now considering 31/116 (removed 85) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8841913011108189979.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7536550875851566875.kers'
[2026-05-25 15:54:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8841913011108189979.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7536550875851566875.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 31 rows 26 cols 82 entries
Finished phase 1 with 26 SingleSign rule and 0 generalized
[2026-05-25 15:54:25] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7536550875851566875.kers
Total runtime 0 ms.
[2026-05-25 15:54:25] [INFO ] Implicit Places using invariants in 21 ms returned []
[2026-05-25 15:54:25] [INFO ] Invariant cache hit.
[2026-05-25 15:54:25] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2026-05-25 15:54:25] [INFO ] Redundant transitions in 0 ms returned []
Running 27 sub problems to find dead transitions.
[2026-05-25 15:54:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 31/53 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 4/57 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 0/57 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 57/57 variables, and 26 constraints, problems are : Problem set: 0 solved, 27 unsolved in 282 ms.
Refiners :[State Equation: 26/26 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 31/53 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 4/57 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 0/57 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 57/57 variables, and 53 constraints, problems are : Problem set: 0 solved, 27 unsolved in 349 ms.
Refiners :[State Equation: 26/26 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 633ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 634ms
Starting structural reductions in SI_CTL mode, iteration 1 : 26/110 places, 31/116 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 709 ms. Remains : 26/110 places, 31/116 transitions.
[2026-05-25 15:54:26] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:54:26] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:54:26] [INFO ] Input system was already deterministic with 31 transitions.
[2026-05-25 15:54:26] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:54:26] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:54:26] [INFO ] Time to serialize gal into /tmp/CTLFireability10576710717671183273.gal : 1 ms
[2026-05-25 15:54:26] [INFO ] Time to serialize properties into /tmp/CTLFireability7152825812232649678.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10576710717671183273.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7152825812232649678.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,11838,0.020945,4380,2,173,5,2428,6,0,135,2789,0


Converting to forward existential form...Done !
original formula: (AF(((AF((((p10==1)&&(p93==1))&&(p108==1))) + (p15==1)) + (p38==1))) + (AF((AF(AG((p85==1))) * AG((p109==1)))) * EF((p56==0))))
=> equivalent forward existential formula: ([FwdG((Init * !(!(EG(!(((!(EG(!((((p10==1)&&(p93==1))&&(p108==1))))) + (p15==1)) + (p38==1))))))),!((!(EG(!(!(E...350
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t6, t9, t10, t11, t15, t16, t18, t19, t21, t22, t24, t25, Intersection with reachabl...226
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.300698,17420,1,0,428,79804,105,232,912,105217,445
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 116/116 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 98 transition count 104
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 98 transition count 104
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 92 transition count 98
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 92 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 92 transition count 95
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 91 transition count 94
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 91 transition count 94
Applied a total of 41 rules in 21 ms. Remains 91 /110 variables (removed 19) and now considering 94/116 (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-17512272614905997081.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9346460786028387038.kers'
[2026-05-25 15:54:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17512272614905997081.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9346460786028387038.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 94 rows 91 cols 229 entries
Finished phase 1 with 85 SingleSign rule and 1 generalized
[2026-05-25 15:54:26] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9346460786028387038.kers
Total runtime 0 ms.
[2026-05-25 15:54:26] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-25 15:54:26] [INFO ] Invariant cache hit.
[2026-05-25 15:54:26] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Running 93 sub problems to find dead transitions.
[2026-05-25 15:54:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 94/184 variables, 90/95 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 1/185 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 0/185 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 96 constraints, problems are : Problem set: 0 solved, 93 unsolved in 2698 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 94/184 variables, 90/95 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 93/188 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (OVERLAPS) 1/185 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 0/185 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 189 constraints, problems are : Problem set: 0 solved, 93 unsolved in 3120 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5826ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 5828ms
Starting structural reductions in LTL mode, iteration 1 : 91/110 places, 94/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5974 ms. Remains : 91/110 places, 94/116 transitions.
[2026-05-25 15:54:32] [INFO ] Flatten gal took : 6 ms
[2026-05-25 15:54:32] [INFO ] Flatten gal took : 5 ms
[2026-05-25 15:54:32] [INFO ] Input system was already deterministic with 94 transitions.
[2026-05-25 15:54:32] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:54:32] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:54:32] [INFO ] Time to serialize gal into /tmp/CTLFireability2942447049844143439.gal : 1 ms
[2026-05-25 15:54:32] [INFO ] Time to serialize properties into /tmp/CTLFireability11355075840489435613.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2942447049844143439.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11355075840489435613.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.28097e+06,0.117832,9568,2,2197,5,23309,6,0,460,25616,0


Converting to forward existential form...Done !
original formula: EX(EG(EF(((p87==0)&&(p6==1)))))
=> equivalent forward existential formula: [FwdG(EY(Init),E(TRUE U ((p87==0)&&(p6==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t6, t10, t22, t23, t28, t35, t42, t49, t56, t63, t69, t79, t84, Intersection wit...236
(forward)formula 0,1,5.42245,165036,1,0,570,750990,215,341,2618,1.10733e+06,497
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 116/116 transitions.
Graph (trivial) has 97 edges and 110 vertex of which 7 / 110 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 154 edges and 104 vertex of which 96 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 95 transition count 54
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 56 rules applied. Total rules applied 109 place count 44 transition count 49
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 113 place count 42 transition count 47
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 116 place count 40 transition count 46
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 116 place count 40 transition count 39
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 130 place count 33 transition count 39
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 135 place count 28 transition count 34
Iterating global reduction 4 with 5 rules applied. Total rules applied 140 place count 28 transition count 34
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 158 place count 19 transition count 25
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 160 place count 18 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 161 place count 17 transition count 23
Applied a total of 161 rules in 16 ms. Remains 17 /110 variables (removed 93) and now considering 23/116 (removed 93) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-626030248952885792.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12148610854698032494.kers'
[2026-05-25 15:54:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-626030248952885792.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12148610854698032494.kers]
Normalized transition count is 22 out of 23 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 22 rows 17 cols 51 entries
Finished phase 1 with 17 SingleSign rule and 0 generalized
[2026-05-25 15:54:38] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12148610854698032494.kers
Total runtime 0 ms.
[2026-05-25 15:54:38] [INFO ] Implicit Places using invariants in 21 ms returned []
[2026-05-25 15:54:38] [INFO ] Invariant cache hit.
[2026-05-25 15:54:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 15:54:38] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2026-05-25 15:54:38] [INFO ] Redundant transitions in 0 ms returned []
Running 18 sub problems to find dead transitions.
[2026-05-25 15:54:38] [INFO ] Invariant cache hit.
[2026-05-25 15:54:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 22/35 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 4/39 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 1/40 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/40 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 18 constraints, problems are : Problem set: 0 solved, 18 unsolved in 208 ms.
Refiners :[State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 22/35 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 4/39 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 1/40 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/40 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 36 constraints, problems are : Problem set: 0 solved, 18 unsolved in 227 ms.
Refiners :[State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 437ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 437ms
Starting structural reductions in SI_CTL mode, iteration 1 : 17/110 places, 23/116 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 504 ms. Remains : 17/110 places, 23/116 transitions.
[2026-05-25 15:54:38] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:54:38] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:54:38] [INFO ] Input system was already deterministic with 23 transitions.
[2026-05-25 15:54:38] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:54:38] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:54:38] [INFO ] Time to serialize gal into /tmp/CTLFireability8158617587773700835.gal : 0 ms
[2026-05-25 15:54:38] [INFO ] Time to serialize properties into /tmp/CTLFireability11385212140523109862.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8158617587773700835.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11385212140523109862.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2285,0.014475,4376,2,93,5,2611,6,0,91,2759,0


Converting to forward existential form...Done !
original formula: EF(((p42==1) * AF((p15==1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (p42==1)) * !(EG(!((p15==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t9, t12, t15, t16, t17, Intersection with reachable at each step enabled. (destr...195
(forward)formula 0,1,0.047084,6200,1,0,158,12360,69,78,533,14704,173
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 116/116 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 100 transition count 106
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 100 transition count 106
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 96 transition count 102
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 96 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 96 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 95 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 95 transition count 99
Applied a total of 32 rules in 15 ms. Remains 95 /110 variables (removed 15) and now considering 99/116 (removed 17) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14501674393600667625.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4845416635190465500.kers'
[2026-05-25 15:54:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14501674393600667625.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4845416635190465500.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 99 rows 95 cols 239 entries
Finished phase 1 with 89 SingleSign rule and 1 generalized
[2026-05-25 15:54:38] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4845416635190465500.kers
Total runtime 1 ms.
[2026-05-25 15:54:38] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-25 15:54:38] [INFO ] Invariant cache hit.
[2026-05-25 15:54:38] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2026-05-25 15:54:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 99/193 variables, 94/99 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 1/194 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 0/194 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 100 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3008 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 99/193 variables, 94/99 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 98/197 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 1/194 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 0/194 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 198 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3943 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6959ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 6959ms
Starting structural reductions in LTL mode, iteration 1 : 95/110 places, 99/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7075 ms. Remains : 95/110 places, 99/116 transitions.
[2026-05-25 15:54:45] [INFO ] Flatten gal took : 8 ms
[2026-05-25 15:54:45] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:54:45] [INFO ] Input system was already deterministic with 99 transitions.
[2026-05-25 15:54:45] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:54:45] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:54:45] [INFO ] Time to serialize gal into /tmp/CTLFireability2944841210546466111.gal : 1 ms
[2026-05-25 15:54:45] [INFO ] Time to serialize properties into /tmp/CTLFireability914282629954823184.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2944841210546466111.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability914282629954823184.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.15339e+06,0.127445,10180,2,2282,5,25361,6,0,481,28182,0


Converting to forward existential form...Done !
original formula: E((((p75==1) * !(A((((p28==1)&&(p93==1))&&(p108==1)) U A((p31==1) U (p26==1))))) * (AX((!(((p13==1)&&(p55==1))) * AX((p66==1)))) + (p92==...197
=> equivalent forward existential formula: ([(FwdU(Init,(((p75==1) * !(!((E(!(!((E(!((p26==1)) U (!((p31==1)) * !((p26==1)))) + EG(!((p26==1)))))) U (!((((...873
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t6, t10, t22, t23, t29, t37, t43, t50, t58, t69, t74, t84, t89, Intersection wit...236
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,12.6601,423752,1,0,1087,2.85758e+06,256,623,2970,2.41857e+06,1382
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 116/116 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 97 transition count 103
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 97 transition count 103
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 90 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 90 transition count 96
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 90 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 89 transition count 91
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 89 transition count 91
Applied a total of 46 rules in 5 ms. Remains 89 /110 variables (removed 21) and now considering 91/116 (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-1015166526787947263.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6828546024133748895.kers'
[2026-05-25 15:54:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1015166526787947263.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6828546024133748895.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 91 rows 89 cols 223 entries
Finished phase 1 with 83 SingleSign rule and 1 generalized
[2026-05-25 15:54:58] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6828546024133748895.kers
Total runtime 1 ms.
[2026-05-25 15:54:58] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-25 15:54:58] [INFO ] Invariant cache hit.
[2026-05-25 15:54:58] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2026-05-25 15:54:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 91/179 variables, 88/93 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 1/180 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 0/180 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 94 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2646 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 91/179 variables, 88/93 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 90/183 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 1/180 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/180 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 184 constraints, problems are : Problem set: 0 solved, 90 unsolved in 3302 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5953ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 5953ms
Starting structural reductions in LTL mode, iteration 1 : 89/110 places, 91/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6075 ms. Remains : 89/110 places, 91/116 transitions.
[2026-05-25 15:55:04] [INFO ] Flatten gal took : 8 ms
[2026-05-25 15:55:04] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:55:04] [INFO ] Input system was already deterministic with 91 transitions.
[2026-05-25 15:55:04] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:55:04] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:55:04] [INFO ] Time to serialize gal into /tmp/CTLFireability16864821851424873292.gal : 1 ms
[2026-05-25 15:55:04] [INFO ] Time to serialize properties into /tmp/CTLFireability14286896930683970589.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16864821851424873292.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14286896930683970589.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.69456e+06,0.11259,9200,2,2150,5,22539,6,0,449,23580,0


Converting to forward existential form...Done !
original formula: AX(EG((p97==0)))
=> equivalent forward existential formula: [(EY(Init) * !(EG((p97==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t6, t7, t12, t22, t23, t28, t35, t42, t49, t56, t63, t69, t76, t81, Intersection wit...236
(forward)formula 0,1,4.91396,180144,1,0,643,1.13277e+06,204,300,2493,1.06178e+06,725
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 116/116 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 97 transition count 103
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 97 transition count 103
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 92 transition count 98
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 92 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 92 transition count 95
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 91 transition count 94
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 91 transition count 94
Applied a total of 41 rules in 10 ms. Remains 91 /110 variables (removed 19) and now considering 94/116 (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-3653704775858116331.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12067223863332543346.kers'
[2026-05-25 15:55:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3653704775858116331.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12067223863332543346.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 94 rows 91 cols 229 entries
Finished phase 1 with 85 SingleSign rule and 1 generalized
[2026-05-25 15:55:09] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12067223863332543346.kers
Total runtime 0 ms.
[2026-05-25 15:55:09] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-25 15:55:09] [INFO ] Invariant cache hit.
[2026-05-25 15:55:09] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 93 sub problems to find dead transitions.
[2026-05-25 15:55:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 94/184 variables, 90/95 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 1/185 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 0/185 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 96 constraints, problems are : Problem set: 0 solved, 93 unsolved in 2736 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 94/184 variables, 90/95 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 93/188 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (OVERLAPS) 1/185 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 0/185 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 189 constraints, problems are : Problem set: 0 solved, 93 unsolved in 3464 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6206ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 6207ms
Starting structural reductions in LTL mode, iteration 1 : 91/110 places, 94/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6340 ms. Remains : 91/110 places, 94/116 transitions.
[2026-05-25 15:55:15] [INFO ] Flatten gal took : 5 ms
[2026-05-25 15:55:15] [INFO ] Flatten gal took : 5 ms
[2026-05-25 15:55:15] [INFO ] Input system was already deterministic with 94 transitions.
[2026-05-25 15:55:15] [INFO ] Flatten gal took : 5 ms
[2026-05-25 15:55:15] [INFO ] Flatten gal took : 4 ms
[2026-05-25 15:55:15] [INFO ] Time to serialize gal into /tmp/CTLFireability10855515709200176074.gal : 1 ms
[2026-05-25 15:55:15] [INFO ] Time to serialize properties into /tmp/CTLFireability3324964385110938604.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10855515709200176074.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3324964385110938604.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.28262e+06,0.126474,10076,2,2296,5,25498,6,0,460,27857,0


Converting to forward existential form...Done !
original formula: E(!(EX(A(A((p67==1) U (p48==1)) U AG((p92==1))))) U ((E(EX(EG((p53==1))) U (EX(AX((p102==1))) + AG(A((p1==1) U ((p79==1)&&(p99==1)))))) *...202
=> equivalent forward existential formula: [(EY((FwdU(Init,!(EX(!((E(!(!(E(TRUE U !((p92==1))))) U (!(!((E(!((p48==1)) U (!((p67==1)) * !((p48==1)))) + EG(...481
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t6, t10, t22, t23, t28, t38, t45, t52, t59, t66, t72, t79, t84, Intersection wit...236
(forward)formula 0,0,13.2081,456700,1,0,1680,3.08699e+06,246,846,2852,2.81137e+06,1875
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 116/116 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 98 transition count 104
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 98 transition count 104
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 91 transition count 97
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 91 transition count 97
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 91 transition count 93
Applied a total of 42 rules in 10 ms. Remains 91 /110 variables (removed 19) and now considering 93/116 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9896428483524283182.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11368949198737401532.kers'
[2026-05-25 15:55:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9896428483524283182.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11368949198737401532.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 93 rows 91 cols 227 entries
Finished phase 1 with 85 SingleSign rule and 1 generalized
[2026-05-25 15:55:29] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11368949198737401532.kers
Total runtime 0 ms.
[2026-05-25 15:55:29] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-25 15:55:29] [INFO ] Invariant cache hit.
[2026-05-25 15:55:29] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2026-05-25 15:55:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 93/183 variables, 90/95 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 1/184 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 0/184 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 96 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2753 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 93/183 variables, 90/95 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 92/187 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 1/184 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/184 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 188 constraints, problems are : Problem set: 0 solved, 92 unsolved in 3087 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5846ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 5847ms
Starting structural reductions in LTL mode, iteration 1 : 91/110 places, 93/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5963 ms. Remains : 91/110 places, 93/116 transitions.
[2026-05-25 15:55:35] [INFO ] Flatten gal took : 6 ms
[2026-05-25 15:55:35] [INFO ] Flatten gal took : 5 ms
[2026-05-25 15:55:35] [INFO ] Input system was already deterministic with 93 transitions.
[2026-05-25 15:55:35] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:55:35] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:55:35] [INFO ] Time to serialize gal into /tmp/CTLFireability15135455124570561093.gal : 1 ms
[2026-05-25 15:55:35] [INFO ] Time to serialize properties into /tmp/CTLFireability16899553444773464716.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15135455124570561093.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16899553444773464716.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.00301e+06,0.108801,9572,2,2543,5,24139,6,0,459,24595,0


Converting to forward existential form...Done !
original formula: EF((A(!(((p69!=1) + (AG((p75==1)) * (p12!=1)))) U A(!(AX((p1==1))) U (p4==1))) * A(((p82==1) + AG(AX((p41==1)))) U AX((((p57==1)||(p88==1...197
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !((E(!(!((E(!((p4==1)) U (!(!(!(EX(!((p1==1)))))) * !((p4==1)))) + EG(!((p4==1)))))) U (!(...681
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t6, t10, t13, t21, t22, t23, t29, t37, t44, t52, t58, t65, t71, t78, t83, Inters...246
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,15.4173,490712,1,0,1018,3.48928e+06,234,636,2826,2.57842e+06,1293
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 116/116 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 98 transition count 104
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 98 transition count 104
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 93 transition count 99
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 93 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 93 transition count 96
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 92 transition count 95
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 92 transition count 95
Applied a total of 39 rules in 2 ms. Remains 92 /110 variables (removed 18) and now considering 95/116 (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-16815791780731969229.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3711933084562192285.kers'
[2026-05-25 15:55:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16815791780731969229.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3711933084562192285.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 95 rows 92 cols 231 entries
Finished phase 1 with 86 SingleSign rule and 1 generalized
[2026-05-25 15:55:50] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3711933084562192285.kers
Total runtime 0 ms.
[2026-05-25 15:55:50] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-25 15:55:50] [INFO ] Invariant cache hit.
[2026-05-25 15:55:50] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2026-05-25 15:55:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 95/186 variables, 91/96 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 1/187 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 0/187 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 97 constraints, problems are : Problem set: 0 solved, 94 unsolved in 2812 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 95/186 variables, 91/96 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 94/190 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 1/187 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 0/187 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 191 constraints, problems are : Problem set: 0 solved, 94 unsolved in 3437 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6256ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 6256ms
Starting structural reductions in LTL mode, iteration 1 : 92/110 places, 95/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6361 ms. Remains : 92/110 places, 95/116 transitions.
[2026-05-25 15:55:57] [INFO ] Flatten gal took : 6 ms
[2026-05-25 15:55:57] [INFO ] Flatten gal took : 6 ms
[2026-05-25 15:55:57] [INFO ] Input system was already deterministic with 95 transitions.
[2026-05-25 15:55:57] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:55:57] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:55:57] [INFO ] Time to serialize gal into /tmp/CTLFireability17283136596449659188.gal : 0 ms
[2026-05-25 15:55:57] [INFO ] Time to serialize properties into /tmp/CTLFireability8965411116557044730.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17283136596449659188.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8965411116557044730.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.56858e+06,0.114078,9464,2,2188,5,22949,6,0,465,24713,0


Converting to forward existential form...Done !
original formula: (AX(EX((p91==0))) * EG(((p33==0) * !(E((p13==1) U (p6==1))))))
=> equivalent forward existential formula: ([(EY(Init) * !(EX((p91==0))))] = FALSE * [(Init * !(EG(((p33==0) * !(E((p13==1) U (p6==1)))))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t6, t10, t23, t24, t29, t36, t43, t50, t57, t64, t70, t80, t85, Intersection wit...236
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,9.86516,338716,1,0,686,2.28003e+06,220,408,2699,1.96298e+06,686
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 116/116 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 97 transition count 103
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 97 transition count 103
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 92 transition count 98
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 92 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 92 transition count 95
Applied a total of 39 rules in 7 ms. Remains 92 /110 variables (removed 18) and now considering 95/116 (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-14746267147373134469.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4035147816852530067.kers'
[2026-05-25 15:56:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14746267147373134469.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4035147816852530067.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 95 rows 92 cols 231 entries
Finished phase 1 with 86 SingleSign rule and 1 generalized
[2026-05-25 15:56:07] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4035147816852530067.kers
Total runtime 1 ms.
[2026-05-25 15:56:07] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-25 15:56:07] [INFO ] Invariant cache hit.
[2026-05-25 15:56:07] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 92/110 places, 95/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 92/110 places, 95/116 transitions.
[2026-05-25 15:56:07] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:56:07] [INFO ] Flatten gal took : 4 ms
[2026-05-25 15:56:07] [INFO ] Input system was already deterministic with 95 transitions.
[2026-05-25 15:56:07] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:56:07] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:56:07] [INFO ] Time to serialize gal into /tmp/CTLFireability793869140420237831.gal : 1 ms
[2026-05-25 15:56:07] [INFO ] Time to serialize properties into /tmp/CTLFireability10321101443454240227.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability793869140420237831.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10321101443454240227.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.36808e+06,0.109607,9412,2,2334,5,23270,6,0,465,23760,0


Converting to forward existential form...Done !
original formula: E(A((p68==1) U AG(EX(((p33==1)&&(p91==1))))) U !(((p90==1) + !(A((p82==1) U EF((p82==1)))))))
=> equivalent forward existential formula: [(((FwdU(Init,!((E(!(!(E(TRUE U !(EX(((p33==1)&&(p91==1))))))) U (!((p68==1)) * !(!(E(TRUE U !(EX(((p33==1)&&(p9...349
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t6, t10, t13, t23, t24, t25, t30, t39, t46, t53, t60, t67, t73, t80, t85, Inters...246
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,7.35403,249892,1,0,844,1.7109e+06,230,487,2846,1.31298e+06,885
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 116/116 transitions.
Graph (complete) has 161 edges and 110 vertex of which 103 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 103 transition count 61
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 59 rules applied. Total rules applied 113 place count 50 transition count 55
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 117 place count 48 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 119 place count 46 transition count 53
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 119 place count 46 transition count 45
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 135 place count 38 transition count 45
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 141 place count 32 transition count 39
Iterating global reduction 4 with 6 rules applied. Total rules applied 147 place count 32 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 147 place count 32 transition count 38
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 149 place count 31 transition count 38
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 167 place count 22 transition count 29
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 168 place count 22 transition count 29
Applied a total of 168 rules in 8 ms. Remains 22 /110 variables (removed 88) and now considering 29/116 (removed 87) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15341781413635682138.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-50871556295550083.kers'
[2026-05-25 15:56:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15341781413635682138.kers, --Pflows, --basisKERS=/tmp/petrispot-output-50871556295550083.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 29 rows 22 cols 69 entries
Finished phase 1 with 22 SingleSign rule and 0 generalized
[2026-05-25 15:56:14] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-50871556295550083.kers
Total runtime 0 ms.
[2026-05-25 15:56:14] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-25 15:56:14] [INFO ] Invariant cache hit.
[2026-05-25 15:56:14] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-25 15:56:14] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2026-05-25 15:56:14] [INFO ] Redundant transitions in 0 ms returned []
Running 28 sub problems to find dead transitions.
[2026-05-25 15:56:14] [INFO ] Invariant cache hit.
[2026-05-25 15:56:14] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 29/50 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 1/51 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 0/51 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 28 constraints, problems are : Problem set: 0 solved, 28 unsolved in 326 ms.
Refiners :[State Equation: 22/22 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 29/50 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 28/55 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/51 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 56 constraints, problems are : Problem set: 0 solved, 28 unsolved in 370 ms.
Refiners :[State Equation: 22/22 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 707ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 707ms
Starting structural reductions in SI_CTL mode, iteration 1 : 22/110 places, 29/116 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 774 ms. Remains : 22/110 places, 29/116 transitions.
[2026-05-25 15:56:15] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:56:15] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:56:15] [INFO ] Input system was already deterministic with 29 transitions.
[2026-05-25 15:56:15] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:56:15] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:56:15] [INFO ] Time to serialize gal into /tmp/CTLFireability17502146722550158174.gal : 0 ms
[2026-05-25 15:56:15] [INFO ] Time to serialize properties into /tmp/CTLFireability1592336493557164226.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17502146722550158174.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1592336493557164226.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3238,0.00928,4160,2,124,5,1018,6,0,117,1287,0


Converting to forward existential form...Done !
original formula: (EF(EG((EG((p89==1)) + ((p1==0)&&(p15==0))))) + E((p87==1) U AF(!(((p6==1)||(p100!=1))))))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),(EG((p89==1)) + ((p1==0)&&(p15==0))))] != FALSE + [(FwdU(Init,(p87==1)) * !(EG(!(!(((p6==...185
Reverse transition relation is NOT exact ! Due to transitions t0, t4, t5, t12, t14, t16, t20, t28, Intersection with reachable at each step enabled. (dest...196
(forward)formula 0,1,0.02679,5020,1,0,93,6007,85,50,705,6111,119
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 116/116 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 96 transition count 102
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 96 transition count 102
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 90 transition count 96
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 90 transition count 96
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 90 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 89 transition count 91
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 89 transition count 91
Applied a total of 46 rules in 4 ms. Remains 89 /110 variables (removed 21) and now considering 91/116 (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-16054559209069529363.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3337538941788987138.kers'
[2026-05-25 15:56:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16054559209069529363.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3337538941788987138.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 91 rows 89 cols 223 entries
Finished phase 1 with 83 SingleSign rule and 1 generalized
[2026-05-25 15:56:15] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3337538941788987138.kers
Total runtime 0 ms.
[2026-05-25 15:56:15] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-25 15:56:15] [INFO ] Invariant cache hit.
[2026-05-25 15:56:15] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2026-05-25 15:56:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 91/179 variables, 88/93 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 1/180 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 0/180 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 94 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2572 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 91/179 variables, 88/93 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 90/183 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 1/180 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/180 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 184 constraints, problems are : Problem set: 0 solved, 90 unsolved in 3135 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5713ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 5713ms
Starting structural reductions in LTL mode, iteration 1 : 89/110 places, 91/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5813 ms. Remains : 89/110 places, 91/116 transitions.
[2026-05-25 15:56:21] [INFO ] Flatten gal took : 5 ms
[2026-05-25 15:56:21] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:56:21] [INFO ] Input system was already deterministic with 91 transitions.
[2026-05-25 15:56:21] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:56:21] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:56:21] [INFO ] Time to serialize gal into /tmp/CTLFireability11333966662597417123.gal : 1 ms
[2026-05-25 15:56:21] [INFO ] Time to serialize properties into /tmp/CTLFireability596285701427420717.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11333966662597417123.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability596285701427420717.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.6705e+06,0.1304,10400,2,2123,5,26673,6,0,449,28618,0


Converting to forward existential form...Done !
original formula: A((p47!=1) U E(AF(!(((((p16==1)&&(p93==1))&&(p108==1))||(p105==1)))) U EF(AX(AX((p36==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(!(EG(!(!(((((p16==1)&&(p93==1))&&(p108==1))||(p105==1)))))) U E(TRUE U !(EX(!(!(EX(!((p36==1)...418
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t7, t11, t22, t23, t28, t35, t42, t49, t56, t63, t69, t76, t81, Intersection with re...232
(forward)formula 0,1,2.47966,100712,1,0,417,608799,221,197,2622,506410,516
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 116/116 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 96 transition count 102
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 96 transition count 102
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 91 transition count 97
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 91 transition count 97
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 91 transition count 94
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 90 transition count 93
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 90 transition count 93
Applied a total of 43 rules in 7 ms. Remains 90 /110 variables (removed 20) and now considering 93/116 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1534715754017156461.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7207189907989509575.kers'
[2026-05-25 15:56:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1534715754017156461.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7207189907989509575.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 93 rows 90 cols 227 entries
Finished phase 1 with 84 SingleSign rule and 1 generalized
[2026-05-25 15:56:23] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7207189907989509575.kers
Total runtime 0 ms.
[2026-05-25 15:56:23] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-25 15:56:23] [INFO ] Invariant cache hit.
[2026-05-25 15:56:23] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2026-05-25 15:56:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 93/182 variables, 89/94 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 1/183 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 0/183 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 95 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2636 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 93/182 variables, 89/94 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 92/186 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 1/183 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/183 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 187 constraints, problems are : Problem set: 0 solved, 92 unsolved in 3440 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6080ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 6081ms
Starting structural reductions in LTL mode, iteration 1 : 90/110 places, 93/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6189 ms. Remains : 90/110 places, 93/116 transitions.
[2026-05-25 15:56:29] [INFO ] Flatten gal took : 7 ms
[2026-05-25 15:56:29] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:56:29] [INFO ] Input system was already deterministic with 93 transitions.
[2026-05-25 15:56:29] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:56:29] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:56:29] [INFO ] Time to serialize gal into /tmp/CTLFireability15539267374575529867.gal : 1 ms
[2026-05-25 15:56:29] [INFO ] Time to serialize properties into /tmp/CTLFireability5185162462852910120.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15539267374575529867.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5185162462852910120.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.83815e+06,0.141372,10452,2,2207,5,27011,6,0,455,28674,0


Converting to forward existential form...Done !
original formula: AF(AG(((((p72==1) * EX((p110==1))) + (EG((((p16==1)&&(p93==1))&&(p108==1))) * (EG((p33==1)) + EG((p93==1))))) * (AF((p25==0)) + ((A((p51=...198
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((((p72==1) * EX((p110==1))) + (EG((((p16==1)&&(p93==1))&&(p108==1))) * (EG((p33==1)) ...306
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t7, t11, t22, t23, t28, t35, t42, t49, t56, t65, t71, t78, t83, Intersection with re...232
(forward)formula 0,0,8.0191,266624,1,0,1309,1.72992e+06,245,595,2813,1.5482e+06,1603
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 116/116 transitions.
Graph (trivial) has 77 edges and 110 vertex of which 7 / 110 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 154 edges and 104 vertex of which 96 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 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 41 place count 95 transition count 66
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 46 rules applied. Total rules applied 87 place count 56 transition count 59
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 91 place count 52 transition count 59
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 91 place count 52 transition count 48
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 113 place count 41 transition count 48
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 120 place count 34 transition count 41
Iterating global reduction 3 with 7 rules applied. Total rules applied 127 place count 34 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 128 place count 34 transition count 40
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 128 place count 34 transition count 39
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 130 place count 33 transition count 39
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 142 place count 27 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 26 transition count 32
Applied a total of 143 rules in 16 ms. Remains 26 /110 variables (removed 84) and now considering 32/116 (removed 84) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-95897752967769112.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16223947065671980898.kers'
[2026-05-25 15:56:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-95897752967769112.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16223947065671980898.kers]
Normalized transition count is 31 out of 32 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 31 rows 26 cols 82 entries
Finished phase 1 with 26 SingleSign rule and 0 generalized
[2026-05-25 15:56:38] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16223947065671980898.kers
Total runtime 0 ms.
[2026-05-25 15:56:38] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-25 15:56:38] [INFO ] Invariant cache hit.
[2026-05-25 15:56:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 15:56:38] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2026-05-25 15:56:38] [INFO ] Redundant transitions in 0 ms returned []
Running 29 sub problems to find dead transitions.
[2026-05-25 15:56:38] [INFO ] Invariant cache hit.
[2026-05-25 15:56:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 31/54 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 3/57 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 1/58 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 0/58 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 58/58 variables, and 27 constraints, problems are : Problem set: 0 solved, 29 unsolved in 392 ms.
Refiners :[State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 31/54 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 3/57 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 1/58 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/58 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 0/58 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 58/58 variables, and 56 constraints, problems are : Problem set: 0 solved, 29 unsolved in 416 ms.
Refiners :[State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 810ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 811ms
Starting structural reductions in SI_CTL mode, iteration 1 : 26/110 places, 32/116 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 875 ms. Remains : 26/110 places, 32/116 transitions.
[2026-05-25 15:56:38] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:56:38] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:56:38] [INFO ] Input system was already deterministic with 32 transitions.
[2026-05-25 15:56:38] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:56:38] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:56:38] [INFO ] Time to serialize gal into /tmp/CTLFireability17434505117406897891.gal : 1 ms
[2026-05-25 15:56:38] [INFO ] Time to serialize properties into /tmp/CTLFireability17815453577730587673.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17434505117406897891.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17815453577730587673.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,20283,0.024071,4860,2,191,5,4600,6,0,135,5738,0


Converting to forward existential form...Done !
original formula: AF(((p105==1) * E((((p101==1)||(p65==1)) * E((p62==1) U (((p10==1)&&(p93==1))&&(p108==1)))) U (((p58==1)&&(p92==1))&&(p30==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(((p105==1) * E((((p101==1)||(p65==1)) * E((p62==1) U (((p10==1)&&(p93==1))&&(p108==1)))) U (((p58==...192
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t5, t6, t7, t11, t12, t14, t15, t22, t29, Intersection with reachable at each st...214
(forward)formula 0,0,0.167217,11628,1,0,277,38565,95,195,813,62217,279
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 116/116 transitions.
Graph (trivial) has 98 edges and 110 vertex of which 7 / 110 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 154 edges and 104 vertex of which 96 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 95 transition count 53
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 59 rules applied. Total rules applied 113 place count 43 transition count 46
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 116 place count 41 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 117 place count 40 transition count 45
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 117 place count 40 transition count 36
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 135 place count 31 transition count 36
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 141 place count 25 transition count 30
Iterating global reduction 4 with 6 rules applied. Total rules applied 147 place count 25 transition count 30
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 163 place count 17 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 165 place count 16 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 166 place count 15 transition count 20
Applied a total of 166 rules in 15 ms. Remains 15 /110 variables (removed 95) and now considering 20/116 (removed 96) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7877024214391686126.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-739094430396445182.kers'
[2026-05-25 15:56:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7877024214391686126.kers, --Pflows, --basisKERS=/tmp/petrispot-output-739094430396445182.kers]
Normalized transition count is 19 out of 20 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 19 rows 15 cols 45 entries
Finished phase 1 with 15 SingleSign rule and 0 generalized
[2026-05-25 15:56:39] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-739094430396445182.kers
Total runtime 1 ms.
[2026-05-25 15:56:39] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-25 15:56:39] [INFO ] Invariant cache hit.
[2026-05-25 15:56:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 15:56:39] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2026-05-25 15:56:39] [INFO ] Redundant transitions in 1 ms returned []
Running 15 sub problems to find dead transitions.
[2026-05-25 15:56:39] [INFO ] Invariant cache hit.
[2026-05-25 15:56:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 19/30 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 4/34 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 1/35 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/35 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/35 variables, and 16 constraints, problems are : Problem set: 0 solved, 15 unsolved in 173 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 19/30 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 4/34 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/35 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/35 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/35 variables, and 31 constraints, problems are : Problem set: 0 solved, 15 unsolved in 199 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 375ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 375ms
Starting structural reductions in SI_CTL mode, iteration 1 : 15/110 places, 20/116 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 438 ms. Remains : 15/110 places, 20/116 transitions.
[2026-05-25 15:56:39] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:56:39] [INFO ] Flatten gal took : 0 ms
[2026-05-25 15:56:39] [INFO ] Input system was already deterministic with 20 transitions.
[2026-05-25 15:56:39] [INFO ] Flatten gal took : 0 ms
[2026-05-25 15:56:39] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:56:39] [INFO ] Time to serialize gal into /tmp/CTLFireability6626373399028571437.gal : 0 ms
[2026-05-25 15:56:39] [INFO ] Time to serialize properties into /tmp/CTLFireability12926721589582234167.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6626373399028571437.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12926721589582234167.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1538,0.007172,4132,2,74,5,1355,6,0,80,1411,0


Converting to forward existential form...Done !
original formula: AF(AG((p20==0)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((p20==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t7, t9, t12, t13, t14, Intersection with reachable at each step enabled. (destro...194
(forward)formula 0,0,0.038816,5728,1,0,100,9447,67,70,491,13720,100
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 15:56:39] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:56:39] [INFO ] Flatten gal took : 2 ms
Total runtime 160559 ms.

BK_STOP 1779724599629

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

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