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.r098-tall-177955695400242.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 DiscoveryGPU-PT-06b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695400242
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.0K Mar 6 16:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Mar 6 16:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 6 16:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 6 16:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 09:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 09:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Mar 6 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Mar 6 16:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 6 16:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:10 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 46K 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 DiscoveryGPU-PT-06b-CTLFireability-2024-00
FORMULA_NAME DiscoveryGPU-PT-06b-CTLFireability-2024-01
FORMULA_NAME DiscoveryGPU-PT-06b-CTLFireability-2024-02
FORMULA_NAME DiscoveryGPU-PT-06b-CTLFireability-2024-03
FORMULA_NAME DiscoveryGPU-PT-06b-CTLFireability-2024-04
FORMULA_NAME DiscoveryGPU-PT-06b-CTLFireability-2024-05
FORMULA_NAME DiscoveryGPU-PT-06b-CTLFireability-2024-06
FORMULA_NAME DiscoveryGPU-PT-06b-CTLFireability-2024-07
FORMULA_NAME DiscoveryGPU-PT-06b-CTLFireability-2024-08
FORMULA_NAME DiscoveryGPU-PT-06b-CTLFireability-2024-09
FORMULA_NAME DiscoveryGPU-PT-06b-CTLFireability-2024-10
FORMULA_NAME DiscoveryGPU-PT-06b-CTLFireability-2024-11
FORMULA_NAME DiscoveryGPU-PT-06b-CTLFireability-2024-12
FORMULA_NAME DiscoveryGPU-PT-06b-CTLFireability-2024-13
FORMULA_NAME DiscoveryGPU-PT-06b-CTLFireability-2024-14
FORMULA_NAME DiscoveryGPU-PT-06b-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779594455452

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-24 03:47:36] [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-24 03:47:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 03:47:36] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2026-05-24 03:47:36] [INFO ] Transformed 184 places.
[2026-05-24 03:47:36] [INFO ] Transformed 194 transitions.
[2026-05-24 03:47:36] [INFO ] Found NUPN structural information;
[2026-05-24 03:47:36] [INFO ] Parsed PT model containing 184 places and 194 transitions and 503 arcs in 152 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 79 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 172 transition count 194
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 25 place count 159 transition count 181
Iterating global reduction 1 with 13 rules applied. Total rules applied 38 place count 159 transition count 181
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 157 transition count 179
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 157 transition count 179
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 155 transition count 177
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 155 transition count 177
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 154 transition count 176
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 154 transition count 176
Applied a total of 48 rules in 42 ms. Remains 154 /184 variables (removed 30) and now considering 176/194 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10794139248330398848.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15444131527958287081.kers'
[2026-05-24 03:47:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10794139248330398848.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15444131527958287081.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 176 rows 154 cols 454 entries
Finished phase 1 with 152 SingleSign rule and 0 generalized
[2026-05-24 03:47:36] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15444131527958287081.kers
Total runtime 2 ms.
[2026-05-24 03:47:37] [INFO ] Implicit Places using invariants in 246 ms returned []
[2026-05-24 03:47:37] [INFO ] Invariant cache hit.
[2026-05-24 03:47:37] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2026-05-24 03:47:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (OVERLAPS) 176/330 variables, 154/156 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 13/169 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 0/330 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 169 constraints, problems are : Problem set: 0 solved, 175 unsolved in 9388 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 176/330 variables, 154/169 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 175/344 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/330 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 345 constraints, problems are : Problem set: 0 solved, 175 unsolved in 16068 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25539ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 25566ms
Starting structural reductions in LTL mode, iteration 1 : 154/184 places, 176/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26037 ms. Remains : 154/184 places, 176/194 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 176/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 154 /154 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2026-05-24 03:48:02] [INFO ] Invariant cache hit.
[2026-05-24 03:48:02] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-24 03:48:02] [INFO ] Invariant cache hit.
[2026-05-24 03:48:02] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 154/154 places, 176/176 transitions.
Support contains 79 out of 154 places after structural reductions.
[2026-05-24 03:48:03] [INFO ] Flatten gal took : 33 ms
[2026-05-24 03:48:03] [INFO ] Flatten gal took : 14 ms
[2026-05-24 03:48:03] [INFO ] Input system was already deterministic with 176 transitions.
Support contains 78 out of 154 places (down from 79) after GAL structural reductions.
RANDOM walk for 40000 steps (199 resets) in 1255 ms. (31 steps per ms) remains 4/61 properties
BEST_FIRST walk for 40002 steps (36 resets) in 172 ms. (231 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (41 resets) in 84 ms. (470 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (40 resets) in 334 ms. (119 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (31 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
[2026-05-24 03:48:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/18 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 70/88 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 200/288 variables, 98/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 42/330 variables, 38/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 156 constraints, problems are : Problem set: 0 solved, 1 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/18 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 70/88 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 200/288 variables, 98/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp33 is UNSAT
After SMT solving in domain Int declared 330/330 variables, and 157 constraints, problems are : Problem set: 1 solved, 0 unsolved in 107 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 202ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2026-05-24 03:48:04] [INFO ] Flatten gal took : 9 ms
[2026-05-24 03:48:04] [INFO ] Flatten gal took : 8 ms
[2026-05-24 03:48:04] [INFO ] Input system was already deterministic with 176 transitions.
Computed a total of 28 stabilizing places and 28 stable transitions
Graph (complete) has 282 edges and 154 vertex of which 147 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 154/154 places, 176/176 transitions.
Graph (complete) has 282 edges and 154 vertex of which 147 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 146 transition count 139
Reduce places removed 29 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 32 rules applied. Total rules applied 62 place count 117 transition count 136
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 65 place count 114 transition count 136
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 65 place count 114 transition count 126
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 85 place count 104 transition count 126
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 91 place count 98 transition count 120
Iterating global reduction 3 with 6 rules applied. Total rules applied 97 place count 98 transition count 120
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 97 place count 98 transition count 119
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 99 place count 97 transition count 119
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 102 place count 94 transition count 115
Iterating global reduction 3 with 3 rules applied. Total rules applied 105 place count 94 transition count 115
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 108 place count 91 transition count 112
Iterating global reduction 3 with 3 rules applied. Total rules applied 111 place count 91 transition count 112
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 113 place count 89 transition count 108
Iterating global reduction 3 with 2 rules applied. Total rules applied 115 place count 89 transition count 108
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 117 place count 87 transition count 106
Iterating global reduction 3 with 2 rules applied. Total rules applied 119 place count 87 transition count 106
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 147 place count 73 transition count 92
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 148 place count 72 transition count 91
Iterating global reduction 3 with 1 rules applied. Total rules applied 149 place count 72 transition count 91
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 150 place count 71 transition count 89
Iterating global reduction 3 with 1 rules applied. Total rules applied 151 place count 71 transition count 89
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 152 place count 70 transition count 88
Iterating global reduction 3 with 1 rules applied. Total rules applied 153 place count 70 transition count 88
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 154 place count 70 transition count 88
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 156 place count 68 transition count 86
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 6 rules applied. Total rules applied 162 place count 67 transition count 81
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 167 place count 62 transition count 81
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 167 place count 62 transition count 80
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 169 place count 61 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 171 place count 60 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 173 place count 60 transition count 77
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 6 with 2 rules applied. Total rules applied 175 place count 59 transition count 76
Applied a total of 175 rules in 53 ms. Remains 59 /154 variables (removed 95) and now considering 76/176 (removed 100) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13223599920713734758.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10029592760461531043.kers'
[2026-05-24 03:48:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13223599920713734758.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10029592760461531043.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 76 rows 59 cols 211 entries
Finished phase 1 with 58 SingleSign rule and 0 generalized
[2026-05-24 03:48:04] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10029592760461531043.kers
Total runtime 1 ms.
[2026-05-24 03:48:04] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-24 03:48:04] [INFO ] Invariant cache hit.
[2026-05-24 03:48:04] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2026-05-24 03:48:04] [INFO ] Redundant transitions in 1 ms returned []
Running 74 sub problems to find dead transitions.
[2026-05-24 03:48:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 76/134 variables, 58/59 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 1/135 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/135 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 61 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1775 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 76/134 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 74/134 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 1/135 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (OVERLAPS) 0/135 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 135 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2195 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3983ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 3983ms
Starting structural reductions in SI_CTL mode, iteration 1 : 59/154 places, 76/176 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4123 ms. Remains : 59/154 places, 76/176 transitions.
[2026-05-24 03:48:08] [INFO ] Flatten gal took : 8 ms
[2026-05-24 03:48:08] [INFO ] Flatten gal took : 5 ms
[2026-05-24 03:48:08] [INFO ] Input system was already deterministic with 76 transitions.
[2026-05-24 03:48:08] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:48:08] [INFO ] Flatten gal took : 4 ms
[2026-05-24 03:48:08] [INFO ] Time to serialize gal into /tmp/CTLFireability5824594838461431887.gal : 1 ms
[2026-05-24 03:48:08] [INFO ] Time to serialize properties into /tmp/CTLFireability2291701428587224217.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5824594838461431887.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2291701428587224217.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,4.95225e+06,0.150238,10044,2,1301,5,26329,6,0,306,34663,0


Converting to forward existential form...Done !
original formula: AF(EG((((p56==0)||((p173==1)&&(((p60==0)||(p53==0))||(p175==0))))||((p157==1)&&(p15==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG((((p56==0)||((p173==1)&&(((p60==0)||(p53==0))||(p175==0))))||((p157==1)&&(p15==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t7, t9, t11, t12, t14, t16, t17, t20, t22, t23, t24, t26, t28, t31, t32, t44, t66, t6...286
(forward)formula 0,1,13.8999,422292,1,0,734,2.4269e+06,178,350,1936,3.35779e+06,739
FORMULA DiscoveryGPU-PT-06b-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 176/176 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 136 transition count 158
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 136 transition count 158
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 132 transition count 154
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 132 transition count 154
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 129 transition count 151
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 129 transition count 151
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 126 transition count 148
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 126 transition count 148
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 124 transition count 144
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 124 transition count 144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 123 transition count 143
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 123 transition count 143
Applied a total of 62 rules in 24 ms. Remains 123 /154 variables (removed 31) and now considering 143/176 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8933247145828264046.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-745149792156175394.kers'
[2026-05-24 03:48:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8933247145828264046.kers, --Pflows, --basisKERS=/tmp/petrispot-output-745149792156175394.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 143 rows 123 cols 380 entries
Finished phase 1 with 121 SingleSign rule and 0 generalized
[2026-05-24 03:48:22] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-745149792156175394.kers
Total runtime 0 ms.
[2026-05-24 03:48:22] [INFO ] Implicit Places using invariants in 125 ms returned []
[2026-05-24 03:48:22] [INFO ] Invariant cache hit.
[2026-05-24 03:48:22] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 142 sub problems to find dead transitions.
[2026-05-24 03:48:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 143/266 variables, 123/125 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 7/132 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 0/266 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 132 constraints, problems are : Problem set: 0 solved, 142 unsolved in 5775 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 143/266 variables, 123/132 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 142/274 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (OVERLAPS) 0/266 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 274 constraints, problems are : Problem set: 0 solved, 142 unsolved in 6698 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12491ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 12493ms
Starting structural reductions in LTL mode, iteration 1 : 123/154 places, 143/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12802 ms. Remains : 123/154 places, 143/176 transitions.
[2026-05-24 03:48:35] [INFO ] Flatten gal took : 12 ms
[2026-05-24 03:48:35] [INFO ] Flatten gal took : 7 ms
[2026-05-24 03:48:35] [INFO ] Input system was already deterministic with 143 transitions.
[2026-05-24 03:48:35] [INFO ] Flatten gal took : 5 ms
[2026-05-24 03:48:35] [INFO ] Flatten gal took : 5 ms
[2026-05-24 03:48:35] [INFO ] Time to serialize gal into /tmp/CTLFireability7585428990337325768.gal : 2 ms
[2026-05-24 03:48:35] [INFO ] Time to serialize properties into /tmp/CTLFireability11475989575587436820.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/CTLFireability7585428990337325768.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11475989575587436820.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,9.29108e+08,12.6053,332948,2,27632,5,1.10217e+06,6,0,636,1.94765e+06,0


Converting to forward existential form...Done !
original formula: A(EX((((AF(EX((p63==1))) * EX(((p86==1)&&(p175==1)))) * ((p52==1)&&(((p152==1)||(p171!=1))||((p124==1)&&(p182==1))))) * ((p74==1)||(p177=...330
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!((!(E(TRUE U !(((!(EG(!((p164==1)))) * (p73==1)) * ((p175==1)&&(p9==1)))))) + (((!(EG(!((...833
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t6, t7, t13, t17, t18, t20, t26, t31, t33, t39, t43, t44, t45, t46, t48, t54, t60, t6...343
Detected timeout of ITS tools.
[2026-05-24 03:49:05] [INFO ] Flatten gal took : 6 ms
[2026-05-24 03:49:05] [INFO ] Applying decomposition
[2026-05-24 03:49:05] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9757851824238984703.txt' '-o' '/tmp/graph9757851824238984703.bin' '-w' '/tmp/graph9757851824238984703.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9757851824238984703.bin' '-l' '-1' '-v' '-w' '/tmp/graph9757851824238984703.weights' '-q' '0' '-e' '0.001'
[2026-05-24 03:49:05] [INFO ] Decomposing Gal with order
[2026-05-24 03:49:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 03:49:05] [INFO ] Removed a total of 48 redundant transitions.
[2026-05-24 03:49:05] [INFO ] Flatten gal took : 54 ms
[2026-05-24 03:49:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2026-05-24 03:49:05] [INFO ] Time to serialize gal into /tmp/CTLFireability6484462100121767942.gal : 4 ms
[2026-05-24 03:49:05] [INFO ] Time to serialize properties into /tmp/CTLFireability10882917072114000678.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/CTLFireability6484462100121767942.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10882917072114000678.ctl'

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 -...263
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,9.29108e+08,3.46537,115096,2416,106,149791,1889,349,877905,47,14375,0


Converting to forward existential form...Done !
original formula: A(EX((((AF(EX((i4.u19.p63==1))) * EX(((i0.i1.u17.p86==1)&&(i15.u42.p175==1)))) * ((i2.u14.p52==1)&&(((i10.u25.p152==1)||(i15.u42.p171!=1)...497
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!((!(E(TRUE U !(((!(EG(!((i14.u40.p164==1)))) * (i9.u21.p73==1)) * ((i15.u42.p175==1)&&(i4...1178
Reverse transition relation is NOT exact ! Due to transitions t100, t107, i1.u6.t94, i2.t71, i2.t54, i2.t39, i2.t26, i2.t13, i2.u7.t85, i2.u7.t142, i3.u9.t...538
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 154/154 places, 176/176 transitions.
Graph (complete) has 282 edges and 154 vertex of which 147 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 146 transition count 135
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 113 transition count 135
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 67 place count 113 transition count 124
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 89 place count 102 transition count 124
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 96 place count 95 transition count 116
Iterating global reduction 2 with 7 rules applied. Total rules applied 103 place count 95 transition count 116
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 103 place count 95 transition count 115
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 94 transition count 115
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 109 place count 90 transition count 110
Iterating global reduction 2 with 4 rules applied. Total rules applied 113 place count 90 transition count 110
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 116 place count 87 transition count 107
Iterating global reduction 2 with 3 rules applied. Total rules applied 119 place count 87 transition count 107
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 121 place count 85 transition count 103
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 85 transition count 103
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 125 place count 83 transition count 101
Iterating global reduction 2 with 2 rules applied. Total rules applied 127 place count 83 transition count 101
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 159 place count 67 transition count 85
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 160 place count 66 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 161 place count 66 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 162 place count 65 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 163 place count 65 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 164 place count 64 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 165 place count 64 transition count 81
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 167 place count 62 transition count 79
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 89 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Graph (trivial) has 61 edges and 60 vertex of which 24 / 60 are part of one of the 12 SCC in 2 ms
Free SCC test removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 9 rules applied. Total rules applied 176 place count 48 transition count 72
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 194 place count 42 transition count 60
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 194 place count 42 transition count 54
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 206 place count 36 transition count 54
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 211 place count 31 transition count 44
Iterating global reduction 4 with 5 rules applied. Total rules applied 216 place count 31 transition count 44
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 221 place count 26 transition count 34
Iterating global reduction 4 with 5 rules applied. Total rules applied 226 place count 26 transition count 34
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 231 place count 21 transition count 29
Iterating global reduction 4 with 5 rules applied. Total rules applied 236 place count 21 transition count 29
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 241 place count 16 transition count 19
Iterating global reduction 4 with 5 rules applied. Total rules applied 246 place count 16 transition count 19
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 251 place count 11 transition count 14
Iterating global reduction 4 with 5 rules applied. Total rules applied 256 place count 11 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 257 place count 10 transition count 13
Applied a total of 257 rules in 48 ms. Remains 10 /154 variables (removed 144) and now considering 13/176 (removed 163) transitions.
[2026-05-24 03:49:35] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13782903887995941352.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12987107205333238134.kers'
[2026-05-24 03:49:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13782903887995941352.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12987107205333238134.kers]
Normalized transition count is 11 out of 12 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 11 rows 10 cols 19 entries
Finished phase 1 with 9 SingleSign rule and 0 generalized
[2026-05-24 03:49:35] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12987107205333238134.kers
Total runtime 0 ms.
[2026-05-24 03:49:35] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-24 03:49:35] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2026-05-24 03:49:35] [INFO ] Invariant cache hit.
[2026-05-24 03:49:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-24 03:49:35] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2026-05-24 03:49:35] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2026-05-24 03:49:35] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2026-05-24 03:49:35] [INFO ] Invariant cache hit.
[2026-05-24 03:49:35] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 11/20 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 1/21 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/21 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/22 variables, and 14 constraints, problems are : Problem set: 0 solved, 10 unsolved in 317 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 11/20 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1/21 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/21 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/22 variables, and 24 constraints, problems are : Problem set: 0 solved, 10 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 525ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 526ms
Starting structural reductions in SI_CTL mode, iteration 1 : 10/154 places, 13/176 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 671 ms. Remains : 10/154 places, 13/176 transitions.
[2026-05-24 03:49:36] [INFO ] Flatten gal took : 1 ms
[2026-05-24 03:49:36] [INFO ] Flatten gal took : 1 ms
[2026-05-24 03:49:36] [INFO ] Input system was already deterministic with 13 transitions.
[2026-05-24 03:49:36] [INFO ] Flatten gal took : 1 ms
[2026-05-24 03:49:36] [INFO ] Flatten gal took : 1 ms
[2026-05-24 03:49:36] [INFO ] Time to serialize gal into /tmp/CTLFireability10688830390618283514.gal : 0 ms
[2026-05-24 03:49:36] [INFO ] Time to serialize properties into /tmp/CTLFireability7333507136209934407.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/CTLFireability10688830390618283514.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7333507136209934407.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,1730,0.00459,3924,2,63,5,619,6,0,48,604,0


Converting to forward existential form...Done !
original formula: AF(AG(EF((p183==0))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(E(TRUE U (p183==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t10, t11, Intersection with reachable at each step enabled. (destroyed/reverse/inter...176
(forward)formula 0,1,0.010725,4200,1,0,33,1586,51,17,289,2097,39
FORMULA DiscoveryGPU-PT-06b-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 176/176 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 135 transition count 157
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 135 transition count 157
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 129 transition count 149
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 129 transition count 149
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 125 transition count 145
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 125 transition count 145
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 121 transition count 141
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 121 transition count 141
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 119 transition count 137
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 119 transition count 137
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 118 transition count 136
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 118 transition count 136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 117 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 117 transition count 135
Applied a total of 74 rules in 8 ms. Remains 117 /154 variables (removed 37) and now considering 135/176 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2766705025409990160.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16911465408462995075.kers'
[2026-05-24 03:49:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2766705025409990160.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16911465408462995075.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 135 rows 117 cols 360 entries
Finished phase 1 with 115 SingleSign rule and 0 generalized
[2026-05-24 03:49:36] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16911465408462995075.kers
Total runtime 0 ms.
[2026-05-24 03:49:36] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-24 03:49:36] [INFO ] Invariant cache hit.
[2026-05-24 03:49:36] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2026-05-24 03:49:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 135/252 variables, 117/119 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 6/125 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 0/252 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 125 constraints, problems are : Problem set: 0 solved, 134 unsolved in 5126 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (OVERLAPS) 135/252 variables, 117/125 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 134/259 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (OVERLAPS) 0/252 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 259 constraints, problems are : Problem set: 0 solved, 134 unsolved in 6522 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11673ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 11673ms
Starting structural reductions in LTL mode, iteration 1 : 117/154 places, 135/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11925 ms. Remains : 117/154 places, 135/176 transitions.
[2026-05-24 03:49:48] [INFO ] Flatten gal took : 5 ms
[2026-05-24 03:49:48] [INFO ] Flatten gal took : 9 ms
[2026-05-24 03:49:48] [INFO ] Input system was already deterministic with 135 transitions.
[2026-05-24 03:49:48] [INFO ] Flatten gal took : 5 ms
[2026-05-24 03:49:48] [INFO ] Flatten gal took : 6 ms
[2026-05-24 03:49:48] [INFO ] Time to serialize gal into /tmp/CTLFireability11766250403615238321.gal : 2 ms
[2026-05-24 03:49:48] [INFO ] Time to serialize properties into /tmp/CTLFireability4421975833538531067.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/CTLFireability11766250403615238321.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4421975833538531067.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,7.29953e+08,15.3299,319020,2,27329,5,1.00614e+06,6,0,602,1.91809e+06,0


Converting to forward existential form...Done !
original formula: E((!((AX((p128==1)) * AX((p92==1)))) * !(E(A((p61==1) U (p82==1)) U ((p78==1)&&(p153==1))))) U EF(((p151==1)&&(p182==1))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(!((!(EX(!((p128==1)))) * !(EX(!((p92==1)))))) * !(E(!((E(!((p82==1)) U (!((p61==1)) * !((p82==...250
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t11, t16, t18, t24, t28, t30, t31, t37, t43, t45, t47, t57, t58, t61, t66, t69, t...323
Detected timeout of ITS tools.
[2026-05-24 03:50:18] [INFO ] Flatten gal took : 12 ms
[2026-05-24 03:50:18] [INFO ] Applying decomposition
[2026-05-24 03:50:18] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11105128188201587705.txt' '-o' '/tmp/graph11105128188201587705.bin' '-w' '/tmp/graph11105128188201587705.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11105128188201587705.bin' '-l' '-1' '-v' '-w' '/tmp/graph11105128188201587705.weights' '-q' '0' '-e' '0.001'
[2026-05-24 03:50:18] [INFO ] Decomposing Gal with order
[2026-05-24 03:50:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 03:50:18] [INFO ] Removed a total of 47 redundant transitions.
[2026-05-24 03:50:18] [INFO ] Flatten gal took : 9 ms
[2026-05-24 03:50:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 1 ms.
[2026-05-24 03:50:18] [INFO ] Time to serialize gal into /tmp/CTLFireability39534578675636152.gal : 2 ms
[2026-05-24 03:50:18] [INFO ] Time to serialize properties into /tmp/CTLFireability5043488141320336151.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/CTLFireability39534578675636152.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5043488141320336151.ctl'

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 -...260
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,7.29953e+08,1.23059,39740,1705,139,64584,3185,336,216994,56,22385,0


Converting to forward existential form...Done !
original formula: E((!((AX((i1.u29.p128==1)) * AX((i14.u22.p92==1)))) * !(E(A((i6.u15.p61==1) U (i6.u19.p82==1)) U ((i5.u18.p78==1)&&(i11.u35.p153==1))))) ...200
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(!((!(EX(!((i1.u29.p128==1)))) * !(EX(!((i14.u22.p92==1)))))) * !(E(!((E(!((i6.u19.p82==1)) U (...324
Reverse transition relation is NOT exact ! Due to transitions t90, t95, t129, u39.t4, u39.t5, i1.t80, i1.t69, i1.t57, i1.t28, i1.u4.t85, i1.u10.t70, i1.u16...490
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 176/176 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 135 transition count 157
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 135 transition count 157
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 130 transition count 150
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 130 transition count 150
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 126 transition count 146
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 126 transition count 146
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 122 transition count 142
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 122 transition count 142
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 120 transition count 138
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 120 transition count 138
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 118 transition count 136
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 118 transition count 136
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 116 transition count 134
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 116 transition count 134
Applied a total of 76 rules in 9 ms. Remains 116 /154 variables (removed 38) and now considering 134/176 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11927690428247684063.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16524715946581191626.kers'
[2026-05-24 03:50:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11927690428247684063.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16524715946581191626.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 134 rows 116 cols 357 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-24 03:50:48] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16524715946581191626.kers
Total runtime 0 ms.
[2026-05-24 03:50:48] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-24 03:50:48] [INFO ] Invariant cache hit.
[2026-05-24 03:50:48] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 133 sub problems to find dead transitions.
[2026-05-24 03:50:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 134/250 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 7/125 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 0/250 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 125 constraints, problems are : Problem set: 0 solved, 133 unsolved in 5340 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 134/250 variables, 116/125 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 133/258 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 0/250 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 258 constraints, problems are : Problem set: 0 solved, 133 unsolved in 7855 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13215ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 13216ms
Starting structural reductions in LTL mode, iteration 1 : 116/154 places, 134/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13392 ms. Remains : 116/154 places, 134/176 transitions.
[2026-05-24 03:51:01] [INFO ] Flatten gal took : 24 ms
[2026-05-24 03:51:01] [INFO ] Flatten gal took : 4 ms
[2026-05-24 03:51:01] [INFO ] Input system was already deterministic with 134 transitions.
[2026-05-24 03:51:01] [INFO ] Flatten gal took : 20 ms
[2026-05-24 03:51:01] [INFO ] Flatten gal took : 4 ms
[2026-05-24 03:51:01] [INFO ] Time to serialize gal into /tmp/CTLFireability671948148003085041.gal : 1 ms
[2026-05-24 03:51:01] [INFO ] Time to serialize properties into /tmp/CTLFireability8767292674573897944.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/CTLFireability671948148003085041.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8767292674573897944.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,9.33295e+08,24.3368,573508,2,46491,5,1.86932e+06,6,0,598,3.36798e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-24 03:51:31] [INFO ] Flatten gal took : 6 ms
[2026-05-24 03:51:31] [INFO ] Applying decomposition
[2026-05-24 03:51:31] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15642307420082829711.txt' '-o' '/tmp/graph15642307420082829711.bin' '-w' '/tmp/graph15642307420082829711.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15642307420082829711.bin' '-l' '-1' '-v' '-w' '/tmp/graph15642307420082829711.weights' '-q' '0' '-e' '0.001'
[2026-05-24 03:51:31] [INFO ] Decomposing Gal with order
[2026-05-24 03:51:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 03:51:31] [INFO ] Removed a total of 46 redundant transitions.
[2026-05-24 03:51:31] [INFO ] Flatten gal took : 11 ms
[2026-05-24 03:51:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 1 ms.
[2026-05-24 03:51:31] [INFO ] Time to serialize gal into /tmp/CTLFireability11554749938461594643.gal : 8 ms
[2026-05-24 03:51:31] [INFO ] Time to serialize properties into /tmp/CTLFireability15169856922936567387.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/CTLFireability11554749938461594643.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15169856922936567387.ctl'

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 -...264
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,9.33295e+08,22.2417,511716,4704,136,898482,6988,315,3.48515e+06,60,68872,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 154/154 places, 176/176 transitions.
Graph (complete) has 282 edges and 154 vertex of which 147 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 146 transition count 145
Reduce places removed 23 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 27 rules applied. Total rules applied 51 place count 123 transition count 141
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 55 place count 119 transition count 141
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 55 place count 119 transition count 130
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 77 place count 108 transition count 130
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 87 place count 98 transition count 119
Iterating global reduction 3 with 10 rules applied. Total rules applied 97 place count 98 transition count 119
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 97 place count 98 transition count 118
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 99 place count 97 transition count 118
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 101 place count 95 transition count 116
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 95 transition count 116
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 94 transition count 115
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 94 transition count 115
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 106 place count 93 transition count 113
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 93 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 108 place count 92 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 92 transition count 112
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 129 place count 82 transition count 102
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 130 place count 81 transition count 101
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 81 transition count 101
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 132 place count 80 transition count 99
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 80 transition count 99
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 134 place count 79 transition count 98
Iterating global reduction 3 with 1 rules applied. Total rules applied 135 place count 79 transition count 98
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 79 transition count 98
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 139 place count 77 transition count 96
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 4 rules applied. Total rules applied 143 place count 76 transition count 93
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 4 with 6 rules applied. Total rules applied 149 place count 73 transition count 90
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 153 place count 70 transition count 89
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 153 place count 70 transition count 87
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 157 place count 68 transition count 87
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 6 with 2 rules applied. Total rules applied 159 place count 67 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 161 place count 67 transition count 84
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 7 with 2 rules applied. Total rules applied 163 place count 66 transition count 83
Applied a total of 163 rules in 31 ms. Remains 66 /154 variables (removed 88) and now considering 83/176 (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-15532243106661795976.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17149169630013500954.kers'
[2026-05-24 03:52:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15532243106661795976.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17149169630013500954.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 83 rows 65 cols 192 entries
Finished phase 1 with 65 SingleSign rule and 0 generalized
[2026-05-24 03:52:02] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17149169630013500954.kers
Total runtime 0 ms.
[2026-05-24 03:52:02] [INFO ] Implicit Places using invariants in 122 ms returned []
[2026-05-24 03:52:02] [INFO ] Invariant cache hit.
[2026-05-24 03:52:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 03:52:02] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2026-05-24 03:52:02] [INFO ] Redundant transitions in 1 ms returned []
Running 81 sub problems to find dead transitions.
[2026-05-24 03:52:02] [INFO ] Invariant cache hit.
[2026-05-24 03:52:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 83/148 variables, 65/66 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 1/149 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 0/149 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 68 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2210 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 83/148 variables, 65/66 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 81/148 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 1/149 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 0/149 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 149 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2512 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4733ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 4733ms
Starting structural reductions in SI_CTL mode, iteration 1 : 66/154 places, 83/176 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4945 ms. Remains : 66/154 places, 83/176 transitions.
[2026-05-24 03:52:06] [INFO ] Flatten gal took : 7 ms
[2026-05-24 03:52:06] [INFO ] Flatten gal took : 5 ms
[2026-05-24 03:52:06] [INFO ] Input system was already deterministic with 83 transitions.
[2026-05-24 03:52:06] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:52:06] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:52:06] [INFO ] Time to serialize gal into /tmp/CTLFireability3868984715097695489.gal : 0 ms
[2026-05-24 03:52:06] [INFO ] Time to serialize properties into /tmp/CTLFireability18109989286093742508.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/CTLFireability3868984715097695489.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18109989286093742508.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,5.82672e+06,0.085496,7840,2,631,5,21629,6,0,341,16005,0


Converting to forward existential form...Done !
original formula: EF((AG(((((p42==0)||(p29==0))||((p120==0)||(p175==0)))&&(p123==1))) * A((((p83==1)&&(((p73==1)&&(p175==1))||(((p57==1)&&(p175==1))&&(p125...281
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !(E(TRUE U !(((((p42==0)||(p29==0))||((p120==0)||(p175==0)))&&(p123==1)))))) * !(EG(!(((!(...559
Reverse transition relation is NOT exact ! Due to transitions t2, t7, t15, t20, t27, t34, t68, t70, t78, t79, t80, t81, t82, Intersection with reachable a...223
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,7.16011,249180,1,0,1422,1.34053e+06,213,784,2301,2.08694e+06,1489
FORMULA DiscoveryGPU-PT-06b-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 176/176 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 132 transition count 154
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 132 transition count 154
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 125 transition count 145
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 125 transition count 145
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 63 place count 120 transition count 140
Iterating global reduction 0 with 5 rules applied. Total rules applied 68 place count 120 transition count 140
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 73 place count 115 transition count 135
Iterating global reduction 0 with 5 rules applied. Total rules applied 78 place count 115 transition count 135
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 81 place count 112 transition count 129
Iterating global reduction 0 with 3 rules applied. Total rules applied 84 place count 112 transition count 129
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 87 place count 109 transition count 126
Iterating global reduction 0 with 3 rules applied. Total rules applied 90 place count 109 transition count 126
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 93 place count 106 transition count 123
Iterating global reduction 0 with 3 rules applied. Total rules applied 96 place count 106 transition count 123
Applied a total of 96 rules in 18 ms. Remains 106 /154 variables (removed 48) and now considering 123/176 (removed 53) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4489022369810262124.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-24269918920190618.kers'
[2026-05-24 03:52:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4489022369810262124.kers, --Pflows, --basisKERS=/tmp/petrispot-output-24269918920190618.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 123 rows 106 cols 330 entries
Finished phase 1 with 104 SingleSign rule and 0 generalized
[2026-05-24 03:52:14] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-24269918920190618.kers
Total runtime 1 ms.
[2026-05-24 03:52:14] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-24 03:52:14] [INFO ] Invariant cache hit.
[2026-05-24 03:52:14] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2026-05-24 03:52:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 123/229 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 6/114 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 0/229 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 114 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4303 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/229 variables, 106/114 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 122/236 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 0/229 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 236 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5138 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9455ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 9455ms
Starting structural reductions in LTL mode, iteration 1 : 106/154 places, 123/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9583 ms. Remains : 106/154 places, 123/176 transitions.
[2026-05-24 03:52:23] [INFO ] Flatten gal took : 7 ms
[2026-05-24 03:52:23] [INFO ] Flatten gal took : 4 ms
[2026-05-24 03:52:23] [INFO ] Input system was already deterministic with 123 transitions.
[2026-05-24 03:52:23] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:52:23] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:52:23] [INFO ] Time to serialize gal into /tmp/CTLFireability16153615525171616109.gal : 1 ms
[2026-05-24 03:52:23] [INFO ] Time to serialize properties into /tmp/CTLFireability17428340129117744812.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/CTLFireability16153615525171616109.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17428340129117744812.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,4.94685e+08,12.3828,306384,2,19510,5,1.06725e+06,6,0,548,1.70972e+06,0


Converting to forward existential form...Done !
original formula: AX(EG((p166==0)))
=> equivalent forward existential formula: [(EY(Init) * !(EG((p166==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t12, t15, t16, t19, t24, t27, t28, t30, t36, t39, t40, t42, t48, t51, t52, t54, t...304
Detected timeout of ITS tools.
[2026-05-24 03:52:53] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:52:53] [INFO ] Applying decomposition
[2026-05-24 03:52:53] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2897028297295287176.txt' '-o' '/tmp/graph2897028297295287176.bin' '-w' '/tmp/graph2897028297295287176.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2897028297295287176.bin' '-l' '-1' '-v' '-w' '/tmp/graph2897028297295287176.weights' '-q' '0' '-e' '0.001'
[2026-05-24 03:52:53] [INFO ] Decomposing Gal with order
[2026-05-24 03:52:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 03:52:53] [INFO ] Removed a total of 45 redundant transitions.
[2026-05-24 03:52:53] [INFO ] Flatten gal took : 5 ms
[2026-05-24 03:52:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 11 ms.
[2026-05-24 03:52:53] [INFO ] Time to serialize gal into /tmp/CTLFireability207495732753254564.gal : 2 ms
[2026-05-24 03:52:53] [INFO ] Time to serialize properties into /tmp/CTLFireability9782831862475539166.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/CTLFireability207495732753254564.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9782831862475539166.ctl'

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 -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 176/176 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 134 transition count 156
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 134 transition count 156
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 128 transition count 148
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 128 transition count 148
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 124 transition count 144
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 124 transition count 144
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 64 place count 120 transition count 140
Iterating global reduction 0 with 4 rules applied. Total rules applied 68 place count 120 transition count 140
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 118 transition count 136
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 118 transition count 136
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 116 transition count 134
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 116 transition count 134
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 114 transition count 132
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 114 transition count 132
Applied a total of 80 rules in 22 ms. Remains 114 /154 variables (removed 40) and now considering 132/176 (removed 44) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10863216470332956870.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11221246454759109049.kers'
[2026-05-24 03:53:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10863216470332956870.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11221246454759109049.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 132 rows 114 cols 353 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-05-24 03:53:24] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11221246454759109049.kers
Total runtime 0 ms.
[2026-05-24 03:53:24] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-24 03:53:24] [INFO ] Invariant cache hit.
[2026-05-24 03:53:24] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 131 sub problems to find dead transitions.
[2026-05-24 03:53:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 132/246 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 0/246 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 122 constraints, problems are : Problem set: 0 solved, 131 unsolved in 4902 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 132/246 variables, 114/122 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 131/253 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 0/246 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 253 constraints, problems are : Problem set: 0 solved, 131 unsolved in 6566 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11477ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 11478ms
Starting structural reductions in LTL mode, iteration 1 : 114/154 places, 132/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11745 ms. Remains : 114/154 places, 132/176 transitions.
[2026-05-24 03:53:35] [INFO ] Flatten gal took : 7 ms
[2026-05-24 03:53:35] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:53:35] [INFO ] Input system was already deterministic with 132 transitions.
[2026-05-24 03:53:35] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:53:35] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:53:35] [INFO ] Time to serialize gal into /tmp/CTLFireability13623084175046612525.gal : 1 ms
[2026-05-24 03:53:35] [INFO ] Time to serialize properties into /tmp/CTLFireability17592655820191410802.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/CTLFireability13623084175046612525.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17592655820191410802.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,6.48235e+08,11.9454,306592,2,27072,5,965706,6,0,588,1.90228e+06,0


Converting to forward existential form...Done !
original formula: A(E(((p93==1)&&(p175==1)) U EX(((EF(((p127==1)&&(p175==1))) + (p24!=1)) + ((p34==1)||(p79==1))))) U !(EF((p88!=1))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U (p88!=1))))))) * !(E(!(!(E(TRUE U (p88!=1)))) U (!(E(((p93==1)&&(p175==1)) U EX(((E(...265
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t11, t14, t15, t17, t23, t26, t27, t29, t36, t42, t44, t47, t52, t55, t56, t58, t...318
Detected timeout of ITS tools.
[2026-05-24 03:54:05] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:54:05] [INFO ] Applying decomposition
[2026-05-24 03:54:05] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6315005051268958403.txt' '-o' '/tmp/graph6315005051268958403.bin' '-w' '/tmp/graph6315005051268958403.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6315005051268958403.bin' '-l' '-1' '-v' '-w' '/tmp/graph6315005051268958403.weights' '-q' '0' '-e' '0.001'
[2026-05-24 03:54:05] [INFO ] Decomposing Gal with order
[2026-05-24 03:54:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 03:54:05] [INFO ] Removed a total of 47 redundant transitions.
[2026-05-24 03:54:05] [INFO ] Flatten gal took : 6 ms
[2026-05-24 03:54:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 2 ms.
[2026-05-24 03:54:05] [INFO ] Time to serialize gal into /tmp/CTLFireability11921427600504440279.gal : 6 ms
[2026-05-24 03:54:05] [INFO ] Time to serialize properties into /tmp/CTLFireability2946950674102312727.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/CTLFireability11921427600504440279.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2946950674102312727.ctl'

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 -...263
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,6.48235e+08,7.64326,188704,3248,118,263500,6367,326,1.27607e+06,47,47893,0


Converting to forward existential form...Done !
original formula: A(E(((i4.u21.p93==1)&&(u38.p175==1)) U EX(((EF(((i5.u29.p127==1)&&(u38.p175==1))) + (i6.u9.p24!=1)) + ((i8.u11.p34==1)||(i7.u17.p79==1)))...184
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U (i11.u26.p88!=1))))))) * !(E(!(!(E(TRUE U (i11.u26.p88!=1)))) U (!(E(((i4.u21.p93==1...331
Reverse transition relation is NOT exact ! Due to transitions t127, u38.t4, u38.t5, i3.u4.t86, i4.u6.t82, i4.u21.t42, i4.u39.t2, i5.t79, i5.t68, i5.t55, i5...472
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 154/154 places, 176/176 transitions.
Graph (complete) has 282 edges and 154 vertex of which 147 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 146 transition count 136
Reduce places removed 32 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 114 transition count 134
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 112 transition count 134
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 69 place count 112 transition count 123
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 91 place count 101 transition count 123
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 98 place count 94 transition count 116
Iterating global reduction 3 with 7 rules applied. Total rules applied 105 place count 94 transition count 116
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 105 place count 94 transition count 114
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 109 place count 92 transition count 114
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 112 place count 89 transition count 110
Iterating global reduction 3 with 3 rules applied. Total rules applied 115 place count 89 transition count 110
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 118 place count 86 transition count 107
Iterating global reduction 3 with 3 rules applied. Total rules applied 121 place count 86 transition count 107
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 123 place count 84 transition count 103
Iterating global reduction 3 with 2 rules applied. Total rules applied 125 place count 84 transition count 103
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 127 place count 82 transition count 101
Iterating global reduction 3 with 2 rules applied. Total rules applied 129 place count 82 transition count 101
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 159 place count 67 transition count 86
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 160 place count 66 transition count 85
Iterating global reduction 3 with 1 rules applied. Total rules applied 161 place count 66 transition count 85
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 162 place count 65 transition count 83
Iterating global reduction 3 with 1 rules applied. Total rules applied 163 place count 65 transition count 83
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 164 place count 64 transition count 82
Iterating global reduction 3 with 1 rules applied. Total rules applied 165 place count 64 transition count 82
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 167 place count 62 transition count 80
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 73 edges and 60 vertex of which 56 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 59 edges and 56 vertex of which 24 / 56 are part of one of the 12 SCC in 0 ms
Free SCC test removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 3 with 20 rules applied. Total rules applied 187 place count 44 transition count 59
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 30 rules applied. Total rules applied 217 place count 28 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 218 place count 27 transition count 45
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 222 place count 23 transition count 37
Iterating global reduction 6 with 4 rules applied. Total rules applied 226 place count 23 transition count 37
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 230 place count 19 transition count 29
Iterating global reduction 6 with 4 rules applied. Total rules applied 234 place count 19 transition count 29
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 238 place count 15 transition count 21
Iterating global reduction 6 with 4 rules applied. Total rules applied 242 place count 15 transition count 21
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 246 place count 11 transition count 17
Iterating global reduction 6 with 4 rules applied. Total rules applied 250 place count 11 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 251 place count 11 transition count 16
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 252 place count 11 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 253 place count 10 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 255 place count 8 transition count 13
Applied a total of 255 rules in 36 ms. Remains 8 /154 variables (removed 146) and now considering 13/176 (removed 163) transitions.
[2026-05-24 03:54:35] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7514811858260803572.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2383287977097069014.kers'
[2026-05-24 03:54:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7514811858260803572.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2383287977097069014.kers]
Normalized transition count is 9 out of 10 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 9 rows 8 cols 15 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-24 03:54:35] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2383287977097069014.kers
Total runtime 0 ms.
[2026-05-24 03:54:36] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-24 03:54:36] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
[2026-05-24 03:54:36] [INFO ] Invariant cache hit.
[2026-05-24 03:54:36] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2026-05-24 03:54:36] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2026-05-24 03:54:36] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
[2026-05-24 03:54:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 2/17 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/17 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/18 variables, and 8 constraints, problems are : Problem set: 0 solved, 9 unsolved in 209 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/17 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/18 variables, and 17 constraints, problems are : Problem set: 0 solved, 9 unsolved in 86 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 313ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 314ms
Starting structural reductions in SI_CTL mode, iteration 1 : 8/154 places, 13/176 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 452 ms. Remains : 8/154 places, 13/176 transitions.
[2026-05-24 03:54:36] [INFO ] Flatten gal took : 0 ms
[2026-05-24 03:54:36] [INFO ] Flatten gal took : 1 ms
[2026-05-24 03:54:36] [INFO ] Input system was already deterministic with 13 transitions.
[2026-05-24 03:54:36] [INFO ] Flatten gal took : 0 ms
[2026-05-24 03:54:36] [INFO ] Flatten gal took : 1 ms
[2026-05-24 03:54:36] [INFO ] Time to serialize gal into /tmp/CTLFireability505626413018114443.gal : 0 ms
[2026-05-24 03:54:36] [INFO ] Time to serialize properties into /tmp/CTLFireability5746192887151105956.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/CTLFireability505626413018114443.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5746192887151105956.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,147,0.002087,3784,2,19,5,104,6,0,39,91,0


Converting to forward existential form...Done !
original formula: EG(AF(E((p69==1) U (p79==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(E((p69==1) U (p79==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...171
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.007556,4160,1,0,120,1692,54,85,216,2317,127
FORMULA DiscoveryGPU-PT-06b-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 176/176 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 131 transition count 153
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 131 transition count 153
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 124 transition count 144
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 124 transition count 144
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 65 place count 119 transition count 139
Iterating global reduction 0 with 5 rules applied. Total rules applied 70 place count 119 transition count 139
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 75 place count 114 transition count 134
Iterating global reduction 0 with 5 rules applied. Total rules applied 80 place count 114 transition count 134
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 83 place count 111 transition count 128
Iterating global reduction 0 with 3 rules applied. Total rules applied 86 place count 111 transition count 128
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 89 place count 108 transition count 125
Iterating global reduction 0 with 3 rules applied. Total rules applied 92 place count 108 transition count 125
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 95 place count 105 transition count 122
Iterating global reduction 0 with 3 rules applied. Total rules applied 98 place count 105 transition count 122
Applied a total of 98 rules in 7 ms. Remains 105 /154 variables (removed 49) and now considering 122/176 (removed 54) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9294015735661420818.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14662642265149953255.kers'
[2026-05-24 03:54:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9294015735661420818.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14662642265149953255.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 122 rows 105 cols 328 entries
Finished phase 1 with 103 SingleSign rule and 0 generalized
[2026-05-24 03:54:36] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-14662642265149953255.kers
Total runtime 7 ms.
[2026-05-24 03:54:36] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-24 03:54:36] [INFO ] Invariant cache hit.
[2026-05-24 03:54:36] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2026-05-24 03:54:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 122/227 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 6/113 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 0/227 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 113 constraints, problems are : Problem set: 0 solved, 121 unsolved in 4312 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/227 variables, 105/113 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 121/234 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 234 constraints, problems are : Problem set: 0 solved, 121 unsolved in 4961 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9299ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 9300ms
Starting structural reductions in LTL mode, iteration 1 : 105/154 places, 122/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9449 ms. Remains : 105/154 places, 122/176 transitions.
[2026-05-24 03:54:45] [INFO ] Flatten gal took : 4 ms
[2026-05-24 03:54:45] [INFO ] Flatten gal took : 4 ms
[2026-05-24 03:54:45] [INFO ] Input system was already deterministic with 122 transitions.
[2026-05-24 03:54:45] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:54:45] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:54:45] [INFO ] Time to serialize gal into /tmp/CTLFireability558097316981964759.gal : 1 ms
[2026-05-24 03:54:45] [INFO ] Time to serialize properties into /tmp/CTLFireability1211913239136107525.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/CTLFireability558097316981964759.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1211913239136107525.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.70015e+08,11.8292,288624,2,27997,5,939100,6,0,543,1.7306e+06,0


Converting to forward existential form...Done !
original formula: AF(AX((p72==1)))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((p72==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t11, t14, t15, t17, t23, t26, t27, t29, t35, t38, t39, t41, t47, t50, t51, t53, t...304
Detected timeout of ITS tools.
[2026-05-24 03:55:15] [INFO ] Flatten gal took : 6 ms
[2026-05-24 03:55:15] [INFO ] Applying decomposition
[2026-05-24 03:55:15] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6588206195115123898.txt' '-o' '/tmp/graph6588206195115123898.bin' '-w' '/tmp/graph6588206195115123898.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6588206195115123898.bin' '-l' '-1' '-v' '-w' '/tmp/graph6588206195115123898.weights' '-q' '0' '-e' '0.001'
[2026-05-24 03:55:15] [INFO ] Decomposing Gal with order
[2026-05-24 03:55:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 03:55:15] [INFO ] Removed a total of 45 redundant transitions.
[2026-05-24 03:55:16] [INFO ] Flatten gal took : 10 ms
[2026-05-24 03:55:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 1 ms.
[2026-05-24 03:55:16] [INFO ] Time to serialize gal into /tmp/CTLFireability3328886769707954351.gal : 1 ms
[2026-05-24 03:55:16] [INFO ] Time to serialize properties into /tmp/CTLFireability9191976896442188250.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/CTLFireability3328886769707954351.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9191976896442188250.ctl'

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 -...262
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.70015e+08,22.9364,542912,3971,106,859465,6940,290,3.77626e+06,42,60648,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 176/176 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 134 transition count 156
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 134 transition count 156
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 127 transition count 147
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 127 transition count 147
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 59 place count 122 transition count 142
Iterating global reduction 0 with 5 rules applied. Total rules applied 64 place count 122 transition count 142
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 68 place count 118 transition count 138
Iterating global reduction 0 with 4 rules applied. Total rules applied 72 place count 118 transition count 138
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 116 transition count 134
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 116 transition count 134
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 114 transition count 132
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 114 transition count 132
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 113 transition count 131
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 113 transition count 131
Applied a total of 82 rules in 7 ms. Remains 113 /154 variables (removed 41) and now considering 131/176 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17831077133868209629.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9601313418658285052.kers'
[2026-05-24 03:55:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17831077133868209629.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9601313418658285052.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 131 rows 113 cols 349 entries
Finished phase 1 with 111 SingleSign rule and 0 generalized
[2026-05-24 03:55:46] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9601313418658285052.kers
Total runtime 1 ms.
[2026-05-24 03:55:46] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-24 03:55:46] [INFO ] Invariant cache hit.
[2026-05-24 03:55:46] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2026-05-24 03:55:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (OVERLAPS) 131/244 variables, 113/115 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 6/121 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 0/244 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/244 variables, and 121 constraints, problems are : Problem set: 0 solved, 130 unsolved in 4725 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 131/244 variables, 113/121 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 130/251 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 0/244 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 244/244 variables, and 251 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5447 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10215ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 10215ms
Starting structural reductions in LTL mode, iteration 1 : 113/154 places, 131/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10396 ms. Remains : 113/154 places, 131/176 transitions.
[2026-05-24 03:55:56] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:55:56] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:55:56] [INFO ] Input system was already deterministic with 131 transitions.
[2026-05-24 03:55:56] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:55:56] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:55:56] [INFO ] Time to serialize gal into /tmp/CTLFireability7823485693203202748.gal : 1 ms
[2026-05-24 03:55:56] [INFO ] Time to serialize properties into /tmp/CTLFireability1238606458030314302.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/CTLFireability7823485693203202748.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1238606458030314302.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,6.49611e+08,11.263,284516,2,26658,5,924987,6,0,583,1.72027e+06,0


Converting to forward existential form...Done !
original formula: EG(AX(EG((!(A((p51==1) U (p121==1))) + ((p98==0)&&(p62==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(EG((!(!((E(!((p121==1)) U (!((p51==1)) * !((p121==1)))) + EG(!((p121==1)))))) + ((p98==0)&&(p6...177
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t11, t14, t15, t17, t23, t29, t30, t31, t33, t39, t43, t44, t46, t52, t56, t58, t...320
Detected timeout of ITS tools.
[2026-05-24 03:56:26] [INFO ] Flatten gal took : 8 ms
[2026-05-24 03:56:26] [INFO ] Applying decomposition
[2026-05-24 03:56:26] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15787151431726909101.txt' '-o' '/tmp/graph15787151431726909101.bin' '-w' '/tmp/graph15787151431726909101.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15787151431726909101.bin' '-l' '-1' '-v' '-w' '/tmp/graph15787151431726909101.weights' '-q' '0' '-e' '0.001'
[2026-05-24 03:56:26] [INFO ] Decomposing Gal with order
[2026-05-24 03:56:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 03:56:26] [INFO ] Removed a total of 44 redundant transitions.
[2026-05-24 03:56:26] [INFO ] Flatten gal took : 4 ms
[2026-05-24 03:56:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 1 ms.
[2026-05-24 03:56:26] [INFO ] Time to serialize gal into /tmp/CTLFireability15724612882985942669.gal : 1 ms
[2026-05-24 03:56:26] [INFO ] Time to serialize properties into /tmp/CTLFireability13910124684797515239.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/CTLFireability15724612882985942669.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13910124684797515239.ctl'

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 -...264
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,6.49611e+08,6.49871,187524,2443,117,272524,6249,328,1.39688e+06,51,52116,0


Converting to forward existential form...Done !
original formula: EG(AX(EG((!(A((i7.u14.p51==1) U (i2.u3.p121==1))) + ((i3.u22.p98==0)&&(i3.u17.p62==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(EG((!(!((E(!((i2.u3.p121==1)) U (!((i7.u14.p51==1)) * !((i2.u3.p121==1)))) + EG(!((i2.u3.p121=...216
Reverse transition relation is NOT exact ! Due to transitions u39.t4, u39.t5, i2.t83, i2.t30, i2.u3.t29, i2.u4.t82, i2.u40.t2, i3.t79, i3.t68, i3.t56, i3.t...491
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 176/176 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 133 transition count 155
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 133 transition count 155
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 127 transition count 147
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 127 transition count 147
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 59 place count 122 transition count 142
Iterating global reduction 0 with 5 rules applied. Total rules applied 64 place count 122 transition count 142
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 68 place count 118 transition count 138
Iterating global reduction 0 with 4 rules applied. Total rules applied 72 place count 118 transition count 138
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 116 transition count 134
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 116 transition count 134
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 114 transition count 132
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 114 transition count 132
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 112 transition count 130
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 112 transition count 130
Applied a total of 84 rules in 5 ms. Remains 112 /154 variables (removed 42) and now considering 130/176 (removed 46) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5907994857544654918.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13537462426827100361.kers'
[2026-05-24 03:56:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5907994857544654918.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13537462426827100361.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 130 rows 112 cols 348 entries
Finished phase 1 with 110 SingleSign rule and 0 generalized
[2026-05-24 03:56:56] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13537462426827100361.kers
Total runtime 0 ms.
[2026-05-24 03:56:56] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-24 03:56:56] [INFO ] Invariant cache hit.
[2026-05-24 03:56:56] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2026-05-24 03:56:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 130/242 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 12/126 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 0/242 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 126 constraints, problems are : Problem set: 0 solved, 129 unsolved in 5147 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/242 variables, 112/126 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 129/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 0/242 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 255 constraints, problems are : Problem set: 0 solved, 129 unsolved in 6714 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11868ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 11868ms
Starting structural reductions in LTL mode, iteration 1 : 112/154 places, 130/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12007 ms. Remains : 112/154 places, 130/176 transitions.
[2026-05-24 03:57:08] [INFO ] Flatten gal took : 8 ms
[2026-05-24 03:57:08] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:57:08] [INFO ] Input system was already deterministic with 130 transitions.
[2026-05-24 03:57:08] [INFO ] Flatten gal took : 4 ms
[2026-05-24 03:57:08] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:57:08] [INFO ] Time to serialize gal into /tmp/CTLFireability8886119596021468122.gal : 0 ms
[2026-05-24 03:57:08] [INFO ] Time to serialize properties into /tmp/CTLFireability18081148909751991447.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/CTLFireability8886119596021468122.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18081148909751991447.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,5.94614e+08,16.041,326724,2,41381,5,1.05343e+06,6,0,579,1.99336e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-24 03:57:38] [INFO ] Flatten gal took : 5 ms
[2026-05-24 03:57:38] [INFO ] Applying decomposition
[2026-05-24 03:57:38] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10468393289323285609.txt' '-o' '/tmp/graph10468393289323285609.bin' '-w' '/tmp/graph10468393289323285609.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10468393289323285609.bin' '-l' '-1' '-v' '-w' '/tmp/graph10468393289323285609.weights' '-q' '0' '-e' '0.001'
[2026-05-24 03:57:38] [INFO ] Decomposing Gal with order
[2026-05-24 03:57:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 03:57:38] [INFO ] Removed a total of 46 redundant transitions.
[2026-05-24 03:57:38] [INFO ] Flatten gal took : 7 ms
[2026-05-24 03:57:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 1 ms.
[2026-05-24 03:57:38] [INFO ] Time to serialize gal into /tmp/CTLFireability10030560298051150892.gal : 1 ms
[2026-05-24 03:57:38] [INFO ] Time to serialize properties into /tmp/CTLFireability9064803193004734146.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/CTLFireability10030560298051150892.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9064803193004734146.ctl'

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 -...263
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,5.94614e+08,4.03483,118996,2715,110,146040,2283,318,994169,47,13615,0


Converting to forward existential form...Done !
original formula: EG((AG(EF((i1.u39.p178==1))) + EX((((EG(((i1.u33.p149==0)||(i1.u39.p182==0))) + AG((i1.u5.p144==0))) + ((i3.u10.p26==0)||(u38.p175==0))) ...177
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !(E(TRUE U (i1.u39.p178==1))))) + EX((((EG(((i1.u33.p149==0)||(i1.u39.p182==0))) + !(E(TR...250
Reverse transition relation is NOT exact ! Due to transitions u38.t5, u38.t6, i1.t97, i1.t96, i1.u5.t19, i1.u6.t82, i1.u39.t2, i1.u39.t3, i2.t79, i2.t68, i...484
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 154/154 places, 176/176 transitions.
Graph (complete) has 282 edges and 154 vertex of which 147 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 146 transition count 135
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 113 transition count 135
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 67 place count 113 transition count 124
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 89 place count 102 transition count 124
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 97 place count 94 transition count 115
Iterating global reduction 2 with 8 rules applied. Total rules applied 105 place count 94 transition count 115
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 105 place count 94 transition count 113
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 109 place count 92 transition count 113
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 113 place count 88 transition count 108
Iterating global reduction 2 with 4 rules applied. Total rules applied 117 place count 88 transition count 108
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 120 place count 85 transition count 105
Iterating global reduction 2 with 3 rules applied. Total rules applied 123 place count 85 transition count 105
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 124 place count 84 transition count 103
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 84 transition count 103
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 126 place count 83 transition count 102
Iterating global reduction 2 with 1 rules applied. Total rules applied 127 place count 83 transition count 102
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 157 place count 68 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 158 place count 67 transition count 86
Iterating global reduction 2 with 1 rules applied. Total rules applied 159 place count 67 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 160 place count 66 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 161 place count 66 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 162 place count 65 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 163 place count 65 transition count 83
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 65 transition count 83
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 166 place count 63 transition count 81
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 74 edges and 61 vertex of which 57 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 62 edges and 57 vertex of which 24 / 57 are part of one of the 12 SCC in 0 ms
Free SCC test removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 2 with 22 rules applied. Total rules applied 188 place count 45 transition count 58
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 218 place count 27 transition count 46
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 222 place count 23 transition count 38
Iterating global reduction 4 with 4 rules applied. Total rules applied 226 place count 23 transition count 38
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 230 place count 19 transition count 30
Iterating global reduction 4 with 4 rules applied. Total rules applied 234 place count 19 transition count 30
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 238 place count 15 transition count 22
Iterating global reduction 4 with 4 rules applied. Total rules applied 242 place count 15 transition count 22
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 246 place count 11 transition count 18
Iterating global reduction 4 with 4 rules applied. Total rules applied 250 place count 11 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 251 place count 11 transition count 17
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 252 place count 11 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 253 place count 10 transition count 16
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 255 place count 8 transition count 14
Applied a total of 255 rules in 25 ms. Remains 8 /154 variables (removed 146) and now considering 14/176 (removed 162) transitions.
[2026-05-24 03:58:08] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11064853226372788906.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1909328201015010729.kers'
[2026-05-24 03:58:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11064853226372788906.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1909328201015010729.kers]
Normalized transition count is 10 out of 11 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 10 rows 8 cols 16 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-24 03:58:08] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1909328201015010729.kers
Total runtime 0 ms.
[2026-05-24 03:58:08] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-24 03:58:08] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
[2026-05-24 03:58:08] [INFO ] Invariant cache hit.
[2026-05-24 03:58:08] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2026-05-24 03:58:08] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2026-05-24 03:58:08] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
[2026-05-24 03:58:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 2/18 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/19 variables, and 8 constraints, problems are : Problem set: 0 solved, 10 unsolved in 75 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 2/18 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/19 variables, and 18 constraints, problems are : Problem set: 0 solved, 10 unsolved in 71 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 148ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 148ms
Starting structural reductions in SI_CTL mode, iteration 1 : 8/154 places, 14/176 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 223 ms. Remains : 8/154 places, 14/176 transitions.
[2026-05-24 03:58:09] [INFO ] Flatten gal took : 0 ms
[2026-05-24 03:58:09] [INFO ] Flatten gal took : 0 ms
[2026-05-24 03:58:09] [INFO ] Input system was already deterministic with 14 transitions.
RANDOM walk for 316 steps (16 resets) in 4 ms. (63 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-06b-CTLFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-24 03:58:09] [INFO ] Flatten gal took : 0 ms
[2026-05-24 03:58:09] [INFO ] Flatten gal took : 1 ms
[2026-05-24 03:58:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10756814110185467210.gal : 0 ms
[2026-05-24 03:58:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11242547338799805134.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10756814110185467210.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11242547338799805134.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality11242547338799805134.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.010229,3776,2,11,5,41,6,0,40,22,0
Total reachable state count : 6

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 176/176 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 135 transition count 157
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 135 transition count 157
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 130 transition count 151
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 130 transition count 151
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 127 transition count 148
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 127 transition count 148
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 125 transition count 146
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 125 transition count 146
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 124 transition count 144
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 124 transition count 144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 123 transition count 143
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 123 transition count 143
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 122 transition count 142
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 122 transition count 142
Applied a total of 64 rules in 6 ms. Remains 122 /154 variables (removed 32) and now considering 142/176 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15522470653977414820.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18257284455191334433.kers'
[2026-05-24 03:58:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15522470653977414820.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18257284455191334433.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 142 rows 122 cols 380 entries
Finished phase 1 with 120 SingleSign rule and 0 generalized
[2026-05-24 03:58:09] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18257284455191334433.kers
Total runtime 0 ms.
[2026-05-24 03:58:09] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-24 03:58:09] [INFO ] Invariant cache hit.
[2026-05-24 03:58:09] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 141 sub problems to find dead transitions.
[2026-05-24 03:58:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 142/264 variables, 122/124 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 6/130 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (OVERLAPS) 0/264 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 130 constraints, problems are : Problem set: 0 solved, 141 unsolved in 5677 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (OVERLAPS) 142/264 variables, 122/130 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 141/271 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (OVERLAPS) 0/264 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/264 variables, and 271 constraints, problems are : Problem set: 0 solved, 141 unsolved in 7382 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13068ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 13068ms
Starting structural reductions in LTL mode, iteration 1 : 122/154 places, 142/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13193 ms. Remains : 122/154 places, 142/176 transitions.
[2026-05-24 03:58:22] [INFO ] Flatten gal took : 10 ms
[2026-05-24 03:58:22] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:58:22] [INFO ] Input system was already deterministic with 142 transitions.
[2026-05-24 03:58:22] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:58:22] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:58:22] [INFO ] Time to serialize gal into /tmp/CTLFireability14551194263649783865.gal : 1 ms
[2026-05-24 03:58:22] [INFO ] Time to serialize properties into /tmp/CTLFireability8414447668970421097.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/CTLFireability14551194263649783865.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8414447668970421097.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,8.25107e+08,11.2027,282784,2,20763,5,967728,6,0,631,1.59755e+06,0


Converting to forward existential form...Done !
original formula: A((((EX(AF(!(((p93==1)&&(p175==1))))) + AX((!(AG((p148==1))) * !(((p62==1)||(p150==1)))))) + (EG(((p162==1)&&(p182==1))) + EF((!(((p70==1...365
=> equivalent forward existential formula: [((Init * !(EG(!(!(!((E(!(!(!(EX(!(!(E(TRUE U !((p152==1))))))))) U (!((p63!=1)) * !(!(!(EX(!(!(E(TRUE U !((p152...1006
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t12, t18, t19, t20, t23, t28, t31, t32, t34, t40, t46, t48, t50, t56, t62, t64, t...343
Using saturation style SCC detection
Detected timeout of ITS tools.
[2026-05-24 03:58:52] [INFO ] Flatten gal took : 7 ms
[2026-05-24 03:58:52] [INFO ] Applying decomposition
[2026-05-24 03:58:52] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7934007095420639767.txt' '-o' '/tmp/graph7934007095420639767.bin' '-w' '/tmp/graph7934007095420639767.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7934007095420639767.bin' '-l' '-1' '-v' '-w' '/tmp/graph7934007095420639767.weights' '-q' '0' '-e' '0.001'
[2026-05-24 03:58:52] [INFO ] Decomposing Gal with order
[2026-05-24 03:58:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 03:58:52] [INFO ] Removed a total of 50 redundant transitions.
[2026-05-24 03:58:52] [INFO ] Flatten gal took : 6 ms
[2026-05-24 03:58:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 1 ms.
[2026-05-24 03:58:52] [INFO ] Time to serialize gal into /tmp/CTLFireability10648968566245678008.gal : 2 ms
[2026-05-24 03:58:52] [INFO ] Time to serialize properties into /tmp/CTLFireability15545520878871657166.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/CTLFireability10648968566245678008.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15545520878871657166.ctl'

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 -...264
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,8.25107e+08,10.0354,322556,3326,142,620076,8078,345,2.1654e+06,48,71498,0


Converting to forward existential form...Done !
original formula: A((((EX(AF(!(((u24.p93==1)&&(u42.p175==1))))) + AX((!(AG((i3.u36.p148==1))) * !(((i7.u15.p62==1)||(i3.u37.p150==1)))))) + (EG(((i14.u40.p...512
=> equivalent forward existential formula: [((Init * !(EG(!(!(!((E(!(!(!(EX(!(!(E(TRUE U !((i13.u38.p152==1))))))))) U (!((i3.u16.p63!=1)) * !(!(!(EX(!(!(E...1259
Reverse transition relation is NOT exact ! Due to transitions t135, t138, u24.t46, u42.t4, u42.t5, i2.u3.t94, i3.t108, i3.t91, i3.t64, i3.t62, i3.t19, i3.u...519
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 154/154 places, 176/176 transitions.
Graph (complete) has 282 edges and 154 vertex of which 147 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 146 transition count 135
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 113 transition count 135
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 67 place count 113 transition count 123
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 91 place count 101 transition count 123
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 99 place count 93 transition count 114
Iterating global reduction 2 with 8 rules applied. Total rules applied 107 place count 93 transition count 114
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 107 place count 93 transition count 113
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 109 place count 92 transition count 113
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 113 place count 88 transition count 108
Iterating global reduction 2 with 4 rules applied. Total rules applied 117 place count 88 transition count 108
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 120 place count 85 transition count 105
Iterating global reduction 2 with 3 rules applied. Total rules applied 123 place count 85 transition count 105
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 125 place count 83 transition count 101
Iterating global reduction 2 with 2 rules applied. Total rules applied 127 place count 83 transition count 101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 129 place count 81 transition count 99
Iterating global reduction 2 with 2 rules applied. Total rules applied 131 place count 81 transition count 99
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 161 place count 66 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 162 place count 65 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 163 place count 65 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 164 place count 64 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 165 place count 64 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 166 place count 63 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 167 place count 63 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 169 place count 61 transition count 78
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 7 rules applied. Total rules applied 176 place count 60 transition count 72
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 8 rules applied. Total rules applied 184 place count 54 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 185 place count 53 transition count 70
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 185 place count 53 transition count 69
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 187 place count 52 transition count 69
Applied a total of 187 rules in 14 ms. Remains 52 /154 variables (removed 102) and now considering 69/176 (removed 107) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7429719247456765751.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6420212437285686376.kers'
[2026-05-24 03:59:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7429719247456765751.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6420212437285686376.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 69 rows 51 cols 161 entries
Finished phase 1 with 51 SingleSign rule and 0 generalized
[2026-05-24 03:59:22] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6420212437285686376.kers
Total runtime 0 ms.
[2026-05-24 03:59:22] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-24 03:59:22] [INFO ] Invariant cache hit.
[2026-05-24 03:59:22] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2026-05-24 03:59:22] [INFO ] Redundant transitions in 1 ms returned []
Running 68 sub problems to find dead transitions.
[2026-05-24 03:59:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (OVERLAPS) 69/121 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (OVERLAPS) 0/121 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 53 constraints, problems are : Problem set: 0 solved, 68 unsolved in 974 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (OVERLAPS) 69/121 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 68/121 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (OVERLAPS) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 121 constraints, problems are : Problem set: 0 solved, 68 unsolved in 1277 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2259ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 2259ms
Starting structural reductions in SI_CTL mode, iteration 1 : 52/154 places, 69/176 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2349 ms. Remains : 52/154 places, 69/176 transitions.
[2026-05-24 03:59:24] [INFO ] Flatten gal took : 4 ms
[2026-05-24 03:59:24] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:59:24] [INFO ] Input system was already deterministic with 69 transitions.
[2026-05-24 03:59:24] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:59:24] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:59:24] [INFO ] Time to serialize gal into /tmp/CTLFireability12863982860373697403.gal : 1 ms
[2026-05-24 03:59:24] [INFO ] Time to serialize properties into /tmp/CTLFireability9954772478982367750.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/CTLFireability12863982860373697403.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9954772478982367750.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,1.95518e+06,0.050484,6024,2,918,5,11856,6,0,268,8893,0


Converting to forward existential form...Done !
original formula: EG(AF(AG(((p134==0)||(p175==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!(E(TRUE U !(((p134==0)||(p175==0)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t8, t10, t14, t16, t20, t22, t26, t28, t32, t34, t68, Intersection with reachable at...222
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.325607,18540,1,0,209,81722,172,110,1878,89127,221
FORMULA DiscoveryGPU-PT-06b-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 154/154 places, 176/176 transitions.
Graph (complete) has 282 edges and 154 vertex of which 147 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 146 transition count 146
Reduce places removed 22 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 30 rules applied. Total rules applied 53 place count 124 transition count 138
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 61 place count 116 transition count 138
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 61 place count 116 transition count 125
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 87 place count 103 transition count 125
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 95 place count 95 transition count 116
Iterating global reduction 3 with 8 rules applied. Total rules applied 103 place count 95 transition count 116
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 107 place count 91 transition count 111
Iterating global reduction 3 with 4 rules applied. Total rules applied 111 place count 91 transition count 111
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 114 place count 88 transition count 108
Iterating global reduction 3 with 3 rules applied. Total rules applied 117 place count 88 transition count 108
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 119 place count 86 transition count 104
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 86 transition count 104
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 85 transition count 103
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 85 transition count 103
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 153 place count 70 transition count 88
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 154 place count 69 transition count 87
Iterating global reduction 3 with 1 rules applied. Total rules applied 155 place count 69 transition count 87
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 156 place count 68 transition count 85
Iterating global reduction 3 with 1 rules applied. Total rules applied 157 place count 68 transition count 85
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 158 place count 67 transition count 84
Iterating global reduction 3 with 1 rules applied. Total rules applied 159 place count 67 transition count 84
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 160 place count 67 transition count 84
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 162 place count 65 transition count 82
Applied a total of 162 rules in 15 ms. Remains 65 /154 variables (removed 89) and now considering 82/176 (removed 94) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7911188242162259836.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16234189945546285502.kers'
[2026-05-24 03:59:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7911188242162259836.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16234189945546285502.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 82 rows 63 cols 194 entries
Finished phase 1 with 63 SingleSign rule and 0 generalized
[2026-05-24 03:59:25] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16234189945546285502.kers
Total runtime 0 ms.
[2026-05-24 03:59:25] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-24 03:59:25] [INFO ] Invariant cache hit.
[2026-05-24 03:59:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 03:59:25] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2026-05-24 03:59:25] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2026-05-24 03:59:25] [INFO ] Invariant cache hit.
[2026-05-24 03:59:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 2/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 82/147 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 0/147 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 68 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1568 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 2/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 82/147 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 80/148 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 0/147 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 148 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1941 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3517ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 3518ms
Starting structural reductions in SI_CTL mode, iteration 1 : 65/154 places, 82/176 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3615 ms. Remains : 65/154 places, 82/176 transitions.
[2026-05-24 03:59:28] [INFO ] Flatten gal took : 4 ms
[2026-05-24 03:59:28] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:59:28] [INFO ] Input system was already deterministic with 82 transitions.
[2026-05-24 03:59:28] [INFO ] Flatten gal took : 1 ms
[2026-05-24 03:59:28] [INFO ] Flatten gal took : 1 ms
[2026-05-24 03:59:28] [INFO ] Time to serialize gal into /tmp/CTLFireability8790787243003734535.gal : 1 ms
[2026-05-24 03:59:28] [INFO ] Time to serialize properties into /tmp/CTLFireability10287776998223135635.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/CTLFireability8790787243003734535.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10287776998223135635.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.16927e+07,0.181401,11428,2,2251,5,40538,6,0,333,35519,0


Converting to forward existential form...Done !
original formula: (E((((EG(A((p83==1) U (p45==1))) * EG(A((p18==1) U ((p124==1)&&(p182==1))))) + ((p102==1)&&(p175==1))) * (p125==1)) U (p164==1)) + AG((p5...162
=> equivalent forward existential formula: [(FwdU((Init * !(E((((EG(!((E(!((p45==1)) U (!((p83==1)) * !((p45==1)))) + EG(!((p45==1)))))) * EG(!((E(!(((p124...337
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t6, t12, t15, t18, t20, t22, t26, t36, t38, t51, t53, t77, Intersection with reachab...227
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,0,18.8531,549888,1,0,1660,3.17619e+06,219,840,2342,4.39686e+06,1811
FORMULA DiscoveryGPU-PT-06b-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-05-24 03:59:47] [INFO ] Flatten gal took : 7 ms
[2026-05-24 03:59:47] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:59:47] [INFO ] Applying decomposition
[2026-05-24 03:59:47] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7234502953556410759.txt' '-o' '/tmp/graph7234502953556410759.bin' '-w' '/tmp/graph7234502953556410759.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7234502953556410759.bin' '-l' '-1' '-v' '-w' '/tmp/graph7234502953556410759.weights' '-q' '0' '-e' '0.001'
[2026-05-24 03:59:47] [INFO ] Decomposing Gal with order
[2026-05-24 03:59:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 03:59:47] [INFO ] Removed a total of 51 redundant transitions.
[2026-05-24 03:59:47] [INFO ] Flatten gal took : 7 ms
[2026-05-24 03:59:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-24 03:59:47] [INFO ] Time to serialize gal into /tmp/CTLFireability6537606879356705154.gal : 2 ms
[2026-05-24 03:59:47] [INFO ] Time to serialize properties into /tmp/CTLFireability15110661381436646929.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/CTLFireability6537606879356705154.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15110661381436646929.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 9 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.60913e+09,3.75401,123852,5556,63,200755,1415,391,561173,50,10150,0


Converting to forward existential form...Done !
original formula: A(EX((((AF(EX((i3.u22.p63==1))) * EX(((i1.u27.p86==1)&&(i18.u53.p175==1)))) * ((i6.i1.u16.p52==1)&&(((i17.u48.p152==1)||(i18.u53.p171!=1)...503
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!((!(E(TRUE U !(((!(EG(!((i15.u44.p164==1)))) * (i8.i0.u21.p73==1)) * ((i18.u53.p175==1)&&...1188
Reverse transition relation is NOT exact ! Due to transitions t132, t133, t165, i2.u2.t102, i2.u2.t117, i3.t113, i3.t96, i3.t79, i3.t77, i3.u3.t110, i4.t53...725
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
ITS-tools command line returned an error code 139
[2026-05-24 04:12:21] [INFO ] Applying decomposition
[2026-05-24 04:12:21] [INFO ] Flatten gal took : 5 ms
[2026-05-24 04:12:21] [INFO ] Decomposing Gal with order
[2026-05-24 04:12:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 04:12:21] [INFO ] Removed a total of 49 redundant transitions.
[2026-05-24 04:12:21] [INFO ] Flatten gal took : 6 ms
[2026-05-24 04:12:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 204 labels/synchronizations in 4 ms.
[2026-05-24 04:12:21] [INFO ] Time to serialize gal into /tmp/CTLFireability10606725335495291048.gal : 1 ms
[2026-05-24 04:12:21] [INFO ] Time to serialize properties into /tmp/CTLFireability12986562110447887057.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/CTLFireability10606725335495291048.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12986562110447887057.ctl'

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 -...264
No direction supplied, using forward translation only.
Parsed 9 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.60913e+09,19.1015,480332,714,2123,565458,475470,250,1.85781e+06,213,2.64563e+06,0


Converting to forward existential form...Done !
original formula: A(EX((((AF(EX((i0.i0.i0.i0.u8.p63==1))) * EX(((i0.i0.i0.i0.u8.p86==1)&&(i1.u13.p175==1)))) * ((i0.i0.i0.i0.i0.u7.p52==1)&&(((i0.u11.p152=...578
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!((!(E(TRUE U !(((!(EG(!((i0.u11.p164==1)))) * (i0.i0.i0.i0.u8.p73==1)) * ((i1.u13.p175==1...1361
Reverse transition relation is NOT exact ! Due to transitions t132, t134, t167, i0.t17, i0.u11.t14, i0.u11.t25, i0.u11.t26, i0.u11.t29, i0.u11.t169, i0.i0....948
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
ITS-tools command line returned an error code 139
[2026-05-24 04:18:05] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:18:05] [INFO ] Input system was already deterministic with 176 transitions.
[2026-05-24 04:18:05] [INFO ] Transformed 154 places.
[2026-05-24 04:18:05] [INFO ] Transformed 176 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-24 04:18:05] [INFO ] Time to serialize gal into /tmp/CTLFireability8823040016809048080.gal : 1 ms
[2026-05-24 04:18:05] [INFO ] Time to serialize properties into /tmp/CTLFireability10402229042584285846.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/CTLFireability8823040016809048080.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10402229042584285846.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 9 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.60913e+09,19.2608,502044,2,50223,5,2.0213e+06,6,0,787,3.02981e+06,0


Converting to forward existential form...Done !
original formula: A(EX((((AF(EX((p63==1))) * EX(((p86==1)&&(p175==1)))) * ((p52==1)&&(((p152==1)||(p171!=1))||((p124==1)&&(p182==1))))) * ((p74==1)||(p177=...330
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!((!(E(TRUE U !(((!(EG(!((p164==1)))) * (p73==1)) * ((p175==1)&&(p9==1)))))) + (((!(EG(!((...833
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t7, t9, t10, t11, t14, t17, t25, t26, t29, t34, t37, t43, t45, t46, t50, t53, t56...413
Detected timeout of ITS tools.
Total runtime 3272221 ms.

BK_STOP 1779597728880

--------------------
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="DiscoveryGPU-PT-06b"
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 DiscoveryGPU-PT-06b, 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 r098-tall-177955695400242"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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