Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r146-tall-177961074200458.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is GPUForwardProgress-PT-24a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074200458
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 5.2K Mar 7 11:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Mar 7 11:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 7 11:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 7 11:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 10:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 10:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 7 11:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Mar 7 11:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 7 11:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Mar 7 11:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:37 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 38K Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779728240933

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-24a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 16:57:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 16:57:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 16:57:22] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2026-05-25 16:57:22] [INFO ] Transformed 104 places.
[2026-05-25 16:57:22] [INFO ] Transformed 129 transitions.
[2026-05-25 16:57:22] [INFO ] Found NUPN structural information;
[2026-05-25 16:57:22] [INFO ] Parsed PT model containing 104 places and 129 transitions and 501 arcs in 145 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
Support contains 60 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 103/103 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 103
Applied a total of 1 rules in 16 ms. Remains 103 /104 variables (removed 1) and now considering 103/103 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4200559881836199390.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15352744944405625310.kers'
[2026-05-25 16:57:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4200559881836199390.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15352744944405625310.kers]
Normalized transition count is 102 out of 103 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 102 rows 103 cols 397 entries
Finished phase 1 with 77 SingleSign rule and 1 generalized
[2026-05-25 16:57:22] [INFO ] Computed 25 invariants in 1 ms
Computed 25 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15352744944405625310.kers
Total runtime 2 ms.
[2026-05-25 16:57:22] [INFO ] Implicit Places using invariants in 277 ms returned []
[2026-05-25 16:57:22] [INFO ] Invariant cache hit.
[2026-05-25 16:57:22] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-25 16:57:22] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2026-05-25 16:57:22] [INFO ] Invariant cache hit.
[2026-05-25 16:57:22] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/204 variables, 102/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 24/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 1/205 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 1/206 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 0/206 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 256 constraints, problems are : Problem set: 0 solved, 102 unsolved in 4812 ms.
Refiners :[Domain max(s): 103/103 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/204 variables, 102/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 24/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 102/355 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 1/205 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 1/206 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 12 (OVERLAPS) 0/206 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 358 constraints, problems are : Problem set: 0 solved, 102 unsolved in 13547 ms.
Refiners :[Domain max(s): 103/103 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18460ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 18476ms
Starting structural reductions in LTL mode, iteration 1 : 103/104 places, 103/103 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19022 ms. Remains : 103/104 places, 103/103 transitions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2026-05-25 16:57:41] [INFO ] Invariant cache hit.
[2026-05-25 16:57:41] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-25 16:57:41] [INFO ] Invariant cache hit.
[2026-05-25 16:57:41] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-25 16:57:41] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 193 ms. Remains : 103/103 places, 103/103 transitions.
Support contains 60 out of 103 places after structural reductions.
[2026-05-25 16:57:42] [INFO ] Flatten gal took : 31 ms
[2026-05-25 16:57:42] [INFO ] Flatten gal took : 13 ms
[2026-05-25 16:57:42] [INFO ] Input system was already deterministic with 103 transitions.
Reduction of identical properties reduced properties to check from 71 to 65
RANDOM walk for 40000 steps (104 resets) in 1999 ms. (20 steps per ms) remains 4/65 properties
BEST_FIRST walk for 40004 steps (13 resets) in 124 ms. (320 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 76 ms. (519 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
[2026-05-25 16:57:43] [INFO ] Invariant cache hit.
[2026-05-25 16:57:43] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 23/31 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 72/103 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 72/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 8 (OVERLAPS) 102/205 variables, 103/231 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 24/255 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/255 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/206 variables, 1/256 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 0/256 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/206 variables, 0/256 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 256 constraints, problems are : Problem set: 1 solved, 1 unsolved in 128 ms.
Refiners :[Domain max(s): 103/103 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 20/26 variables, 6/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 20/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 76/102 variables, 19/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 76/127 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 102/204 variables, 102/229 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 24/253 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 1/254 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 0/254 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/205 variables, 1/255 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/205 variables, 1/256 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 0/256 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/206 variables, 1/257 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/206 variables, 0/257 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/206 variables, 0/257 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 257 constraints, problems are : Problem set: 1 solved, 1 unsolved in 323 ms.
Refiners :[Domain max(s): 103/103 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 457ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 47 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 9 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2026-05-25 16:57:43] [INFO ] Flatten gal took : 8 ms
[2026-05-25 16:57:43] [INFO ] Flatten gal took : 15 ms
[2026-05-25 16:57:43] [INFO ] Input system was already deterministic with 103 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 328 edges and 103 vertex of which 78 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.4 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Graph (complete) has 328 edges and 103 vertex of which 78 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 1 place count 78 transition count 84
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 37 place count 60 transition count 84
Applied a total of 37 rules in 17 ms. Remains 60 /103 variables (removed 43) and now considering 84/103 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13176102604430188471.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12031806488387748002.kers'
[2026-05-25 16:57:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13176102604430188471.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12031806488387748002.kers]
Normalized transition count is 83 out of 84 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 83 rows 60 cols 311 entries
Finished phase 1 with 58 SingleSign rule and 1 generalized
[2026-05-25 16:57:44] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12031806488387748002.kers
Total runtime 0 ms.
[2026-05-25 16:57:44] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-25 16:57:44] [INFO ] Invariant cache hit.
[2026-05-25 16:57:44] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-25 16:57:44] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2026-05-25 16:57:44] [INFO ] Redundant transitions in 3 ms returned []
Running 83 sub problems to find dead transitions.
[2026-05-25 16:57:44] [INFO ] Invariant cache hit.
[2026-05-25 16:57:44] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 83/142 variables, 59/119 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 24/143 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 1/143 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (OVERLAPS) 1/144 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 11 (OVERLAPS) 0/144 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 146 constraints, problems are : Problem set: 0 solved, 83 unsolved in 2866 ms.
Refiners :[Domain max(s): 60/60 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 83/142 variables, 59/119 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 24/143 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 83/226 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 1/143 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 1/144 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/144 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 12 (OVERLAPS) 0/144 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 229 constraints, problems are : Problem set: 0 solved, 83 unsolved in 5832 ms.
Refiners :[Domain max(s): 60/60 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8740ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 8741ms
Starting structural reductions in SI_CTL mode, iteration 1 : 60/103 places, 84/103 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8911 ms. Remains : 60/103 places, 84/103 transitions.
[2026-05-25 16:57:52] [INFO ] Flatten gal took : 11 ms
[2026-05-25 16:57:52] [INFO ] Flatten gal took : 6 ms
[2026-05-25 16:57:52] [INFO ] Input system was already deterministic with 84 transitions.
[2026-05-25 16:57:52] [INFO ] Flatten gal took : 5 ms
[2026-05-25 16:57:52] [INFO ] Flatten gal took : 5 ms
[2026-05-25 16:57:52] [INFO ] Time to serialize gal into /tmp/CTLFireability8409318313428304978.gal : 3 ms
[2026-05-25 16:57:52] [INFO ] Time to serialize properties into /tmp/CTLFireability4729959329902432575.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8409318313428304978.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4729959329902432575.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,9.52086e+12,17.8845,471656,2,29339,5,3.07394e+06,6,0,325,2.04056e+06,0


Converting to forward existential form...Done !
original formula: (AG(!(E(!(E((p63==1) U (p95==1))) U (((p83==1)&&(p7==1))&&((p11==1)&&(p2==1)))))) + EG((((p96==1)&&(p99==1))&&(p103==1))))
=> equivalent forward existential formula: [(FwdU(FwdU((Init * !(EG((((p96==1)&&(p99==1))&&(p103==1))))),TRUE),!(E((p63==1) U (p95==1)))) * (((p83==1)&&(p7...192
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t17, t18, t19, t20, t21, t22, t23, t48, t51, t53, t55, t57, t59, t61, t62, t65, t...297
Detected timeout of ITS tools.
[2026-05-25 16:58:23] [INFO ] Flatten gal took : 8 ms
[2026-05-25 16:58:23] [INFO ] Applying decomposition
[2026-05-25 16:58:23] [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/graph9848056069388748304.txt' '-o' '/tmp/graph9848056069388748304.bin' '-w' '/tmp/graph9848056069388748304.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9848056069388748304.bin' '-l' '-1' '-v' '-w' '/tmp/graph9848056069388748304.weights' '-q' '0' '-e' '0.001'
[2026-05-25 16:58:23] [INFO ] Decomposing Gal with order
[2026-05-25 16:58:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 16:58:23] [INFO ] Removed a total of 46 redundant transitions.
[2026-05-25 16:58:23] [INFO ] Flatten gal took : 301 ms
[2026-05-25 16:58:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2026-05-25 16:58:23] [INFO ] Time to serialize gal into /tmp/CTLFireability8703541487050961999.gal : 2 ms
[2026-05-25 16:58:23] [INFO ] Time to serialize properties into /tmp/CTLFireability5803391734059840612.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/CTLFireability8703541487050961999.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5803391734059840612.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,9.52086e+12,0.047293,6552,105,33,6388,191,200,7001,38,424,0


Converting to forward existential form...Done !
original formula: (AG(!(E(!(E((u15.p63==1) U (u23.p95==1))) U (((u20.p83==1)&&(u1.p7==1))&&((u2.p11==1)&&(u0.p2==1)))))) + EG((((u23.p96==1)&&(u24.p99==1))...173
=> equivalent forward existential formula: [(FwdU(FwdU((Init * !(EG((((u23.p96==1)&&(u24.p99==1))&&(u24.p103==1))))),TRUE),!(E((u15.p63==1) U (u23.p95==1))...225
Reverse transition relation is NOT exact ! Due to transitions t18, t19, t20, t21, t22, t23, t48, t51, t53, t55, t57, t59, t61, t62, t65, t66, t69, t70, t72...313
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
(forward)formula 0,0,0.106488,8184,1,0,11064,308,1251,10195,218,978,19449
FORMULA GPUForwardProgress-PT-24a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Graph (complete) has 328 edges and 103 vertex of which 78 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.0 ms
Discarding 25 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 24 Pre rules applied. Total rules applied 1 place count 78 transition count 78
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 49 place count 54 transition count 78
Applied a total of 49 rules in 8 ms. Remains 54 /103 variables (removed 49) and now considering 78/103 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6660597812671919948.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15884933473374511680.kers'
[2026-05-25 16:58:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6660597812671919948.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15884933473374511680.kers]
Normalized transition count is 77 out of 78 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 77 rows 54 cols 299 entries
Finished phase 1 with 52 SingleSign rule and 1 generalized
[2026-05-25 16:58:23] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15884933473374511680.kers
Total runtime 3 ms.
[2026-05-25 16:58:23] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-25 16:58:23] [INFO ] Invariant cache hit.
[2026-05-25 16:58:23] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-25 16:58:23] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2026-05-25 16:58:23] [INFO ] Redundant transitions in 0 ms returned []
Running 77 sub problems to find dead transitions.
[2026-05-25 16:58:23] [INFO ] Invariant cache hit.
[2026-05-25 16:58:23] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 77/130 variables, 53/107 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 24/131 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 1/131 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 1/132 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 0/132 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 134 constraints, problems are : Problem set: 0 solved, 77 unsolved in 2704 ms.
Refiners :[Domain max(s): 54/54 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 77/130 variables, 53/107 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 24/131 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 77/208 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 1/131 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 1/132 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 12 (OVERLAPS) 0/132 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 211 constraints, problems are : Problem set: 0 solved, 77 unsolved in 5233 ms.
Refiners :[Domain max(s): 54/54 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7964ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 7964ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/103 places, 78/103 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8123 ms. Remains : 54/103 places, 78/103 transitions.
[2026-05-25 16:58:31] [INFO ] Flatten gal took : 8 ms
[2026-05-25 16:58:31] [INFO ] Flatten gal took : 3 ms
[2026-05-25 16:58:31] [INFO ] Input system was already deterministic with 78 transitions.
[2026-05-25 16:58:31] [INFO ] Flatten gal took : 11 ms
[2026-05-25 16:58:31] [INFO ] Flatten gal took : 4 ms
[2026-05-25 16:58:31] [INFO ] Time to serialize gal into /tmp/CTLFireability6734445548276581424.gal : 1 ms
[2026-05-25 16:58:31] [INFO ] Time to serialize properties into /tmp/CTLFireability1326699076743879825.ctl : 5 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/CTLFireability6734445548276581424.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1326699076743879825.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,1.69454e+12,0.290253,16208,2,256,5,86611,6,0,295,42896,0


Converting to forward existential form...Done !
original formula: EF(EG(!(A(!((((p48==1)&&(p99==1))&&(p103==1))) U E((((p84==1)&&(p99==1))&&(p103==1)) U (((p16==1)&&(p99==1))&&(p103==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(!((E(!(E((((p84==1)&&(p99==1))&&(p103==1)) U (((p16==1)&&(p99==1))&&(p103==1)))) U (!(!(...366
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t5, t30, t33, t34, t36, t38, t40, t42, t44, t47, t49, t50, t52, t54, t56, t59, t6...296
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,1.59217,57808,1,0,509,513845,188,296,2486,217650,468
FORMULA GPUForwardProgress-PT-24a-CTLFireability-2024-01 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 : 103/103 places, 103/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-617398287010777648.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3222143473457974328.kers'
[2026-05-25 16:58:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-617398287010777648.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3222143473457974328.kers]
Normalized transition count is 102 out of 103 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 102 rows 103 cols 397 entries
Finished phase 1 with 77 SingleSign rule and 1 generalized
[2026-05-25 16:58:33] [INFO ] Computed 25 invariants in 0 ms
Computed 25 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3222143473457974328.kers
Total runtime 0 ms.
[2026-05-25 16:58:33] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-25 16:58:33] [INFO ] Invariant cache hit.
[2026-05-25 16:58:33] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-25 16:58:33] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2026-05-25 16:58:33] [INFO ] Invariant cache hit.
[2026-05-25 16:58:33] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/204 variables, 102/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 24/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 1/205 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 1/206 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 0/206 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 256 constraints, problems are : Problem set: 0 solved, 102 unsolved in 4462 ms.
Refiners :[Domain max(s): 103/103 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/204 variables, 102/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 24/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 102/355 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 1/205 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 1/206 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 12 (OVERLAPS) 0/206 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 358 constraints, problems are : Problem set: 0 solved, 102 unsolved in 13466 ms.
Refiners :[Domain max(s): 103/103 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17955ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 17956ms
Finished structural reductions in LTL mode , in 1 iterations and 18157 ms. Remains : 103/103 places, 103/103 transitions.
[2026-05-25 16:58:51] [INFO ] Flatten gal took : 9 ms
[2026-05-25 16:58:51] [INFO ] Flatten gal took : 5 ms
[2026-05-25 16:58:51] [INFO ] Input system was already deterministic with 103 transitions.
[2026-05-25 16:58:51] [INFO ] Flatten gal took : 4 ms
[2026-05-25 16:58:51] [INFO ] Flatten gal took : 4 ms
[2026-05-25 16:58:51] [INFO ] Time to serialize gal into /tmp/CTLFireability8860149835229416456.gal : 1 ms
[2026-05-25 16:58:51] [INFO ] Time to serialize properties into /tmp/CTLFireability12363278749575033549.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/CTLFireability8860149835229416456.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12363278749575033549.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.68829e+15,0.543851,26628,2,523,5,171148,6,0,516,77607,0


Converting to forward existential form...Done !
original formula: A(EX(A(AG(((p62==1)||(p59==1))) U AX((((p16==1)&&(p99==1))&&((p103==1)&&(p87==1)))))) U EF((A(((A((((p28==1)&&(p99==1))&&(p103==1)) U (((...348
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (!((E(!((E(TRUE U (p87==1)) + ((p102==1)&&(p62==1)))) U (!(((!((E(!((((p42==1)&&(p99==...1772
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t53, Intersection with reachable at each step enabled. (destroyed/reverse/inters...177
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
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,5.31184,176612,1,0,1668,1.39673e+06,258,1042,3926,753180,2105
FORMULA GPUForwardProgress-PT-24a-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2026-05-25 16:58:56] [INFO ] Invariant cache hit.
[2026-05-25 16:58:56] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-25 16:58:56] [INFO ] Invariant cache hit.
[2026-05-25 16:58:57] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-25 16:58:57] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 199 ms. Remains : 103/103 places, 103/103 transitions.
[2026-05-25 16:58:57] [INFO ] Flatten gal took : 8 ms
[2026-05-25 16:58:57] [INFO ] Flatten gal took : 4 ms
[2026-05-25 16:58:57] [INFO ] Input system was already deterministic with 103 transitions.
[2026-05-25 16:58:57] [INFO ] Flatten gal took : 5 ms
[2026-05-25 16:58:57] [INFO ] Flatten gal took : 4 ms
[2026-05-25 16:58:57] [INFO ] Time to serialize gal into /tmp/CTLFireability8660699839901508703.gal : 1 ms
[2026-05-25 16:58:57] [INFO ] Time to serialize properties into /tmp/CTLFireability12236440801304203146.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/CTLFireability8660699839901508703.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12236440801304203146.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.68829e+15,0.557494,26608,2,523,5,171148,6,0,516,77607,0


Converting to forward existential form...Done !
original formula: AG(E((AF(AG((p15==1))) + !(AX(FALSE))) U !((((p22==1)&&(p99==1))&&(p103==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((!(EG(!(!(E(TRUE U !((p15==1))))))) + !(!(EX(!(FALSE))))) U !((((p22==1)&&(p99==1))&&(p1...175
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t53, Intersection with reachable at each step enabled. (destroyed/reverse/inters...177
(forward)formula 0,1,1.1378,34616,1,0,316,254156,235,172,3820,78396,442
FORMULA GPUForwardProgress-PT-24a-CTLFireability-2024-03 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 : 103/103 places, 103/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2026-05-25 16:58:58] [INFO ] Invariant cache hit.
[2026-05-25 16:58:58] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-25 16:58:58] [INFO ] Invariant cache hit.
[2026-05-25 16:58:58] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-25 16:58:58] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 203 ms. Remains : 103/103 places, 103/103 transitions.
[2026-05-25 16:58:58] [INFO ] Flatten gal took : 8 ms
[2026-05-25 16:58:58] [INFO ] Flatten gal took : 4 ms
[2026-05-25 16:58:58] [INFO ] Input system was already deterministic with 103 transitions.
[2026-05-25 16:58:58] [INFO ] Flatten gal took : 4 ms
[2026-05-25 16:58:58] [INFO ] Flatten gal took : 4 ms
[2026-05-25 16:58:58] [INFO ] Time to serialize gal into /tmp/CTLFireability13332632450731969590.gal : 1 ms
[2026-05-25 16:58:58] [INFO ] Time to serialize properties into /tmp/CTLFireability3953639320424868045.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/CTLFireability13332632450731969590.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3953639320424868045.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.68829e+15,0.584463,26624,2,523,5,171148,6,0,516,77607,0


Converting to forward existential form...Done !
original formula: AX(((AG(EF((p82==0))) * (p92==1)) * ((p99==1)&&(p103==1))))
=> equivalent forward existential formula: (([(FwdU(EY(Init),TRUE) * !(E(TRUE U (p82==0))))] = FALSE * [(EY(Init) * !((p92==1)))] = FALSE) * [(EY(Init) * !...189
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t53, Intersection with reachable at each step enabled. (destroyed/reverse/inters...177
(forward)formula 0,1,0.672175,26720,1,0,200,171148,230,110,3766,77607,218
FORMULA GPUForwardProgress-PT-24a-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Graph (complete) has 328 edges and 103 vertex of which 78 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 23 Pre rules applied. Total rules applied 1 place count 77 transition count 78
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 46 rules applied. Total rules applied 47 place count 54 transition count 78
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 0 with 2 rules applied. Total rules applied 49 place count 53 transition count 77
Applied a total of 49 rules in 12 ms. Remains 53 /103 variables (removed 50) and now considering 77/103 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12145255309469267120.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10654986051365385087.kers'
[2026-05-25 16:58:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12145255309469267120.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10654986051365385087.kers]
Normalized transition count is 76 out of 77 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 76 rows 53 cols 224 entries
Finished phase 1 with 51 SingleSign rule and 1 generalized
[2026-05-25 16:58:59] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10654986051365385087.kers
Total runtime 0 ms.
[2026-05-25 16:58:59] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-25 16:58:59] [INFO ] Invariant cache hit.
[2026-05-25 16:58:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 16:58:59] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2026-05-25 16:58:59] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2026-05-25 16:58:59] [INFO ] Invariant cache hit.
[2026-05-25 16:58:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 76/105 variables, 29/59 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 24/129 variables, 24/83 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 24/107 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 1/130 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 108 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1373 ms.
Refiners :[Domain max(s): 53/53 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 76/105 variables, 29/59 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 24/129 variables, 24/88 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 24/112 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 48/160 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 1/130 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (OVERLAPS) 0/130 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 161 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1921 ms.
Refiners :[Domain max(s): 53/53 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3304ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 3304ms
Starting structural reductions in SI_CTL mode, iteration 1 : 53/103 places, 77/103 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3423 ms. Remains : 53/103 places, 77/103 transitions.
[2026-05-25 16:59:02] [INFO ] Flatten gal took : 5 ms
[2026-05-25 16:59:02] [INFO ] Flatten gal took : 4 ms
[2026-05-25 16:59:02] [INFO ] Input system was already deterministic with 77 transitions.
[2026-05-25 16:59:02] [INFO ] Flatten gal took : 3 ms
[2026-05-25 16:59:02] [INFO ] Flatten gal took : 3 ms
[2026-05-25 16:59:02] [INFO ] Time to serialize gal into /tmp/CTLFireability1585326006085228626.gal : 1 ms
[2026-05-25 16:59:02] [INFO ] Time to serialize properties into /tmp/CTLFireability8382409549501934950.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/CTLFireability1585326006085228626.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8382409549501934950.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,1.50624e+12,0.142696,10460,2,703,5,39224,6,0,291,30539,0


Converting to forward existential form...Done !
original formula: AG(AF((p86==0)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((p86==0)))] = FALSE
Hit Full ! (commute/partial/dont) 74/0/3
(forward)formula 0,0,0.183477,10680,1,0,8,39224,20,2,1601,30539,8
FORMULA GPUForwardProgress-PT-24a-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Applied a total of 0 rules in 8 ms. Remains 103 /103 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15348709792066884260.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1006332572896503765.kers'
[2026-05-25 16:59:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15348709792066884260.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1006332572896503765.kers]
Normalized transition count is 102 out of 103 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 102 rows 103 cols 397 entries
Finished phase 1 with 77 SingleSign rule and 1 generalized
[2026-05-25 16:59:02] [INFO ] Computed 25 invariants in 1 ms
Computed 25 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1006332572896503765.kers
Total runtime 2 ms.
[2026-05-25 16:59:02] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-25 16:59:02] [INFO ] Invariant cache hit.
[2026-05-25 16:59:03] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-25 16:59:03] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2026-05-25 16:59:03] [INFO ] Invariant cache hit.
[2026-05-25 16:59:03] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/204 variables, 102/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 24/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 1/205 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 1/206 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 0/206 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 256 constraints, problems are : Problem set: 0 solved, 102 unsolved in 4387 ms.
Refiners :[Domain max(s): 103/103 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/204 variables, 102/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 24/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 102/355 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 1/205 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 1/206 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 12 (OVERLAPS) 0/206 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 358 constraints, problems are : Problem set: 0 solved, 102 unsolved in 13311 ms.
Refiners :[Domain max(s): 103/103 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17718ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 17719ms
Finished structural reductions in LTL mode , in 1 iterations and 17940 ms. Remains : 103/103 places, 103/103 transitions.
[2026-05-25 16:59:20] [INFO ] Flatten gal took : 5 ms
[2026-05-25 16:59:20] [INFO ] Flatten gal took : 3 ms
[2026-05-25 16:59:20] [INFO ] Input system was already deterministic with 103 transitions.
[2026-05-25 16:59:20] [INFO ] Flatten gal took : 3 ms
[2026-05-25 16:59:20] [INFO ] Flatten gal took : 3 ms
[2026-05-25 16:59:20] [INFO ] Time to serialize gal into /tmp/CTLFireability16120594994109764758.gal : 1 ms
[2026-05-25 16:59:20] [INFO ] Time to serialize properties into /tmp/CTLFireability601761077523593936.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/CTLFireability16120594994109764758.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability601761077523593936.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,1.68829e+15,0.594108,26616,2,523,5,171148,6,0,516,77607,0


Converting to forward existential form...Done !
original formula: EF((((AG((p26==1)) * AF((p55==0))) * ((p68==1)&&(p99==1))) * ((p103==1) * ((p19==0) + EX((p67==0))))))
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * ((!(E(TRUE U !((p26==1)))) * !(EG(!((p55==0))))) * ((p68==1)&&(p99==1)))) * (p103==1)) * ...312
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t53, Intersection with reachable at each step enabled. (destroyed/reverse/inters...177
(forward)formula 0,0,1.11688,31060,1,0,342,219499,239,156,3799,77607,499
FORMULA GPUForwardProgress-PT-24a-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Graph (complete) has 328 edges and 103 vertex of which 78 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 24 Pre rules applied. Total rules applied 1 place count 77 transition count 77
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 49 place count 53 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 0 with 2 rules applied. Total rules applied 51 place count 52 transition count 76
Applied a total of 51 rules in 12 ms. Remains 52 /103 variables (removed 51) and now considering 76/103 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16454983803295578050.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13320481095106000243.kers'
[2026-05-25 16:59:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16454983803295578050.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13320481095106000243.kers]
Normalized transition count is 75 out of 76 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 75 rows 52 cols 222 entries
Finished phase 1 with 50 SingleSign rule and 1 generalized
[2026-05-25 16:59:21] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13320481095106000243.kers
Total runtime 0 ms.
[2026-05-25 16:59:22] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-25 16:59:22] [INFO ] Invariant cache hit.
[2026-05-25 16:59:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 16:59:22] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2026-05-25 16:59:22] [INFO ] Redundant transitions in 2 ms returned []
Running 52 sub problems to find dead transitions.
[2026-05-25 16:59:22] [INFO ] Invariant cache hit.
[2026-05-25 16:59:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 75/103 variables, 28/57 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 24/127 variables, 24/81 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 24/105 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 1/128 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (OVERLAPS) 0/128 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 106 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1281 ms.
Refiners :[Domain max(s): 52/52 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 75/103 variables, 28/57 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 24/127 variables, 24/85 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 24/109 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 48/157 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (OVERLAPS) 1/128 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/128 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 12 (OVERLAPS) 0/128 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 158 constraints, problems are : Problem set: 0 solved, 52 unsolved in 2073 ms.
Refiners :[Domain max(s): 52/52 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3364ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 3365ms
Starting structural reductions in SI_CTL mode, iteration 1 : 52/103 places, 76/103 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3480 ms. Remains : 52/103 places, 76/103 transitions.
[2026-05-25 16:59:25] [INFO ] Flatten gal took : 6 ms
[2026-05-25 16:59:25] [INFO ] Flatten gal took : 2 ms
[2026-05-25 16:59:25] [INFO ] Input system was already deterministic with 76 transitions.
[2026-05-25 16:59:25] [INFO ] Flatten gal took : 2 ms
[2026-05-25 16:59:25] [INFO ] Flatten gal took : 2 ms
[2026-05-25 16:59:25] [INFO ] Time to serialize gal into /tmp/CTLFireability2771128396220714006.gal : 1 ms
[2026-05-25 16:59:25] [INFO ] Time to serialize properties into /tmp/CTLFireability18112744256443572598.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/CTLFireability2771128396220714006.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18112744256443572598.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.12968e+12,0.101048,8180,2,526,5,25187,6,0,286,19644,0


Converting to forward existential form...Done !
original formula: EF(AG((p98==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p98==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t4, t7, t8, t10, t12, t14, t16, t19, t21, t23, t24, t26, t28, t30, t33, t35, t37,...289
(forward)formula 0,1,0.174424,9328,1,0,192,36016,173,82,2002,29177,165
FORMULA GPUForwardProgress-PT-24a-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3754679974316417808.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10737167112427525138.kers'
[2026-05-25 16:59:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3754679974316417808.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10737167112427525138.kers]
Normalized transition count is 102 out of 103 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 102 rows 103 cols 397 entries
Finished phase 1 with 77 SingleSign rule and 1 generalized
[2026-05-25 16:59:25] [INFO ] Computed 25 invariants in 0 ms
Computed 25 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10737167112427525138.kers
Total runtime 0 ms.
[2026-05-25 16:59:25] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-25 16:59:25] [INFO ] Invariant cache hit.
[2026-05-25 16:59:25] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-25 16:59:25] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2026-05-25 16:59:25] [INFO ] Invariant cache hit.
[2026-05-25 16:59:25] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/204 variables, 102/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 24/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 1/205 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 1/206 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 0/206 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 256 constraints, problems are : Problem set: 0 solved, 102 unsolved in 4358 ms.
Refiners :[Domain max(s): 103/103 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/204 variables, 102/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 24/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 102/355 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 1/205 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 1/206 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 12 (OVERLAPS) 0/206 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 358 constraints, problems are : Problem set: 0 solved, 102 unsolved in 13294 ms.
Refiners :[Domain max(s): 103/103 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17673ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 17674ms
Finished structural reductions in LTL mode , in 1 iterations and 17863 ms. Remains : 103/103 places, 103/103 transitions.
[2026-05-25 16:59:43] [INFO ] Flatten gal took : 10 ms
[2026-05-25 16:59:43] [INFO ] Flatten gal took : 3 ms
[2026-05-25 16:59:43] [INFO ] Input system was already deterministic with 103 transitions.
[2026-05-25 16:59:43] [INFO ] Flatten gal took : 3 ms
[2026-05-25 16:59:43] [INFO ] Flatten gal took : 3 ms
[2026-05-25 16:59:43] [INFO ] Time to serialize gal into /tmp/CTLFireability463275672482364170.gal : 0 ms
[2026-05-25 16:59:43] [INFO ] Time to serialize properties into /tmp/CTLFireability2280696477950907732.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/CTLFireability463275672482364170.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2280696477950907732.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,1.68829e+15,0.546202,26644,2,523,5,171148,6,0,516,77607,0


Converting to forward existential form...Done !
original formula: E(AX((((AF((p102==1)) * !(AF((p42==1)))) * ((p96==1)&&(p99==1))) * (((p103==1)&&(p59==1))&&((p70==1)&&(p79==1))))) U (E(((A((p83==1) U (p...623
=> equivalent forward existential formula: ([((FwdU(Init,!(EX(!((((!(EG(!((p102==1)))) * !(!(EG(!((p42==1)))))) * ((p96==1)&&(p99==1))) * (((p103==1)&&(p59...1145
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t53, Intersection with reachable at each step enabled. (destroyed/reverse/inters...177
(forward)formula 0,1,10.1992,315740,1,0,2541,2.46789e+06,278,1272,3866,1.27735e+06,3270
FORMULA GPUForwardProgress-PT-24a-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Applied a total of 0 rules in 6 ms. Remains 103 /103 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2026-05-25 16:59:53] [INFO ] Invariant cache hit.
[2026-05-25 16:59:53] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-25 16:59:53] [INFO ] Invariant cache hit.
[2026-05-25 16:59:53] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-25 16:59:54] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 193 ms. Remains : 103/103 places, 103/103 transitions.
[2026-05-25 16:59:54] [INFO ] Flatten gal took : 3 ms
[2026-05-25 16:59:54] [INFO ] Flatten gal took : 3 ms
[2026-05-25 16:59:54] [INFO ] Input system was already deterministic with 103 transitions.
[2026-05-25 16:59:54] [INFO ] Flatten gal took : 2 ms
[2026-05-25 16:59:54] [INFO ] Flatten gal took : 3 ms
[2026-05-25 16:59:54] [INFO ] Time to serialize gal into /tmp/CTLFireability10288596930401653121.gal : 1 ms
[2026-05-25 16:59:54] [INFO ] Time to serialize properties into /tmp/CTLFireability18266256682775163047.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/CTLFireability10288596930401653121.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18266256682775163047.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,1.68829e+15,0.551656,26620,2,523,5,171148,6,0,516,77607,0


Converting to forward existential form...Done !
original formula: E(E((!(A(((p23==1)&&(p31==1)) U EF((p19==1)))) * !(EX(AX((p67==1))))) U !(((E(EX((p39==1)) U ((p82==1)&&(p55==1))) + (p83==1)) + (((((p20...349
=> equivalent forward existential formula: ([FwdG(FwdU(Init,E((!(!((E(!(E(TRUE U (p19==1))) U (!(((p23==1)&&(p31==1))) * !(E(TRUE U (p19==1))))) + EG(!(E(T...823
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t53, Intersection with reachable at each step enabled. (destroyed/reverse/inters...177
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,3.62272,119704,1,0,764,926538,262,494,3939,552605,838
FORMULA GPUForwardProgress-PT-24a-CTLFireability-2024-09 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 : 103/103 places, 103/103 transitions.
Graph (complete) has 328 edges and 103 vertex of which 78 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.2 ms
Discarding 25 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 22 Pre rules applied. Total rules applied 1 place count 77 transition count 79
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 45 place count 55 transition count 79
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 0 with 2 rules applied. Total rules applied 47 place count 54 transition count 78
Applied a total of 47 rules in 12 ms. Remains 54 /103 variables (removed 49) and now considering 78/103 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17928831553719067275.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8909284264344603062.kers'
[2026-05-25 16:59:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17928831553719067275.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8909284264344603062.kers]
Normalized transition count is 77 out of 78 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 77 rows 54 cols 226 entries
Finished phase 1 with 52 SingleSign rule and 1 generalized
[2026-05-25 16:59:57] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8909284264344603062.kers
Total runtime 1 ms.
[2026-05-25 16:59:57] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-25 16:59:57] [INFO ] Invariant cache hit.
[2026-05-25 16:59:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 16:59:57] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2026-05-25 16:59:57] [INFO ] Redundant transitions in 1 ms returned []
Running 54 sub problems to find dead transitions.
[2026-05-25 16:59:57] [INFO ] Invariant cache hit.
[2026-05-25 16:59:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 77/107 variables, 30/61 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 24/131 variables, 24/85 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 24/109 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 1/132 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 110 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1385 ms.
Refiners :[Domain max(s): 54/54 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 77/107 variables, 30/61 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 24/131 variables, 24/91 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 24/115 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 48/163 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 1/132 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 12 (OVERLAPS) 0/132 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 164 constraints, problems are : Problem set: 0 solved, 54 unsolved in 2053 ms.
Refiners :[Domain max(s): 54/54 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3463ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 3463ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/103 places, 78/103 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3584 ms. Remains : 54/103 places, 78/103 transitions.
[2026-05-25 17:00:01] [INFO ] Flatten gal took : 5 ms
[2026-05-25 17:00:01] [INFO ] Flatten gal took : 5 ms
[2026-05-25 17:00:01] [INFO ] Input system was already deterministic with 78 transitions.
[2026-05-25 17:00:01] [INFO ] Flatten gal took : 2 ms
[2026-05-25 17:00:01] [INFO ] Flatten gal took : 2 ms
[2026-05-25 17:00:01] [INFO ] Time to serialize gal into /tmp/CTLFireability9390195540287793849.gal : 1 ms
[2026-05-25 17:00:01] [INFO ] Time to serialize properties into /tmp/CTLFireability2021849149626803379.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/CTLFireability9390195540287793849.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2021849149626803379.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.00831e+12,0.131459,9724,2,524,5,37848,6,0,296,25251,0


Converting to forward existential form...Done !
original formula: EF(EG(((p23==1)&&(p66==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((p23==1)&&(p66==1)))] != FALSE
Hit Full ! (commute/partial/dont) 73/5/5
(forward)formula 0,1,0.178639,9948,1,0,8,37848,19,2,1628,25251,8
FORMULA GPUForwardProgress-PT-24a-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Graph (complete) has 328 edges and 103 vertex of which 78 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.2 ms
Discarding 25 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 1 place count 78 transition count 82
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 41 place count 58 transition count 82
Applied a total of 41 rules in 12 ms. Remains 58 /103 variables (removed 45) and now considering 82/103 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-641911443649290882.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12225580584608479201.kers'
[2026-05-25 17:00:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-641911443649290882.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12225580584608479201.kers]
Normalized transition count is 81 out of 82 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 81 rows 58 cols 307 entries
Finished phase 1 with 56 SingleSign rule and 1 generalized
[2026-05-25 17:00:01] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12225580584608479201.kers
Total runtime 1 ms.
[2026-05-25 17:00:01] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-25 17:00:01] [INFO ] Invariant cache hit.
[2026-05-25 17:00:01] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-25 17:00:01] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2026-05-25 17:00:01] [INFO ] Redundant transitions in 2 ms returned []
Running 81 sub problems to find dead transitions.
[2026-05-25 17:00:01] [INFO ] Invariant cache hit.
[2026-05-25 17:00:01] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 81/138 variables, 57/115 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 24/139 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 1/139 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 1/140 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 0/140 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 142 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2654 ms.
Refiners :[Domain max(s): 58/58 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 25/25 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/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 81/138 variables, 57/115 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 24/139 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 81/220 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 1/139 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (OVERLAPS) 1/140 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 12 (OVERLAPS) 0/140 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 223 constraints, problems are : Problem set: 0 solved, 81 unsolved in 5696 ms.
Refiners :[Domain max(s): 58/58 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8369ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 8369ms
Starting structural reductions in SI_CTL mode, iteration 1 : 58/103 places, 82/103 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8483 ms. Remains : 58/103 places, 82/103 transitions.
[2026-05-25 17:00:09] [INFO ] Flatten gal took : 7 ms
[2026-05-25 17:00:09] [INFO ] Flatten gal took : 4 ms
[2026-05-25 17:00:09] [INFO ] Input system was already deterministic with 82 transitions.
[2026-05-25 17:00:09] [INFO ] Flatten gal took : 2 ms
[2026-05-25 17:00:09] [INFO ] Flatten gal took : 2 ms
[2026-05-25 17:00:09] [INFO ] Time to serialize gal into /tmp/CTLFireability529752666149057423.gal : 0 ms
[2026-05-25 17:00:09] [INFO ] Time to serialize properties into /tmp/CTLFireability12916592791434009952.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/CTLFireability529752666149057423.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12916592791434009952.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,5.35553e+12,24.6459,626544,2,52013,5,4.23243e+06,6,0,315,2.6331e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 17:00:40] [INFO ] Flatten gal took : 2 ms
[2026-05-25 17:00:40] [INFO ] Applying decomposition
[2026-05-25 17:00:40] [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/graph4490491625273182709.txt' '-o' '/tmp/graph4490491625273182709.bin' '-w' '/tmp/graph4490491625273182709.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4490491625273182709.bin' '-l' '-1' '-v' '-w' '/tmp/graph4490491625273182709.weights' '-q' '0' '-e' '0.001'
[2026-05-25 17:00:40] [INFO ] Decomposing Gal with order
[2026-05-25 17:00:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 17:00:40] [INFO ] Removed a total of 46 redundant transitions.
[2026-05-25 17:00:40] [INFO ] Flatten gal took : 5 ms
[2026-05-25 17:00:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 17:00:40] [INFO ] Time to serialize gal into /tmp/CTLFireability16608700269470127382.gal : 6 ms
[2026-05-25 17:00:40] [INFO ] Time to serialize properties into /tmp/CTLFireability8574408482766601461.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/CTLFireability16608700269470127382.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8574408482766601461.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.35553e+12,0.029084,5380,105,33,3463,196,200,3286,38,423,0


Converting to forward existential form...Done !
original formula: (!(E((u23.p95!=1) U (EF(((((u5.p24==1)&&(u24.p99==1))&&(u24.p103==1))||(((u23.p96==1)&&(u24.p99==1))&&(u24.p103==1)))) * AF((A((u8.p35==1...227
=> equivalent forward existential formula: ([((FwdU(Init,(u23.p95!=1)) * E(TRUE U ((((u5.p24==1)&&(u24.p99==1))&&(u24.p103==1))||(((u23.p96==1)&&(u24.p99==...360
Reverse transition relation is NOT exact ! Due to transitions t14, t15, t16, t17, t42, t45, t46, t48, t50, t52, t54, t57, t58, t60, t62, t64, t66, t68, t70...313
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
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 a local SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
(forward)formula 0,0,0.296152,21132,1,0,42676,347,1386,53053,226,1405,51159
FORMULA GPUForwardProgress-PT-24a-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5559706544005782727.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11808829061177344208.kers'
[2026-05-25 17:00:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5559706544005782727.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11808829061177344208.kers]
Normalized transition count is 102 out of 103 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 102 rows 103 cols 397 entries
Finished phase 1 with 77 SingleSign rule and 1 generalized
[2026-05-25 17:00:40] [INFO ] Computed 25 invariants in 2 ms
Computed 25 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11808829061177344208.kers
Total runtime 3 ms.
[2026-05-25 17:00:40] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-25 17:00:40] [INFO ] Invariant cache hit.
[2026-05-25 17:00:40] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-25 17:00:40] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2026-05-25 17:00:40] [INFO ] Invariant cache hit.
[2026-05-25 17:00:40] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/204 variables, 102/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 24/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 1/205 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 1/206 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 0/206 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 256 constraints, problems are : Problem set: 0 solved, 102 unsolved in 4358 ms.
Refiners :[Domain max(s): 103/103 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/204 variables, 102/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 24/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 102/355 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 1/205 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 1/206 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 12 (OVERLAPS) 0/206 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 358 constraints, problems are : Problem set: 0 solved, 102 unsolved in 13190 ms.
Refiners :[Domain max(s): 103/103 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17566ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 17567ms
Finished structural reductions in LTL mode , in 1 iterations and 17770 ms. Remains : 103/103 places, 103/103 transitions.
[2026-05-25 17:00:58] [INFO ] Flatten gal took : 5 ms
[2026-05-25 17:00:58] [INFO ] Flatten gal took : 3 ms
[2026-05-25 17:00:58] [INFO ] Input system was already deterministic with 103 transitions.
[2026-05-25 17:00:58] [INFO ] Flatten gal took : 2 ms
[2026-05-25 17:00:58] [INFO ] Flatten gal took : 4 ms
[2026-05-25 17:00:58] [INFO ] Time to serialize gal into /tmp/CTLFireability15669278417241134693.gal : 1 ms
[2026-05-25 17:00:58] [INFO ] Time to serialize properties into /tmp/CTLFireability16968501493033532435.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/CTLFireability15669278417241134693.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16968501493033532435.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,1.68829e+15,0.590137,26644,2,523,5,171148,6,0,516,77607,0


Converting to forward existential form...Done !
original formula: E(!(A(EG(E((p47==1) U (p58==1))) U AX(EX((((p16==1)&&(p99==1))&&(p103==1)))))) U EG((!(AF((((p32==1)&&(p99==1))&&(p103==1)))) * EG((((p7=...212
=> equivalent forward existential formula: [FwdG(FwdU(Init,!(!((E(!(!(EX(!(EX((((p16==1)&&(p99==1))&&(p103==1))))))) U (!(EG(E((p47==1) U (p58==1)))) * !(!...391
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t53, Intersection with reachable at each step enabled. (destroyed/reverse/inters...177
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,10.4543,309700,1,0,1604,2.30823e+06,256,930,3777,1.40143e+06,2063
FORMULA GPUForwardProgress-PT-24a-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2026-05-25 17:01:08] [INFO ] Invariant cache hit.
[2026-05-25 17:01:08] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-25 17:01:08] [INFO ] Invariant cache hit.
[2026-05-25 17:01:08] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-25 17:01:08] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 216 ms. Remains : 103/103 places, 103/103 transitions.
[2026-05-25 17:01:08] [INFO ] Flatten gal took : 3 ms
[2026-05-25 17:01:08] [INFO ] Flatten gal took : 2 ms
[2026-05-25 17:01:08] [INFO ] Input system was already deterministic with 103 transitions.
[2026-05-25 17:01:08] [INFO ] Flatten gal took : 2 ms
[2026-05-25 17:01:08] [INFO ] Flatten gal took : 2 ms
[2026-05-25 17:01:08] [INFO ] Time to serialize gal into /tmp/CTLFireability16372173647019285340.gal : 1 ms
[2026-05-25 17:01:08] [INFO ] Time to serialize properties into /tmp/CTLFireability14417441323102302778.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/CTLFireability16372173647019285340.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14417441323102302778.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,1.68829e+15,0.617972,26640,2,523,5,171148,6,0,516,77607,0


Converting to forward existential form...Done !
original formula: EF(AX((((p14==1)&&(p99==1))&&(p103==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((((p14==1)&&(p99==1))&&(p103==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t53, Intersection with reachable at each step enabled. (destroyed/reverse/inters...177
(forward)formula 0,1,0.701474,26732,1,0,197,171148,222,108,3670,77607,212
FORMULA GPUForwardProgress-PT-24a-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2026-05-25 17:01:09] [INFO ] Invariant cache hit.
[2026-05-25 17:01:09] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-25 17:01:09] [INFO ] Invariant cache hit.
[2026-05-25 17:01:09] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-25 17:01:09] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 230 ms. Remains : 103/103 places, 103/103 transitions.
[2026-05-25 17:01:09] [INFO ] Flatten gal took : 2 ms
[2026-05-25 17:01:09] [INFO ] Flatten gal took : 2 ms
[2026-05-25 17:01:09] [INFO ] Input system was already deterministic with 103 transitions.
[2026-05-25 17:01:09] [INFO ] Flatten gal took : 2 ms
[2026-05-25 17:01:09] [INFO ] Flatten gal took : 2 ms
[2026-05-25 17:01:09] [INFO ] Time to serialize gal into /tmp/CTLFireability12417185850860500843.gal : 0 ms
[2026-05-25 17:01:09] [INFO ] Time to serialize properties into /tmp/CTLFireability6504827077867636288.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/CTLFireability12417185850860500843.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6504827077867636288.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.68829e+15,0.59219,26616,2,523,5,171148,6,0,516,77607,0


Converting to forward existential form...Done !
original formula: EF((E(EG((p71==1)) U !(E((((p86==1)&&(p99==1))&&((p103==1)&&(p79==1))) U ((((p4==1)&&(p99==1))&&((p103==1)&&(p10==1)))&&((p99==1)&&(p103=...326
=> equivalent forward existential formula: ([(FwdU(FwdU((FwdU(Init,TRUE) * E(EG((p71==1)) U !(E((((p86==1)&&(p99==1))&&((p103==1)&&(p79==1))) U ((((p4==1)&...576
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t53, Intersection with reachable at each step enabled. (destroyed/reverse/inters...177
Hit Full ! (commute/partial/dont) 48/60/55
(forward)formula 0,1,1.15399,33216,1,0,367,250355,245,178,3921,77607,535
FORMULA GPUForwardProgress-PT-24a-CTLFireability-2024-14 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 : 103/103 places, 103/103 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2026-05-25 17:01:11] [INFO ] Invariant cache hit.
[2026-05-25 17:01:11] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-25 17:01:11] [INFO ] Invariant cache hit.
[2026-05-25 17:01:11] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-25 17:01:11] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 201 ms. Remains : 103/103 places, 103/103 transitions.
[2026-05-25 17:01:11] [INFO ] Flatten gal took : 4 ms
[2026-05-25 17:01:11] [INFO ] Flatten gal took : 3 ms
[2026-05-25 17:01:11] [INFO ] Input system was already deterministic with 103 transitions.
[2026-05-25 17:01:11] [INFO ] Flatten gal took : 1 ms
[2026-05-25 17:01:11] [INFO ] Flatten gal took : 3 ms
[2026-05-25 17:01:11] [INFO ] Time to serialize gal into /tmp/CTLFireability14818330497842098639.gal : 1 ms
[2026-05-25 17:01:11] [INFO ] Time to serialize properties into /tmp/CTLFireability11840481216338225852.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/CTLFireability14818330497842098639.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11840481216338225852.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,1.68829e+15,0.616072,26628,2,523,5,171148,6,0,516,77607,0


Converting to forward existential form...Done !
original formula: (AX(!(A(AG(E((p54==1) U (((p30==1)&&(p99==1))&&(p103==1)))) U (p91==1)))) * E(!(EG(E(((p67==1)||(p54==1)) U ((p63==1)&&(p7==1))))) U EG((...252
=> equivalent forward existential formula: ([((EY(Init) * !(EG(!((p91==1))))) * !(E(!((p91==1)) U (!(!(E(TRUE U !(E((p54==1) U (((p30==1)&&(p99==1))&&(p103...432
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t53, Intersection with reachable at each step enabled. (destroyed/reverse/inters...177
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,1.53658,48424,1,0,381,312497,252,224,3914,184627,492
FORMULA GPUForwardProgress-PT-24a-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-05-25 17:01:12] [INFO ] Flatten gal took : 3 ms
[2026-05-25 17:01:12] [INFO ] Flatten gal took : 3 ms
Total runtime 230837 ms.

BK_STOP 1779728472933

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPUForwardProgress-PT-24a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-24a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r146-tall-177961074200458"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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