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-178021499000049.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 ErlangenMainframeV1-PT-bP01C01, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499000049
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.9K May 27 08:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 27 08:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 27 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 27 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 27 10:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 27 10:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 27 10:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 14K May 27 08:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K May 27 08:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 27 08:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K May 27 08:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:30 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 52K 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 ErlangenMainframeV1-PT-bP01C01-CTLCardinality-2024-00
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-CTLCardinality-2024-01
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-CTLCardinality-2024-02
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-CTLCardinality-2024-03
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-CTLCardinality-2024-04
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-CTLCardinality-2024-05
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-CTLCardinality-2024-06
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-CTLCardinality-2024-07
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-CTLCardinality-2024-08
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-CTLCardinality-2024-09
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-CTLCardinality-2024-10
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-CTLCardinality-2024-11
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-CTLCardinality-2024-12
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-CTLCardinality-2024-13
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-CTLCardinality-2024-14
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1780259530070

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV1-PT-bP01C01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-31 20:32:12] [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-05-31 20:32:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-31 20:32:12] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2026-05-31 20:32:12] [INFO ] Transformed 173 places.
[2026-05-31 20:32:12] [INFO ] Transformed 219 transitions.
[2026-05-31 20:32:12] [INFO ] Found NUPN structural information;
[2026-05-31 20:32:12] [INFO ] Parsed PT model containing 173 places and 219 transitions and 608 arcs in 361 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 23 ms.
Initial state reduction rules removed 1 formulas.
FORMULA ErlangenMainframeV1-PT-bP01C01-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 89 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 219/219 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 161 transition count 207
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 161 transition count 207
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 159 transition count 205
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 159 transition count 205
Applied a total of 28 rules in 48 ms. Remains 159 /173 variables (removed 14) and now considering 205/219 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9238257199879470980.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-999992831090321040.kers'
[2026-05-31 20:32:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9238257199879470980.kers, --Pflows, --basisKERS=/tmp/petrispot-output-999992831090321040.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 205 rows 159 cols 580 entries
Finished phase 1 with 148 SingleSign rule and 3 generalized
[2026-05-31 20:32:12] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-999992831090321040.kers
Total runtime 3 ms.
[2026-05-31 20:32:13] [INFO ] Implicit Places using invariants in 403 ms returned []
[2026-05-31 20:32:13] [INFO ] Invariant cache hit.
[2026-05-31 20:32:13] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2026-05-31 20:32:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/159 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/364 variables, 159/177 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (OVERLAPS) 0/364 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 181 constraints, problems are : Problem set: 0 solved, 204 unsolved in 25541 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/159 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/364 variables, 159/181 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 204/385 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 10/395 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 2/397 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/364 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/364 variables, and 399 constraints, problems are : Problem set: 0 solved, 204 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 55705ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 55726ms
Starting structural reductions in LTL mode, iteration 1 : 159/173 places, 205/219 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56533 ms. Remains : 159/173 places, 205/219 transitions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 205/205 transitions.
Applied a total of 0 rules in 6 ms. Remains 159 /159 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2026-05-31 20:33:09] [INFO ] Invariant cache hit.
[2026-05-31 20:33:09] [INFO ] Implicit Places using invariants in 100 ms returned []
[2026-05-31 20:33:09] [INFO ] Invariant cache hit.
[2026-05-31 20:33:09] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 320 ms. Remains : 159/159 places, 205/205 transitions.
Support contains 89 out of 159 places after structural reductions.
[2026-05-31 20:33:09] [INFO ] Flatten gal took : 77 ms
[2026-05-31 20:33:10] [INFO ] Flatten gal took : 52 ms
[2026-05-31 20:33:10] [INFO ] Input system was already deterministic with 205 transitions.
Support contains 80 out of 159 places (down from 89) after GAL structural reductions.
FORMULA ErlangenMainframeV1-PT-bP01C01-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1851 ms. (21 steps per ms) remains 5/60 properties
BEST_FIRST walk for 40003 steps (8 resets) in 226 ms. (176 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 141 ms. (281 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 178 ms. (223 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 176 ms. (225 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
[2026-05-31 20:33:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 89/93 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 61/154 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/159 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 205/364 variables, 159/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/364 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 167 constraints, problems are : Problem set: 0 solved, 2 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 89/93 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 61/154 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 5/159 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 205/364 variables, 159/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/364 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/364 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/364 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/364 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 364/364 variables, and 171 constraints, problems are : Problem set: 0 solved, 2 unsolved in 597 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 889ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 10988 steps, including 204 resets, run visited all 2 properties in 54 ms. (steps per millisecond=203 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 64 ms.
[2026-05-31 20:33:12] [INFO ] Flatten gal took : 27 ms
[2026-05-31 20:33:12] [INFO ] Flatten gal took : 25 ms
[2026-05-31 20:33:12] [INFO ] Input system was already deterministic with 205 transitions.
Computed a total of 18 stabilizing places and 18 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 205/205 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 131 transition count 177
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 131 transition count 177
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 122 transition count 168
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 122 transition count 168
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 77 place count 119 transition count 165
Iterating global reduction 0 with 3 rules applied. Total rules applied 80 place count 119 transition count 165
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 83 place count 116 transition count 148
Iterating global reduction 0 with 3 rules applied. Total rules applied 86 place count 116 transition count 148
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 114 transition count 146
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 114 transition count 146
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 92 place count 112 transition count 144
Iterating global reduction 0 with 2 rules applied. Total rules applied 94 place count 112 transition count 144
Applied a total of 94 rules in 63 ms. Remains 112 /159 variables (removed 47) and now considering 144/205 (removed 61) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4716081621078344767.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11922098918366580521.kers'
[2026-05-31 20:33:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4716081621078344767.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11922098918366580521.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 144 rows 112 cols 388 entries
Finished phase 1 with 102 SingleSign rule and 2 generalized
[2026-05-31 20:33:12] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11922098918366580521.kers
Total runtime 2 ms.
[2026-05-31 20:33:12] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-31 20:33:12] [INFO ] Invariant cache hit.
[2026-05-31 20:33:12] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 143 sub problems to find dead transitions.
[2026-05-31 20:33:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 144/256 variables, 112/124 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (OVERLAPS) 0/256 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 125 constraints, problems are : Problem set: 0 solved, 143 unsolved in 11907 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 144/256 variables, 112/126 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 143/269 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 3/272 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 11 (OVERLAPS) 0/256 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 273 constraints, problems are : Problem set: 0 solved, 143 unsolved in 15744 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 27682ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 27686ms
Starting structural reductions in LTL mode, iteration 1 : 112/159 places, 144/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28018 ms. Remains : 112/159 places, 144/205 transitions.
[2026-05-31 20:33:40] [INFO ] Flatten gal took : 11 ms
[2026-05-31 20:33:40] [INFO ] Flatten gal took : 10 ms
[2026-05-31 20:33:40] [INFO ] Input system was already deterministic with 144 transitions.
[2026-05-31 20:33:40] [INFO ] Flatten gal took : 17 ms
[2026-05-31 20:33:40] [INFO ] Flatten gal took : 18 ms
[2026-05-31 20:33:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality18385564179053778704.gal : 7 ms
[2026-05-31 20:33:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality5972563863671195490.ctl : 20 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/CTLCardinality18385564179053778704.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5972563863671195490.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.01562e+07,0.292061,11188,2,1984,5,29909,6,0,594,34041,0


Converting to forward existential form...Done !
original formula: E((EX((EF(((p106==1)&&(p144==0))) + (p53==1))) + EG(E(E((p65==1) U ((p110==0)||(p70==1))) U AG(((p45==0)||(p61==1)))))) U EG(!((EF((p116=...210
=> equivalent forward existential formula: [FwdG(FwdU(Init,(EX((E(TRUE U ((p106==1)&&(p144==0))) + (p53==1))) + EG(E(E((p65==1) U ((p110==0)||(p70==1))) U ...278
Reverse transition relation is NOT exact ! Due to transitions t9, t13, t16, t25, t31, t51, t55, t69, t70, t74, t76, t82, t83, t89, t91, t93, t95, t113, t11...270
Detected timeout of ITS tools.
[2026-05-31 20:34:10] [INFO ] Flatten gal took : 12 ms
[2026-05-31 20:34:10] [INFO ] Applying decomposition
[2026-05-31 20:34:10] [INFO ] Flatten gal took : 9 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/graph16230326347513631234.txt' '-o' '/tmp/graph16230326347513631234.bin' '-w' '/tmp/graph16230326347513631234.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16230326347513631234.bin' '-l' '-1' '-v' '-w' '/tmp/graph16230326347513631234.weights' '-q' '0' '-e' '0.001'
[2026-05-31 20:34:10] [INFO ] Decomposing Gal with order
[2026-05-31 20:34:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 20:34:10] [INFO ] Removed a total of 95 redundant transitions.
[2026-05-31 20:34:10] [INFO ] Flatten gal took : 135 ms
[2026-05-31 20:34:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 18 ms.
[2026-05-31 20:34:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality18211721473055763218.gal : 10 ms
[2026-05-31 20:34:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality16047616093113205915.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/CTLCardinality18211721473055763218.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16047616093113205915.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,3.01562e+07,0.051819,5312,245,36,2078,262,362,3497,76,529,0


Converting to forward existential form...Done !
original formula: E((EX((EF(((i5.u23.p106==1)&&(i9.u33.p144==0))) + (i2.u12.p53==1))) + EG(E(E((i3.i1.u14.p65==1) U ((i5.u25.p110==0)||(i0.i0.u15.p70==1)))...317
=> equivalent forward existential formula: [FwdG(FwdU(Init,(EX((E(TRUE U ((i5.u23.p106==1)&&(i9.u33.p144==0))) + (i2.u12.p53==1))) + EG(E(E((i3.i1.u14.p65=...385
Reverse transition relation is NOT exact ! Due to transitions t25, t69, i1.u7.t83, i1.u7.t89, i2.t82, i2.t74, i2.u12.t76, i3.t118, i3.t117, i3.i0.t93, i3.i...371
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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an 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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an 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
(forward)formula 0,1,6.7804,166824,1,0,296537,1000,2193,568567,349,3245,373946
FORMULA ErlangenMainframeV1-PT-bP01C01-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 159/159 places, 205/205 transitions.
Graph (trivial) has 138 edges and 159 vertex of which 12 / 159 are part of one of the 5 SCC in 4 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 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 151 transition count 149
Reduce places removed 47 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 60 rules applied. Total rules applied 108 place count 104 transition count 136
Reduce places removed 5 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 11 rules applied. Total rules applied 119 place count 99 transition count 130
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 126 place count 93 transition count 129
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 126 place count 93 transition count 122
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 140 place count 86 transition count 122
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 155 place count 71 transition count 107
Iterating global reduction 4 with 15 rules applied. Total rules applied 170 place count 71 transition count 107
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 170 place count 71 transition count 106
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 172 place count 70 transition count 106
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 177 place count 65 transition count 82
Iterating global reduction 4 with 5 rules applied. Total rules applied 182 place count 65 transition count 82
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 183 place count 64 transition count 80
Iterating global reduction 4 with 1 rules applied. Total rules applied 184 place count 64 transition count 80
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 210 place count 51 transition count 67
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 211 place count 50 transition count 65
Iterating global reduction 4 with 1 rules applied. Total rules applied 212 place count 50 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 214 place count 50 transition count 63
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 216 place count 50 transition count 63
Applied a total of 216 rules in 70 ms. Remains 50 /159 variables (removed 109) and now considering 63/205 (removed 142) transitions.
[2026-05-31 20:34:17] [INFO ] Flow matrix only has 59 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17749482372586753241.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-755139423148794348.kers'
[2026-05-31 20:34:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17749482372586753241.kers, --Pflows, --basisKERS=/tmp/petrispot-output-755139423148794348.kers]
Normalized transition count is 58 out of 59 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 58 rows 50 cols 164 entries
Finished phase 1 with 40 SingleSign rule and 2 generalized
[2026-05-31 20:34:17] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-755139423148794348.kers
Total runtime 3 ms.
[2026-05-31 20:34:17] [INFO ] Implicit Places using invariants in 61 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 49/159 places, 63/205 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 47 transition count 61
Applied a total of 4 rules in 5 ms. Remains 47 /49 variables (removed 2) and now considering 61/63 (removed 2) transitions.
[2026-05-31 20:34:17] [INFO ] Flow matrix only has 57 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-799534599106559855.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6184201379821419466.kers'
[2026-05-31 20:34:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-799534599106559855.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6184201379821419466.kers]
Normalized transition count is 56 out of 57 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 56 rows 47 cols 148 entries
Finished phase 1 with 40 SingleSign rule and 0 generalized
[2026-05-31 20:34:17] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6184201379821419466.kers
Total runtime 1 ms.
[2026-05-31 20:34:18] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-31 20:34:18] [INFO ] Flow matrix only has 57 transitions (discarded 4 similar events)
[2026-05-31 20:34:18] [INFO ] Invariant cache hit.
[2026-05-31 20:34:18] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-31 20:34:18] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 47/159 places, 61/205 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 276 ms. Remains : 47/159 places, 61/205 transitions.
[2026-05-31 20:34:18] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:34:18] [INFO ] Flatten gal took : 3 ms
[2026-05-31 20:34:18] [INFO ] Input system was already deterministic with 61 transitions.
[2026-05-31 20:34:18] [INFO ] Flatten gal took : 3 ms
[2026-05-31 20:34:18] [INFO ] Flatten gal took : 2 ms
[2026-05-31 20:34:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality14808626375687633144.gal : 1 ms
[2026-05-31 20:34:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality10351815289732700661.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/CTLCardinality14808626375687633144.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10351815289732700661.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,98743,0.019911,4304,2,152,5,1573,6,0,244,1691,0


Converting to forward existential form...Done !
original formula: AG((AG(!(A(E(((p99==0)||(p102==1)) U ((p82==0)||(p13==1))) U ((p2==1)&&(p100==1))))) + (!(E((p16==1) U (p82==1))) * EF(((p169==0)||(p86==...162
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * !(!(E(TRUE U !(!(!((E(!(((p2==1)&&(p100==1))) U (!(E(((p99==0)||(p102==1)) U ((p82==0...503
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t46, Intersection with reachable at each step enabled. (destroyed/reverse/intersect...173
Hit Full ! (commute/partial/dont) 59/0/2
(forward)formula 0,0,0.086826,6480,1,0,100,11203,159,57,1524,10211,159
FORMULA ErlangenMainframeV1-PT-bP01C01-CTLCardinality-2024-01 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 : 159/159 places, 205/205 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 128 transition count 174
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 128 transition count 174
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 73 place count 117 transition count 163
Iterating global reduction 0 with 11 rules applied. Total rules applied 84 place count 117 transition count 163
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 89 place count 112 transition count 158
Iterating global reduction 0 with 5 rules applied. Total rules applied 94 place count 112 transition count 158
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 99 place count 107 transition count 135
Iterating global reduction 0 with 5 rules applied. Total rules applied 104 place count 107 transition count 135
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 107 place count 104 transition count 132
Iterating global reduction 0 with 3 rules applied. Total rules applied 110 place count 104 transition count 132
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 112 place count 102 transition count 130
Iterating global reduction 0 with 2 rules applied. Total rules applied 114 place count 102 transition count 130
Applied a total of 114 rules in 11 ms. Remains 102 /159 variables (removed 57) and now considering 130/205 (removed 75) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16004196839685387882.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12689801245230516489.kers'
[2026-05-31 20:34:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16004196839685387882.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12689801245230516489.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 130 rows 102 cols 334 entries
Finished phase 1 with 93 SingleSign rule and 1 generalized
[2026-05-31 20:34:18] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12689801245230516489.kers
Total runtime 1 ms.
[2026-05-31 20:34:18] [INFO ] Implicit Places using invariants in 69 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 101/159 places, 130/205 transitions.
Applied a total of 0 rules in 1 ms. Remains 101 /101 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 82 ms. Remains : 101/159 places, 130/205 transitions.
[2026-05-31 20:34:18] [INFO ] Flatten gal took : 7 ms
[2026-05-31 20:34:18] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:34:18] [INFO ] Input system was already deterministic with 130 transitions.
[2026-05-31 20:34:18] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:34:18] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:34:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality2225370431747480944.gal : 1 ms
[2026-05-31 20:34:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality12313672093857081726.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/CTLCardinality2225370431747480944.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12313672093857081726.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.17378e+07,0.152184,8204,2,1394,5,16667,6,0,536,21093,0


Converting to forward existential form...Done !
original formula: (EG((AF(EG((p22==0))) * EF(((p54==0)&&(p134==1))))) + AF((((EG((((p164==1)||((p33==0)&&(p1==1))) + AX((p24==0)))) * (p131==0)) * ((p39==0...224
=> equivalent forward existential formula: [FwdG((Init * !(EG((!(EG(!(EG((p22==0))))) * E(TRUE U ((p54==0)&&(p134==1))))))),!((((EG((((p164==1)||((p33==0)&...302
Reverse transition relation is NOT exact ! Due to transitions t8, t12, t15, t23, t29, t46, t51, t52, t65, t68, t70, t74, t76, t83, t85, t86, t88, t104, t10...264
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,6.00825,147456,1,0,413,970149,309,228,3417,720080,533
FORMULA ErlangenMainframeV1-PT-bP01C01-CTLCardinality-2024-02 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 : 159/159 places, 205/205 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 129 transition count 175
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 129 transition count 175
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 70 place count 119 transition count 165
Iterating global reduction 0 with 10 rules applied. Total rules applied 80 place count 119 transition count 165
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 83 place count 116 transition count 162
Iterating global reduction 0 with 3 rules applied. Total rules applied 86 place count 116 transition count 162
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 89 place count 113 transition count 145
Iterating global reduction 0 with 3 rules applied. Total rules applied 92 place count 113 transition count 145
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 94 place count 111 transition count 143
Iterating global reduction 0 with 2 rules applied. Total rules applied 96 place count 111 transition count 143
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 98 place count 109 transition count 141
Iterating global reduction 0 with 2 rules applied. Total rules applied 100 place count 109 transition count 141
Applied a total of 100 rules in 15 ms. Remains 109 /159 variables (removed 50) and now considering 141/205 (removed 64) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6945916014885009596.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7087536005830237688.kers'
[2026-05-31 20:34:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6945916014885009596.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7087536005830237688.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 141 rows 109 cols 382 entries
Finished phase 1 with 99 SingleSign rule and 2 generalized
[2026-05-31 20:34:24] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7087536005830237688.kers
Total runtime 1 ms.
[2026-05-31 20:34:24] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-31 20:34:24] [INFO ] Invariant cache hit.
[2026-05-31 20:34:24] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 140 sub problems to find dead transitions.
[2026-05-31 20:34:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 141/250 variables, 109/119 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 0/250 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 120 constraints, problems are : Problem set: 0 solved, 140 unsolved in 8543 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (OVERLAPS) 141/250 variables, 109/123 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 140/263 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (OVERLAPS) 0/250 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 264 constraints, problems are : Problem set: 0 solved, 140 unsolved in 12066 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 20628ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 20630ms
Starting structural reductions in LTL mode, iteration 1 : 109/159 places, 141/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20841 ms. Remains : 109/159 places, 141/205 transitions.
[2026-05-31 20:34:45] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:34:45] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:34:45] [INFO ] Input system was already deterministic with 141 transitions.
[2026-05-31 20:34:45] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:34:45] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:34:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality4352762377143015714.gal : 6 ms
[2026-05-31 20:34:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality5555328003669495581.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/CTLCardinality4352762377143015714.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5555328003669495581.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.08407e+07,0.11984,7940,2,1345,5,16680,6,0,579,16865,0


Converting to forward existential form...Done !
original formula: EF(((p19==1) * EX((((EX((p87==1)) + EX((p59==1))) + ((p80==0)||(p108==1))) + ((p16==0)||(p62==1))))))
=> equivalent forward existential formula: ((([(EY(EY((FwdU(Init,TRUE) * (p19==1)))) * (p87==1))] != FALSE + [(EY(EY((FwdU(Init,TRUE) * (p19==1)))) * (p59=...315
(forward)formula 0,1,0.135952,8204,1,0,11,16680,9,2,924,16865,4
FORMULA ErlangenMainframeV1-PT-bP01C01-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 205/205 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 132 transition count 178
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 132 transition count 178
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 63 place count 123 transition count 169
Iterating global reduction 0 with 9 rules applied. Total rules applied 72 place count 123 transition count 169
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 75 place count 120 transition count 166
Iterating global reduction 0 with 3 rules applied. Total rules applied 78 place count 120 transition count 166
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 81 place count 117 transition count 147
Iterating global reduction 0 with 3 rules applied. Total rules applied 84 place count 117 transition count 147
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 87 place count 114 transition count 144
Iterating global reduction 0 with 3 rules applied. Total rules applied 90 place count 114 transition count 144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 113 transition count 143
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 113 transition count 143
Applied a total of 92 rules in 11 ms. Remains 113 /159 variables (removed 46) and now considering 143/205 (removed 62) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12335150708651197179.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6076330770025501279.kers'
[2026-05-31 20:34:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12335150708651197179.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6076330770025501279.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 143 rows 113 cols 380 entries
Finished phase 1 with 102 SingleSign rule and 3 generalized
[2026-05-31 20:34:45] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6076330770025501279.kers
Total runtime 1 ms.
[2026-05-31 20:34:45] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-31 20:34:45] [INFO ] Invariant cache hit.
[2026-05-31 20:34:45] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 142 sub problems to find dead transitions.
[2026-05-31 20:34:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 143/256 variables, 113/128 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 0/256 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 128 constraints, problems are : Problem set: 0 solved, 142 unsolved in 11270 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 143/256 variables, 113/128 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 142/270 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 11 (OVERLAPS) 0/256 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 274 constraints, problems are : Problem set: 0 solved, 142 unsolved in 20080 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 31375ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 31376ms
Starting structural reductions in LTL mode, iteration 1 : 113/159 places, 143/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31597 ms. Remains : 113/159 places, 143/205 transitions.
[2026-05-31 20:35:17] [INFO ] Flatten gal took : 7 ms
[2026-05-31 20:35:17] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:35:17] [INFO ] Input system was already deterministic with 143 transitions.
[2026-05-31 20:35:17] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:35:17] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:35:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality6301305579916209247.gal : 1 ms
[2026-05-31 20:35:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality989212156185780476.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/CTLCardinality6301305579916209247.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality989212156185780476.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,2.38827e+07,0.16502,8060,2,2033,5,17295,6,0,597,17858,0


Converting to forward existential form...Done !
original formula: (EX((((((p167==0)&&(p98==1)) + (((p106==0)&&(p31==1)) * (AG(((p7==0)&&(p99==1))) * AX(((p39==0)&&(p138==1)))))) * (p13==0)) * (p100==1)))...270
=> equivalent forward existential formula: (([(((EY(Init) * (p100==1)) * (p13==0)) * ((p167==0)&&(p98==1)))] != FALSE + [(((((EY(Init) * (p100==1)) * (p13=...664
Reverse transition relation is NOT exact ! Due to transitions t9, t13, t16, t26, t51, t52, t55, t59, t70, t73, t80, t86, t89, t90, t93, t113, t118, t119, t...260
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,16.0141,411780,1,0,595,2.83808e+06,331,299,3866,2.26458e+06,714
FORMULA ErlangenMainframeV1-PT-bP01C01-CTLCardinality-2024-04 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 : 159/159 places, 205/205 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 131 transition count 177
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 131 transition count 177
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 67 place count 120 transition count 166
Iterating global reduction 0 with 11 rules applied. Total rules applied 78 place count 120 transition count 166
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 83 place count 115 transition count 161
Iterating global reduction 0 with 5 rules applied. Total rules applied 88 place count 115 transition count 161
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 93 place count 110 transition count 138
Iterating global reduction 0 with 5 rules applied. Total rules applied 98 place count 110 transition count 138
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 102 place count 106 transition count 133
Iterating global reduction 0 with 4 rules applied. Total rules applied 106 place count 106 transition count 133
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 108 place count 104 transition count 131
Iterating global reduction 0 with 2 rules applied. Total rules applied 110 place count 104 transition count 131
Applied a total of 110 rules in 12 ms. Remains 104 /159 variables (removed 55) and now considering 131/205 (removed 74) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18060550960764941051.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9046341563046432979.kers'
[2026-05-31 20:35:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18060550960764941051.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9046341563046432979.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 131 rows 104 cols 336 entries
Finished phase 1 with 95 SingleSign rule and 1 generalized
[2026-05-31 20:35:33] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-9046341563046432979.kers
Total runtime 6 ms.
[2026-05-31 20:35:33] [INFO ] Implicit Places using invariants in 67 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 82 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/159 places, 131/205 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 131/131 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 98 ms. Remains : 103/159 places, 131/205 transitions.
[2026-05-31 20:35:33] [INFO ] Flatten gal took : 5 ms
[2026-05-31 20:35:33] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:35:33] [INFO ] Input system was already deterministic with 131 transitions.
[2026-05-31 20:35:33] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:35:33] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:35:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality1796651671975104582.gal : 1 ms
[2026-05-31 20:35:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality15572630230991063288.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/CTLCardinality1796651671975104582.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15572630230991063288.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.09603e+07,0.06565,5824,2,920,5,7252,6,0,545,9105,0


Converting to forward existential form...Done !
original formula: ((EX(AF((AG(((p48==0)||(p96==1))) * (EX(((p62==0)||(p71==1))) + (p64!=1))))) + AG((p67==0))) + AG(((p58==0)||(p147==1))))
=> equivalent forward existential formula: [(FwdU((Init * !((EX(!(EG(!((!(E(TRUE U !(((p48==0)||(p96==1))))) * (EX(((p62==0)||(p71==1))) + (p64!=1))))))) +...226
Reverse transition relation is NOT exact ! Due to transitions t8, t12, t16, t28, t32, t35, t43, t65, t67, t68, t69, t72, t78, t80, t86, t88, t90, t106, In...252
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,3.65293,102912,1,0,283,582658,299,147,3522,558362,384
FORMULA ErlangenMainframeV1-PT-bP01C01-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 205/205 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 125 transition count 171
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 125 transition count 171
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 80 place count 113 transition count 159
Iterating global reduction 0 with 12 rules applied. Total rules applied 92 place count 113 transition count 159
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 97 place count 108 transition count 154
Iterating global reduction 0 with 5 rules applied. Total rules applied 102 place count 108 transition count 154
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 107 place count 103 transition count 131
Iterating global reduction 0 with 5 rules applied. Total rules applied 112 place count 103 transition count 131
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 116 place count 99 transition count 126
Iterating global reduction 0 with 4 rules applied. Total rules applied 120 place count 99 transition count 126
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 123 place count 96 transition count 123
Iterating global reduction 0 with 3 rules applied. Total rules applied 126 place count 96 transition count 123
Applied a total of 126 rules in 9 ms. Remains 96 /159 variables (removed 63) and now considering 123/205 (removed 82) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9688124215878875362.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15870670626841805952.kers'
[2026-05-31 20:35:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9688124215878875362.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15870670626841805952.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 123 rows 96 cols 320 entries
Finished phase 1 with 87 SingleSign rule and 1 generalized
[2026-05-31 20:35:37] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15870670626841805952.kers
Total runtime 1 ms.
[2026-05-31 20:35:37] [INFO ] Implicit Places using invariants in 51 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 95/159 places, 123/205 transitions.
Applied a total of 0 rules in 1 ms. Remains 95 /95 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63 ms. Remains : 95/159 places, 123/205 transitions.
[2026-05-31 20:35:37] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:35:37] [INFO ] Flatten gal took : 5 ms
[2026-05-31 20:35:37] [INFO ] Input system was already deterministic with 123 transitions.
[2026-05-31 20:35:37] [INFO ] Flatten gal took : 5 ms
[2026-05-31 20:35:37] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:35:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality8278246069994433302.gal : 1 ms
[2026-05-31 20:35:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality17994294313546892387.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/CTLCardinality8278246069994433302.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17994294313546892387.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.067274,5840,1,0,6,7993,7,1,607,8221,1
FORMULA ErlangenMainframeV1-PT-bP01C01-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 205/205 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 126 transition count 172
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 126 transition count 172
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 78 place count 114 transition count 160
Iterating global reduction 0 with 12 rules applied. Total rules applied 90 place count 114 transition count 160
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 95 place count 109 transition count 155
Iterating global reduction 0 with 5 rules applied. Total rules applied 100 place count 109 transition count 155
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 104 place count 105 transition count 136
Iterating global reduction 0 with 4 rules applied. Total rules applied 108 place count 105 transition count 136
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 111 place count 102 transition count 132
Iterating global reduction 0 with 3 rules applied. Total rules applied 114 place count 102 transition count 132
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 116 place count 100 transition count 130
Iterating global reduction 0 with 2 rules applied. Total rules applied 118 place count 100 transition count 130
Applied a total of 118 rules in 9 ms. Remains 100 /159 variables (removed 59) and now considering 130/205 (removed 75) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16589900324091436897.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7849097733457826502.kers'
[2026-05-31 20:35:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16589900324091436897.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7849097733457826502.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 130 rows 100 cols 350 entries
Finished phase 1 with 91 SingleSign rule and 1 generalized
[2026-05-31 20:35:37] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7849097733457826502.kers
Total runtime 1 ms.
[2026-05-31 20:35:37] [INFO ] Implicit Places using invariants in 59 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/159 places, 130/205 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 71 ms. Remains : 99/159 places, 130/205 transitions.
[2026-05-31 20:35:37] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:35:37] [INFO ] Flatten gal took : 5 ms
[2026-05-31 20:35:37] [INFO ] Input system was already deterministic with 130 transitions.
[2026-05-31 20:35:37] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:35:37] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:35:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality4755348009014991061.gal : 2 ms
[2026-05-31 20:35:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality12771858515329128410.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/CTLCardinality4755348009014991061.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12771858515329128410.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (AX(AF(AG((p120==0)))) + AG(AX(((p83==0)||(p37==1)))))
=> equivalent forward existential formula: [(EY(FwdU((Init * !(!(EX(!(!(EG(!(!(E(TRUE U !((p120==0)))))))))))),TRUE)) * !(((p83==0)||(p37==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t12, t15, t23, t33, t65, t68, t75, t83, t85, t101, t104, Intersection with reachable at ...223
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,2.39256,69572,1,0,226,423622,293,123,3582,305763,331
FORMULA ErlangenMainframeV1-PT-bP01C01-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 159/159 places, 205/205 transitions.
Graph (trivial) has 153 edges and 159 vertex of which 10 / 159 are part of one of the 4 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 152 transition count 140
Reduce places removed 57 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 72 rules applied. Total rules applied 130 place count 95 transition count 125
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 136 place count 89 transition count 125
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 136 place count 89 transition count 118
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 150 place count 82 transition count 118
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 168 place count 64 transition count 100
Iterating global reduction 3 with 18 rules applied. Total rules applied 186 place count 64 transition count 100
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 186 place count 64 transition count 97
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 192 place count 61 transition count 97
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 199 place count 54 transition count 70
Ensure Unique test removed 1 places
Iterating global reduction 3 with 8 rules applied. Total rules applied 207 place count 53 transition count 70
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 209 place count 51 transition count 66
Iterating global reduction 3 with 2 rules applied. Total rules applied 211 place count 51 transition count 66
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 212 place count 50 transition count 64
Iterating global reduction 3 with 1 rules applied. Total rules applied 213 place count 50 transition count 64
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 245 place count 34 transition count 48
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 246 place count 33 transition count 47
Iterating global reduction 3 with 1 rules applied. Total rules applied 247 place count 33 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 251 place count 33 transition count 43
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 253 place count 32 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 254 place count 31 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 255 place count 30 transition count 41
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 258 place count 30 transition count 38
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 259 place count 30 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 260 place count 29 transition count 37
Applied a total of 260 rules in 34 ms. Remains 29 /159 variables (removed 130) and now considering 37/205 (removed 168) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8823588230365335063.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1657200178724508713.kers'
[2026-05-31 20:35:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8823588230365335063.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1657200178724508713.kers]
Normalized transition count is 36 out of 37 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 36 rows 28 cols 87 entries
Finished phase 1 with 23 SingleSign rule and 0 generalized
[2026-05-31 20:35:39] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1657200178724508713.kers
Total runtime 2 ms.
[2026-05-31 20:35:39] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-31 20:35:39] [INFO ] Invariant cache hit.
[2026-05-31 20:35:39] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2026-05-31 20:35:39] [INFO ] Redundant transitions in 0 ms returned []
Running 24 sub problems to find dead transitions.
[2026-05-31 20:35:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 5/29 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 36/65 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/66 variables, and 35 constraints, problems are : Problem set: 0 solved, 24 unsolved in 644 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 5/29 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 36/65 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/65 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/66 variables, and 59 constraints, problems are : Problem set: 0 solved, 24 unsolved in 407 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1065ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 1065ms
Starting structural reductions in SI_CTL mode, iteration 1 : 29/159 places, 37/205 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1198 ms. Remains : 29/159 places, 37/205 transitions.
[2026-05-31 20:35:40] [INFO ] Flatten gal took : 1 ms
[2026-05-31 20:35:40] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:35:40] [INFO ] Input system was already deterministic with 37 transitions.
[2026-05-31 20:35:40] [INFO ] Flatten gal took : 2 ms
[2026-05-31 20:35:40] [INFO ] Flatten gal took : 1 ms
[2026-05-31 20:35:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality17911087567918686720.gal : 0 ms
[2026-05-31 20:35:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality16082748922123166483.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/CTLCardinality17911087567918686720.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16082748922123166483.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,8640,0.007125,3992,2,78,5,426,5,0,154,335,0


Converting to forward existential form...Done !
original formula: EF(AG((p49==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p49==0)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.019916,4480,1,0,8,3374,13,2,661,2404,5
FORMULA ErlangenMainframeV1-PT-bP01C01-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 159/159 places, 205/205 transitions.
Graph (trivial) has 140 edges and 159 vertex of which 10 / 159 are part of one of the 4 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 152 transition count 151
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 58 rules applied. Total rules applied 105 place count 106 transition count 139
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 113 place count 100 transition count 137
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 115 place count 98 transition count 137
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 115 place count 98 transition count 128
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 133 place count 89 transition count 128
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 147 place count 75 transition count 114
Iterating global reduction 4 with 14 rules applied. Total rules applied 161 place count 75 transition count 114
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 161 place count 75 transition count 113
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 163 place count 74 transition count 113
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 168 place count 69 transition count 92
Ensure Unique test removed 1 places
Iterating global reduction 4 with 6 rules applied. Total rules applied 174 place count 68 transition count 92
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 176 place count 66 transition count 88
Iterating global reduction 4 with 2 rules applied. Total rules applied 178 place count 66 transition count 88
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 179 place count 65 transition count 86
Iterating global reduction 4 with 1 rules applied. Total rules applied 180 place count 65 transition count 86
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 216 place count 47 transition count 68
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 217 place count 46 transition count 64
Iterating global reduction 4 with 1 rules applied. Total rules applied 218 place count 46 transition count 64
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 222 place count 46 transition count 60
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 224 place count 45 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 225 place count 44 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 226 place count 43 transition count 58
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 229 place count 43 transition count 55
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 230 place count 43 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 231 place count 42 transition count 54
Applied a total of 231 rules in 43 ms. Remains 42 /159 variables (removed 117) and now considering 54/205 (removed 151) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13199861078919360989.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12306181603175746483.kers'
[2026-05-31 20:35:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13199861078919360989.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12306181603175746483.kers]
Normalized transition count is 53 out of 54 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 53 rows 41 cols 133 entries
Finished phase 1 with 36 SingleSign rule and 0 generalized
[2026-05-31 20:35:41] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12306181603175746483.kers
Total runtime 0 ms.
[2026-05-31 20:35:41] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-31 20:35:41] [INFO ] Invariant cache hit.
[2026-05-31 20:35:41] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2026-05-31 20:35:41] [INFO ] Redundant transitions in 1 ms returned []
Running 42 sub problems to find dead transitions.
[2026-05-31 20:35:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 5/42 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 53/95 variables, 42/48 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 0/95 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 95/96 variables, and 48 constraints, problems are : Problem set: 0 solved, 42 unsolved in 975 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 5/42 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 53/95 variables, 42/48 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 42/90 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 0/95 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 95/96 variables, and 91 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1380 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2359ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 2359ms
Starting structural reductions in SI_CTL mode, iteration 1 : 42/159 places, 54/205 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2504 ms. Remains : 42/159 places, 54/205 transitions.
[2026-05-31 20:35:43] [INFO ] Flatten gal took : 3 ms
[2026-05-31 20:35:43] [INFO ] Flatten gal took : 3 ms
[2026-05-31 20:35:43] [INFO ] Input system was already deterministic with 54 transitions.
[2026-05-31 20:35:43] [INFO ] Flatten gal took : 2 ms
[2026-05-31 20:35:43] [INFO ] Flatten gal took : 2 ms
[2026-05-31 20:35:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality1274215275512915796.gal : 1 ms
[2026-05-31 20:35:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality13335503540797331255.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/CTLCardinality1274215275512915796.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13335503540797331255.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,55440,0.016679,4152,2,79,5,944,5,0,222,886,0


Converting to forward existential form...Done !
original formula: AG(((p35==1) + AF(((((p119==0)&&(p57==1)) * AG((p90==0))) + ((((p93==0)||(p49==1))||(p114==0)) * EF((p84==1)))))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !((p35==1))),!(((((p119==0)&&(p57==1)) * !(E(TRUE U !((p90==0))))) + ((((p93==0)||(p49=...205
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.078336,5700,1,0,21,9489,24,11,1005,8697,19
FORMULA ErlangenMainframeV1-PT-bP01C01-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 159/159 places, 205/205 transitions.
Graph (trivial) has 151 edges and 159 vertex of which 12 / 159 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 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 151 transition count 142
Reduce places removed 54 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 69 rules applied. Total rules applied 124 place count 97 transition count 127
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 132 place count 91 transition count 125
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 134 place count 89 transition count 125
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 134 place count 89 transition count 119
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 146 place count 83 transition count 119
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 159 place count 70 transition count 106
Iterating global reduction 4 with 13 rules applied. Total rules applied 172 place count 70 transition count 106
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 172 place count 70 transition count 104
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 176 place count 68 transition count 104
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 179 place count 65 transition count 93
Ensure Unique test removed 1 places
Iterating global reduction 4 with 4 rules applied. Total rules applied 183 place count 64 transition count 93
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 185 place count 62 transition count 89
Iterating global reduction 4 with 2 rules applied. Total rules applied 187 place count 62 transition count 89
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 188 place count 61 transition count 87
Iterating global reduction 4 with 1 rules applied. Total rules applied 189 place count 61 transition count 87
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 225 place count 43 transition count 69
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 227 place count 41 transition count 57
Iterating global reduction 4 with 2 rules applied. Total rules applied 229 place count 41 transition count 57
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 231 place count 41 transition count 55
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 233 place count 40 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 234 place count 39 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 235 place count 38 transition count 53
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 239 place count 38 transition count 49
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 241 place count 38 transition count 47
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 243 place count 36 transition count 47
Applied a total of 243 rules in 42 ms. Remains 36 /159 variables (removed 123) and now considering 47/205 (removed 158) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17346642836212117727.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5344302888951525072.kers'
[2026-05-31 20:35:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17346642836212117727.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5344302888951525072.kers]
Normalized transition count is 46 out of 47 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 46 rows 35 cols 127 entries
Finished phase 1 with 30 SingleSign rule and 0 generalized
[2026-05-31 20:35:43] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5344302888951525072.kers
Total runtime 0 ms.
[2026-05-31 20:35:43] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-31 20:35:43] [INFO ] Invariant cache hit.
[2026-05-31 20:35:43] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2026-05-31 20:35:43] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2026-05-31 20:35:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 5/36 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 46/82 variables, 36/42 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 0/82 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/83 variables, and 42 constraints, problems are : Problem set: 0 solved, 32 unsolved in 942 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 5/36 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 46/82 variables, 36/42 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 32/74 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/82 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/83 variables, and 74 constraints, problems are : Problem set: 0 solved, 32 unsolved in 825 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1772ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 1773ms
Starting structural reductions in SI_CTL mode, iteration 1 : 36/159 places, 47/205 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1962 ms. Remains : 36/159 places, 47/205 transitions.
[2026-05-31 20:35:45] [INFO ] Flatten gal took : 2 ms
[2026-05-31 20:35:45] [INFO ] Flatten gal took : 1 ms
[2026-05-31 20:35:45] [INFO ] Input system was already deterministic with 47 transitions.
[2026-05-31 20:35:45] [INFO ] Flatten gal took : 2 ms
[2026-05-31 20:35:45] [INFO ] Flatten gal took : 1 ms
[2026-05-31 20:35:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality15852819589398069557.gal : 1 ms
[2026-05-31 20:35:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality4596607771532554263.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/CTLCardinality15852819589398069557.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4596607771532554263.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,17280,0.012381,4128,2,86,5,879,5,0,192,828,0


Converting to forward existential form...Done !
original formula: EG(AG(EF((EF(((p38==0)&&(p81==1))) * ((p108==0)||(p92==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(E(TRUE U (E(TRUE U ((p38==0)&&(p81==1))) * ((p108==0)||(p92==1))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.05806,5748,1,0,10,10942,19,2,912,7713,12
FORMULA ErlangenMainframeV1-PT-bP01C01-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 159/159 places, 205/205 transitions.
Graph (trivial) has 156 edges and 159 vertex of which 12 / 159 are part of one of the 5 SCC in 0 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 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 151 transition count 138
Reduce places removed 58 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 73 rules applied. Total rules applied 132 place count 93 transition count 123
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 138 place count 87 transition count 123
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 138 place count 87 transition count 116
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 152 place count 80 transition count 116
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 169 place count 63 transition count 99
Iterating global reduction 3 with 17 rules applied. Total rules applied 186 place count 63 transition count 99
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 186 place count 63 transition count 96
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 192 place count 60 transition count 96
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 199 place count 53 transition count 69
Ensure Unique test removed 1 places
Iterating global reduction 3 with 8 rules applied. Total rules applied 207 place count 52 transition count 69
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 209 place count 50 transition count 65
Iterating global reduction 3 with 2 rules applied. Total rules applied 211 place count 50 transition count 65
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 212 place count 49 transition count 63
Iterating global reduction 3 with 1 rules applied. Total rules applied 213 place count 49 transition count 63
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 245 place count 33 transition count 47
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 246 place count 32 transition count 46
Iterating global reduction 3 with 1 rules applied. Total rules applied 247 place count 32 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 251 place count 32 transition count 42
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 253 place count 31 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 254 place count 30 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 255 place count 29 transition count 40
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 259 place count 29 transition count 36
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 261 place count 29 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 263 place count 27 transition count 34
Applied a total of 263 rules in 17 ms. Remains 27 /159 variables (removed 132) and now considering 34/205 (removed 171) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5768665794008788452.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13810167335587522797.kers'
[2026-05-31 20:35:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5768665794008788452.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13810167335587522797.kers]
Normalized transition count is 33 out of 34 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 33 rows 26 cols 81 entries
Finished phase 1 with 21 SingleSign rule and 0 generalized
[2026-05-31 20:35:45] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13810167335587522797.kers
Total runtime 1 ms.
[2026-05-31 20:35:45] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-31 20:35:45] [INFO ] Invariant cache hit.
[2026-05-31 20:35:45] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2026-05-31 20:35:45] [INFO ] Redundant transitions in 0 ms returned []
Running 21 sub problems to find dead transitions.
[2026-05-31 20:35:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 5/27 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 33/60 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 0/60 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/61 variables, and 33 constraints, problems are : Problem set: 0 solved, 21 unsolved in 515 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 5/27 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 33/60 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 21/54 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/60 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/61 variables, and 54 constraints, problems are : Problem set: 0 solved, 21 unsolved in 467 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 984ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 984ms
Starting structural reductions in SI_CTL mode, iteration 1 : 27/159 places, 34/205 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1089 ms. Remains : 27/159 places, 34/205 transitions.
[2026-05-31 20:35:46] [INFO ] Flatten gal took : 2 ms
[2026-05-31 20:35:46] [INFO ] Flatten gal took : 1 ms
[2026-05-31 20:35:46] [INFO ] Input system was already deterministic with 34 transitions.
RANDOM walk for 52 steps (2 resets) in 4 ms. (10 steps per ms) remains 0/1 properties
FORMULA ErlangenMainframeV1-PT-bP01C01-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-31 20:35:46] [INFO ] Flatten gal took : 1 ms
[2026-05-31 20:35:46] [INFO ] Flatten gal took : 1 ms
[2026-05-31 20:35:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6781914186341971573.gal : 0 ms
[2026-05-31 20:35:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11017029966810023368.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6781914186341971573.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11017029966810023368.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 : 159/159 places, 205/205 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 128 transition count 174
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 128 transition count 174
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 70 place count 120 transition count 166
Iterating global reduction 0 with 8 rules applied. Total rules applied 78 place count 120 transition count 166
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 118 transition count 164
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 118 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 117 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 117 transition count 162
Applied a total of 84 rules in 5 ms. Remains 117 /159 variables (removed 42) and now considering 162/205 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16707050011384318878.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4002880514099461320.kers'
[2026-05-31 20:35:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16707050011384318878.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4002880514099461320.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 162 rows 117 cols 482 entries
Finished phase 1 with 108 SingleSign rule and 1 generalized
[2026-05-31 20:35:46] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4002880514099461320.kers
Total runtime 1 ms.
[2026-05-31 20:35:46] [INFO ] Implicit Places using invariants in 72 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 73 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/159 places, 162/205 transitions.
Applied a total of 0 rules in 1 ms. Remains 116 /116 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 81 ms. Remains : 116/159 places, 162/205 transitions.
[2026-05-31 20:35:46] [INFO ] Flatten gal took : 5 ms
[2026-05-31 20:35:46] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:35:46] [INFO ] Input system was already deterministic with 162 transitions.
[2026-05-31 20:35:46] [INFO ] Flatten gal took : 5 ms
[2026-05-31 20:35:46] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:35:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality15682465325625912567.gal : 1 ms
[2026-05-31 20:35:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality4158368335484224988.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/CTLCardinality15682465325625912567.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4158368335484224988.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.75947e+07,0.220255,11012,2,1678,5,29866,6,0,628,32264,0


Converting to forward existential form...Done !
original formula: AG(((E(!((!(((p150==0)||(p170==1))) * AG((p58==0)))) U EX(EG((p92==0)))) + EG((((p22==1)||(p115==0))||((p119==0)&&(p20==1))))) + (!(E(((p...242
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !((E(!((!(((p150==0)||(p170==1))) * !(E(TRUE U !((p58==0)))))) U EX(EG((p92==0)))) + ...333
Reverse transition relation is NOT exact ! Due to transitions t8, t11, t15, t16, t18, t26, t51, t58, t72, t74, t77, t82, t84, t90, t92, t94, t96, t97, t99,...268
(forward)formula 0,1,7.42541,198032,1,0,412,1.3462e+06,374,217,4233,838687,537
FORMULA ErlangenMainframeV1-PT-bP01C01-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 205/205 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 129 transition count 175
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 129 transition count 175
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 71 place count 118 transition count 164
Iterating global reduction 0 with 11 rules applied. Total rules applied 82 place count 118 transition count 164
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 86 place count 114 transition count 160
Iterating global reduction 0 with 4 rules applied. Total rules applied 90 place count 114 transition count 160
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 94 place count 110 transition count 141
Iterating global reduction 0 with 4 rules applied. Total rules applied 98 place count 110 transition count 141
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 101 place count 107 transition count 137
Iterating global reduction 0 with 3 rules applied. Total rules applied 104 place count 107 transition count 137
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 106 place count 105 transition count 135
Iterating global reduction 0 with 2 rules applied. Total rules applied 108 place count 105 transition count 135
Applied a total of 108 rules in 6 ms. Remains 105 /159 variables (removed 54) and now considering 135/205 (removed 70) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15161761534417263862.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2388042645899772075.kers'
[2026-05-31 20:35:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15161761534417263862.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2388042645899772075.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 135 rows 105 cols 360 entries
Finished phase 1 with 96 SingleSign rule and 1 generalized
[2026-05-31 20:35:54] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2388042645899772075.kers
Total runtime 1 ms.
[2026-05-31 20:35:54] [INFO ] Implicit Places using invariants in 54 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/159 places, 135/205 transitions.
Applied a total of 0 rules in 1 ms. Remains 104 /104 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63 ms. Remains : 104/159 places, 135/205 transitions.
[2026-05-31 20:35:54] [INFO ] Flatten gal took : 3 ms
[2026-05-31 20:35:54] [INFO ] Flatten gal took : 3 ms
[2026-05-31 20:35:54] [INFO ] Input system was already deterministic with 135 transitions.
[2026-05-31 20:35:54] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:35:54] [INFO ] Flatten gal took : 3 ms
[2026-05-31 20:35:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality3061416037769668019.gal : 1 ms
[2026-05-31 20:35:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality849106491206481356.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/CTLCardinality3061416037769668019.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality849106491206481356.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.1784e+07,0.133802,7012,2,1082,5,12427,6,0,553,14751,0


Converting to forward existential form...Done !
original formula: A(EF((p89==1)) U !(EX(A(EF(((p108==0)||(p28==1))) U (p159!=0)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!((E(!((p159!=0)) U (!(E(TRUE U ((p108==0)||(p28==1)))) * !((p159!=0)))) + EG(!((p159!=0))...419
Reverse transition relation is NOT exact ! Due to transitions t8, t13, t16, t19, t27, t56, t69, t79, t82, t88, t90, t106, t109, Intersection with reachabl...228
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,4.20989,124844,1,0,411,824702,306,270,3573,635461,525
FORMULA ErlangenMainframeV1-PT-bP01C01-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-05-31 20:35:58] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:35:58] [INFO ] Flatten gal took : 4 ms
Total runtime 226606 ms.

BK_STOP 1780259758815

--------------------
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="ErlangenMainframeV1-PT-bP01C01"
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 ErlangenMainframeV1-PT-bP01C01, 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-178021499000049"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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