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-178021499200217.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is ErlangenMainframeV2-PT-bP02C02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499200217
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 7.2K May 27 09:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 27 09:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 27 09:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 27 09:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 27 10:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 27 10:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 27 10:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 12K May 27 09:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K May 27 09:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 27 09:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 27 09:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:40 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 67K May 26 18:17 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1780370919163

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV2-PT-bP02C02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-06-02 03:28:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-02 03:28:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-02 03:28:41] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2026-06-02 03:28:41] [INFO ] Transformed 199 places.
[2026-06-02 03:28:41] [INFO ] Transformed 259 transitions.
[2026-06-02 03:28:41] [INFO ] Found NUPN structural information;
[2026-06-02 03:28:41] [INFO ] Parsed PT model containing 199 places and 259 transitions and 872 arcs in 266 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
Initial state reduction rules removed 1 formulas.
FORMULA ErlangenMainframeV2-PT-bP02C02-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP02C02-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP02C02-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 81 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 259/259 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 179 transition count 239
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 179 transition count 239
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 48 place count 171 transition count 231
Iterating global reduction 0 with 8 rules applied. Total rules applied 56 place count 171 transition count 231
Applied a total of 56 rules in 52 ms. Remains 171 /199 variables (removed 28) and now considering 231/259 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18295780380561571585.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2045346648171849907.kers'
[2026-06-02 03:28:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18295780380561571585.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2045346648171849907.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 231 rows 171 cols 816 entries
Finished phase 1 with 156 SingleSign rule and 3 generalized
[2026-06-02 03:28:41] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2045346648171849907.kers
Total runtime 3 ms.
[2026-06-02 03:28:41] [INFO ] Implicit Places using invariants in 413 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 464 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/199 places, 231/259 transitions.
Applied a total of 0 rules in 6 ms. Remains 170 /170 variables (removed 0) and now considering 231/231 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 544 ms. Remains : 170/199 places, 231/259 transitions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 231/231 transitions.
Applied a total of 0 rules in 6 ms. Remains 170 /170 variables (removed 0) and now considering 231/231 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5549746874112357244.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9226095509802313475.kers'
[2026-06-02 03:28:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5549746874112357244.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9226095509802313475.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 231 rows 170 cols 789 entries
Finished phase 1 with 156 SingleSign rule and 3 generalized
[2026-06-02 03:28:41] [INFO ] Computed 11 invariants in 8 ms
Computed 11 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-9226095509802313475.kers
Total runtime 11 ms.
[2026-06-02 03:28:42] [INFO ] Implicit Places using invariants in 171 ms returned []
[2026-06-02 03:28:42] [INFO ] Invariant cache hit.
[2026-06-02 03:28:42] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
Running 230 sub problems to find dead transitions.
[2026-06-02 03:28:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (OVERLAPS) 1/170 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (OVERLAPS) 231/401 variables, 170/199 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 401/401 variables, and 200 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (OVERLAPS) 1/170 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (OVERLAPS) 231/401 variables, 170/201 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 230/431 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 6/437 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/401 variables, 2/441 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/401 variables, and 441 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60301ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 60330ms
Finished structural reductions in LTL mode , in 1 iterations and 60942 ms. Remains : 170/170 places, 231/231 transitions.
Support contains 81 out of 170 places after structural reductions.
[2026-06-02 03:29:43] [INFO ] Flatten gal took : 95 ms
[2026-06-02 03:29:43] [INFO ] Flatten gal took : 46 ms
[2026-06-02 03:29:43] [INFO ] Input system was already deterministic with 231 transitions.
Support contains 79 out of 170 places (down from 81) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2280 ms. (17 steps per ms) remains 2/46 properties
BEST_FIRST walk for 40003 steps (8 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 170 ms. (233 steps per ms) remains 2/2 properties
[2026-06-02 03:29:44] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 64/138 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 32/170 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 231/401 variables, 170/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/401 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 181 constraints, problems are : Problem set: 0 solved, 2 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 170/170 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 64/138 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 32/170 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 231/401 variables, 170/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/401 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/401 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/401 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 186 constraints, problems are : Problem set: 0 solved, 2 unsolved in 714 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 925ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 31 ms.
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 231/231 transitions.
Graph (trivial) has 154 edges and 170 vertex of which 12 / 170 are part of one of the 5 SCC in 7 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 163 transition count 165
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 67 rules applied. Total rules applied 121 place count 110 transition count 151
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 127 place count 104 transition count 151
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 127 place count 104 transition count 143
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 143 place count 96 transition count 143
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 161 place count 78 transition count 123
Iterating global reduction 3 with 18 rules applied. Total rules applied 179 place count 78 transition count 123
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 179 place count 78 transition count 118
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 189 place count 73 transition count 118
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 195 place count 67 transition count 89
Ensure Unique test removed 1 places
Iterating global reduction 3 with 7 rules applied. Total rules applied 202 place count 66 transition count 89
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 205 place count 63 transition count 79
Iterating global reduction 3 with 3 rules applied. Total rules applied 208 place count 63 transition count 79
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 209 place count 62 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 210 place count 62 transition count 77
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 3 with 36 rules applied. Total rules applied 246 place count 44 transition count 59
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 249 place count 41 transition count 52
Iterating global reduction 3 with 3 rules applied. Total rules applied 252 place count 41 transition count 52
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -14
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 266 place count 34 transition count 66
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 273 place count 34 transition count 59
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 274 place count 33 transition count 55
Iterating global reduction 4 with 1 rules applied. Total rules applied 275 place count 33 transition count 55
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 278 place count 33 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 280 place count 32 transition count 61
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 290 place count 32 transition count 51
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 296 place count 32 transition count 45
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 308 place count 26 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 314 place count 26 transition count 33
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 315 place count 26 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 316 place count 25 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 317 place count 25 transition count 31
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 318 place count 25 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 319 place count 24 transition count 33
Applied a total of 319 rules in 81 ms. Remains 24 /170 variables (removed 146) and now considering 33/231 (removed 198) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 24/170 places, 33/231 transitions.
RANDOM walk for 524 steps (0 resets) in 17 ms. (29 steps per ms) remains 0/1 properties
[2026-06-02 03:29:45] [INFO ] Flatten gal took : 19 ms
[2026-06-02 03:29:45] [INFO ] Flatten gal took : 20 ms
[2026-06-02 03:29:45] [INFO ] Input system was already deterministic with 231 transitions.
Computed a total of 16 stabilizing places and 16 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 231/231 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 142 transition count 201
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 142 transition count 201
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 135 transition count 189
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 135 transition count 189
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 74 place count 131 transition count 175
Iterating global reduction 0 with 4 rules applied. Total rules applied 78 place count 131 transition count 175
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 82 place count 127 transition count 160
Iterating global reduction 0 with 4 rules applied. Total rules applied 86 place count 127 transition count 160
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 125 transition count 158
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 125 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 124 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 124 transition count 157
Applied a total of 92 rules in 25 ms. Remains 124 /170 variables (removed 46) and now considering 157/231 (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-6968095098695972864.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6163272063579461231.kers'
[2026-06-02 03:29:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6968095098695972864.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6163272063579461231.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 157 rows 124 cols 448 entries
Finished phase 1 with 111 SingleSign rule and 2 generalized
[2026-06-02 03:29:45] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6163272063579461231.kers
Total runtime 2 ms.
[2026-06-02 03:29:45] [INFO ] Implicit Places using invariants in 71 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/170 places, 157/231 transitions.
Applied a total of 0 rules in 1 ms. Remains 123 /123 variables (removed 0) and now considering 157/157 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 100 ms. Remains : 123/170 places, 157/231 transitions.
[2026-06-02 03:29:45] [INFO ] Flatten gal took : 10 ms
[2026-06-02 03:29:45] [INFO ] Flatten gal took : 11 ms
[2026-06-02 03:29:45] [INFO ] Input system was already deterministic with 157 transitions.
[2026-06-02 03:29:45] [INFO ] Flatten gal took : 10 ms
[2026-06-02 03:29:45] [INFO ] Flatten gal took : 11 ms
[2026-06-02 03:29:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality10301310325942656474.gal : 5 ms
[2026-06-02 03:29:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality4182074940308554672.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10301310325942656474.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4182074940308554672.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.81805e+08,0.362715,15212,2,3895,5,44818,6,0,651,51731,0


Converting to forward existential form...Done !
original formula: (AF((((p70==0)&&(p84==1))||((p87==0)&&((p191==0)||(p119==1))))) * (((AX(FALSE) + AG(AX(FALSE))) + (AG(EX((((p171==0)&&(p16==1))||(p65==1)...236
=> equivalent forward existential formula: ([FwdG(Init,!((((p70==0)&&(p84==1))||((p87==0)&&((p191==0)||(p119==1))))))] = FALSE * ([FwdG(EY((Init * !(((!(EX...564
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t16, t19, t27, t49, t55, t69, t70, t74, t79, t81, t87, t89, t90, t91, t92, t93, t95...297
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,21.1101,519092,1,0,461,3.39292e+06,350,239,4331,2.50922e+06,587
FORMULA ErlangenMainframeV2-PT-bP02C02-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 231/231 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 136 transition count 195
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 136 transition count 195
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 78 place count 126 transition count 180
Iterating global reduction 0 with 10 rules applied. Total rules applied 88 place count 126 transition count 180
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 94 place count 120 transition count 163
Ensure Unique test removed 1 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 101 place count 119 transition count 163
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 106 place count 114 transition count 146
Iterating global reduction 0 with 5 rules applied. Total rules applied 111 place count 114 transition count 146
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 114 place count 111 transition count 142
Iterating global reduction 0 with 3 rules applied. Total rules applied 117 place count 111 transition count 142
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 118 place count 110 transition count 141
Iterating global reduction 0 with 1 rules applied. Total rules applied 119 place count 110 transition count 141
Applied a total of 119 rules in 13 ms. Remains 110 /170 variables (removed 60) and now considering 141/231 (removed 90) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2741417954155431087.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14369833463480500372.kers'
[2026-06-02 03:30:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2741417954155431087.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14369833463480500372.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 141 rows 110 cols 394 entries
Finished phase 1 with 99 SingleSign rule and 1 generalized
[2026-06-02 03:30:06] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14369833463480500372.kers
Total runtime 2 ms.
[2026-06-02 03:30:07] [INFO ] Implicit Places using invariants in 74 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 109/170 places, 141/231 transitions.
Applied a total of 0 rules in 1 ms. Remains 109 /109 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 92 ms. Remains : 109/170 places, 141/231 transitions.
[2026-06-02 03:30:07] [INFO ] Flatten gal took : 10 ms
[2026-06-02 03:30:07] [INFO ] Flatten gal took : 9 ms
[2026-06-02 03:30:07] [INFO ] Input system was already deterministic with 141 transitions.
[2026-06-02 03:30:07] [INFO ] Flatten gal took : 7 ms
[2026-06-02 03:30:07] [INFO ] Flatten gal took : 8 ms
[2026-06-02 03:30:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality14844060055136872776.gal : 3 ms
[2026-06-02 03:30:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality8225079678288297850.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/CTLCardinality14844060055136872776.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8225079678288297850.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.26032e+07,0.126085,7580,2,1377,5,15631,6,0,579,14749,0


Converting to forward existential form...Done !
original formula: AG(AX(E(EF((p182==0)) U ((p64==0)||(p142==1)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(E(TRUE U (p182==0)) U ((p64==0)||(p142==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t14, t17, t25, t67, t70, t77, t79, t86, t87, t89, t90, t92, t93, t96, t126, t127, Inter...249
(forward)formula 0,1,0.982793,29572,1,0,211,150224,304,120,3509,106584,298
FORMULA ErlangenMainframeV2-PT-bP02C02-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 231/231 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 139 transition count 198
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 139 transition count 198
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 71 place count 130 transition count 184
Iterating global reduction 0 with 9 rules applied. Total rules applied 80 place count 130 transition count 184
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 86 place count 124 transition count 167
Ensure Unique test removed 1 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 93 place count 123 transition count 167
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 98 place count 118 transition count 150
Iterating global reduction 0 with 5 rules applied. Total rules applied 103 place count 118 transition count 150
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 106 place count 115 transition count 146
Iterating global reduction 0 with 3 rules applied. Total rules applied 109 place count 115 transition count 146
Applied a total of 109 rules in 19 ms. Remains 115 /170 variables (removed 55) and now considering 146/231 (removed 85) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2126471264829947964.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8992165533120038116.kers'
[2026-06-02 03:30:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2126471264829947964.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8992165533120038116.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 146 rows 115 cols 404 entries
Finished phase 1 with 104 SingleSign rule and 1 generalized
[2026-06-02 03:30:08] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8992165533120038116.kers
Total runtime 1 ms.
[2026-06-02 03:30:08] [INFO ] Implicit Places using invariants in 77 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 80 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/170 places, 146/231 transitions.
Applied a total of 0 rules in 3 ms. Remains 114 /114 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 102 ms. Remains : 114/170 places, 146/231 transitions.
[2026-06-02 03:30:08] [INFO ] Flatten gal took : 12 ms
[2026-06-02 03:30:08] [INFO ] Flatten gal took : 13 ms
[2026-06-02 03:30:08] [INFO ] Input system was already deterministic with 146 transitions.
[2026-06-02 03:30:08] [INFO ] Flatten gal took : 12 ms
[2026-06-02 03:30:08] [INFO ] Flatten gal took : 12 ms
[2026-06-02 03:30:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality3486698459250376669.gal : 3 ms
[2026-06-02 03:30:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality2753074561928584906.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/CTLCardinality3486698459250376669.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2753074561928584906.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EX((AG(((EX(((p106==0)&&(p184==1))) * ((p51==0)||(p146==1))) * (((p144==0)||(p109==1))||(p119==0)))) + EF((p107==1))))
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U !(((EX(((p106==0)&&(p184==1))) * ((p51==0)||(p146==1))) * (((p144==0)||(p109==1))||(p11...224
Reverse transition relation is NOT exact ! Due to transitions t10, t15, t18, t26, t36, t72, t75, t82, t90, t91, t93, t94, t96, t97, t100, t131, t132, Inte...250
(forward)formula 0,1,1.30846,34952,1,0,224,167832,317,129,4011,132493,312
FORMULA ErlangenMainframeV2-PT-bP02C02-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 231/231 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 137 transition count 196
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 137 transition count 196
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 73 place count 130 transition count 184
Iterating global reduction 0 with 7 rules applied. Total rules applied 80 place count 130 transition count 184
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 84 place count 126 transition count 170
Iterating global reduction 0 with 4 rules applied. Total rules applied 88 place count 126 transition count 170
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 92 place count 122 transition count 155
Iterating global reduction 0 with 4 rules applied. Total rules applied 96 place count 122 transition count 155
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 99 place count 119 transition count 151
Iterating global reduction 0 with 3 rules applied. Total rules applied 102 place count 119 transition count 151
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 103 place count 118 transition count 150
Iterating global reduction 0 with 1 rules applied. Total rules applied 104 place count 118 transition count 150
Applied a total of 104 rules in 14 ms. Remains 118 /170 variables (removed 52) and now considering 150/231 (removed 81) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9252123735960903990.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16145561544748141010.kers'
[2026-06-02 03:30:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9252123735960903990.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16145561544748141010.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 150 rows 118 cols 434 entries
Finished phase 1 with 105 SingleSign rule and 2 generalized
[2026-06-02 03:30:09] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16145561544748141010.kers
Total runtime 1 ms.
[2026-06-02 03:30:09] [INFO ] Implicit Places using invariants in 71 ms returned [11]
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 : 117/170 places, 150/231 transitions.
Applied a total of 0 rules in 2 ms. Remains 117 /117 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 89 ms. Remains : 117/170 places, 150/231 transitions.
[2026-06-02 03:30:09] [INFO ] Flatten gal took : 8 ms
[2026-06-02 03:30:09] [INFO ] Flatten gal took : 8 ms
[2026-06-02 03:30:09] [INFO ] Input system was already deterministic with 150 transitions.
[2026-06-02 03:30:09] [INFO ] Flatten gal took : 10 ms
[2026-06-02 03:30:09] [INFO ] Flatten gal took : 11 ms
[2026-06-02 03:30:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality18051319990163418931.gal : 2 ms
[2026-06-02 03:30:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality11080358964383607138.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/CTLCardinality18051319990163418931.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11080358964383607138.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.53358e+08,0.159569,8860,2,2354,5,21152,6,0,620,19891,0


Converting to forward existential form...Done !
original formula: A((p171==0) U AG(EX(E(((p112==0)||(p107==1)) U (((p31==1)||(p40==0))||(p104==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(EX(E(((p112==0)||(p107==1)) U (((p31==1)||(p40==0))||(p104==1))))))))))) * !(E(!(!...353
Reverse transition relation is NOT exact ! Due to transitions t11, t15, t18, t26, t56, t70, t73, t80, t88, t90, t91, t93, t94, t96, t97, t100, t101, t135, ...261
(forward)formula 0,1,1.24151,36836,1,0,250,172577,332,132,3819,154736,338
FORMULA ErlangenMainframeV2-PT-bP02C02-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 231/231 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 139 transition count 198
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 139 transition count 198
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 129 transition count 183
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 129 transition count 183
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 89 place count 122 transition count 165
Ensure Unique test removed 1 places
Iterating global reduction 0 with 8 rules applied. Total rules applied 97 place count 121 transition count 165
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 103 place count 115 transition count 144
Iterating global reduction 0 with 6 rules applied. Total rules applied 109 place count 115 transition count 144
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 113 place count 111 transition count 139
Iterating global reduction 0 with 4 rules applied. Total rules applied 117 place count 111 transition count 139
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 119 place count 109 transition count 137
Iterating global reduction 0 with 2 rules applied. Total rules applied 121 place count 109 transition count 137
Applied a total of 121 rules in 8 ms. Remains 109 /170 variables (removed 61) and now considering 137/231 (removed 94) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14581574734649740333.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12804689941203560908.kers'
[2026-06-02 03:30:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14581574734649740333.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12804689941203560908.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 137 rows 109 cols 370 entries
Finished phase 1 with 98 SingleSign rule and 1 generalized
[2026-06-02 03:30:11] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12804689941203560908.kers
Total runtime 1 ms.
[2026-06-02 03:30:11] [INFO ] Implicit Places using invariants in 67 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 108/170 places, 137/231 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 78 ms. Remains : 108/170 places, 137/231 transitions.
[2026-06-02 03:30:11] [INFO ] Flatten gal took : 8 ms
[2026-06-02 03:30:11] [INFO ] Flatten gal took : 7 ms
[2026-06-02 03:30:11] [INFO ] Input system was already deterministic with 137 transitions.
[2026-06-02 03:30:11] [INFO ] Flatten gal took : 8 ms
[2026-06-02 03:30:11] [INFO ] Flatten gal took : 7 ms
[2026-06-02 03:30:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality7835851406962805907.gal : 1 ms
[2026-06-02 03:30:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality3522228982448702057.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/CTLCardinality7835851406962805907.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3522228982448702057.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,8.11221e+07,0.124822,7688,2,1490,5,16216,6,0,571,16050,0


Converting to forward existential form...Done !
original formula: AG(((AF(EX((p59==1))) + (p191==0)) + ((p69==1)||(p150==1))))
=> equivalent forward existential formula: [FwdG(((FwdU(Init,TRUE) * !(((p69==1)||(p150==1)))) * !((p191==0))),!(EX((p59==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t15, t18, t26, t67, t78, t85, t87, t88, t90, t91, t93, t94, t97, t122, t123, Inter...249
(forward)formula 0,0,0.944931,30256,1,0,293,134632,300,181,3418,136082,370
FORMULA ErlangenMainframeV2-PT-bP02C02-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 170/170 places, 231/231 transitions.
Graph (trivial) has 137 edges and 170 vertex of which 10 / 170 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 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 163 transition count 178
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 56 rules applied. Total rules applied 102 place count 118 transition count 167
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 107 place count 114 transition count 166
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 108 place count 113 transition count 166
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 108 place count 113 transition count 156
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 128 place count 103 transition count 156
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 147 place count 84 transition count 135
Iterating global reduction 4 with 19 rules applied. Total rules applied 166 place count 84 transition count 135
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 166 place count 84 transition count 133
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 170 place count 82 transition count 133
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 176 place count 76 transition count 107
Ensure Unique test removed 2 places
Iterating global reduction 4 with 8 rules applied. Total rules applied 184 place count 74 transition count 107
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 188 place count 70 transition count 95
Iterating global reduction 4 with 4 rules applied. Total rules applied 192 place count 70 transition count 95
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 193 place count 69 transition count 93
Iterating global reduction 4 with 1 rules applied. Total rules applied 194 place count 69 transition count 93
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 230 place count 51 transition count 75
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 232 place count 49 transition count 66
Iterating global reduction 4 with 2 rules applied. Total rules applied 234 place count 49 transition count 66
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 237 place count 49 transition count 63
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 4 with 4 rules applied. Total rules applied 241 place count 47 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 242 place count 46 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 243 place count 45 transition count 60
Applied a total of 243 rules in 42 ms. Remains 45 /170 variables (removed 125) and now considering 60/231 (removed 171) transitions.
[2026-06-02 03:30:12] [INFO ] Flow matrix only has 55 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-225676832334637385.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16377212643772867708.kers'
[2026-06-02 03:30:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-225676832334637385.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16377212643772867708.kers]
Normalized transition count is 54 out of 55 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 54 rows 43 cols 150 entries
Finished phase 1 with 37 SingleSign rule and 0 generalized
[2026-06-02 03:30:12] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16377212643772867708.kers
Total runtime 1 ms.
[2026-06-02 03:30:12] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-06-02 03:30:12] [INFO ] Flow matrix only has 55 transitions (discarded 5 similar events)
[2026-06-02 03:30:12] [INFO ] Invariant cache hit.
[2026-06-02 03:30:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-06-02 03:30:12] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2026-06-02 03:30:12] [INFO ] Redundant transitions in 2 ms returned []
Running 51 sub problems to find dead transitions.
[2026-06-02 03:30:12] [INFO ] Flow matrix only has 55 transitions (discarded 5 similar events)
[2026-06-02 03:30:12] [INFO ] Invariant cache hit.
[2026-06-02 03:30:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 4/45 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (OVERLAPS) 54/99 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 1/100 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (OVERLAPS) 0/100 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 54 constraints, problems are : Problem set: 0 solved, 51 unsolved in 2037 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 4/45 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (OVERLAPS) 54/99 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 51/104 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 1/100 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (OVERLAPS) 0/100 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 105 constraints, problems are : Problem set: 0 solved, 51 unsolved in 2031 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4081ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 4084ms
Starting structural reductions in SI_CTL mode, iteration 1 : 45/170 places, 60/231 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4292 ms. Remains : 45/170 places, 60/231 transitions.
[2026-06-02 03:30:16] [INFO ] Flatten gal took : 6 ms
[2026-06-02 03:30:16] [INFO ] Flatten gal took : 10 ms
[2026-06-02 03:30:16] [INFO ] Input system was already deterministic with 60 transitions.
[2026-06-02 03:30:16] [INFO ] Flatten gal took : 4 ms
[2026-06-02 03:30:16] [INFO ] Flatten gal took : 4 ms
[2026-06-02 03:30:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality16201996218821477547.gal : 1 ms
[2026-06-02 03:30:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality14118583909826653019.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/CTLCardinality16201996218821477547.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14118583909826653019.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,138600,0.021274,4216,2,141,5,1028,6,0,238,873,0


Converting to forward existential form...Done !
original formula: EG(((E((p111==1) U !((((p195==0)||(p153==1))&&(p85==1)))) + AF((p146==1))) + (E(!(((!((p166==0)||(p65==1)))&&(p172!=1))) U !(EF((p134==1)...173
=> equivalent forward existential formula: [FwdG(Init,((E((p111==1) U !((((p195==0)||(p153==1))&&(p85==1)))) + !(EG(!((p146==1))))) + (E(!(((!((p166==0)||(...228
Reverse transition relation is NOT exact ! Due to transitions t7, t50, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tota...168
(forward)formula 0,1,0.85514,27348,1,0,239,128984,161,149,1538,167594,302
FORMULA ErlangenMainframeV2-PT-bP02C02-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 231/231 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 136 transition count 195
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 136 transition count 195
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 78 place count 126 transition count 180
Iterating global reduction 0 with 10 rules applied. Total rules applied 88 place count 126 transition count 180
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 94 place count 120 transition count 163
Ensure Unique test removed 1 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 101 place count 119 transition count 163
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 106 place count 114 transition count 146
Iterating global reduction 0 with 5 rules applied. Total rules applied 111 place count 114 transition count 146
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 114 place count 111 transition count 142
Iterating global reduction 0 with 3 rules applied. Total rules applied 117 place count 111 transition count 142
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 118 place count 110 transition count 141
Iterating global reduction 0 with 1 rules applied. Total rules applied 119 place count 110 transition count 141
Applied a total of 119 rules in 7 ms. Remains 110 /170 variables (removed 60) and now considering 141/231 (removed 90) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-467521530635812063.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6746928670160097984.kers'
[2026-06-02 03:30:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-467521530635812063.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6746928670160097984.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 141 rows 110 cols 394 entries
Finished phase 1 with 99 SingleSign rule and 1 generalized
[2026-06-02 03:30:17] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6746928670160097984.kers
Total runtime 1 ms.
[2026-06-02 03:30:17] [INFO ] Implicit Places using invariants in 56 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 57 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 109/170 places, 141/231 transitions.
Applied a total of 0 rules in 1 ms. Remains 109 /109 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 109/170 places, 141/231 transitions.
[2026-06-02 03:30:17] [INFO ] Flatten gal took : 6 ms
[2026-06-02 03:30:17] [INFO ] Flatten gal took : 6 ms
[2026-06-02 03:30:17] [INFO ] Input system was already deterministic with 141 transitions.
[2026-06-02 03:30:17] [INFO ] Flatten gal took : 6 ms
[2026-06-02 03:30:17] [INFO ] Flatten gal took : 5 ms
[2026-06-02 03:30:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality7887795022483258608.gal : 2 ms
[2026-06-02 03:30:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality4407780522904055461.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/CTLCardinality7887795022483258608.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4407780522904055461.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,7.91216e+07,0.113221,7488,2,1504,5,15501,6,0,579,13443,0


Converting to forward existential form...Done !
original formula: EX(AG(EX(EF(((p108==0)&&(p121==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(EX(E(TRUE U ((p108==0)&&(p121==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t14, t17, t25, t68, t78, t86, t87, t89, t90, t92, t93, t96, t126, t127, Intersection wi...239
(forward)formula 0,0,3.61196,112404,1,0,251,700208,303,144,3624,485429,357
FORMULA ErlangenMainframeV2-PT-bP02C02-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 231/231 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 139 transition count 200
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 139 transition count 200
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 70 place count 131 transition count 192
Iterating global reduction 0 with 8 rules applied. Total rules applied 78 place count 131 transition count 192
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 82 place count 127 transition count 177
Iterating global reduction 0 with 4 rules applied. Total rules applied 86 place count 127 transition count 177
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 90 place count 123 transition count 160
Iterating global reduction 0 with 4 rules applied. Total rules applied 94 place count 123 transition count 160
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 96 place count 121 transition count 158
Iterating global reduction 0 with 2 rules applied. Total rules applied 98 place count 121 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 120 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 120 transition count 157
Applied a total of 100 rules in 6 ms. Remains 120 /170 variables (removed 50) and now considering 157/231 (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-16439369023665585117.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10185411461043203467.kers'
[2026-06-02 03:30:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16439369023665585117.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10185411461043203467.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 157 rows 120 cols 486 entries
Finished phase 1 with 107 SingleSign rule and 2 generalized
[2026-06-02 03:30:21] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10185411461043203467.kers
Total runtime 1 ms.
[2026-06-02 03:30:21] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-06-02 03:30:21] [INFO ] Invariant cache hit.
[2026-06-02 03:30:21] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2026-06-02 03:30:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 1/120 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (OVERLAPS) 157/277 variables, 120/132 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 0/277 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 132 constraints, problems are : Problem set: 0 solved, 156 unsolved in 12177 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 1/120 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 157/277 variables, 120/135 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 156/291 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 4/296 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/277 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/277 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/277 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 14 (OVERLAPS) 0/277 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/277 variables, and 298 constraints, problems are : Problem set: 0 solved, 156 unsolved in 29184 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 41384ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 41385ms
Starting structural reductions in LTL mode, iteration 1 : 120/170 places, 157/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41603 ms. Remains : 120/170 places, 157/231 transitions.
[2026-06-02 03:31:02] [INFO ] Flatten gal took : 7 ms
[2026-06-02 03:31:02] [INFO ] Flatten gal took : 8 ms
[2026-06-02 03:31:02] [INFO ] Input system was already deterministic with 157 transitions.
[2026-06-02 03:31:02] [INFO ] Flatten gal took : 6 ms
[2026-06-02 03:31:02] [INFO ] Flatten gal took : 6 ms
[2026-06-02 03:31:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality3939264568376335646.gal : 2 ms
[2026-06-02 03:31:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality2853138410742958759.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/CTLCardinality3939264568376335646.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2853138410742958759.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.75936e+08,0.24507,11392,2,2558,5,31883,6,0,639,31220,0


Converting to forward existential form...Done !
original formula: EF(EX(!(E((EG(((p89==0)||(p159==1))) + (((p153==0)||(p23==1))&&((p103==0)||(p37==1)))) U ((p22==0)&&(p58==0))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E((EG(((p89==0)||(p159==1))) + (((p153==0)||(p23==1))&&((p103==0)||(p37==1)))) U ((p22...183
Reverse transition relation is NOT exact ! Due to transitions t11, t15, t18, t26, t68, t69, t72, t79, t86, t88, t89, t92, t94, t95, t97, t98, t101, t102, t...290
(forward)formula 0,1,2.15669,60160,1,0,285,321481,341,150,4161,293200,365
FORMULA ErlangenMainframeV2-PT-bP02C02-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 170/170 places, 231/231 transitions.
Graph (trivial) has 153 edges and 170 vertex of which 12 / 170 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 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 162 transition count 174
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 62 rules applied. Total rules applied 111 place count 114 transition count 160
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 117 place count 108 transition count 160
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 117 place count 108 transition count 150
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 137 place count 98 transition count 150
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 153 place count 82 transition count 132
Iterating global reduction 3 with 16 rules applied. Total rules applied 169 place count 82 transition count 132
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 169 place count 82 transition count 130
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 173 place count 80 transition count 130
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 178 place count 75 transition count 105
Ensure Unique test removed 1 places
Iterating global reduction 3 with 6 rules applied. Total rules applied 184 place count 74 transition count 105
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 187 place count 71 transition count 95
Iterating global reduction 3 with 3 rules applied. Total rules applied 190 place count 71 transition count 95
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 224 place count 54 transition count 78
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 227 place count 51 transition count 68
Iterating global reduction 3 with 3 rules applied. Total rules applied 230 place count 51 transition count 68
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 234 place count 51 transition count 64
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 3 with 4 rules applied. Total rules applied 238 place count 49 transition count 62
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 239 place count 48 transition count 61
Applied a total of 239 rules in 27 ms. Remains 48 /170 variables (removed 122) and now considering 61/231 (removed 170) transitions.
[2026-06-02 03:31:04] [INFO ] Flow matrix only has 56 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15678518483000050079.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5683002073550398572.kers'
[2026-06-02 03:31:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15678518483000050079.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5683002073550398572.kers]
Normalized transition count is 55 out of 56 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 55 rows 47 cols 166 entries
Finished phase 1 with 38 SingleSign rule and 0 generalized
[2026-06-02 03:31:04] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5683002073550398572.kers
Total runtime 0 ms.
[2026-06-02 03:31:04] [INFO ] Implicit Places using invariants in 50 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 47/170 places, 61/231 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 60
Applied a total of 2 rules in 3 ms. Remains 46 /47 variables (removed 1) and now considering 60/61 (removed 1) transitions.
[2026-06-02 03:31:04] [INFO ] Flow matrix only has 55 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-265948700379336388.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16600145575008402968.kers'
[2026-06-02 03:31:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-265948700379336388.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16600145575008402968.kers]
Normalized transition count is 54 out of 55 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 54 rows 45 cols 156 entries
Finished phase 1 with 36 SingleSign rule and 1 generalized
[2026-06-02 03:31:04] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16600145575008402968.kers
Total runtime 0 ms.
[2026-06-02 03:31:05] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-06-02 03:31:05] [INFO ] Flow matrix only has 55 transitions (discarded 5 similar events)
[2026-06-02 03:31:05] [INFO ] Invariant cache hit.
[2026-06-02 03:31:05] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-06-02 03:31:05] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 46/170 places, 60/231 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 225 ms. Remains : 46/170 places, 60/231 transitions.
[2026-06-02 03:31:05] [INFO ] Flatten gal took : 3 ms
[2026-06-02 03:31:05] [INFO ] Flatten gal took : 4 ms
[2026-06-02 03:31:05] [INFO ] Input system was already deterministic with 60 transitions.
[2026-06-02 03:31:05] [INFO ] Flatten gal took : 4 ms
[2026-06-02 03:31:05] [INFO ] Flatten gal took : 4 ms
[2026-06-02 03:31:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality11581757231201385755.gal : 1 ms
[2026-06-02 03:31:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality14990946042409133021.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/CTLCardinality11581757231201385755.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14990946042409133021.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,147760,0.040595,4580,2,462,5,3186,6,0,240,2612,0


Converting to forward existential form...Done !
original formula: (EG(((p51==0)||(p99==1))) + AG((AF(((p79==1)&&((p88==0)||(p96==1)))) + EG(AG(((p150==0)||(p18==1)))))))
=> equivalent forward existential formula: [FwdG((FwdU((Init * !(EG(((p51==0)||(p99==1))))),TRUE) * !(EG(!(E(TRUE U !(((p150==0)||(p18==1)))))))),!(((p79==...191
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t40, t41, t44, t45, t48, t49, Intersection with reachable at each step enabled. (des...197
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.665857,18664,1,0,181,87173,158,82,1646,80097,224
FORMULA ErlangenMainframeV2-PT-bP02C02-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 170/170 places, 231/231 transitions.
Graph (trivial) has 141 edges and 170 vertex of which 6 / 170 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 166 transition count 180
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 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 61 rules applied. Total rules applied 109 place count 119 transition count 166
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 116 place count 113 transition count 165
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 117 place count 112 transition count 165
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 117 place count 112 transition count 158
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 131 place count 105 transition count 158
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 151 place count 85 transition count 136
Iterating global reduction 4 with 20 rules applied. Total rules applied 171 place count 85 transition count 136
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 171 place count 85 transition count 133
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 177 place count 82 transition count 133
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 184 place count 75 transition count 103
Ensure Unique test removed 2 places
Iterating global reduction 4 with 9 rules applied. Total rules applied 193 place count 73 transition count 103
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 196 place count 70 transition count 93
Iterating global reduction 4 with 3 rules applied. Total rules applied 199 place count 70 transition count 93
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 200 place count 69 transition count 91
Iterating global reduction 4 with 1 rules applied. Total rules applied 201 place count 69 transition count 91
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 239 place count 50 transition count 72
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 242 place count 47 transition count 65
Iterating global reduction 4 with 3 rules applied. Total rules applied 245 place count 47 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 251 place count 47 transition count 59
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 4 with 4 rules applied. Total rules applied 255 place count 45 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 256 place count 44 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 257 place count 43 transition count 56
Applied a total of 257 rules in 35 ms. Remains 43 /170 variables (removed 127) and now considering 56/231 (removed 175) transitions.
[2026-06-02 03:31:05] [INFO ] Flow matrix only has 53 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13046929454654841632.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18054745732741167673.kers'
[2026-06-02 03:31:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13046929454654841632.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18054745732741167673.kers]
Normalized transition count is 52 out of 53 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 52 rows 42 cols 129 entries
Finished phase 1 with 35 SingleSign rule and 0 generalized
[2026-06-02 03:31:05] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18054745732741167673.kers
Total runtime 1 ms.
[2026-06-02 03:31:05] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-06-02 03:31:05] [INFO ] Flow matrix only has 53 transitions (discarded 3 similar events)
[2026-06-02 03:31:05] [INFO ] Invariant cache hit.
[2026-06-02 03:31:06] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-06-02 03:31:06] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2026-06-02 03:31:06] [INFO ] Redundant transitions in 1 ms returned []
Running 47 sub problems to find dead transitions.
[2026-06-02 03:31:06] [INFO ] Flow matrix only has 53 transitions (discarded 3 similar events)
[2026-06-02 03:31:06] [INFO ] Invariant cache hit.
[2026-06-02 03:31:06] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 4/43 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 52/95 variables, 43/52 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 1/96 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/96 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 62 constraints, problems are : Problem set: 0 solved, 47 unsolved in 2498 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 43/43 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 4/43 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 52/95 variables, 43/52 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 47/108 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/95 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/95 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/95 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (OVERLAPS) 1/96 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/96 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 13 (OVERLAPS) 0/96 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 111 constraints, problems are : Problem set: 0 solved, 47 unsolved in 3228 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 43/43 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 5735ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 5735ms
Starting structural reductions in SI_CTL mode, iteration 1 : 43/170 places, 56/231 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5930 ms. Remains : 43/170 places, 56/231 transitions.
[2026-06-02 03:31:11] [INFO ] Flatten gal took : 3 ms
[2026-06-02 03:31:11] [INFO ] Flatten gal took : 4 ms
[2026-06-02 03:31:11] [INFO ] Input system was already deterministic with 56 transitions.
[2026-06-02 03:31:11] [INFO ] Flatten gal took : 2 ms
[2026-06-02 03:31:11] [INFO ] Flatten gal took : 2 ms
[2026-06-02 03:31:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality7799372863420184002.gal : 1 ms
[2026-06-02 03:31:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality3356382871987984588.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/CTLCardinality7799372863420184002.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3356382871987984588.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,75600,0.019004,4160,2,153,5,957,6,0,225,803,0


Converting to forward existential form...Done !
original formula: E(E(EF((p69==0)) U AF(!(((p173==0)||(p50==1))))) U (EF(EG((p56==1))) + !((((p40==0)||(p67==1))&&((p52==0)||(p41==1))))))
=> equivalent forward existential formula: ([FwdG(FwdU(FwdU(Init,E(E(TRUE U (p69==0)) U !(EG(!(!(((p173==0)||(p50==1)))))))),TRUE),(p56==1))] != FALSE + [(...286
Reverse transition relation is NOT exact ! Due to transitions t11, t18, t32, Intersection with reachable at each step enabled. (destroyed/reverse/intersec...174
Hit Full ! (commute/partial/dont) 54/0/2
(forward)formula 0,1,0.327334,10984,1,0,139,34708,150,100,1492,44687,223
FORMULA ErlangenMainframeV2-PT-bP02C02-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 170/170 places, 231/231 transitions.
Graph (trivial) has 156 edges and 170 vertex of which 12 / 170 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 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 162 transition count 172
Reduce places removed 50 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 65 rules applied. Total rules applied 116 place count 112 transition count 157
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 122 place count 106 transition count 157
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 122 place count 106 transition count 148
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 140 place count 97 transition count 148
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 158 place count 79 transition count 128
Iterating global reduction 3 with 18 rules applied. Total rules applied 176 place count 79 transition count 128
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 176 place count 79 transition count 126
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 180 place count 77 transition count 126
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 186 place count 71 transition count 100
Ensure Unique test removed 2 places
Iterating global reduction 3 with 8 rules applied. Total rules applied 194 place count 69 transition count 100
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 198 place count 65 transition count 88
Iterating global reduction 3 with 4 rules applied. Total rules applied 202 place count 65 transition count 88
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 203 place count 64 transition count 86
Iterating global reduction 3 with 1 rules applied. Total rules applied 204 place count 64 transition count 86
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 248 place count 42 transition count 64
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 251 place count 39 transition count 54
Iterating global reduction 3 with 3 rules applied. Total rules applied 254 place count 39 transition count 54
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 259 place count 39 transition count 49
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 263 place count 37 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 264 place count 36 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 266 place count 34 transition count 46
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 270 place count 34 transition count 42
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 272 place count 34 transition count 40
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 274 place count 32 transition count 40
Applied a total of 274 rules in 31 ms. Remains 32 /170 variables (removed 138) and now considering 40/231 (removed 191) transitions.
[2026-06-02 03:31:12] [INFO ] Flow matrix only has 38 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12857366149327926918.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4499748831369918843.kers'
[2026-06-02 03:31:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12857366149327926918.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4499748831369918843.kers]
Normalized transition count is 37 out of 38 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 37 rows 30 cols 94 entries
Finished phase 1 with 25 SingleSign rule and 0 generalized
[2026-06-02 03:31:12] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4499748831369918843.kers
Total runtime 0 ms.
[2026-06-02 03:31:12] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-06-02 03:31:12] [INFO ] Flow matrix only has 38 transitions (discarded 2 similar events)
[2026-06-02 03:31:12] [INFO ] Invariant cache hit.
[2026-06-02 03:31:12] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2026-06-02 03:31:12] [INFO ] Redundant transitions in 1 ms returned []
Running 26 sub problems to find dead transitions.
[2026-06-02 03:31:12] [INFO ] Flow matrix only has 38 transitions (discarded 2 similar events)
[2026-06-02 03:31:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 5/32 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 37/69 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 0/69 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/70 variables, and 39 constraints, problems are : Problem set: 0 solved, 26 unsolved in 831 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 5/32 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 37/69 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 26/65 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 0/69 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/70 variables, and 65 constraints, problems are : Problem set: 0 solved, 26 unsolved in 762 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1598ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 1598ms
Starting structural reductions in SI_CTL mode, iteration 1 : 32/170 places, 40/231 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1773 ms. Remains : 32/170 places, 40/231 transitions.
[2026-06-02 03:31:13] [INFO ] Flatten gal took : 2 ms
[2026-06-02 03:31:13] [INFO ] Flatten gal took : 1 ms
[2026-06-02 03:31:13] [INFO ] Input system was already deterministic with 40 transitions.
[2026-06-02 03:31:13] [INFO ] Flatten gal took : 3 ms
[2026-06-02 03:31:13] [INFO ] Flatten gal took : 2 ms
[2026-06-02 03:31:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality567019271062628021.gal : 5 ms
[2026-06-02 03:31:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality7487177399819653630.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/CTLCardinality567019271062628021.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7487177399819653630.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,15552,0.013252,4032,2,58,5,445,5,0,169,342,0


Converting to forward existential form...Done !
original formula: AG((EF((p113==1)) * (p140==0)))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U (p113==1))))] = FALSE * [(FwdU(Init,TRUE) * !((p140==0)))] = FALSE)
(forward)formula 0,0,0.014306,4296,1,0,8,445,8,2,174,342,1
FORMULA ErlangenMainframeV2-PT-bP02C02-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 231/231 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 139 transition count 198
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 139 transition count 198
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 71 place count 130 transition count 184
Iterating global reduction 0 with 9 rules applied. Total rules applied 80 place count 130 transition count 184
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 85 place count 125 transition count 176
Iterating global reduction 0 with 5 rules applied. Total rules applied 90 place count 125 transition count 176
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 94 place count 121 transition count 153
Iterating global reduction 0 with 4 rules applied. Total rules applied 98 place count 121 transition count 153
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 100 place count 119 transition count 151
Iterating global reduction 0 with 2 rules applied. Total rules applied 102 place count 119 transition count 151
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 104 place count 117 transition count 149
Iterating global reduction 0 with 2 rules applied. Total rules applied 106 place count 117 transition count 149
Applied a total of 106 rules in 13 ms. Remains 117 /170 variables (removed 53) and now considering 149/231 (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-16057240921635398027.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2551016330443703639.kers'
[2026-06-02 03:31:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16057240921635398027.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2551016330443703639.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 149 rows 117 cols 432 entries
Finished phase 1 with 104 SingleSign rule and 2 generalized
[2026-06-02 03:31:13] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2551016330443703639.kers
Total runtime 2 ms.
[2026-06-02 03:31:14] [INFO ] Implicit Places using invariants in 96 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 105 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/170 places, 149/231 transitions.
Applied a total of 0 rules in 2 ms. Remains 116 /116 variables (removed 0) and now considering 149/149 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 120 ms. Remains : 116/170 places, 149/231 transitions.
[2026-06-02 03:31:14] [INFO ] Flatten gal took : 6 ms
[2026-06-02 03:31:14] [INFO ] Flatten gal took : 6 ms
[2026-06-02 03:31:14] [INFO ] Input system was already deterministic with 149 transitions.
[2026-06-02 03:31:14] [INFO ] Flatten gal took : 7 ms
[2026-06-02 03:31:14] [INFO ] Flatten gal took : 6 ms
[2026-06-02 03:31:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality10617669759265399338.gal : 2 ms
[2026-06-02 03:31:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality920135709370985646.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/CTLCardinality10617669759265399338.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality920135709370985646.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.97547e+08,0.294897,9840,2,2043,5,25614,6,0,615,23111,0


Converting to forward existential form...Done !
original formula: E(EX(!(AG(((p66==0)||(p169==1))))) U (AF((EG(!(((p25==0)||(p124==1)))) * ((p103==0)||(p90==1)))) + (AF(AX((((p101==0)||(p86==1))||((p171=...208
=> equivalent forward existential formula: ([(FwdU(Init,EX(!(!(E(TRUE U !(((p66==0)||(p169==1)))))))) * !(EG(!((EG(!(((p25==0)||(p124==1)))) * ((p103==0)||...365
Reverse transition relation is NOT exact ! Due to transitions t10, t13, t16, t20, t28, t68, t69, t71, t73, t80, t89, t90, t92, t94, t96, t97, t100, t101, t...272
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,24.698,567060,1,0,702,2.89055e+06,339,420,4157,3.39176e+06,867
FORMULA ErlangenMainframeV2-PT-bP02C02-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 231/231 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 141 transition count 200
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 141 transition count 200
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 67 place count 132 transition count 191
Iterating global reduction 0 with 9 rules applied. Total rules applied 76 place count 132 transition count 191
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 80 place count 128 transition count 178
Iterating global reduction 0 with 4 rules applied. Total rules applied 84 place count 128 transition count 178
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 88 place count 124 transition count 161
Iterating global reduction 0 with 4 rules applied. Total rules applied 92 place count 124 transition count 161
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 95 place count 121 transition count 158
Iterating global reduction 0 with 3 rules applied. Total rules applied 98 place count 121 transition count 158
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 100 place count 119 transition count 156
Iterating global reduction 0 with 2 rules applied. Total rules applied 102 place count 119 transition count 156
Applied a total of 102 rules in 12 ms. Remains 119 /170 variables (removed 51) and now considering 156/231 (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-17616479507911103881.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10957396958893511.kers'
[2026-06-02 03:31:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17616479507911103881.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10957396958893511.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 156 rows 119 cols 496 entries
Finished phase 1 with 106 SingleSign rule and 2 generalized
[2026-06-02 03:31:39] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10957396958893511.kers
Total runtime 2 ms.
[2026-06-02 03:31:39] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-06-02 03:31:39] [INFO ] Invariant cache hit.
[2026-06-02 03:31:39] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 155 sub problems to find dead transitions.
[2026-06-02 03:31:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 1/119 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (OVERLAPS) 156/275 variables, 119/133 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 0/275 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 133 constraints, problems are : Problem set: 0 solved, 155 unsolved in 11883 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 1/119 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (OVERLAPS) 156/275 variables, 119/133 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 155/288 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 10 (OVERLAPS) 0/275 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/275 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 12 (OVERLAPS) 0/275 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 275/275 variables, and 295 constraints, problems are : Problem set: 0 solved, 155 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 41914ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 41915ms
Starting structural reductions in LTL mode, iteration 1 : 119/170 places, 156/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42157 ms. Remains : 119/170 places, 156/231 transitions.
[2026-06-02 03:32:21] [INFO ] Flatten gal took : 5 ms
[2026-06-02 03:32:21] [INFO ] Flatten gal took : 5 ms
[2026-06-02 03:32:21] [INFO ] Input system was already deterministic with 156 transitions.
[2026-06-02 03:32:21] [INFO ] Flatten gal took : 5 ms
[2026-06-02 03:32:21] [INFO ] Flatten gal took : 5 ms
[2026-06-02 03:32:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality15825278206933789845.gal : 1 ms
[2026-06-02 03:32:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality6727140321879539186.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/CTLCardinality15825278206933789845.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6727140321879539186.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.31363e+08,0.381815,13492,2,3774,5,39382,6,0,634,39120,0


Converting to forward existential form...Done !
original formula: EF((E(EF(((p57==0)||(p18==1))) U EG(!((((p116==0)||(p33==1))||((p86==0)||(p126==1)))))) * AF(((EF(((p137==0)||(p38==1))) * ((p94==0)||(p1...231
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * E(E(TRUE U ((p57==0)||(p18==1))) U EG(!((((p116==0)||(p33==1))||((p86==0)||(p126==1))))))) ...307
Reverse transition relation is NOT exact ! Due to transitions t10, t14, t17, t25, t29, t33, t49, t67, t69, t71, t79, t86, t88, t92, t93, t96, t97, t98, t10...324
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,17.3134,420900,1,0,495,2.68094e+06,353,235,4451,2.06347e+06,615
FORMULA ErlangenMainframeV2-PT-bP02C02-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-06-02 03:32:38] [INFO ] Flatten gal took : 11 ms
[2026-06-02 03:32:38] [INFO ] Flatten gal took : 11 ms
Total runtime 237841 ms.

BK_STOP 1780371158786

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is ErlangenMainframeV2-PT-bP02C02, 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-178021499200217"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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