fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r338-smll-178021499200249
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for ErlangenMainframeV2-PT-bP06C06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15230.508 1700494.00 1796197.00 5196.10 TTFFFFFTTFFTTTTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r338-smll-178021499200249.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 ErlangenMainframeV2-PT-bP06C06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499200249
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 7.2K May 27 09:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 27 09:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 27 09:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 27 09:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 27 10:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 27 10:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 27 10:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 10:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 7.5K May 27 09:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K May 27 09:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 27 09:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K May 27 09:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 8 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 1.9M May 26 18:17 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 ErlangenMainframeV2-PT-bP06C06-CTLCardinality-2024-00
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-CTLCardinality-2024-01
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-CTLCardinality-2024-02
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-CTLCardinality-2024-03
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-CTLCardinality-2024-04
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-CTLCardinality-2024-05
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-CTLCardinality-2024-06
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-CTLCardinality-2024-07
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-CTLCardinality-2024-08
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-CTLCardinality-2024-09
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-CTLCardinality-2024-10
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-CTLCardinality-2024-11
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-CTLCardinality-2024-12
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-CTLCardinality-2024-13
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-CTLCardinality-2024-14
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1780380077826

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV2-PT-bP06C06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-06-02 06:01:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-02 06:01:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-02 06:01:21] [INFO ] Load time of PNML (sax parser for PT used): 618 ms
[2026-06-02 06:01:21] [INFO ] Transformed 279 places.
[2026-06-02 06:01:21] [INFO ] Transformed 2491 transitions.
[2026-06-02 06:01:21] [INFO ] Found NUPN structural information;
[2026-06-02 06:01:21] [INFO ] Parsed PT model containing 279 places and 2491 transitions and 38716 arcs in 912 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 28 ms.
Support contains 105 out of 279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 2491/2491 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 247 transition count 2459
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 247 transition count 2459
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 71 place count 240 transition count 2452
Iterating global reduction 0 with 7 rules applied. Total rules applied 78 place count 240 transition count 2452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 239 transition count 2209
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 239 transition count 2209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 238 transition count 1723
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 238 transition count 1723
Applied a total of 82 rules in 295 ms. Remains 238 /279 variables (removed 41) and now considering 1723/2491 (removed 768) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7966310949840628344.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2479869245694781384.kers'
[2026-06-02 06:01:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7966310949840628344.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2479869245694781384.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 1723 rows 238 cols 26002 entries
Finished phase 1 with 215 SingleSign rule and 3 generalized
[2026-06-02 06:01:22] [INFO ] Computed 20 invariants in 17 ms
Computed 20 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-2479869245694781384.kers
Total runtime 26 ms.
[2026-06-02 06:01:24] [INFO ] Implicit Places using invariants in 2258 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2325 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 237/279 places, 1723/2491 transitions.
Applied a total of 0 rules in 22 ms. Remains 237 /237 variables (removed 0) and now considering 1723/1723 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2673 ms. Remains : 237/279 places, 1723/2491 transitions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 1723/1723 transitions.
Applied a total of 0 rules in 13 ms. Remains 237 /237 variables (removed 0) and now considering 1723/1723 (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-13055628749935352109.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8898819019675929758.kers'
[2026-06-02 06:01:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13055628749935352109.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8898819019675929758.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 1723 rows 237 cols 24544 entries
Finished phase 1 with 215 SingleSign rule and 3 generalized
[2026-06-02 06:01:24] [INFO ] Computed 19 invariants in 16 ms
Computed 19 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-8898819019675929758.kers
Total runtime 24 ms.
[2026-06-02 06:01:24] [INFO ] Implicit Places using invariants in 528 ms returned []
[2026-06-02 06:01:24] [INFO ] Invariant cache hit.
[2026-06-02 06:01:26] [INFO ] Implicit Places using invariants and state equation in 1226 ms returned []
Implicit Place search using SMT with State Equation took 1758 ms to find 0 implicit places.
Running 1722 sub problems to find dead transitions.
[2026-06-02 06:01:26] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1722 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/1960 variables, and 7 constraints, problems are : Problem set: 0 solved, 1722 unsolved in 30111 ms.
Refiners :[Positive P Invariants (semi-flows): 0/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/237 constraints, PredecessorRefiner: 1722/239 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1722 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1722 unsolved
At refinement iteration 2 (OVERLAPS) 1/237 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 1722 unsolved
SMT process timed out in 64427ms, After SMT, problems are : Problem set: 0 solved, 1722 unsolved
Search for dead transitions found 0 dead transitions in 64491ms
Finished structural reductions in LTL mode , in 1 iterations and 66330 ms. Remains : 237/237 places, 1723/1723 transitions.
Support contains 105 out of 237 places after structural reductions.
[2026-06-02 06:02:31] [INFO ] Flatten gal took : 668 ms
[2026-06-02 06:02:32] [INFO ] Flatten gal took : 314 ms
[2026-06-02 06:02:32] [INFO ] Input system was already deterministic with 1723 transitions.
Support contains 101 out of 237 places (down from 105) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 8230 ms. (4 steps per ms) remains 17/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
[2026-06-02 06:02:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 134/166 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 71/237 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 1723/1960 variables, 237/256 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1960 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/1960 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1960/1960 variables, and 256 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1803 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 16/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 134/166 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp48 is UNSAT
At refinement iteration 4 (OVERLAPS) 71/237 variables, 7/20 constraints. Problems are: Problem set: 1 solved, 15 unsolved
SMT process timed out in 7364ms, After SMT, problems are : Problem set: 1 solved, 15 unsolved
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 30 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 1723/1723 transitions.
Graph (trivial) has 173 edges and 237 vertex of which 12 / 237 are part of one of the 5 SCC in 9 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 230 transition count 1657
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 67 rules applied. Total rules applied 121 place count 177 transition count 1643
Reduce places removed 6 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 9 rules applied. Total rules applied 130 place count 171 transition count 1640
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 133 place count 168 transition count 1640
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 133 place count 168 transition count 1632
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 149 place count 160 transition count 1632
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 162 place count 147 transition count 1619
Iterating global reduction 4 with 13 rules applied. Total rules applied 175 place count 147 transition count 1619
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 176 place count 147 transition count 1618
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 176 place count 147 transition count 1616
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 180 place count 145 transition count 1616
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 184 place count 141 transition count 1331
Iterating global reduction 5 with 4 rules applied. Total rules applied 188 place count 141 transition count 1331
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 190 place count 139 transition count 791
Iterating global reduction 5 with 2 rules applied. Total rules applied 192 place count 139 transition count 791
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 258 place count 106 transition count 758
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 260 place count 104 transition count 682
Iterating global reduction 5 with 2 rules applied. Total rules applied 262 place count 104 transition count 682
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 263 place count 103 transition count 538
Iterating global reduction 5 with 1 rules applied. Total rules applied 264 place count 103 transition count 538
Performed 6 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 276 place count 97 transition count 564
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 279 place count 97 transition count 561
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 283 place count 97 transition count 557
Free-agglomeration rule applied 9 times.
Iterating global reduction 6 with 9 rules applied. Total rules applied 292 place count 97 transition count 548
Reduce places removed 9 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 306 place count 88 transition count 543
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 308 place count 88 transition count 899
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 310 place count 86 transition count 899
Applied a total of 310 rules in 659 ms. Remains 86 /237 variables (removed 151) and now considering 899/1723 (removed 824) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 660 ms. Remains : 86/237 places, 899/1723 transitions.
RANDOM walk for 40000 steps (11 resets) in 3276 ms. (12 steps per ms) remains 1/15 properties
BEST_FIRST walk for 23526 steps (5 resets) in 164 ms. (142 steps per ms) remains 0/1 properties
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2026-06-02 06:02:44] [INFO ] Flatten gal took : 186 ms
[2026-06-02 06:02:44] [INFO ] Flatten gal took : 210 ms
[2026-06-02 06:02:45] [INFO ] Input system was already deterministic with 1723 transitions.
Computed a total of 23 stabilizing places and 23 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 1723/1723 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 194 transition count 1519
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 194 transition count 1519
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 107 place count 173 transition count 895
Iterating global reduction 0 with 21 rules applied. Total rules applied 128 place count 173 transition count 895
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 139 place count 162 transition count 295
Ensure Unique test removed 3 places
Iterating global reduction 0 with 14 rules applied. Total rules applied 153 place count 159 transition count 295
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 159 place count 153 transition count 200
Iterating global reduction 0 with 6 rules applied. Total rules applied 165 place count 153 transition count 200
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 168 place count 150 transition count 195
Iterating global reduction 0 with 3 rules applied. Total rules applied 171 place count 150 transition count 195
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 172 place count 149 transition count 194
Iterating global reduction 0 with 1 rules applied. Total rules applied 173 place count 149 transition count 194
Applied a total of 173 rules in 133 ms. Remains 149 /237 variables (removed 88) and now considering 194/1723 (removed 1529) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8692916871854128450.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7695437008672419661.kers'
[2026-06-02 06:02:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8692916871854128450.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7695437008672419661.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 194 rows 149 cols 664 entries
Finished phase 1 with 131 SingleSign rule and 2 generalized
[2026-06-02 06:02:45] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-7695437008672419661.kers
Total runtime 5 ms.
[2026-06-02 06:02:45] [INFO ] Implicit Places using invariants in 119 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 121 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 148/237 places, 194/1723 transitions.
Applied a total of 0 rules in 7 ms. Remains 148 /148 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 262 ms. Remains : 148/237 places, 194/1723 transitions.
[2026-06-02 06:02:45] [INFO ] Flatten gal took : 5 ms
[2026-06-02 06:02:45] [INFO ] Flatten gal took : 5 ms
[2026-06-02 06:02:45] [INFO ] Input system was already deterministic with 194 transitions.
[2026-06-02 06:02:45] [INFO ] Flatten gal took : 6 ms
[2026-06-02 06:02:45] [INFO ] Flatten gal took : 5 ms
[2026-06-02 06:02:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality6791273184040048689.gal : 5 ms
[2026-06-02 06:02:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality2256068640832185227.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6791273184040048689.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2256068640832185227.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.89217e+11,2.33039,56040,2,18208,5,205745,6,0,788,223005,0


Converting to forward existential form...Done !
original formula: (EF((EF(((EF((p248==0)) + (p170==0)) + (p96==1))) * !(A((p230!=0) U AF(((p257==0)||(p123==1))))))) * EG(AG((EF((p258==0)) + AX((p63==1)))...158
=> equivalent forward existential formula: [FwdG((Init * E(TRUE U (E(TRUE U ((E(TRUE U (p248==0)) + (p170==0)) + (p96==1))) * !(!((E(!(!(EG(!(((p257==0)||(...342
Reverse transition relation is NOT exact ! Due to transitions t7, t16, t21, t25, t30, t34, t75, t76, t79, t86, t92, t96, t98, t99, t100, t102, t104, t105, ...399
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2026-06-02 06:03:15] [INFO ] Flatten gal took : 10 ms
[2026-06-02 06:03:15] [INFO ] Applying decomposition
[2026-06-02 06:03:15] [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/graph9409240567690508161.txt' '-o' '/tmp/graph9409240567690508161.bin' '-w' '/tmp/graph9409240567690508161.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9409240567690508161.bin' '-l' '-1' '-v' '-w' '/tmp/graph9409240567690508161.weights' '-q' '0' '-e' '0.001'
[2026-06-02 06:03:15] [INFO ] Decomposing Gal with order
[2026-06-02 06:03:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-02 06:03:15] [INFO ] Removed a total of 211 redundant transitions.
[2026-06-02 06:03:15] [INFO ] Flatten gal took : 117 ms
[2026-06-02 06:03:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 20 ms.
[2026-06-02 06:03:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality14366136232556861996.gal : 15 ms
[2026-06-02 06:03:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality2082600821076394754.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/CTLCardinality14366136232556861996.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2082600821076394754.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,1.89217e+11,0.200972,8128,699,70,8961,506,555,8808,100,1134,0


Converting to forward existential form...Done !
original formula: (EF((EF(((EF((i11.i1.u48.p248==0)) + (i5.u25.p170==0)) + (i4.u14.p96==1))) * !(A((i9.i0.u38.p230!=0) U AF(((i10.u44.p257==0)||(i7.u18.p12...222
=> equivalent forward existential formula: [FwdG((Init * E(TRUE U (E(TRUE U ((E(TRUE U (i11.i1.u48.p248==0)) + (i5.u25.p170==0)) + (i4.u14.p96==1))) * !(!(...436
Reverse transition relation is NOT exact ! Due to transitions t21, t34, t75, t99, t105, t114, t124, t125, t126, t127, i1.i0.t120, i1.i0.t175, i1.i0.u5.t118...596
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 2
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,1,1.37018,39660,1,0,74329,1582,3924,114472,565,3207,160909
FORMULA ErlangenMainframeV2-PT-bP06C06-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 237/237 places, 1723/1723 transitions.
Graph (trivial) has 202 edges and 237 vertex of which 12 / 237 are part of one of the 5 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 229 transition count 1651
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 77 rules applied. Total rules applied 141 place count 166 transition count 1637
Reduce places removed 6 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 9 rules applied. Total rules applied 150 place count 160 transition count 1634
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 154 place count 157 transition count 1633
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 154 place count 157 transition count 1624
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 172 place count 148 transition count 1624
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 197 place count 123 transition count 1438
Iterating global reduction 4 with 25 rules applied. Total rules applied 222 place count 123 transition count 1438
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 222 place count 123 transition count 1435
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 228 place count 120 transition count 1435
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 242 place count 106 transition count 766
Ensure Unique test removed 4 places
Iterating global reduction 4 with 18 rules applied. Total rules applied 260 place count 102 transition count 766
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 268 place count 94 transition count 126
Iterating global reduction 4 with 8 rules applied. Total rules applied 276 place count 94 transition count 126
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 279 place count 91 transition count 120
Iterating global reduction 4 with 3 rules applied. Total rules applied 282 place count 91 transition count 120
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 342 place count 61 transition count 90
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 347 place count 56 transition count 82
Ensure Unique test removed 2 places
Iterating global reduction 4 with 7 rules applied. Total rules applied 354 place count 54 transition count 82
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 356 place count 52 transition count 76
Iterating global reduction 4 with 2 rules applied. Total rules applied 358 place count 52 transition count 76
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 359 place count 51 transition count 74
Iterating global reduction 4 with 1 rules applied. Total rules applied 360 place count 51 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 362 place count 50 transition count 73
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 371 place count 50 transition count 64
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 383 place count 44 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 384 place count 43 transition count 57
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 386 place count 41 transition count 57
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 390 place count 41 transition count 53
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 392 place count 41 transition count 51
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 394 place count 39 transition count 51
Applied a total of 394 rules in 170 ms. Remains 39 /237 variables (removed 198) and now considering 51/1723 (removed 1672) transitions.
[2026-06-02 06:03:17] [INFO ] Flow matrix only has 41 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16753867329762327942.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11925511008270033367.kers'
[2026-06-02 06:03:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16753867329762327942.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11925511008270033367.kers]
Normalized transition count is 40 out of 41 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 1 ms.
// Phase 1: matrix 40 rows 33 cols 100 entries
Finished phase 1 with 28 SingleSign rule and 0 generalized
[2026-06-02 06:03:17] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11925511008270033367.kers
Total runtime 3 ms.
[2026-06-02 06:03:17] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-06-02 06:03:17] [INFO ] Flow matrix only has 41 transitions (discarded 10 similar events)
[2026-06-02 06:03:17] [INFO ] Invariant cache hit.
[2026-06-02 06:03:17] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2026-06-02 06:03:17] [INFO ] Redundant transitions in 1 ms returned []
Running 33 sub problems to find dead transitions.
[2026-06-02 06:03:17] [INFO ] Flow matrix only has 41 transitions (discarded 10 similar events)
[2026-06-02 06:03:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 5/39 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 40/79 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 0/79 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/80 variables, and 50 constraints, problems are : Problem set: 0 solved, 33 unsolved in 728 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 39/39 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 5/39 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 40/79 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 33/83 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 0/79 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/80 variables, and 83 constraints, problems are : Problem set: 0 solved, 33 unsolved in 736 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 39/39 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1474ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 1474ms
Starting structural reductions in SI_CTL mode, iteration 1 : 39/237 places, 51/1723 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1796 ms. Remains : 39/237 places, 51/1723 transitions.
[2026-06-02 06:03:19] [INFO ] Flatten gal took : 4 ms
[2026-06-02 06:03:19] [INFO ] Flatten gal took : 2 ms
[2026-06-02 06:03:19] [INFO ] Input system was already deterministic with 51 transitions.
[2026-06-02 06:03:19] [INFO ] Flatten gal took : 2 ms
[2026-06-02 06:03:19] [INFO ] Flatten gal took : 2 ms
[2026-06-02 06:03:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality11324523423885281193.gal : 1 ms
[2026-06-02 06:03:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality716766009437075487.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/CTLCardinality11324523423885281193.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality716766009437075487.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,258048,0.015043,4172,2,144,5,1175,5,0,208,1077,0


Converting to forward existential form...Done !
original formula: EF(EG(((p159==0)&&(p194==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((p159==0)&&(p194==1)))] != FALSE
Hit Full ! (commute/partial/dont) 44/6/7
(forward)formula 0,1,0.03222,4612,1,0,6,3859,18,0,1039,1569,8
FORMULA ErlangenMainframeV2-PT-bP06C06-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 1723/1723 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 197 transition count 1522
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 197 transition count 1522
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 99 place count 178 transition count 918
Iterating global reduction 0 with 19 rules applied. Total rules applied 118 place count 178 transition count 918
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 129 place count 167 transition count 345
Ensure Unique test removed 2 places
Iterating global reduction 0 with 13 rules applied. Total rules applied 142 place count 165 transition count 345
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 150 place count 157 transition count 209
Iterating global reduction 0 with 8 rules applied. Total rules applied 158 place count 157 transition count 209
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 160 place count 155 transition count 206
Iterating global reduction 0 with 2 rules applied. Total rules applied 162 place count 155 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 163 place count 154 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 164 place count 154 transition count 205
Applied a total of 164 rules in 32 ms. Remains 154 /237 variables (removed 83) and now considering 205/1723 (removed 1518) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13468595114721881492.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3213891202431009990.kers'
[2026-06-02 06:03:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13468595114721881492.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3213891202431009990.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 205 rows 154 cols 830 entries
Finished phase 1 with 135 SingleSign rule and 2 generalized
[2026-06-02 06:03:19] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3213891202431009990.kers
Total runtime 1 ms.
[2026-06-02 06:03:19] [INFO ] Implicit Places using invariants in 111 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 116 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/237 places, 205/1723 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 205/205 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 150 ms. Remains : 153/237 places, 205/1723 transitions.
[2026-06-02 06:03:19] [INFO ] Flatten gal took : 7 ms
[2026-06-02 06:03:19] [INFO ] Flatten gal took : 8 ms
[2026-06-02 06:03:19] [INFO ] Input system was already deterministic with 205 transitions.
[2026-06-02 06:03:19] [INFO ] Flatten gal took : 9 ms
[2026-06-02 06:03:19] [INFO ] Flatten gal took : 8 ms
[2026-06-02 06:03:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality15383945377976346616.gal : 3 ms
[2026-06-02 06:03:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality17717238057866716569.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/CTLCardinality15383945377976346616.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17717238057866716569.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.15189e+11,7.21917,144272,2,35563,5,556126,6,0,819,572042,0


Converting to forward existential form...Done !
original formula: E(!(EG((!((EG(((p112==0)||(p104==1))) * AG((p146==0)))) * AX(((p132==0)&&(p145==1)))))) U AG(!((!(AG((p158==0))) + ((p141!=1)&&((((((p167...233
=> equivalent forward existential formula: [(FwdU(Init,!(EG((!((EG(((p112==0)||(p104==1))) * !(E(TRUE U !((p146==0)))))) * !(EX(!(((p132==0)&&(p145==1)))))...321
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t7, t8, t17, t21, t24, t32, t36, t40, t60, t73, t75, t76, t78, t81, t85, t87, t92, t9...455
Detected timeout of ITS tools.
[2026-06-02 06:03:49] [INFO ] Flatten gal took : 8 ms
[2026-06-02 06:03:49] [INFO ] Applying decomposition
[2026-06-02 06:03:49] [INFO ] Flatten gal took : 7 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/graph1928100127490562984.txt' '-o' '/tmp/graph1928100127490562984.bin' '-w' '/tmp/graph1928100127490562984.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1928100127490562984.bin' '-l' '-1' '-v' '-w' '/tmp/graph1928100127490562984.weights' '-q' '0' '-e' '0.001'
[2026-06-02 06:03:49] [INFO ] Decomposing Gal with order
[2026-06-02 06:03:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-02 06:03:49] [INFO ] Removed a total of 291 redundant transitions.
[2026-06-02 06:03:49] [INFO ] Flatten gal took : 25 ms
[2026-06-02 06:03:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 9 ms.
[2026-06-02 06:03:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality11343290963327615327.gal : 5 ms
[2026-06-02 06:03:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality3835488318703767153.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/CTLCardinality11343290963327615327.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3835488318703767153.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.15189e+11,0.161996,8036,441,86,6928,918,629,11631,118,2163,0


Converting to forward existential form...Done !
original formula: E(!(EG((!((EG(((i0.u19.p112==0)||(i1.u16.p104==1))) * AG((i5.u25.p146==0)))) * AX(((i5.u22.p132==0)&&(i5.u25.p145==1)))))) U AG(!((!(AG((...338
=> equivalent forward existential formula: [(FwdU(Init,!(EG((!((EG(((i0.u19.p112==0)||(i1.u16.p104==1))) * !(E(TRUE U !((i5.u25.p146==0)))))) * !(EX(!(((i5...426
Reverse transition relation is NOT exact ! Due to transitions t32, t73, t98, t118, t128, t129, t130, t131, t132, t133, t134, t135, i0.t101, i0.t8, i0.u19.t...710
(forward)formula 0,0,0.941022,29584,1,0,47359,1178,3925,102816,662,2682,101353
FORMULA ErlangenMainframeV2-PT-bP06C06-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 1723/1723 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 197 transition count 1522
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 197 transition count 1522
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 97 place count 180 transition count 1197
Ensure Unique test removed 1 places
Iterating global reduction 0 with 18 rules applied. Total rules applied 115 place count 179 transition count 1197
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 124 place count 170 transition count 348
Ensure Unique test removed 2 places
Iterating global reduction 0 with 11 rules applied. Total rules applied 135 place count 168 transition count 348
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 140 place count 163 transition count 235
Iterating global reduction 0 with 5 rules applied. Total rules applied 145 place count 163 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 146 place count 162 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 147 place count 162 transition count 233
Applied a total of 147 rules in 31 ms. Remains 162 /237 variables (removed 75) and now considering 233/1723 (removed 1490) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13160259671342942735.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16157671013106703270.kers'
[2026-06-02 06:03:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13160259671342942735.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16157671013106703270.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 233 rows 162 cols 1098 entries
Finished phase 1 with 143 SingleSign rule and 3 generalized
[2026-06-02 06:03:50] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16157671013106703270.kers
Total runtime 1 ms.
[2026-06-02 06:03:50] [INFO ] Implicit Places using invariants in 108 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 110 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/237 places, 233/1723 transitions.
Applied a total of 0 rules in 2 ms. Remains 161 /161 variables (removed 0) and now considering 233/233 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 143 ms. Remains : 161/237 places, 233/1723 transitions.
[2026-06-02 06:03:50] [INFO ] Flatten gal took : 9 ms
[2026-06-02 06:03:50] [INFO ] Flatten gal took : 9 ms
[2026-06-02 06:03:50] [INFO ] Input system was already deterministic with 233 transitions.
[2026-06-02 06:03:50] [INFO ] Flatten gal took : 8 ms
[2026-06-02 06:03:50] [INFO ] Flatten gal took : 8 ms
[2026-06-02 06:03:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality10828579463219703955.gal : 2 ms
[2026-06-02 06:03:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality6509801760782469473.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/CTLCardinality10828579463219703955.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6509801760782469473.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,4.3165e+11,4.82238,112272,2,22721,5,411277,6,0,879,456245,0


Converting to forward existential form...Done !
original formula: E(((!(AX((((p27==0)||(p153==1)) * EX((p179==1))))) + EG((((p177==0)&&(((p215==1)||(p21==0))||(p269==1)))&&((p142==0)||(p205==1))))) + (((...322
=> equivalent forward existential formula: [(FwdU(FwdU(Init,((!(!(EX(!((((p27==0)||(p153==1)) * EX((p179==1))))))) + EG((((p177==0)&&(((p215==1)||(p21==0))...464
Reverse transition relation is NOT exact ! Due to transitions t1, t15, t18, t23, t34, t48, t56, t59, t65, t66, t69, t76, t82, t85, t93, t96, t100, t102, t1...487
(forward)formula 0,0,14.5379,301312,1,0,420,1.29773e+06,487,213,7099,1.0624e+06,479
FORMULA ErlangenMainframeV2-PT-bP06C06-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 1723/1723 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 196 transition count 1521
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 196 transition count 1521
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 97 place count 181 transition count 956
Iterating global reduction 0 with 15 rules applied. Total rules applied 112 place count 181 transition count 956
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 120 place count 173 transition count 447
Ensure Unique test removed 1 places
Iterating global reduction 0 with 9 rules applied. Total rules applied 129 place count 172 transition count 447
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 133 place count 168 transition count 301
Iterating global reduction 0 with 4 rules applied. Total rules applied 137 place count 168 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 138 place count 167 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 139 place count 167 transition count 299
Applied a total of 139 rules in 29 ms. Remains 167 /237 variables (removed 70) and now considering 299/1723 (removed 1424) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2081270405801302870.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16083607381367910748.kers'
[2026-06-02 06:04:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2081270405801302870.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16083607381367910748.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 299 rows 167 cols 2178 entries
Finished phase 1 with 146 SingleSign rule and 3 generalized
[2026-06-02 06:04:05] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16083607381367910748.kers
Total runtime 3 ms.
[2026-06-02 06:04:05] [INFO ] Implicit Places using invariants in 173 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 175 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 166/237 places, 299/1723 transitions.
Applied a total of 0 rules in 2 ms. Remains 166 /166 variables (removed 0) and now considering 299/299 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 206 ms. Remains : 166/237 places, 299/1723 transitions.
[2026-06-02 06:04:05] [INFO ] Flatten gal took : 15 ms
[2026-06-02 06:04:05] [INFO ] Flatten gal took : 16 ms
[2026-06-02 06:04:05] [INFO ] Input system was already deterministic with 299 transitions.
[2026-06-02 06:04:05] [INFO ] Flatten gal took : 14 ms
[2026-06-02 06:04:05] [INFO ] Flatten gal took : 14 ms
[2026-06-02 06:04:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality3401920247857176760.gal : 3 ms
[2026-06-02 06:04:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality12458415965485783564.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/CTLCardinality3401920247857176760.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12458415965485783564.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,6.82717e+11,6.05306,137924,2,37140,5,438355,6,0,965,469348,0


Converting to forward existential form...Done !
original formula: ((EF(((((p143==0)||(p12==1))||((p21==0)||(p142==1))) * EX((((p261==0)&&(p17==1))||(p59==0))))) * (A((((p263==1) + EG((p127==1))) + EX((p1...341
=> equivalent forward existential formula: (([(Init * !(E(TRUE U ((((p143==0)||(p12==1))||((p21==0)||(p142==1))) * EX((((p261==0)&&(p17==1))||(p59==0))))))...1211
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t8, t9, t10, t11, t20, t25, t26, t28, t36, t46, t59, t64, t78, t81, t89, t92, t96, t9...635
Detected timeout of ITS tools.
[2026-06-02 06:04:35] [INFO ] Flatten gal took : 33 ms
[2026-06-02 06:04:35] [INFO ] Applying decomposition
[2026-06-02 06:04:35] [INFO ] Flatten gal took : 16 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/graph9841060562341670292.txt' '-o' '/tmp/graph9841060562341670292.bin' '-w' '/tmp/graph9841060562341670292.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9841060562341670292.bin' '-l' '-1' '-v' '-w' '/tmp/graph9841060562341670292.weights' '-q' '0' '-e' '0.001'
[2026-06-02 06:04:36] [INFO ] Decomposing Gal with order
[2026-06-02 06:04:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-02 06:04:36] [INFO ] Removed a total of 360 redundant transitions.
[2026-06-02 06:04:36] [INFO ] Flatten gal took : 66 ms
[2026-06-02 06:04:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 122 labels/synchronizations in 9 ms.
[2026-06-02 06:04:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality8687783142460101059.gal : 5 ms
[2026-06-02 06:04:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality9747616829631676574.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/CTLCardinality8687783142460101059.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9747616829631676574.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 237/237 places, 1723/1723 transitions.
Graph (trivial) has 208 edges and 237 vertex of which 12 / 237 are part of one of the 5 SCC in 2 ms
Free SCC test removed 7 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 229 transition count 1647
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 82 rules applied. Total rules applied 150 place count 162 transition count 1632
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 156 place count 156 transition count 1632
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 156 place count 156 transition count 1623
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 174 place count 147 transition count 1623
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 199 place count 122 transition count 1437
Iterating global reduction 3 with 25 rules applied. Total rules applied 224 place count 122 transition count 1437
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 224 place count 122 transition count 1434
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 230 place count 119 transition count 1434
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 243 place count 106 transition count 769
Ensure Unique test removed 3 places
Iterating global reduction 3 with 16 rules applied. Total rules applied 259 place count 103 transition count 769
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 266 place count 96 transition count 137
Iterating global reduction 3 with 7 rules applied. Total rules applied 273 place count 96 transition count 137
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 275 place count 94 transition count 133
Iterating global reduction 3 with 2 rules applied. Total rules applied 277 place count 94 transition count 133
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 339 place count 63 transition count 102
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 344 place count 58 transition count 91
Ensure Unique test removed 2 places
Iterating global reduction 3 with 7 rules applied. Total rules applied 351 place count 56 transition count 91
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 353 place count 54 transition count 79
Iterating global reduction 3 with 2 rules applied. Total rules applied 355 place count 54 transition count 79
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 356 place count 53 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 357 place count 53 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 366 place count 53 transition count 68
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 378 place count 47 transition count 62
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 379 place count 46 transition count 61
Applied a total of 379 rules in 159 ms. Remains 46 /237 variables (removed 191) and now considering 61/1723 (removed 1662) transitions.
[2026-06-02 06:05:06] [INFO ] Flow matrix only has 48 transitions (discarded 13 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1533974759645096464.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6435226058527797694.kers'
[2026-06-02 06:05:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1533974759645096464.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6435226058527797694.kers]
Normalized transition count is 47 out of 48 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 47 rows 44 cols 156 entries
Finished phase 1 with 32 SingleSign rule and 0 generalized
[2026-06-02 06:05:06] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6435226058527797694.kers
Total runtime 1 ms.
[2026-06-02 06:05:06] [INFO ] Implicit Places using invariants in 250 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 253 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 45/237 places, 61/1723 transitions.
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 2 place count 44 transition count 60
Applied a total of 2 rules in 6 ms. Remains 44 /45 variables (removed 1) and now considering 60/61 (removed 1) transitions.
[2026-06-02 06:05:06] [INFO ] Flow matrix only has 47 transitions (discarded 13 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6631230225759186281.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1231888087475199378.kers'
[2026-06-02 06:05:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6631230225759186281.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1231888087475199378.kers]
Normalized transition count is 46 out of 47 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 46 rows 42 cols 153 entries
Finished phase 1 with 30 SingleSign rule and 1 generalized
[2026-06-02 06:05:06] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1231888087475199378.kers
Total runtime 1 ms.
[2026-06-02 06:05:06] [INFO ] Implicit Places using invariants in 180 ms returned []
[2026-06-02 06:05:06] [INFO ] Flow matrix only has 47 transitions (discarded 13 similar events)
[2026-06-02 06:05:06] [INFO ] Invariant cache hit.
[2026-06-02 06:05:06] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 44/237 places, 60/1723 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 702 ms. Remains : 44/237 places, 60/1723 transitions.
[2026-06-02 06:05:06] [INFO ] Flatten gal took : 4 ms
[2026-06-02 06:05:06] [INFO ] Flatten gal took : 2 ms
[2026-06-02 06:05:06] [INFO ] Input system was already deterministic with 60 transitions.
[2026-06-02 06:05:07] [INFO ] Flatten gal took : 3 ms
[2026-06-02 06:05:07] [INFO ] Flatten gal took : 2 ms
RANDOM walk for 2019 steps (42 resets) in 38 ms. (51 steps per ms) remains 0/1 properties
FORMULA ErlangenMainframeV2-PT-bP06C06-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-06-02 06:05:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8115323731437574049.gal : 6 ms
[2026-06-02 06:05:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16090327613234604710.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8115323731437574049.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16090327613234604710.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 1723/1723 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 189 transition count 1514
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 189 transition count 1514
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 119 place count 166 transition count 865
Ensure Unique test removed 1 places
Iterating global reduction 0 with 24 rules applied. Total rules applied 143 place count 165 transition count 865
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 156 place count 152 transition count 238
Ensure Unique test removed 4 places
Iterating global reduction 0 with 17 rules applied. Total rules applied 173 place count 148 transition count 238
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 181 place count 140 transition count 183
Iterating global reduction 0 with 8 rules applied. Total rules applied 189 place count 140 transition count 183
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 193 place count 136 transition count 176
Iterating global reduction 0 with 4 rules applied. Total rules applied 197 place count 136 transition count 176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 198 place count 135 transition count 175
Iterating global reduction 0 with 1 rules applied. Total rules applied 199 place count 135 transition count 175
Applied a total of 199 rules in 57 ms. Remains 135 /237 variables (removed 102) and now considering 175/1723 (removed 1548) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6764579069306646647.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10878751542951600919.kers'
[2026-06-02 06:05:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6764579069306646647.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10878751542951600919.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 175 rows 135 cols 518 entries
Finished phase 1 with 120 SingleSign rule and 1 generalized
[2026-06-02 06:05:07] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10878751542951600919.kers
Total runtime 2 ms.
[2026-06-02 06:05:07] [INFO ] Implicit Places using invariants in 109 ms returned [42]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 111 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/237 places, 175/1723 transitions.
Applied a total of 0 rules in 2 ms. Remains 134 /134 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 171 ms. Remains : 134/237 places, 175/1723 transitions.
[2026-06-02 06:05:07] [INFO ] Flatten gal took : 8 ms
[2026-06-02 06:05:07] [INFO ] Flatten gal took : 6 ms
[2026-06-02 06:05:07] [INFO ] Input system was already deterministic with 175 transitions.
[2026-06-02 06:05:07] [INFO ] Flatten gal took : 7 ms
[2026-06-02 06:05:07] [INFO ] Flatten gal took : 6 ms
[2026-06-02 06:05:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality16409110814811511498.gal : 1 ms
[2026-06-02 06:05:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality13918258213402651122.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/CTLCardinality16409110814811511498.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13918258213402651122.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,5.99413e+10,0.643305,20976,2,6722,5,73354,6,0,713,74761,0


Converting to forward existential form...Done !
original formula: AX(A((!(EG((p267==1))) + (p63==1)) U AF(!(((p9==0)||(p239==1))))))
=> equivalent forward existential formula: ([FwdG((FwdU(EY(Init),!(!(EG(!(!(((p9==0)||(p239==1)))))))) * !((!(EG((p267==1))) + (p63==1)))),!(!(((p9==0)||(p...240
Reverse transition relation is NOT exact ! Due to transitions t14, t17, t20, t23, t31, t71, t74, t81, t90, t92, t94, t96, t98, t100, t102, t103, t105, t106...335
Detected timeout of ITS tools.
[2026-06-02 06:05:37] [INFO ] Flatten gal took : 4 ms
[2026-06-02 06:05:37] [INFO ] Applying decomposition
[2026-06-02 06:05:37] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9480290095676381849.txt' '-o' '/tmp/graph9480290095676381849.bin' '-w' '/tmp/graph9480290095676381849.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9480290095676381849.bin' '-l' '-1' '-v' '-w' '/tmp/graph9480290095676381849.weights' '-q' '0' '-e' '0.001'
[2026-06-02 06:05:37] [INFO ] Decomposing Gal with order
[2026-06-02 06:05:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-02 06:05:37] [INFO ] Removed a total of 135 redundant transitions.
[2026-06-02 06:05:37] [INFO ] Flatten gal took : 11 ms
[2026-06-02 06:05:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 3 ms.
[2026-06-02 06:05:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality11604309042180094513.gal : 2 ms
[2026-06-02 06:05:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality17470077391014826281.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/CTLCardinality11604309042180094513.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17470077391014826281.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.99413e+10,0.163667,7164,397,41,7341,511,411,7315,89,1130,0


Converting to forward existential form...Done !
original formula: AX(A((!(EG((i12.i1.u35.p267==1))) + (i4.u8.p63==1)) U AF(!(((i0.u2.p9==0)||(i11.u32.p239==1))))))
=> equivalent forward existential formula: ([FwdG((FwdU(EY(Init),!(!(EG(!(!(((i0.u2.p9==0)||(i11.u32.p239==1)))))))) * !((!(EG((i12.i1.u35.p267==1))) + (i4...299
Reverse transition relation is NOT exact ! Due to transitions t31, t106, t116, i1.u1.t113, i2.u7.t107, i2.u7.t109, i2.u7.t156, i3.t157, i3.t112, i3.u6.t110...495
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,0,4.52477,124072,1,0,261957,717,2232,304553,404,2418,257527
FORMULA ErlangenMainframeV2-PT-bP06C06-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 1723/1723 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 189 transition count 1514
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 189 transition count 1514
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 119 place count 166 transition count 860
Ensure Unique test removed 1 places
Iterating global reduction 0 with 24 rules applied. Total rules applied 143 place count 165 transition count 860
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 157 place count 151 transition count 232
Ensure Unique test removed 4 places
Iterating global reduction 0 with 18 rules applied. Total rules applied 175 place count 147 transition count 232
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 185 place count 137 transition count 176
Iterating global reduction 0 with 10 rules applied. Total rules applied 195 place count 137 transition count 176
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 198 place count 134 transition count 171
Iterating global reduction 0 with 3 rules applied. Total rules applied 201 place count 134 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 202 place count 133 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 203 place count 133 transition count 170
Applied a total of 203 rules in 35 ms. Remains 133 /237 variables (removed 104) and now considering 170/1723 (removed 1553) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11936092802936899816.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12691039955564406093.kers'
[2026-06-02 06:05:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11936092802936899816.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12691039955564406093.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 170 rows 133 cols 492 entries
Finished phase 1 with 118 SingleSign rule and 1 generalized
[2026-06-02 06:05:41] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12691039955564406093.kers
Total runtime 1 ms.
[2026-06-02 06:05:42] [INFO ] Implicit Places using invariants in 82 ms returned [43]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 84 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/237 places, 170/1723 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 170/170 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 120 ms. Remains : 132/237 places, 170/1723 transitions.
[2026-06-02 06:05:42] [INFO ] Flatten gal took : 4 ms
[2026-06-02 06:05:42] [INFO ] Flatten gal took : 4 ms
[2026-06-02 06:05:42] [INFO ] Input system was already deterministic with 170 transitions.
[2026-06-02 06:05:42] [INFO ] Flatten gal took : 3 ms
[2026-06-02 06:05:42] [INFO ] Flatten gal took : 3 ms
[2026-06-02 06:05:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality17822360098788156909.gal : 1 ms
[2026-06-02 06:05:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality8059417073516254357.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/CTLCardinality17822360098788156909.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8059417073516254357.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.79422e+10,0.149848,8272,2,1591,5,20961,6,0,700,18603,0


Converting to forward existential form...Done !
original formula: EF(EX(EX(((p211==0)&&(p100==1)))))
=> equivalent forward existential formula: [(EY(EY(FwdU(Init,TRUE))) * ((p211==0)&&(p100==1)))] != FALSE
(forward)formula 0,1,0.17542,8516,1,0,9,20961,8,1,1179,18603,3
FORMULA ErlangenMainframeV2-PT-bP06C06-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 237/237 places, 1723/1723 transitions.
Graph (trivial) has 206 edges and 237 vertex of which 12 / 237 are part of one of the 5 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 229 transition count 1649
Reduce places removed 65 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 78 rules applied. Total rules applied 144 place count 164 transition count 1636
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 149 place count 159 transition count 1636
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 149 place count 159 transition count 1627
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 167 place count 150 transition count 1627
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 192 place count 125 transition count 1441
Iterating global reduction 3 with 25 rules applied. Total rules applied 217 place count 125 transition count 1441
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 217 place count 125 transition count 1438
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 223 place count 122 transition count 1438
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 237 place count 108 transition count 769
Ensure Unique test removed 4 places
Iterating global reduction 3 with 18 rules applied. Total rules applied 255 place count 104 transition count 769
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 263 place count 96 transition count 129
Iterating global reduction 3 with 8 rules applied. Total rules applied 271 place count 96 transition count 129
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 274 place count 93 transition count 123
Iterating global reduction 3 with 3 rules applied. Total rules applied 277 place count 93 transition count 123
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 339 place count 62 transition count 92
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 344 place count 57 transition count 84
Ensure Unique test removed 2 places
Iterating global reduction 3 with 7 rules applied. Total rules applied 351 place count 55 transition count 84
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 353 place count 53 transition count 78
Iterating global reduction 3 with 2 rules applied. Total rules applied 355 place count 53 transition count 78
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 356 place count 52 transition count 76
Iterating global reduction 3 with 1 rules applied. Total rules applied 357 place count 52 transition count 76
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 3 with 2 rules applied. Total rules applied 359 place count 51 transition count 75
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 367 place count 51 transition count 67
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 379 place count 45 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 380 place count 44 transition count 60
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 382 place count 42 transition count 60
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 386 place count 42 transition count 56
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 388 place count 42 transition count 54
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 390 place count 40 transition count 54
Applied a total of 390 rules in 133 ms. Remains 40 /237 variables (removed 197) and now considering 54/1723 (removed 1669) transitions.
[2026-06-02 06:05:42] [INFO ] Flow matrix only has 44 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4571619724958123675.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14226704033017569377.kers'
[2026-06-02 06:05:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4571619724958123675.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14226704033017569377.kers]
Normalized transition count is 43 out of 44 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 43 rows 34 cols 106 entries
Finished phase 1 with 29 SingleSign rule and 0 generalized
[2026-06-02 06:05:42] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14226704033017569377.kers
Total runtime 1 ms.
[2026-06-02 06:05:42] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-06-02 06:05:42] [INFO ] Flow matrix only has 44 transitions (discarded 10 similar events)
[2026-06-02 06:05:42] [INFO ] Invariant cache hit.
[2026-06-02 06:05:42] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2026-06-02 06:05:42] [INFO ] Redundant transitions in 1 ms returned []
Running 35 sub problems to find dead transitions.
[2026-06-02 06:05:42] [INFO ] Flow matrix only has 44 transitions (discarded 10 similar events)
[2026-06-02 06:05:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (OVERLAPS) 5/40 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 43/83 variables, 40/51 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (OVERLAPS) 0/83 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 83/84 variables, and 51 constraints, problems are : Problem set: 0 solved, 35 unsolved in 922 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (OVERLAPS) 5/40 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 43/83 variables, 40/51 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 35/86 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 0/83 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 83/84 variables, and 86 constraints, problems are : Problem set: 0 solved, 35 unsolved in 1174 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2107ms problems are : Problem set: 0 solved, 35 unsolved
Search for dead transitions found 0 dead transitions in 2108ms
Starting structural reductions in SI_CTL mode, iteration 1 : 40/237 places, 54/1723 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2385 ms. Remains : 40/237 places, 54/1723 transitions.
[2026-06-02 06:05:44] [INFO ] Flatten gal took : 2 ms
[2026-06-02 06:05:44] [INFO ] Flatten gal took : 1 ms
[2026-06-02 06:05:44] [INFO ] Input system was already deterministic with 54 transitions.
[2026-06-02 06:05:44] [INFO ] Flatten gal took : 2 ms
[2026-06-02 06:05:44] [INFO ] Flatten gal took : 1 ms
[2026-06-02 06:05:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality5225657339539046743.gal : 1 ms
[2026-06-02 06:05:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality2269322187777865429.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/CTLCardinality5225657339539046743.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2269322187777865429.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,248832,0.012623,4192,2,135,5,807,5,0,215,583,0


Converting to forward existential form...Done !
original formula: EF(AG(AF((p250==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EG(!((p250==0))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.036733,4816,1,0,8,5047,21,2,1036,2875,8
FORMULA ErlangenMainframeV2-PT-bP06C06-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 1723/1723 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 193 transition count 1679
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 193 transition count 1679
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 107 place count 174 transition count 1219
Iterating global reduction 0 with 19 rules applied. Total rules applied 126 place count 174 transition count 1219
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 136 place count 164 transition count 298
Ensure Unique test removed 3 places
Iterating global reduction 0 with 13 rules applied. Total rules applied 149 place count 161 transition count 298
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 156 place count 154 transition count 205
Iterating global reduction 0 with 7 rules applied. Total rules applied 163 place count 154 transition count 205
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 165 place count 152 transition count 201
Iterating global reduction 0 with 2 rules applied. Total rules applied 167 place count 152 transition count 201
Applied a total of 167 rules in 49 ms. Remains 152 /237 variables (removed 85) and now considering 201/1723 (removed 1522) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11695345476254608396.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12484906120704005525.kers'
[2026-06-02 06:05:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11695345476254608396.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12484906120704005525.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 201 rows 152 cols 702 entries
Finished phase 1 with 134 SingleSign rule and 2 generalized
[2026-06-02 06:05:44] [INFO ] Computed 16 invariants in 2 ms
Computed 16 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12484906120704005525.kers
Total runtime 3 ms.
[2026-06-02 06:05:44] [INFO ] Implicit Places using invariants in 148 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 152 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 151/237 places, 201/1723 transitions.
Applied a total of 0 rules in 2 ms. Remains 151 /151 variables (removed 0) and now considering 201/201 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 203 ms. Remains : 151/237 places, 201/1723 transitions.
[2026-06-02 06:05:44] [INFO ] Flatten gal took : 7 ms
[2026-06-02 06:05:44] [INFO ] Flatten gal took : 7 ms
[2026-06-02 06:05:44] [INFO ] Input system was already deterministic with 201 transitions.
[2026-06-02 06:05:44] [INFO ] Flatten gal took : 7 ms
[2026-06-02 06:05:44] [INFO ] Flatten gal took : 7 ms
[2026-06-02 06:05:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality259158274925563035.gal : 2 ms
[2026-06-02 06:05:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality13396184970375873588.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/CTLCardinality259158274925563035.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13396184970375873588.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.88122e+11,2.36528,59244,2,17129,5,223998,6,0,807,243525,0


Converting to forward existential form...Done !
original formula: (EF((p44==1)) * E(E(!(((p203==0)||(p50==1))) U !(((!(((p132==0)||(p41==1))||(p0==1)))&&(p197!=0)))) U !(EX(EF((((p20==0)||(p257==1))||(p2...167
=> equivalent forward existential formula: [(FwdU((Init * E(TRUE U (p44==1))),E(!(((p203==0)||(p50==1))) U !(((!(((p132==0)||(p41==1))||(p0==1)))&&(p197!=0...225
Reverse transition relation is NOT exact ! Due to transitions t2, t15, t20, t23, t31, t55, t76, t79, t86, t95, t97, t99, t101, t103, t105, t107, t109, t110...365
(forward)formula 0,0,9.72994,222892,1,0,338,1.07675e+06,423,180,5658,893493,417
FORMULA ErlangenMainframeV2-PT-bP06C06-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 1723/1723 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 189 transition count 1514
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 189 transition count 1514
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 118 place count 167 transition count 872
Ensure Unique test removed 1 places
Iterating global reduction 0 with 23 rules applied. Total rules applied 141 place count 166 transition count 872
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 154 place count 153 transition count 257
Ensure Unique test removed 3 places
Iterating global reduction 0 with 16 rules applied. Total rules applied 170 place count 150 transition count 257
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 180 place count 140 transition count 179
Iterating global reduction 0 with 10 rules applied. Total rules applied 190 place count 140 transition count 179
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 193 place count 137 transition count 174
Iterating global reduction 0 with 3 rules applied. Total rules applied 196 place count 137 transition count 174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 197 place count 136 transition count 173
Iterating global reduction 0 with 1 rules applied. Total rules applied 198 place count 136 transition count 173
Applied a total of 198 rules in 27 ms. Remains 136 /237 variables (removed 101) and now considering 173/1723 (removed 1550) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4921768530372170407.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4461959035942661049.kers'
[2026-06-02 06:05:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4921768530372170407.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4461959035942661049.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 173 rows 136 cols 532 entries
Finished phase 1 with 119 SingleSign rule and 2 generalized
[2026-06-02 06:05:54] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4461959035942661049.kers
Total runtime 1 ms.
[2026-06-02 06:05:54] [INFO ] Implicit Places using invariants in 82 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 135/237 places, 173/1723 transitions.
Applied a total of 0 rules in 1 ms. Remains 135 /135 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 122 ms. Remains : 135/237 places, 173/1723 transitions.
[2026-06-02 06:05:54] [INFO ] Flatten gal took : 3 ms
[2026-06-02 06:05:54] [INFO ] Flatten gal took : 3 ms
[2026-06-02 06:05:54] [INFO ] Input system was already deterministic with 173 transitions.
[2026-06-02 06:05:54] [INFO ] Flatten gal took : 3 ms
[2026-06-02 06:05:54] [INFO ] Flatten gal took : 3 ms
[2026-06-02 06:05:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality3239195526782511750.gal : 1 ms
[2026-06-02 06:05:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality138580804500509800.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/CTLCardinality3239195526782511750.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality138580804500509800.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,7.28907e+10,0.767355,25892,2,6376,5,89518,6,0,715,102727,0


Converting to forward existential form...Done !
original formula: (AG(((p133==0)||(p93==1))) * EX((p90==0)))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(((p133==0)||(p93==1))))] = FALSE * [(Init * !(EX((p90==0))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t15, t19, t22, t30, t70, t73, t80, t83, t89, t90, t91, t93, t97, t99, t100, t102, t10...348
(forward)formula 0,0,2.91882,77016,1,0,294,372638,364,151,4499,315005,354
FORMULA ErlangenMainframeV2-PT-bP06C06-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 237/237 places, 1723/1723 transitions.
Graph (trivial) has 204 edges and 237 vertex of which 12 / 237 are part of one of the 5 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 229 transition count 1648
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 81 rules applied. Total rules applied 148 place count 163 transition count 1633
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 154 place count 157 transition count 1633
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 154 place count 157 transition count 1624
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 172 place count 148 transition count 1624
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 195 place count 125 transition count 1440
Iterating global reduction 3 with 23 rules applied. Total rules applied 218 place count 125 transition count 1440
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 218 place count 125 transition count 1438
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 222 place count 123 transition count 1438
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 234 place count 111 transition count 775
Ensure Unique test removed 3 places
Iterating global reduction 3 with 15 rules applied. Total rules applied 249 place count 108 transition count 775
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 256 place count 101 transition count 143
Iterating global reduction 3 with 7 rules applied. Total rules applied 263 place count 101 transition count 143
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 266 place count 98 transition count 137
Iterating global reduction 3 with 3 rules applied. Total rules applied 269 place count 98 transition count 137
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 333 place count 66 transition count 105
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 338 place count 61 transition count 93
Ensure Unique test removed 2 places
Iterating global reduction 3 with 7 rules applied. Total rules applied 345 place count 59 transition count 93
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 347 place count 57 transition count 81
Iterating global reduction 3 with 2 rules applied. Total rules applied 349 place count 57 transition count 81
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 350 place count 56 transition count 79
Iterating global reduction 3 with 1 rules applied. Total rules applied 351 place count 56 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 358 place count 56 transition count 72
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 368 place count 51 transition count 67
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 369 place count 50 transition count 66
Applied a total of 369 rules in 118 ms. Remains 50 /237 variables (removed 187) and now considering 66/1723 (removed 1657) transitions.
[2026-06-02 06:05:57] [INFO ] Flow matrix only has 54 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17492627321669407780.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9657229720962070835.kers'
[2026-06-02 06:05:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17492627321669407780.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9657229720962070835.kers]
Normalized transition count is 53 out of 54 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 53 rows 48 cols 174 entries
Finished phase 1 with 36 SingleSign rule and 0 generalized
[2026-06-02 06:05:57] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9657229720962070835.kers
Total runtime 0 ms.
[2026-06-02 06:05:58] [INFO ] Implicit Places using invariants in 67 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 49/237 places, 66/1723 transitions.
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 2 place count 48 transition count 65
Applied a total of 2 rules in 2 ms. Remains 48 /49 variables (removed 1) and now considering 65/66 (removed 1) transitions.
[2026-06-02 06:05:58] [INFO ] Flow matrix only has 53 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17683561972595062530.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14092587356298994166.kers'
[2026-06-02 06:05:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17683561972595062530.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14092587356298994166.kers]
Normalized transition count is 52 out of 53 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 52 rows 46 cols 171 entries
Finished phase 1 with 34 SingleSign rule and 1 generalized
[2026-06-02 06:05:58] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14092587356298994166.kers
Total runtime 1 ms.
[2026-06-02 06:05:58] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-06-02 06:05:58] [INFO ] Flow matrix only has 53 transitions (discarded 12 similar events)
[2026-06-02 06:05:58] [INFO ] Invariant cache hit.
[2026-06-02 06:05:58] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 48/237 places, 65/1723 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 318 ms. Remains : 48/237 places, 65/1723 transitions.
[2026-06-02 06:05:58] [INFO ] Flatten gal took : 1 ms
[2026-06-02 06:05:58] [INFO ] Flatten gal took : 2 ms
[2026-06-02 06:05:58] [INFO ] Input system was already deterministic with 65 transitions.
[2026-06-02 06:05:58] [INFO ] Flatten gal took : 2 ms
[2026-06-02 06:05:58] [INFO ] Flatten gal took : 1 ms
[2026-06-02 06:05:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality10567473683101992474.gal : 1 ms
[2026-06-02 06:05:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality3982585848171676913.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/CTLCardinality10567473683101992474.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3982585848171676913.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.04112e+06,0.022284,4472,2,187,5,2350,6,0,255,2001,0


Converting to forward existential form...Done !
original formula: EF((AG(((p36==1)||(p179==0))) * EF((p204==1))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(E(TRUE U !(((p36==1)||(p179==0)))))),TRUE) * (p204==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t44, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,1,0.137339,8360,1,0,110,23271,147,56,1807,19414,141
FORMULA ErlangenMainframeV2-PT-bP06C06-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 237/237 places, 1723/1723 transitions.
Graph (trivial) has 206 edges and 237 vertex of which 12 / 237 are part of one of the 5 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 229 transition count 1648
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 81 rules applied. Total rules applied 148 place count 163 transition count 1633
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 154 place count 157 transition count 1633
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 154 place count 157 transition count 1624
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 172 place count 148 transition count 1624
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 197 place count 123 transition count 1438
Iterating global reduction 3 with 25 rules applied. Total rules applied 222 place count 123 transition count 1438
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 222 place count 123 transition count 1435
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 228 place count 120 transition count 1435
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 242 place count 106 transition count 766
Ensure Unique test removed 4 places
Iterating global reduction 3 with 18 rules applied. Total rules applied 260 place count 102 transition count 766
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 268 place count 94 transition count 126
Iterating global reduction 3 with 8 rules applied. Total rules applied 276 place count 94 transition count 126
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 278 place count 92 transition count 122
Iterating global reduction 3 with 2 rules applied. Total rules applied 280 place count 92 transition count 122
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 342 place count 61 transition count 91
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 347 place count 56 transition count 83
Ensure Unique test removed 2 places
Iterating global reduction 3 with 7 rules applied. Total rules applied 354 place count 54 transition count 83
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 356 place count 52 transition count 77
Iterating global reduction 3 with 2 rules applied. Total rules applied 358 place count 52 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 359 place count 51 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 360 place count 51 transition count 75
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 3 with 2 rules applied. Total rules applied 362 place count 50 transition count 74
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 371 place count 50 transition count 65
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 383 place count 44 transition count 59
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 384 place count 44 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 385 place count 43 transition count 58
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 387 place count 41 transition count 58
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 391 place count 41 transition count 54
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 393 place count 41 transition count 52
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 395 place count 39 transition count 52
Applied a total of 395 rules in 151 ms. Remains 39 /237 variables (removed 198) and now considering 52/1723 (removed 1671) transitions.
[2026-06-02 06:05:58] [INFO ] Flow matrix only has 43 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17672946917608809093.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4070353653565884859.kers'
[2026-06-02 06:05:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17672946917608809093.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4070353653565884859.kers]
Normalized transition count is 42 out of 43 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 42 rows 34 cols 111 entries
Finished phase 1 with 28 SingleSign rule and 0 generalized
[2026-06-02 06:05:58] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4070353653565884859.kers
Total runtime 0 ms.
[2026-06-02 06:05:58] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-06-02 06:05:58] [INFO ] Flow matrix only has 43 transitions (discarded 9 similar events)
[2026-06-02 06:05:58] [INFO ] Invariant cache hit.
[2026-06-02 06:05:58] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2026-06-02 06:05:58] [INFO ] Redundant transitions in 18 ms returned []
Running 34 sub problems to find dead transitions.
[2026-06-02 06:05:58] [INFO ] Flow matrix only has 43 transitions (discarded 9 similar events)
[2026-06-02 06:05:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 5/39 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 42/81 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 0/81 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/82 variables, and 50 constraints, problems are : Problem set: 0 solved, 34 unsolved in 1013 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 39/39 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 5/39 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 42/81 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 34/84 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/82 variables, and 84 constraints, problems are : Problem set: 0 solved, 34 unsolved in 1060 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 39/39 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2091ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 2093ms
Starting structural reductions in SI_CTL mode, iteration 1 : 39/237 places, 52/1723 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2405 ms. Remains : 39/237 places, 52/1723 transitions.
[2026-06-02 06:06:00] [INFO ] Flatten gal took : 2 ms
[2026-06-02 06:06:00] [INFO ] Flatten gal took : 1 ms
[2026-06-02 06:06:00] [INFO ] Input system was already deterministic with 52 transitions.
RANDOM walk for 1070 steps (29 resets) in 9 ms. (107 steps per ms) remains 0/1 properties
FORMULA ErlangenMainframeV2-PT-bP06C06-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-06-02 06:06:00] [INFO ] Flatten gal took : 2 ms
[2026-06-02 06:06:00] [INFO ] Flatten gal took : 2 ms
[2026-06-02 06:06:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3642797280444685338.gal : 0 ms
[2026-06-02 06:06:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1129606482410667407.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3642797280444685338.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1129606482410667407.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 1723/1723 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 190 transition count 1515
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 190 transition count 1515
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 113 place count 171 transition count 1201
Ensure Unique test removed 1 places
Iterating global reduction 0 with 20 rules applied. Total rules applied 133 place count 170 transition count 1201
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 139 place count 164 transition count 497
Ensure Unique test removed 2 places
Iterating global reduction 0 with 8 rules applied. Total rules applied 147 place count 162 transition count 497
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 151 place count 158 transition count 255
Iterating global reduction 0 with 4 rules applied. Total rules applied 155 place count 158 transition count 255
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 156 place count 157 transition count 253
Iterating global reduction 0 with 1 rules applied. Total rules applied 157 place count 157 transition count 253
Applied a total of 157 rules in 31 ms. Remains 157 /237 variables (removed 80) and now considering 253/1723 (removed 1470) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13940918371878761214.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-760585301526811218.kers'
[2026-06-02 06:06:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13940918371878761214.kers, --Pflows, --basisKERS=/tmp/petrispot-output-760585301526811218.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 253 rows 157 cols 1322 entries
Finished phase 1 with 139 SingleSign rule and 2 generalized
[2026-06-02 06:06:00] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-760585301526811218.kers
Total runtime 3 ms.
[2026-06-02 06:06:00] [INFO ] Implicit Places using invariants in 117 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 118 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 156/237 places, 253/1723 transitions.
Applied a total of 0 rules in 1 ms. Remains 156 /156 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 152 ms. Remains : 156/237 places, 253/1723 transitions.
[2026-06-02 06:06:00] [INFO ] Flatten gal took : 8 ms
[2026-06-02 06:06:00] [INFO ] Flatten gal took : 9 ms
[2026-06-02 06:06:00] [INFO ] Input system was already deterministic with 253 transitions.
[2026-06-02 06:06:01] [INFO ] Flatten gal took : 9 ms
[2026-06-02 06:06:01] [INFO ] Flatten gal took : 8 ms
[2026-06-02 06:06:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality4086251941970925444.gal : 2 ms
[2026-06-02 06:06:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality13970534455812795699.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/CTLCardinality4086251941970925444.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13970534455812795699.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.98543e+11,2.8657,66380,2,14598,5,238334,6,0,879,254666,0


Converting to forward existential form...Done !
original formula: (EG(EF(AG((((p31==0)&&(p12==1))&&(p114==0))))) + (EX(TRUE) * (EF((((AF(((p12==0)||(p29==1))) * (p257==1)) * (((p199==1)||(p13==0))&&(p96=...216
=> equivalent forward existential formula: ([FwdG(Init,E(TRUE U !(E(TRUE U !((((p31==0)&&(p12==1))&&(p114==0)))))))] != FALSE + ([((((FwdU((Init * EX(TRUE)...344
Reverse transition relation is NOT exact ! Due to transitions t15, t20, t23, t31, t75, t78, t85, t91, t97, t98, t99, t101, t103, t104, t105, t107, t109, t1...487
(forward)formula 0,1,12.3556,276836,1,0,467,1.21051e+06,544,241,7821,1.15692e+06,566
FORMULA ErlangenMainframeV2-PT-bP06C06-CTLCardinality-2024-13 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 : 237/237 places, 1723/1723 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 188 transition count 1513
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 188 transition count 1513
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 122 place count 164 transition count 858
Ensure Unique test removed 1 places
Iterating global reduction 0 with 25 rules applied. Total rules applied 147 place count 163 transition count 858
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 161 place count 149 transition count 230
Ensure Unique test removed 4 places
Iterating global reduction 0 with 18 rules applied. Total rules applied 179 place count 145 transition count 230
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 188 place count 136 transition count 176
Iterating global reduction 0 with 9 rules applied. Total rules applied 197 place count 136 transition count 176
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 201 place count 132 transition count 169
Iterating global reduction 0 with 4 rules applied. Total rules applied 205 place count 132 transition count 169
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 206 place count 131 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 207 place count 131 transition count 168
Applied a total of 207 rules in 29 ms. Remains 131 /237 variables (removed 106) and now considering 168/1723 (removed 1555) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5242120734265135978.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8118788636667208263.kers'
[2026-06-02 06:06:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5242120734265135978.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8118788636667208263.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 168 rows 131 cols 488 entries
Finished phase 1 with 116 SingleSign rule and 1 generalized
[2026-06-02 06:06:13] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-8118788636667208263.kers
Total runtime 10 ms.
[2026-06-02 06:06:13] [INFO ] Implicit Places using invariants in 110 ms returned [42]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 122 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 130/237 places, 168/1723 transitions.
Applied a total of 0 rules in 1 ms. Remains 130 /130 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 152 ms. Remains : 130/237 places, 168/1723 transitions.
[2026-06-02 06:06:13] [INFO ] Flatten gal took : 4 ms
[2026-06-02 06:06:13] [INFO ] Flatten gal took : 3 ms
[2026-06-02 06:06:13] [INFO ] Input system was already deterministic with 168 transitions.
[2026-06-02 06:06:13] [INFO ] Flatten gal took : 3 ms
[2026-06-02 06:06:13] [INFO ] Flatten gal took : 3 ms
[2026-06-02 06:06:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality3429580213990168451.gal : 1 ms
[2026-06-02 06:06:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality5660059809261603575.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/CTLCardinality3429580213990168451.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5660059809261603575.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.95376e+10,0.140319,8444,2,1565,5,21633,6,0,690,20095,0


Converting to forward existential form...Done !
original formula: AX(EF((p63==1)))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (p63==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t14, t18, t21, t29, t69, t72, t79, t88, t90, t92, t94, t96, t98, t100, t101, t103, t104, t105...329
(forward)formula 0,1,5.14696,135700,1,0,335,723999,357,176,4357,679574,420
FORMULA ErlangenMainframeV2-PT-bP06C06-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 1723/1723 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 192 transition count 1517
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 192 transition count 1517
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 111 place count 171 transition count 901
Iterating global reduction 0 with 21 rules applied. Total rules applied 132 place count 171 transition count 901
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 143 place count 160 transition count 300
Ensure Unique test removed 4 places
Iterating global reduction 0 with 15 rules applied. Total rules applied 158 place count 156 transition count 300
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 164 place count 150 transition count 207
Iterating global reduction 0 with 6 rules applied. Total rules applied 170 place count 150 transition count 207
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 173 place count 147 transition count 202
Iterating global reduction 0 with 3 rules applied. Total rules applied 176 place count 147 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 177 place count 146 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 178 place count 146 transition count 201
Applied a total of 178 rules in 33 ms. Remains 146 /237 variables (removed 91) and now considering 201/1723 (removed 1522) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2239450773548631383.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17696392649694849521.kers'
[2026-06-02 06:06:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2239450773548631383.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17696392649694849521.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 201 rows 146 cols 760 entries
Finished phase 1 with 129 SingleSign rule and 2 generalized
[2026-06-02 06:06:18] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17696392649694849521.kers
Total runtime 2 ms.
[2026-06-02 06:06:19] [INFO ] Implicit Places using invariants in 136 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 148 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 145/237 places, 201/1723 transitions.
Applied a total of 0 rules in 2 ms. Remains 145 /145 variables (removed 0) and now considering 201/201 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 183 ms. Remains : 145/237 places, 201/1723 transitions.
[2026-06-02 06:06:19] [INFO ] Flatten gal took : 7 ms
[2026-06-02 06:06:19] [INFO ] Flatten gal took : 8 ms
[2026-06-02 06:06:19] [INFO ] Input system was already deterministic with 201 transitions.
[2026-06-02 06:06:19] [INFO ] Flatten gal took : 7 ms
[2026-06-02 06:06:19] [INFO ] Flatten gal took : 7 ms
[2026-06-02 06:06:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality12954829971186032438.gal : 2 ms
[2026-06-02 06:06:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality14457153843404229777.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/CTLCardinality12954829971186032438.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14457153843404229777.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.40036e+11,1.70712,44028,2,13680,5,165445,6,0,783,158242,0


Converting to forward existential form...Done !
original formula: AF(((EF(((p212==0)&&(p234==1))) + (((p99==0)&&(p183==0))&&(p91==1))) + (AX(((p256==0)||(p272==1))) * (A(((p138==0)||(p36==1)) U (p157==1)...197
=> equivalent forward existential formula: [FwdG(Init,!(((E(TRUE U ((p212==0)&&(p234==1))) + (((p99==0)&&(p183==0))&&(p91==1))) + (!(EX(!(((p256==0)||(p272...301
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t15, t18, t21, t24, t32, t75, t78, t85, t95, t97, t99, t102, t104, t106, t110, t111, ...387
Detected timeout of ITS tools.
[2026-06-02 06:06:49] [INFO ] Flatten gal took : 5 ms
[2026-06-02 06:06:49] [INFO ] Applying decomposition
[2026-06-02 06:06:49] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17435421527667094981.txt' '-o' '/tmp/graph17435421527667094981.bin' '-w' '/tmp/graph17435421527667094981.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17435421527667094981.bin' '-l' '-1' '-v' '-w' '/tmp/graph17435421527667094981.weights' '-q' '0' '-e' '0.001'
[2026-06-02 06:06:49] [INFO ] Decomposing Gal with order
[2026-06-02 06:06:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-02 06:06:49] [INFO ] Removed a total of 296 redundant transitions.
[2026-06-02 06:06:49] [INFO ] Flatten gal took : 25 ms
[2026-06-02 06:06:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 2 ms.
[2026-06-02 06:06:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality6409406256622122435.gal : 2 ms
[2026-06-02 06:06:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality13999615385972121678.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/CTLCardinality6409406256622122435.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13999615385972121678.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,1.40036e+11,0.09604,7196,389,49,6303,379,488,10420,100,863,0


Converting to forward existential form...Done !
original formula: AF(((EF(((i10.u35.p212==0)&&(i10.u38.p234==1))) + (((i3.u16.p99==0)&&(i9.u28.p183==0))&&(i3.u15.p91==1))) + (AX(((i8.u41.p256==0)||(i2.i1...291
=> equivalent forward existential formula: [FwdG(Init,!(((E(TRUE U ((i10.u35.p212==0)&&(i10.u38.p234==1))) + (((i3.u16.p99==0)&&(i9.u28.p183==0))&&(i3.u15....409
Reverse transition relation is NOT exact ! Due to transitions t75, t111, t121, t122, t129, t130, t137, t138, i0.t114, i0.u7.t1, i0.u7.t2, i1.t185, i1.t110,...506
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,1,0.801944,26212,1,0,47288,1453,2982,74777,514,2000,92200
FORMULA ErlangenMainframeV2-PT-bP06C06-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2026-06-02 06:06:50] [INFO ] Flatten gal took : 196 ms
[2026-06-02 06:06:50] [INFO ] Flatten gal took : 150 ms
[2026-06-02 06:06:50] [INFO ] Applying decomposition
[2026-06-02 06:06:50] [INFO ] Flatten gal took : 149 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/graph6636096009831895428.txt' '-o' '/tmp/graph6636096009831895428.bin' '-w' '/tmp/graph6636096009831895428.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6636096009831895428.bin' '-l' '-1' '-v' '-w' '/tmp/graph6636096009831895428.weights' '-q' '0' '-e' '0.001'
[2026-06-02 06:06:51] [INFO ] Decomposing Gal with order
[2026-06-02 06:06:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-02 06:06:52] [INFO ] Removed a total of 2227 redundant transitions.
[2026-06-02 06:06:52] [INFO ] Flatten gal took : 704 ms
[2026-06-02 06:06:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 1791 labels/synchronizations in 124 ms.
[2026-06-02 06:06:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality2135927571871155270.gal : 24 ms
[2026-06-02 06:06:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality18441407182203068181.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/CTLCardinality2135927571871155270.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18441407182203068181.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.
Detected timeout of ITS tools.
[2026-06-02 06:28:42] [INFO ] Applying decomposition
[2026-06-02 06:28:42] [INFO ] Flatten gal took : 153 ms
[2026-06-02 06:28:42] [INFO ] Decomposing Gal with order
[2026-06-02 06:28:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-02 06:28:43] [INFO ] Removed a total of 12699 redundant transitions.
[2026-06-02 06:28:43] [INFO ] Flatten gal took : 282 ms
[2026-06-02 06:28:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 289 labels/synchronizations in 62 ms.
[2026-06-02 06:28:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality10685525882421501141.gal : 5 ms
[2026-06-02 06:28:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality16326296801982851293.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/CTLCardinality10685525882421501141.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16326296801982851293.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.21606e+14,0.97327,30604,1191,1282,41670,6684,384,163784,328,48980,0


Converting to forward existential form...Done !
original formula: ((EF(((((i1.i0.i1.i0.u17.p143==0)||(i1.i0.i0.i0.i0.u32.p12==1))||((i1.i0.i0.i0.i0.i0.i0.u9.p21==0)||(i1.i0.i1.i0.u17.p142==1))) * EX((((i...662
=> equivalent forward existential formula: (([(Init * !(E(TRUE U ((((i1.i0.i1.i0.u17.p143==0)||(i1.i0.i0.i0.i0.u32.p12==1))||((i1.i0.i0.i0.i0.i0.i0.u9.p21=...2034
Reverse transition relation is NOT exact ! Due to transitions t534, u1.t173, u1.t174, i1.i0.i0.t134, i1.i0.i0.u14.t13, i1.i0.i0.u14.t14, i1.i0.i0.u14.t15, ...1642
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
(forward)formula 0,0,54.4043,1235804,1,0,1.04424e+06,319287,5329,1.1074e+07,2612,2.19792e+06,441883
FORMULA ErlangenMainframeV2-PT-bP06C06-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1697786 ms.

BK_STOP 1780381778320

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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="ErlangenMainframeV2-PT-bP06C06"
export BK_EXAMINATION="CTLCardinality"
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 ErlangenMainframeV2-PT-bP06C06, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r338-smll-178021499200249"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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