Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r178-oct2-177969020000273.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 MedleyA-PT-23, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020000273
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.3K Mar 7 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 7 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 7 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 7 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 11:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 11:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 11:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 11:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Mar 7 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 7 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 7 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 150K Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779703403340

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-23
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-25 10:03:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 10:03:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 10:03:24] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2026-05-25 10:03:24] [INFO ] Transformed 378 places.
[2026-05-25 10:03:24] [INFO ] Transformed 614 transitions.
[2026-05-25 10:03:24] [INFO ] Found NUPN structural information;
[2026-05-25 10:03:24] [INFO ] Parsed PT model containing 378 places and 614 transitions and 1969 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Support contains 95 out of 378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 378/378 places, 614/614 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 376 transition count 614
Discarding 71 places :
Symmetric choice reduction at 1 with 71 rule applications. Total rules 73 place count 305 transition count 543
Iterating global reduction 1 with 71 rules applied. Total rules applied 144 place count 305 transition count 543
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 186 place count 263 transition count 501
Iterating global reduction 1 with 42 rules applied. Total rules applied 228 place count 263 transition count 501
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 238 place count 253 transition count 485
Iterating global reduction 1 with 10 rules applied. Total rules applied 248 place count 253 transition count 485
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 252 place count 249 transition count 474
Iterating global reduction 1 with 4 rules applied. Total rules applied 256 place count 249 transition count 474
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 257 place count 248 transition count 471
Iterating global reduction 1 with 1 rules applied. Total rules applied 258 place count 248 transition count 471
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 259 place count 248 transition count 470
Applied a total of 259 rules in 78 ms. Remains 248 /378 variables (removed 130) and now considering 470/614 (removed 144) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8873027712170228712.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14120075498506782273.kers'
[2026-05-25 10:03:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8873027712170228712.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14120075498506782273.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 470 rows 248 cols 1601 entries
Finished phase 1 with 239 SingleSign rule and 0 generalized
[2026-05-25 10:03:24] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14120075498506782273.kers
Total runtime 4 ms.
[2026-05-25 10:03:25] [INFO ] Implicit Places using invariants in 319 ms returned []
[2026-05-25 10:03:25] [INFO ] Invariant cache hit.
[2026-05-25 10:03:25] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
Running 469 sub problems to find dead transitions.
[2026-05-25 10:03:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 1 (OVERLAPS) 2/248 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 4 (OVERLAPS) 470/718 variables, 248/259 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/718 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 469 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 718/718 variables, and 261 constraints, problems are : Problem set: 0 solved, 469 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 469/469 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 469 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 1 (OVERLAPS) 2/248 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 4 (OVERLAPS) 470/718 variables, 248/261 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/718 variables, 469/730 constraints. Problems are: Problem set: 0 solved, 469 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 718/718 variables, and 732 constraints, problems are : Problem set: 0 solved, 469 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 469/469 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60311ms problems are : Problem set: 0 solved, 469 unsolved
Search for dead transitions found 0 dead transitions in 60328ms
Starting structural reductions in LTL mode, iteration 1 : 248/378 places, 470/614 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61192 ms. Remains : 248/378 places, 470/614 transitions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 470/470 transitions.
Applied a total of 0 rules in 4 ms. Remains 248 /248 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2026-05-25 10:04:25] [INFO ] Invariant cache hit.
[2026-05-25 10:04:26] [INFO ] Implicit Places using invariants in 102 ms returned []
[2026-05-25 10:04:26] [INFO ] Invariant cache hit.
[2026-05-25 10:04:26] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 424 ms. Remains : 248/248 places, 470/470 transitions.
Support contains 95 out of 248 places after structural reductions.
[2026-05-25 10:04:26] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-25 10:04:26] [INFO ] Flatten gal took : 56 ms
[2026-05-25 10:04:26] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-23-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 10:04:26] [INFO ] Flatten gal took : 26 ms
[2026-05-25 10:04:26] [INFO ] Input system was already deterministic with 470 transitions.
Support contains 73 out of 248 places (down from 95) after GAL structural reductions.
RANDOM walk for 40000 steps (29 resets) in 2931 ms. (13 steps per ms) remains 18/44 properties
BEST_FIRST walk for 4004 steps (14 resets) in 41 ms. (95 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (15 resets) in 43 ms. (91 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4002 steps (12 resets) in 15 ms. (250 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4002 steps (12 resets) in 20 ms. (190 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4002 steps (12 resets) in 16 ms. (235 steps per ms) remains 13/15 properties
BEST_FIRST walk for 4001 steps (11 resets) in 18 ms. (210 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4003 steps (14 resets) in 9 ms. (400 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4003 steps (13 resets) in 21 ms. (181 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4003 steps (13 resets) in 11 ms. (333 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (14 resets) in 14 ms. (266 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (14 resets) in 14 ms. (266 steps per ms) remains 11/12 properties
BEST_FIRST walk for 4003 steps (13 resets) in 11 ms. (333 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4002 steps (12 resets) in 19 ms. (200 steps per ms) remains 10/11 properties
[2026-05-25 10:04:27] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 95/111 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 28/139 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 362/501 variables, 139/148 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 171/672 variables, 77/225 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/672 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 41/713 variables, 28/253 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/713 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 5/718 variables, 4/257 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/718 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 0/718 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 718/718 variables, and 257 constraints, problems are : Problem set: 0 solved, 10 unsolved in 903 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 95/111 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 28/139 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 362/501 variables, 139/148 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 171/672 variables, 77/228 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/672 variables, 7/235 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/672 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/672 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 41/713 variables, 28/264 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/713 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 5/718 variables, 4/268 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/718 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 0/718 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 718/718 variables, and 268 constraints, problems are : Problem set: 0 solved, 10 unsolved in 3680 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 4598ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 9 properties in 1997 ms.
Support contains 1 out of 248 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 248/248 places, 470/470 transitions.
Graph (trivial) has 211 edges and 248 vertex of which 29 / 248 are part of one of the 3 SCC in 5 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 40 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 43 transitions.
Graph (complete) has 820 edges and 222 vertex of which 221 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 221 transition count 388
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 81 place count 183 transition count 386
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 81 place count 183 transition count 383
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 87 place count 180 transition count 383
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 131 place count 136 transition count 328
Iterating global reduction 2 with 44 rules applied. Total rules applied 175 place count 136 transition count 328
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 175 place count 136 transition count 321
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 189 place count 129 transition count 321
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 208 place count 110 transition count 264
Iterating global reduction 2 with 19 rules applied. Total rules applied 227 place count 110 transition count 264
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
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 2 with 12 rules applied. Total rules applied 239 place count 110 transition count 252
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 243 place count 108 transition count 250
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 279 place count 90 transition count 232
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 283 place count 90 transition count 228
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 290 place count 83 transition count 207
Iterating global reduction 5 with 7 rules applied. Total rules applied 297 place count 83 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 298 place count 83 transition count 206
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 299 place count 82 transition count 204
Iterating global reduction 6 with 1 rules applied. Total rules applied 300 place count 82 transition count 204
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 301 place count 81 transition count 201
Iterating global reduction 6 with 1 rules applied. Total rules applied 302 place count 81 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 303 place count 81 transition count 200
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 321 place count 72 transition count 215
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 331 place count 72 transition count 205
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 333 place count 70 transition count 199
Iterating global reduction 7 with 2 rules applied. Total rules applied 335 place count 70 transition count 199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 337 place count 70 transition count 197
Free-agglomeration rule applied 20 times.
Iterating global reduction 8 with 20 rules applied. Total rules applied 357 place count 70 transition count 177
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 26 rules applied. Total rules applied 383 place count 50 transition count 171
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 389 place count 47 transition count 168
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 390 place count 46 transition count 167
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 391 place count 45 transition count 167
Applied a total of 391 rules in 75 ms. Remains 45 /248 variables (removed 203) and now considering 167/470 (removed 303) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 45/248 places, 167/470 transitions.
RANDOM walk for 195 steps (1 resets) in 7 ms. (24 steps per ms) remains 0/1 properties
[2026-05-25 10:04:34] [INFO ] Flatten gal took : 18 ms
[2026-05-25 10:04:34] [INFO ] Flatten gal took : 18 ms
[2026-05-25 10:04:34] [INFO ] Input system was already deterministic with 470 transitions.
Computed a total of 23 stabilizing places and 28 stable transitions
Graph (complete) has 864 edges and 248 vertex of which 247 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 470/470 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 247 transition count 470
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 49 place count 199 transition count 414
Iterating global reduction 1 with 48 rules applied. Total rules applied 97 place count 199 transition count 414
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 121 place count 175 transition count 376
Iterating global reduction 1 with 24 rules applied. Total rules applied 145 place count 175 transition count 376
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 155 place count 165 transition count 355
Iterating global reduction 1 with 10 rules applied. Total rules applied 165 place count 165 transition count 355
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 167 place count 165 transition count 353
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 175 place count 157 transition count 333
Iterating global reduction 2 with 8 rules applied. Total rules applied 183 place count 157 transition count 333
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 188 place count 157 transition count 328
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 189 place count 156 transition count 326
Iterating global reduction 3 with 1 rules applied. Total rules applied 190 place count 156 transition count 326
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 191 place count 156 transition count 325
Applied a total of 191 rules in 17 ms. Remains 156 /248 variables (removed 92) and now considering 325/470 (removed 145) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4920426261848124314.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14770495613775714596.kers'
[2026-05-25 10:04:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4920426261848124314.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14770495613775714596.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 325 rows 156 cols 1130 entries
Finished phase 1 with 148 SingleSign rule and 0 generalized
[2026-05-25 10:04:34] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14770495613775714596.kers
Total runtime 2 ms.
[2026-05-25 10:04:34] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-25 10:04:34] [INFO ] Invariant cache hit.
[2026-05-25 10:04:34] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2026-05-25 10:04:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (OVERLAPS) 325/481 variables, 156/165 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 3/170 constraints. Problems are: Problem set: 0 solved, 324 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/481 variables, and 170 constraints, problems are : Problem set: 0 solved, 324 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (OVERLAPS) 325/481 variables, 156/167 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 324/491 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 3/495 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/481 variables, 3/498 constraints. Problems are: Problem set: 0 solved, 324 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/481 variables, and 498 constraints, problems are : Problem set: 0 solved, 324 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60151ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 60154ms
Starting structural reductions in LTL mode, iteration 1 : 156/248 places, 325/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60437 ms. Remains : 156/248 places, 325/470 transitions.
[2026-05-25 10:05:34] [INFO ] Flatten gal took : 28 ms
[2026-05-25 10:05:34] [INFO ] Flatten gal took : 11 ms
[2026-05-25 10:05:35] [INFO ] Input system was already deterministic with 325 transitions.
[2026-05-25 10:05:35] [INFO ] Flatten gal took : 13 ms
[2026-05-25 10:05:35] [INFO ] Flatten gal took : 15 ms
[2026-05-25 10:05:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality760267127005925786.gal : 9 ms
[2026-05-25 10:05:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality11567002533726987153.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/CTLCardinality760267127005925786.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11567002533726987153.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.
Detected timeout of ITS tools.
[2026-05-25 10:06:05] [INFO ] Flatten gal took : 28 ms
[2026-05-25 10:06:05] [INFO ] Applying decomposition
[2026-05-25 10:06:05] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph13925856718271364743.txt' '-o' '/tmp/graph13925856718271364743.bin' '-w' '/tmp/graph13925856718271364743.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13925856718271364743.bin' '-l' '-1' '-v' '-w' '/tmp/graph13925856718271364743.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:06:05] [INFO ] Decomposing Gal with order
[2026-05-25 10:06:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:06:05] [INFO ] Removed a total of 476 redundant transitions.
[2026-05-25 10:06:05] [INFO ] Flatten gal took : 77 ms
[2026-05-25 10:06:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 7 ms.
[2026-05-25 10:06:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality12589704393608540105.gal : 5 ms
[2026-05-25 10:06:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality9182335939316993596.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/CTLCardinality12589704393608540105.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9182335939316993596.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.50902e+09,0.974996,37704,1238,56,59971,383,608,114654,81,1040,0


Converting to forward existential form...Done !
original formula: EF((AF(AG((i2.u21.p153==0))) * !(E(!(((i8.u45.p377==0)||(i2.u23.p198==1))) U EX(TRUE)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(!(E(TRUE U !((i2.u21.p153==0)))))))) * !(E(!(((i8.u45.p377==0)||(i2.u23.p198==1))) U...177
Reverse transition relation is NOT exact ! Due to transitions t20, t52, t143, t145, t146, t179, t181, t182, t203, t205, t206, t218, t219, t220, t221, t222,...838
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 248/248 places, 470/470 transitions.
Graph (trivial) has 199 edges and 248 vertex of which 28 / 248 are part of one of the 3 SCC in 1 ms
Free SCC test removed 25 places
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Graph (complete) has 826 edges and 223 vertex of which 222 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 222 transition count 399
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 186 transition count 397
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 76 place count 186 transition count 394
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 82 place count 183 transition count 394
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 121 place count 144 transition count 348
Iterating global reduction 2 with 39 rules applied. Total rules applied 160 place count 144 transition count 348
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 160 place count 144 transition count 341
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 174 place count 137 transition count 341
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 189 place count 122 transition count 296
Iterating global reduction 2 with 15 rules applied. Total rules applied 204 place count 122 transition count 296
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 212 place count 122 transition count 288
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 244 place count 106 transition count 272
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 251 place count 99 transition count 251
Iterating global reduction 3 with 7 rules applied. Total rules applied 258 place count 99 transition count 251
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 259 place count 99 transition count 250
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 260 place count 98 transition count 248
Iterating global reduction 4 with 1 rules applied. Total rules applied 261 place count 98 transition count 248
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 262 place count 97 transition count 245
Iterating global reduction 4 with 1 rules applied. Total rules applied 263 place count 97 transition count 245
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 264 place count 97 transition count 244
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 270 place count 97 transition count 238
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 276 place count 94 transition count 235
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 278 place count 92 transition count 229
Iterating global reduction 5 with 2 rules applied. Total rules applied 280 place count 92 transition count 229
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 282 place count 92 transition count 227
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 283 place count 92 transition count 227
Applied a total of 283 rules in 74 ms. Remains 92 /248 variables (removed 156) and now considering 227/470 (removed 243) transitions.
[2026-05-25 10:06:35] [INFO ] Flow matrix only has 217 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9305066334645359006.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9962371756214729393.kers'
[2026-05-25 10:06:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9305066334645359006.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9962371756214729393.kers]
Normalized transition count is 216 out of 217 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 216 rows 92 cols 754 entries
Finished phase 1 with 84 SingleSign rule and 0 generalized
[2026-05-25 10:06:35] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9962371756214729393.kers
Total runtime 1 ms.
[2026-05-25 10:06:35] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-25 10:06:35] [INFO ] Flow matrix only has 217 transitions (discarded 10 similar events)
[2026-05-25 10:06:35] [INFO ] Invariant cache hit.
[2026-05-25 10:06:35] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-25 10:06:35] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2026-05-25 10:06:35] [INFO ] Redundant transitions in 5 ms returned []
Running 226 sub problems to find dead transitions.
[2026-05-25 10:06:35] [INFO ] Flow matrix only has 217 transitions (discarded 10 similar events)
[2026-05-25 10:06:35] [INFO ] Invariant cache hit.
[2026-05-25 10:06:35] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 216/308 variables, 92/100 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (OVERLAPS) 1/309 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 0/309 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 138 constraints, problems are : Problem set: 0 solved, 226 unsolved in 13848 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 92/92 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 216/308 variables, 92/100 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 226/363 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 5/368 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 226 unsolved
SMT process timed out in 43925ms, After SMT, problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 43926ms
Starting structural reductions in SI_CTL mode, iteration 1 : 92/248 places, 227/470 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44223 ms. Remains : 92/248 places, 227/470 transitions.
[2026-05-25 10:07:19] [INFO ] Flatten gal took : 13 ms
[2026-05-25 10:07:19] [INFO ] Flatten gal took : 16 ms
[2026-05-25 10:07:19] [INFO ] Input system was already deterministic with 227 transitions.
[2026-05-25 10:07:19] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:07:19] [INFO ] Flatten gal took : 14 ms
[2026-05-25 10:07:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality13388152651193426932.gal : 1 ms
[2026-05-25 10:07:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality14441386556193832549.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/CTLCardinality13388152651193426932.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14441386556193832549.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,2.55964e+07,13.2913,324188,2,12059,5,661711,6,0,591,1.07805e+06,0


Converting to forward existential form...Done !
original formula: EF((((((p271==1) + EG((p276==1))) + ((p323==0)||(p349==1))) + ((p228==0)||(p259==1))) * ((p138==1) + AG(((AF(((p266==0)||(p0==1))) + (p14...177
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * ((((p271==1) + EG((p276==1))) + ((p323==0)||(p349==1))) + ((p228==0)||(p259==1)))) * (p138...364
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t7, t14, t16, t22, t28, t29, t36, t37, t40, t43, t46, t47, t49, t55, t56, t63, t65, t...527
(forward)formula 0,1,19.3631,329700,1,0,510,1.58788e+06,474,225,4937,1.36021e+06,507
FORMULA MedleyA-PT-23-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 470/470 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 247 transition count 470
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 47 place count 201 transition count 416
Iterating global reduction 1 with 46 rules applied. Total rules applied 93 place count 201 transition count 416
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 115 place count 179 transition count 382
Iterating global reduction 1 with 22 rules applied. Total rules applied 137 place count 179 transition count 382
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 146 place count 170 transition count 361
Iterating global reduction 1 with 9 rules applied. Total rules applied 155 place count 170 transition count 361
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 158 place count 170 transition count 358
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 166 place count 162 transition count 340
Iterating global reduction 2 with 8 rules applied. Total rules applied 174 place count 162 transition count 340
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 179 place count 162 transition count 335
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 181 place count 160 transition count 330
Iterating global reduction 3 with 2 rules applied. Total rules applied 183 place count 160 transition count 330
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 185 place count 160 transition count 328
Applied a total of 185 rules in 18 ms. Remains 160 /248 variables (removed 88) and now considering 328/470 (removed 142) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7490497826241491707.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15108359904805227607.kers'
[2026-05-25 10:07:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7490497826241491707.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15108359904805227607.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 328 rows 160 cols 1136 entries
Finished phase 1 with 152 SingleSign rule and 0 generalized
[2026-05-25 10:07:39] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15108359904805227607.kers
Total runtime 1 ms.
[2026-05-25 10:07:39] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-25 10:07:39] [INFO ] Invariant cache hit.
[2026-05-25 10:07:39] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Running 327 sub problems to find dead transitions.
[2026-05-25 10:07:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (OVERLAPS) 328/488 variables, 160/169 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 3/173 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 8 (OVERLAPS) 0/488 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 327 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 173 constraints, problems are : Problem set: 0 solved, 327 unsolved in 22246 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 327 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (OVERLAPS) 328/488 variables, 160/170 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 327/497 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 3/501 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 503 constraints, problems are : Problem set: 0 solved, 327 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 52328ms problems are : Problem set: 0 solved, 327 unsolved
Search for dead transitions found 0 dead transitions in 52329ms
Starting structural reductions in LTL mode, iteration 1 : 160/248 places, 328/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52631 ms. Remains : 160/248 places, 328/470 transitions.
[2026-05-25 10:08:32] [INFO ] Flatten gal took : 17 ms
[2026-05-25 10:08:32] [INFO ] Flatten gal took : 15 ms
[2026-05-25 10:08:32] [INFO ] Input system was already deterministic with 328 transitions.
[2026-05-25 10:08:32] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:08:32] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:08:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality4006556216585832432.gal : 2 ms
[2026-05-25 10:08:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality399839382686772947.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/CTLCardinality4006556216585832432.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality399839382686772947.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.
Detected timeout of ITS tools.
[2026-05-25 10:09:02] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:09:02] [INFO ] Applying decomposition
[2026-05-25 10:09:02] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14685668088097553159.txt' '-o' '/tmp/graph14685668088097553159.bin' '-w' '/tmp/graph14685668088097553159.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14685668088097553159.bin' '-l' '-1' '-v' '-w' '/tmp/graph14685668088097553159.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:09:02] [INFO ] Decomposing Gal with order
[2026-05-25 10:09:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:09:02] [INFO ] Removed a total of 470 redundant transitions.
[2026-05-25 10:09:02] [INFO ] Flatten gal took : 18 ms
[2026-05-25 10:09:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 6 ms.
[2026-05-25 10:09:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality16420025583766376188.gal : 9 ms
[2026-05-25 10:09:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality1653303159022137260.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/CTLCardinality16420025583766376188.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1653303159022137260.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.54241e+10,3.97564,120096,1642,70,201834,749,766,450392,88,2044,0


Converting to forward existential form...Done !
original formula: (AG(((((i4.i0.u22.p164==1)&&((i3.i1.u15.p122==0)||(i6.u35.p296==1)))||((i8.u45.p354!=0)&&(i6.u32.p274!=1))) + AF(((i6.u29.p270==0)||(i3.i...250
=> equivalent forward existential formula: [FwdG((Init * !(!(E(TRUE U !(((((i4.i0.u22.p164==1)&&((i3.i1.u15.p122==0)||(i6.u35.p296==1)))||((i8.u45.p354!=0)...322
Reverse transition relation is NOT exact ! Due to transitions t20, t57, t123, t132, t143, t146, t147, t155, t175, t182, t185, t186, t201, t208, t211, t212,...1001
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 248/248 places, 470/470 transitions.
Graph (trivial) has 212 edges and 248 vertex of which 29 / 248 are part of one of the 3 SCC in 3 ms
Free SCC test removed 26 places
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Graph (complete) has 823 edges and 222 vertex of which 221 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 220 transition count 392
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 83 place count 181 transition count 389
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 83 place count 181 transition count 386
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 89 place count 178 transition count 386
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 134 place count 133 transition count 330
Iterating global reduction 2 with 45 rules applied. Total rules applied 179 place count 133 transition count 330
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 179 place count 133 transition count 323
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 193 place count 126 transition count 323
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 211 place count 108 transition count 269
Iterating global reduction 2 with 18 rules applied. Total rules applied 229 place count 108 transition count 269
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 239 place count 108 transition count 259
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 269 place count 93 transition count 244
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 276 place count 86 transition count 223
Iterating global reduction 3 with 7 rules applied. Total rules applied 283 place count 86 transition count 223
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 284 place count 85 transition count 221
Iterating global reduction 3 with 1 rules applied. Total rules applied 285 place count 85 transition count 221
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 286 place count 84 transition count 218
Iterating global reduction 3 with 1 rules applied. Total rules applied 287 place count 84 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 288 place count 84 transition count 217
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 294 place count 84 transition count 211
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 300 place count 81 transition count 208
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 303 place count 78 transition count 199
Iterating global reduction 4 with 3 rules applied. Total rules applied 306 place count 78 transition count 199
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 309 place count 78 transition count 196
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 311 place count 78 transition count 196
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 313 place count 76 transition count 194
Applied a total of 313 rules in 45 ms. Remains 76 /248 variables (removed 172) and now considering 194/470 (removed 276) transitions.
[2026-05-25 10:09:32] [INFO ] Flow matrix only has 184 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17095916256112042490.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2659231465101013550.kers'
[2026-05-25 10:09:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17095916256112042490.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2659231465101013550.kers]
Normalized transition count is 183 out of 184 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 183 rows 75 cols 643 entries
Finished phase 1 with 68 SingleSign rule and 0 generalized
[2026-05-25 10:09:32] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2659231465101013550.kers
Total runtime 3 ms.
[2026-05-25 10:09:32] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-25 10:09:32] [INFO ] Flow matrix only has 184 transitions (discarded 10 similar events)
[2026-05-25 10:09:32] [INFO ] Invariant cache hit.
[2026-05-25 10:09:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 10:09:32] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2026-05-25 10:09:32] [INFO ] Redundant transitions in 8 ms returned []
Running 167 sub problems to find dead transitions.
[2026-05-25 10:09:32] [INFO ] Flow matrix only has 184 transitions (discarded 10 similar events)
[2026-05-25 10:09:32] [INFO ] Invariant cache hit.
[2026-05-25 10:09:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 182/255 variables, 73/81 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 4/259 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (OVERLAPS) 0/259 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/260 variables, and 87 constraints, problems are : Problem set: 0 solved, 167 unsolved in 10485 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 76/76 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 182/255 variables, 73/81 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 4/259 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 147/254 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 10 (OVERLAPS) 0/259 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/260 variables, and 254 constraints, problems are : Problem set: 0 solved, 167 unsolved in 8815 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 76/76 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 19341ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 19342ms
Starting structural reductions in SI_CTL mode, iteration 1 : 76/248 places, 194/470 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19647 ms. Remains : 76/248 places, 194/470 transitions.
[2026-05-25 10:09:52] [INFO ] Flatten gal took : 9 ms
[2026-05-25 10:09:52] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:09:52] [INFO ] Input system was already deterministic with 194 transitions.
[2026-05-25 10:09:52] [INFO ] Flatten gal took : 12 ms
[2026-05-25 10:09:52] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:09:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15196968794447366291.gal : 2 ms
[2026-05-25 10:09:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16658181953710664253.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15196968794447366291.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16658181953710664253.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 23382 steps (10 resets) in 147 ms. (157 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-23-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 248/248 places, 470/470 transitions.
Graph (trivial) has 206 edges and 248 vertex of which 29 / 248 are part of one of the 3 SCC in 1 ms
Free SCC test removed 26 places
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Graph (complete) has 823 edges and 222 vertex of which 221 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 221 transition count 396
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 77 place count 185 transition count 393
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 77 place count 185 transition count 390
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 83 place count 182 transition count 390
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 124 place count 141 transition count 338
Iterating global reduction 2 with 41 rules applied. Total rules applied 165 place count 141 transition count 338
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 165 place count 141 transition count 332
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 177 place count 135 transition count 332
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 194 place count 118 transition count 281
Iterating global reduction 2 with 17 rules applied. Total rules applied 211 place count 118 transition count 281
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 221 place count 118 transition count 271
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 255 place count 101 transition count 254
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 262 place count 94 transition count 233
Iterating global reduction 3 with 7 rules applied. Total rules applied 269 place count 94 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 270 place count 94 transition count 232
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 276 place count 94 transition count 226
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 282 place count 91 transition count 223
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 285 place count 88 transition count 214
Iterating global reduction 4 with 3 rules applied. Total rules applied 288 place count 88 transition count 214
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 291 place count 88 transition count 211
Applied a total of 291 rules in 36 ms. Remains 88 /248 variables (removed 160) and now considering 211/470 (removed 259) transitions.
[2026-05-25 10:09:52] [INFO ] Flow matrix only has 202 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6433947435038310293.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1569799201447309798.kers'
[2026-05-25 10:09:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6433947435038310293.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1569799201447309798.kers]
Normalized transition count is 201 out of 202 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 201 rows 88 cols 700 entries
Finished phase 1 with 80 SingleSign rule and 0 generalized
[2026-05-25 10:09:52] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-1569799201447309798.kers
Total runtime 6 ms.
[2026-05-25 10:09:52] [INFO ] Implicit Places using invariants in 376 ms returned []
[2026-05-25 10:09:52] [INFO ] Flow matrix only has 202 transitions (discarded 9 similar events)
[2026-05-25 10:09:52] [INFO ] Invariant cache hit.
[2026-05-25 10:09:52] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-25 10:09:52] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
[2026-05-25 10:09:52] [INFO ] Redundant transitions in 2 ms returned []
Running 210 sub problems to find dead transitions.
[2026-05-25 10:09:52] [INFO ] Flow matrix only has 202 transitions (discarded 9 similar events)
[2026-05-25 10:09:52] [INFO ] Invariant cache hit.
[2026-05-25 10:09:52] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 201/289 variables, 88/96 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 32/128 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 1/290 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (OVERLAPS) 0/290 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 130 constraints, problems are : Problem set: 0 solved, 210 unsolved in 15156 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 88/88 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 201/289 variables, 88/97 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 32/129 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 210/339 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 4/343 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (OVERLAPS) 1/290 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 290/290 variables, and 344 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 88/88 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 45211ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 45212ms
Starting structural reductions in SI_CTL mode, iteration 1 : 88/248 places, 211/470 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45907 ms. Remains : 88/248 places, 211/470 transitions.
[2026-05-25 10:10:38] [INFO ] Flatten gal took : 12 ms
[2026-05-25 10:10:38] [INFO ] Flatten gal took : 10 ms
[2026-05-25 10:10:38] [INFO ] Input system was already deterministic with 211 transitions.
[2026-05-25 10:10:38] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:10:38] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:10:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality5481061935091649961.gal : 2 ms
[2026-05-25 10:10:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality1490552723760837084.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/CTLCardinality5481061935091649961.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1490552723760837084.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.18151e+07,6.57863,154912,2,10386,5,432762,6,0,559,680691,0


Converting to forward existential form...Done !
original formula: !(E(EF(!(((((p9==1)&&(p13==0)) + AG(((p14==0)||(p85==1)))) * !(AG((p0==1)))))) U (p198==1)))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U !(((((p9==1)&&(p13==0)) + !(E(TRUE U !(((p14==0)||(p85==1)))))) * !(!(E(TRUE U !((p0==1))))...182
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t12, t13, t16, t19, t20, t26, t27, t32, t33, t36, t39, t40, t45, t49, t50, t54, t...660
(forward)formula 0,1,20.2206,450908,1,0,578,2.44542e+06,449,263,4722,2.20706e+06,538
FORMULA MedleyA-PT-23-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 470/470 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 247 transition count 470
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 49 place count 199 transition count 414
Iterating global reduction 1 with 48 rules applied. Total rules applied 97 place count 199 transition count 414
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 122 place count 174 transition count 375
Iterating global reduction 1 with 25 rules applied. Total rules applied 147 place count 174 transition count 375
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 159 place count 162 transition count 348
Iterating global reduction 1 with 12 rules applied. Total rules applied 171 place count 162 transition count 348
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 174 place count 162 transition count 345
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 184 place count 152 transition count 321
Iterating global reduction 2 with 10 rules applied. Total rules applied 194 place count 152 transition count 321
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 200 place count 152 transition count 315
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 202 place count 150 transition count 310
Iterating global reduction 3 with 2 rules applied. Total rules applied 204 place count 150 transition count 310
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 206 place count 150 transition count 308
Applied a total of 206 rules in 28 ms. Remains 150 /248 variables (removed 98) and now considering 308/470 (removed 162) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16640691765932553509.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7193229787884222443.kers'
[2026-05-25 10:10:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16640691765932553509.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7193229787884222443.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 308 rows 150 cols 1066 entries
Finished phase 1 with 142 SingleSign rule and 0 generalized
[2026-05-25 10:10:58] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7193229787884222443.kers
Total runtime 2 ms.
[2026-05-25 10:10:58] [INFO ] Implicit Places using invariants in 157 ms returned []
[2026-05-25 10:10:58] [INFO ] Invariant cache hit.
[2026-05-25 10:10:58] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2026-05-25 10:10:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 308/458 variables, 150/159 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 3/163 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (OVERLAPS) 0/458 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 163 constraints, problems are : Problem set: 0 solved, 307 unsolved in 23051 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 308/458 variables, 150/160 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 307/467 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 3/470 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 3/473 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/458 variables, and 473 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 53120ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 53121ms
Starting structural reductions in LTL mode, iteration 1 : 150/248 places, 308/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53633 ms. Remains : 150/248 places, 308/470 transitions.
[2026-05-25 10:11:52] [INFO ] Flatten gal took : 13 ms
[2026-05-25 10:11:52] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:11:52] [INFO ] Input system was already deterministic with 308 transitions.
[2026-05-25 10:11:52] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:11:52] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:11:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality493195748441324240.gal : 2 ms
[2026-05-25 10:11:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality17087467391960537991.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/CTLCardinality493195748441324240.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17087467391960537991.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.
Detected timeout of ITS tools.
[2026-05-25 10:12:22] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:12:22] [INFO ] Applying decomposition
[2026-05-25 10:12:22] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3553448369027556976.txt' '-o' '/tmp/graph3553448369027556976.bin' '-w' '/tmp/graph3553448369027556976.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3553448369027556976.bin' '-l' '-1' '-v' '-w' '/tmp/graph3553448369027556976.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:12:22] [INFO ] Decomposing Gal with order
[2026-05-25 10:12:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:12:22] [INFO ] Removed a total of 441 redundant transitions.
[2026-05-25 10:12:22] [INFO ] Flatten gal took : 15 ms
[2026-05-25 10:12:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 3 ms.
[2026-05-25 10:12:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality9891792557636258467.gal : 2 ms
[2026-05-25 10:12:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality12259295286951084824.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/CTLCardinality9891792557636258467.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12259295286951084824.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.01747e+09,2.33644,72828,1385,47,115077,631,586,235382,72,1914,0


Converting to forward existential form...Done !
original formula: (EX(EF(EG(((i6.u37.p320==0)||(i8.u42.p351==1))))) * EX(AF((i6.u35.p324==1))))
=> equivalent forward existential formula: [(EY((Init * EX(E(TRUE U EG(((i6.u37.p320==0)||(i8.u42.p351==1))))))) * !(EG(!((i6.u35.p324==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t20, t54, t135, t137, t138, t171, t173, t174, t195, t197, t198, t203, t204, t205, t207, t208,...841
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 470/470 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 247 transition count 470
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 40 place count 208 transition count 425
Iterating global reduction 1 with 39 rules applied. Total rules applied 79 place count 208 transition count 425
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 98 place count 189 transition count 396
Iterating global reduction 1 with 19 rules applied. Total rules applied 117 place count 189 transition count 396
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 125 place count 181 transition count 377
Iterating global reduction 1 with 8 rules applied. Total rules applied 133 place count 181 transition count 377
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 135 place count 181 transition count 375
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 142 place count 174 transition count 359
Iterating global reduction 2 with 7 rules applied. Total rules applied 149 place count 174 transition count 359
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 154 place count 174 transition count 354
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 155 place count 173 transition count 351
Iterating global reduction 3 with 1 rules applied. Total rules applied 156 place count 173 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 157 place count 173 transition count 350
Applied a total of 157 rules in 10 ms. Remains 173 /248 variables (removed 75) and now considering 350/470 (removed 120) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12586793447719769145.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13657977141791002430.kers'
[2026-05-25 10:12:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12586793447719769145.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13657977141791002430.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 350 rows 173 cols 1216 entries
Finished phase 1 with 165 SingleSign rule and 0 generalized
[2026-05-25 10:12:52] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13657977141791002430.kers
Total runtime 2 ms.
[2026-05-25 10:12:52] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-25 10:12:52] [INFO ] Invariant cache hit.
[2026-05-25 10:12:52] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Running 349 sub problems to find dead transitions.
[2026-05-25 10:12:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 3 (OVERLAPS) 350/523 variables, 173/181 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/523 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/523 variables, 3/185 constraints. Problems are: Problem set: 0 solved, 349 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 523/523 variables, and 185 constraints, problems are : Problem set: 0 solved, 349 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 349/349 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 349 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 4 (OVERLAPS) 350/523 variables, 173/182 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/523 variables, 349/531 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 3/534 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 3/537 constraints. Problems are: Problem set: 0 solved, 349 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 523/523 variables, and 537 constraints, problems are : Problem set: 0 solved, 349 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 349/349 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60126ms problems are : Problem set: 0 solved, 349 unsolved
Search for dead transitions found 0 dead transitions in 60126ms
Starting structural reductions in LTL mode, iteration 1 : 173/248 places, 350/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60425 ms. Remains : 173/248 places, 350/470 transitions.
[2026-05-25 10:13:52] [INFO ] Flatten gal took : 13 ms
[2026-05-25 10:13:52] [INFO ] Flatten gal took : 25 ms
[2026-05-25 10:13:52] [INFO ] Input system was already deterministic with 350 transitions.
[2026-05-25 10:13:52] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:13:52] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:13:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality10088855282473199551.gal : 3 ms
[2026-05-25 10:13:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality4816123716202562905.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/CTLCardinality10088855282473199551.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4816123716202562905.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.
Detected timeout of ITS tools.
[2026-05-25 10:14:23] [INFO ] Flatten gal took : 14 ms
[2026-05-25 10:14:23] [INFO ] Applying decomposition
[2026-05-25 10:14:23] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14359945681079536517.txt' '-o' '/tmp/graph14359945681079536517.bin' '-w' '/tmp/graph14359945681079536517.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14359945681079536517.bin' '-l' '-1' '-v' '-w' '/tmp/graph14359945681079536517.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:14:23] [INFO ] Decomposing Gal with order
[2026-05-25 10:14:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:14:23] [INFO ] Removed a total of 506 redundant transitions.
[2026-05-25 10:14:23] [INFO ] Flatten gal took : 19 ms
[2026-05-25 10:14:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 7 ms.
[2026-05-25 10:14:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality8288107675480634269.gal : 4 ms
[2026-05-25 10:14:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality3336945519960981050.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/CTLCardinality8288107675480634269.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3336945519960981050.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.52732e+10,2.65481,83224,2018,96,139069,1024,824,288719,93,3748,0


Converting to forward existential form...Done !
original formula: EG(A(!(((!((((((i4.i2.u31.p184==1)||(i5.i0.u40.p261==0))||(i5.i0.u33.p327==1))&&(i4.i2.u22.p160==1))&&((i2.i0.u10.p73==0)||(i4.i2.u22.p16...427
=> equivalent forward existential formula: [FwdG(Init,!((E(!(E(!((E(!((i4.i2.u20.p152==0)) U (!((((i4.i1.u27.p157==0)||(i2.i1.u14.p121==1))&&((i7.u46.p337=...1022
Reverse transition relation is NOT exact ! Due to transitions t20, t61, t156, t158, t159, t160, t167, t188, t197, t199, t200, t201, t215, t224, t226, t227,...988
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 470/470 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 247 transition count 470
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 48 place count 200 transition count 417
Iterating global reduction 1 with 47 rules applied. Total rules applied 95 place count 200 transition count 417
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 119 place count 176 transition count 379
Iterating global reduction 1 with 24 rules applied. Total rules applied 143 place count 176 transition count 379
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 154 place count 165 transition count 353
Iterating global reduction 1 with 11 rules applied. Total rules applied 165 place count 165 transition count 353
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 168 place count 165 transition count 350
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 177 place count 156 transition count 329
Iterating global reduction 2 with 9 rules applied. Total rules applied 186 place count 156 transition count 329
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 192 place count 156 transition count 323
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 194 place count 154 transition count 318
Iterating global reduction 3 with 2 rules applied. Total rules applied 196 place count 154 transition count 318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 198 place count 154 transition count 316
Applied a total of 198 rules in 22 ms. Remains 154 /248 variables (removed 94) and now considering 316/470 (removed 154) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2266334821444938187.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11762653870987033420.kers'
[2026-05-25 10:14:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2266334821444938187.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11762653870987033420.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 316 rows 154 cols 1106 entries
Finished phase 1 with 146 SingleSign rule and 0 generalized
[2026-05-25 10:14:53] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11762653870987033420.kers
Total runtime 1 ms.
[2026-05-25 10:14:53] [INFO ] Implicit Places using invariants in 110 ms returned []
[2026-05-25 10:14:53] [INFO ] Invariant cache hit.
[2026-05-25 10:14:53] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
Running 315 sub problems to find dead transitions.
[2026-05-25 10:14:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (OVERLAPS) 316/470 variables, 154/162 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (OVERLAPS) 0/470 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 315 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 166 constraints, problems are : Problem set: 0 solved, 315 unsolved in 27345 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 315 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 316/470 variables, 154/163 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 315/478 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 3/481 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 3/485 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/470 variables, and 485 constraints, problems are : Problem set: 0 solved, 315 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 57430ms problems are : Problem set: 0 solved, 315 unsolved
Search for dead transitions found 0 dead transitions in 57431ms
Starting structural reductions in LTL mode, iteration 1 : 154/248 places, 316/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57759 ms. Remains : 154/248 places, 316/470 transitions.
[2026-05-25 10:15:50] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:15:50] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:15:51] [INFO ] Input system was already deterministic with 316 transitions.
[2026-05-25 10:15:51] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:15:51] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:15:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality14220673397686103193.gal : 2 ms
[2026-05-25 10:15:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality5352492566181870865.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/CTLCardinality14220673397686103193.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5352492566181870865.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.
Detected timeout of ITS tools.
[2026-05-25 10:16:21] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:16:21] [INFO ] Applying decomposition
[2026-05-25 10:16:21] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10720690877054148462.txt' '-o' '/tmp/graph10720690877054148462.bin' '-w' '/tmp/graph10720690877054148462.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10720690877054148462.bin' '-l' '-1' '-v' '-w' '/tmp/graph10720690877054148462.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:16:21] [INFO ] Decomposing Gal with order
[2026-05-25 10:16:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:16:21] [INFO ] Removed a total of 466 redundant transitions.
[2026-05-25 10:16:21] [INFO ] Flatten gal took : 13 ms
[2026-05-25 10:16:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 5 ms.
[2026-05-25 10:16:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality10390327177114746000.gal : 2 ms
[2026-05-25 10:16:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality10067209492562580078.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/CTLCardinality10390327177114746000.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10067209492562580078.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.00494e+10,0.644393,26212,1101,47,36049,564,607,88654,76,1667,0


Converting to forward existential form...Done !
original formula: AG(A((i4.u22.p164==1) U (!(EX((i6.u26.p215==1))) * EX(A((i0.u5.p26==1) U ((i5.u36.p303==0)||(i3.u17.p129==1)))))))
=> equivalent forward existential formula: (([(EY((FwdU(FwdU(Init,TRUE),!((!(EX((i6.u26.p215==1))) * EX(!((E(!(((i5.u36.p303==0)||(i3.u17.p129==1))) U (!((...967
Reverse transition relation is NOT exact ! Due to transitions t19, t53, t137, t139, t140, t173, t175, t176, t197, t199, t200, t205, t206, t207, t208, t209,...843
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,3.50821,125328,1,0,191076,1781,3735,546774,392,5282,421577
FORMULA MedleyA-PT-23-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 470/470 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 247 transition count 470
Discarding 50 places :
Symmetric choice reduction at 1 with 50 rule applications. Total rules 51 place count 197 transition count 412
Iterating global reduction 1 with 50 rules applied. Total rules applied 101 place count 197 transition count 412
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 126 place count 172 transition count 373
Iterating global reduction 1 with 25 rules applied. Total rules applied 151 place count 172 transition count 373
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 162 place count 161 transition count 348
Iterating global reduction 1 with 11 rules applied. Total rules applied 173 place count 161 transition count 348
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 176 place count 161 transition count 345
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 185 place count 152 transition count 324
Iterating global reduction 2 with 9 rules applied. Total rules applied 194 place count 152 transition count 324
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 199 place count 152 transition count 319
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 201 place count 150 transition count 314
Iterating global reduction 3 with 2 rules applied. Total rules applied 203 place count 150 transition count 314
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 205 place count 150 transition count 312
Applied a total of 205 rules in 8 ms. Remains 150 /248 variables (removed 98) and now considering 312/470 (removed 158) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3812818289164913026.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17082182162779112389.kers'
[2026-05-25 10:16:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3812818289164913026.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17082182162779112389.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 312 rows 150 cols 1080 entries
Finished phase 1 with 142 SingleSign rule and 0 generalized
[2026-05-25 10:16:24] [INFO ] Computed 8 invariants in 4 ms
Computed 8 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-17082182162779112389.kers
Total runtime 5 ms.
[2026-05-25 10:16:24] [INFO ] Implicit Places using invariants in 147 ms returned []
[2026-05-25 10:16:24] [INFO ] Invariant cache hit.
[2026-05-25 10:16:25] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
Running 311 sub problems to find dead transitions.
[2026-05-25 10:16:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (OVERLAPS) 312/462 variables, 150/158 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/462 variables, and 162 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (OVERLAPS) 312/462 variables, 150/159 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 311/470 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 3/473 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 3/477 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/462 variables, and 480 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 60108ms
Starting structural reductions in LTL mode, iteration 1 : 150/248 places, 312/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60552 ms. Remains : 150/248 places, 312/470 transitions.
[2026-05-25 10:17:25] [INFO ] Flatten gal took : 10 ms
[2026-05-25 10:17:25] [INFO ] Flatten gal took : 9 ms
[2026-05-25 10:17:25] [INFO ] Input system was already deterministic with 312 transitions.
[2026-05-25 10:17:25] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:17:25] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:17:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality418966215590510494.gal : 2 ms
[2026-05-25 10:17:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality938593923706306741.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/CTLCardinality418966215590510494.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality938593923706306741.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 -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 10:17:55] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:17:55] [INFO ] Applying decomposition
[2026-05-25 10:17:55] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph13461052002493085281.txt' '-o' '/tmp/graph13461052002493085281.bin' '-w' '/tmp/graph13461052002493085281.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13461052002493085281.bin' '-l' '-1' '-v' '-w' '/tmp/graph13461052002493085281.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:17:55] [INFO ] Decomposing Gal with order
[2026-05-25 10:17:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:17:55] [INFO ] Removed a total of 452 redundant transitions.
[2026-05-25 10:17:55] [INFO ] Flatten gal took : 13 ms
[2026-05-25 10:17:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 4 ms.
[2026-05-25 10:17:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality16161684713141976366.gal : 2 ms
[2026-05-25 10:17:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality13836789304629190338.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/CTLCardinality16161684713141976366.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13836789304629190338.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.47271e+09,2.6501,85180,1450,46,147943,538,582,293924,73,1345,0


Converting to forward existential form...Done !
original formula: AF(AG(EF(EX((i5.u34.p297==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(E(TRUE U EX((i5.u34.p297==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t19, t55, t136, t138, t139, t172, t174, t175, t196, t198, t199, t204, t205, t206, t207, t208,...822
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 470/470 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 247 transition count 470
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 47 place count 201 transition count 416
Iterating global reduction 1 with 46 rules applied. Total rules applied 93 place count 201 transition count 416
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 117 place count 177 transition count 380
Iterating global reduction 1 with 24 rules applied. Total rules applied 141 place count 177 transition count 380
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 152 place count 166 transition count 356
Iterating global reduction 1 with 11 rules applied. Total rules applied 163 place count 166 transition count 356
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 165 place count 166 transition count 354
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 174 place count 157 transition count 332
Iterating global reduction 2 with 9 rules applied. Total rules applied 183 place count 157 transition count 332
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 188 place count 157 transition count 327
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 189 place count 156 transition count 324
Iterating global reduction 3 with 1 rules applied. Total rules applied 190 place count 156 transition count 324
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 191 place count 156 transition count 323
Applied a total of 191 rules in 8 ms. Remains 156 /248 variables (removed 92) and now considering 323/470 (removed 147) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1162265062650881274.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2839933558539292913.kers'
[2026-05-25 10:18:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1162265062650881274.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2839933558539292913.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 323 rows 156 cols 1114 entries
Finished phase 1 with 148 SingleSign rule and 0 generalized
[2026-05-25 10:18:25] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2839933558539292913.kers
Total runtime 2 ms.
[2026-05-25 10:18:25] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-25 10:18:25] [INFO ] Invariant cache hit.
[2026-05-25 10:18:25] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Running 322 sub problems to find dead transitions.
[2026-05-25 10:18:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (OVERLAPS) 323/479 variables, 156/164 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/479 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 8 (OVERLAPS) 0/479 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 168 constraints, problems are : Problem set: 0 solved, 322 unsolved in 25407 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 323/479 variables, 156/165 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 322/487 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 3/490 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 3/493 constraints. Problems are: Problem set: 0 solved, 322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/479 variables, and 493 constraints, problems are : Problem set: 0 solved, 322 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 55471ms problems are : Problem set: 0 solved, 322 unsolved
Search for dead transitions found 0 dead transitions in 55471ms
Starting structural reductions in LTL mode, iteration 1 : 156/248 places, 323/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55782 ms. Remains : 156/248 places, 323/470 transitions.
[2026-05-25 10:19:21] [INFO ] Flatten gal took : 4 ms
[2026-05-25 10:19:21] [INFO ] Flatten gal took : 4 ms
[2026-05-25 10:19:21] [INFO ] Input system was already deterministic with 323 transitions.
[2026-05-25 10:19:21] [INFO ] Flatten gal took : 4 ms
[2026-05-25 10:19:21] [INFO ] Flatten gal took : 4 ms
[2026-05-25 10:19:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality5108703057928670547.gal : 2 ms
[2026-05-25 10:19:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality15283777501000403848.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/CTLCardinality5108703057928670547.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15283777501000403848.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.
Detected timeout of ITS tools.
[2026-05-25 10:19:51] [INFO ] Flatten gal took : 10 ms
[2026-05-25 10:19:51] [INFO ] Applying decomposition
[2026-05-25 10:19:51] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4333968370102103198.txt' '-o' '/tmp/graph4333968370102103198.bin' '-w' '/tmp/graph4333968370102103198.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4333968370102103198.bin' '-l' '-1' '-v' '-w' '/tmp/graph4333968370102103198.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:19:51] [INFO ] Decomposing Gal with order
[2026-05-25 10:19:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:19:51] [INFO ] Removed a total of 458 redundant transitions.
[2026-05-25 10:19:51] [INFO ] Flatten gal took : 27 ms
[2026-05-25 10:19:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 5 ms.
[2026-05-25 10:19:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality15903521887741254414.gal : 3 ms
[2026-05-25 10:19:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality13549266010888879894.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/CTLCardinality15903521887741254414.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13549266010888879894.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.95444e+09,3.34693,100584,1574,83,169392,1609,605,351952,88,6982,0


Converting to forward existential form...Done !
original formula: EX(AF(AG((E((i5.u28.p282==0) U (i2.u9.p52==0)) + AF(((i5.u29.p236==0)||(i5.u30.p269==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(!(E(TRUE U !((E((i5.u28.p282==0) U (i2.u9.p52==0)) + !(EG(!(((i5.u29.p236==0)||(i5.u30.p269=...180
Reverse transition relation is NOT exact ! Due to transitions t19, t57, t144, t146, t147, t182, t184, t185, t207, t209, t210, t225, t226, t227, t228, t232,...855
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,6.20649,129008,1,0,196245,3095,3774,638109,480,9518,431706
FORMULA MedleyA-PT-23-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 248/248 places, 470/470 transitions.
Graph (trivial) has 211 edges and 248 vertex of which 29 / 248 are part of one of the 3 SCC in 1 ms
Free SCC test removed 26 places
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Graph (complete) has 823 edges and 222 vertex of which 221 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 39 place count 220 transition count 394
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 41 rules applied. Total rules applied 80 place count 183 transition count 390
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 182 transition count 390
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 81 place count 182 transition count 387
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 87 place count 179 transition count 387
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 132 place count 134 transition count 331
Iterating global reduction 3 with 45 rules applied. Total rules applied 177 place count 134 transition count 331
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 177 place count 134 transition count 324
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 191 place count 127 transition count 324
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 209 place count 109 transition count 270
Iterating global reduction 3 with 18 rules applied. Total rules applied 227 place count 109 transition count 270
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 237 place count 109 transition count 260
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 267 place count 94 transition count 245
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 274 place count 87 transition count 224
Iterating global reduction 4 with 7 rules applied. Total rules applied 281 place count 87 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 282 place count 87 transition count 223
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 283 place count 86 transition count 221
Iterating global reduction 5 with 1 rules applied. Total rules applied 284 place count 86 transition count 221
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 285 place count 85 transition count 218
Iterating global reduction 5 with 1 rules applied. Total rules applied 286 place count 85 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 287 place count 85 transition count 217
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 292 place count 85 transition count 212
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 298 place count 82 transition count 209
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 301 place count 79 transition count 200
Iterating global reduction 6 with 3 rules applied. Total rules applied 304 place count 79 transition count 200
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 307 place count 79 transition count 197
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 309 place count 77 transition count 195
Applied a total of 309 rules in 69 ms. Remains 77 /248 variables (removed 171) and now considering 195/470 (removed 275) transitions.
[2026-05-25 10:19:57] [INFO ] Flow matrix only has 185 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8697397862437198811.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12679770326806732946.kers'
[2026-05-25 10:19:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8697397862437198811.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12679770326806732946.kers]
Normalized transition count is 184 out of 185 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 184 rows 76 cols 645 entries
Finished phase 1 with 69 SingleSign rule and 0 generalized
[2026-05-25 10:19:57] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12679770326806732946.kers
Total runtime 1 ms.
[2026-05-25 10:19:57] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-25 10:19:57] [INFO ] Flow matrix only has 185 transitions (discarded 10 similar events)
[2026-05-25 10:19:57] [INFO ] Invariant cache hit.
[2026-05-25 10:19:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 10:19:58] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2026-05-25 10:19:58] [INFO ] Redundant transitions in 1 ms returned []
Running 169 sub problems to find dead transitions.
[2026-05-25 10:19:58] [INFO ] Flow matrix only has 185 transitions (discarded 10 similar events)
[2026-05-25 10:19:58] [INFO ] Invariant cache hit.
[2026-05-25 10:19:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 184/258 variables, 74/82 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 3/261 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (OVERLAPS) 0/261 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 261/262 variables, and 87 constraints, problems are : Problem set: 0 solved, 169 unsolved in 7369 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 77/77 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 184/258 variables, 74/82 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 22/105 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (OVERLAPS) 3/261 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 147/257 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 11 (OVERLAPS) 0/261 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/261 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 13 (OVERLAPS) 0/261 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 261/262 variables, and 258 constraints, problems are : Problem set: 0 solved, 169 unsolved in 23138 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 77/77 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 30536ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 30537ms
Starting structural reductions in SI_CTL mode, iteration 1 : 77/248 places, 195/470 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30818 ms. Remains : 77/248 places, 195/470 transitions.
[2026-05-25 10:20:28] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:20:28] [INFO ] Flatten gal took : 2 ms
[2026-05-25 10:20:28] [INFO ] Input system was already deterministic with 195 transitions.
[2026-05-25 10:20:28] [INFO ] Flatten gal took : 3 ms
[2026-05-25 10:20:28] [INFO ] Flatten gal took : 3 ms
[2026-05-25 10:20:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality17559145904292459417.gal : 1 ms
[2026-05-25 10:20:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality2332952131173678355.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/CTLCardinality17559145904292459417.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2332952131173678355.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: E((p109==1) U AG(!(AG((p274==1)))))
=> equivalent forward existential formula: [(FwdU(Init,(p109==1)) * !(E(TRUE U !(!(!(E(TRUE U !((p274==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t12, t13, t14, t17, t20, t21, t28, t29, t32, t35, t36, t43, t44, t73, t74, t75, t...497
Hit Full ! (commute/partial/dont) 188/0/7
(forward)formula 0,1,9.85807,257840,1,0,420,1.3909e+06,413,178,4250,1.0638e+06,397
FORMULA MedleyA-PT-23-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 470/470 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 247 transition count 470
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 48 place count 200 transition count 415
Iterating global reduction 1 with 47 rules applied. Total rules applied 95 place count 200 transition count 415
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 119 place count 176 transition count 377
Iterating global reduction 1 with 24 rules applied. Total rules applied 143 place count 176 transition count 377
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 153 place count 166 transition count 353
Iterating global reduction 1 with 10 rules applied. Total rules applied 163 place count 166 transition count 353
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 166 place count 166 transition count 350
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 174 place count 158 transition count 331
Iterating global reduction 2 with 8 rules applied. Total rules applied 182 place count 158 transition count 331
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 186 place count 158 transition count 327
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 188 place count 156 transition count 322
Iterating global reduction 3 with 2 rules applied. Total rules applied 190 place count 156 transition count 322
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 192 place count 156 transition count 320
Applied a total of 192 rules in 39 ms. Remains 156 /248 variables (removed 92) and now considering 320/470 (removed 150) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10314326464391445969.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5830764356131612762.kers'
[2026-05-25 10:20:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10314326464391445969.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5830764356131612762.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 320 rows 156 cols 1096 entries
Finished phase 1 with 148 SingleSign rule and 0 generalized
[2026-05-25 10:20:38] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5830764356131612762.kers
Total runtime 1 ms.
[2026-05-25 10:20:38] [INFO ] Implicit Places using invariants in 150 ms returned []
[2026-05-25 10:20:38] [INFO ] Invariant cache hit.
[2026-05-25 10:20:38] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Running 319 sub problems to find dead transitions.
[2026-05-25 10:20:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (OVERLAPS) 320/476 variables, 156/164 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 7 (OVERLAPS) 0/476 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Real declared 476/476 variables, and 168 constraints, problems are : Problem set: 0 solved, 319 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 319 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (OVERLAPS) 320/476 variables, 156/165 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 319/484 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 3/488 constraints. Problems are: Problem set: 0 solved, 319 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 476/476 variables, and 491 constraints, problems are : Problem set: 0 solved, 319 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 319 unsolved
Search for dead transitions found 0 dead transitions in 60112ms
Starting structural reductions in LTL mode, iteration 1 : 156/248 places, 320/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60510 ms. Remains : 156/248 places, 320/470 transitions.
[2026-05-25 10:21:39] [INFO ] Flatten gal took : 4 ms
[2026-05-25 10:21:39] [INFO ] Flatten gal took : 4 ms
[2026-05-25 10:21:39] [INFO ] Input system was already deterministic with 320 transitions.
[2026-05-25 10:21:39] [INFO ] Flatten gal took : 4 ms
[2026-05-25 10:21:39] [INFO ] Flatten gal took : 16 ms
[2026-05-25 10:21:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality2076354159017506380.gal : 1 ms
[2026-05-25 10:21:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality13385254382611460167.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/CTLCardinality2076354159017506380.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13385254382611460167.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.
Detected timeout of ITS tools.
[2026-05-25 10:22:09] [INFO ] Flatten gal took : 13 ms
[2026-05-25 10:22:09] [INFO ] Applying decomposition
[2026-05-25 10:22:09] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12321497724644056780.txt' '-o' '/tmp/graph12321497724644056780.bin' '-w' '/tmp/graph12321497724644056780.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12321497724644056780.bin' '-l' '-1' '-v' '-w' '/tmp/graph12321497724644056780.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:22:09] [INFO ] Decomposing Gal with order
[2026-05-25 10:22:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:22:09] [INFO ] Removed a total of 455 redundant transitions.
[2026-05-25 10:22:09] [INFO ] Flatten gal took : 27 ms
[2026-05-25 10:22:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 3 ms.
[2026-05-25 10:22:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality7788919955387657697.gal : 3 ms
[2026-05-25 10:22:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality5793807968760628663.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/CTLCardinality7788919955387657697.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5793807968760628663.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.955e+09,1.58754,54228,1132,53,86794,908,683,170009,75,2558,0


Converting to forward existential form...Done !
original formula: (EX(((i5.i0.u34.p289==0)&&(i8.u46.p359==1))) + (AG(AX(EF(((i0.u1.p7==0)&&(i1.i0.u10.p69==0))))) * EF((E((i1.i0.u9.p67==1) U (i2.u5.p29==0...185
=> equivalent forward existential formula: ([(EY(FwdU((Init * !(EX(((i5.i0.u34.p289==0)&&(i8.u46.p359==1))))),TRUE)) * !(E(TRUE U ((i0.u1.p7==0)&&(i1.i0.u1...333
Reverse transition relation is NOT exact ! Due to transitions t19, t56, t144, t146, t147, t180, t182, t183, t204, t206, t207, t212, t213, t214, t215, t217,...924
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,10.3362,296068,1,0,460304,2961,4313,1.12911e+06,399,7763,966744
FORMULA MedleyA-PT-23-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 248/248 places, 470/470 transitions.
Graph (trivial) has 212 edges and 248 vertex of which 29 / 248 are part of one of the 3 SCC in 2 ms
Free SCC test removed 26 places
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Graph (complete) has 823 edges and 222 vertex of which 221 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 220 transition count 392
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 83 place count 181 transition count 389
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 83 place count 181 transition count 386
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 89 place count 178 transition count 386
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 134 place count 133 transition count 330
Iterating global reduction 2 with 45 rules applied. Total rules applied 179 place count 133 transition count 330
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 179 place count 133 transition count 323
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 193 place count 126 transition count 323
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 212 place count 107 transition count 266
Iterating global reduction 2 with 19 rules applied. Total rules applied 231 place count 107 transition count 266
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 241 place count 107 transition count 256
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 271 place count 92 transition count 241
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 278 place count 85 transition count 220
Iterating global reduction 3 with 7 rules applied. Total rules applied 285 place count 85 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 286 place count 85 transition count 219
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 287 place count 84 transition count 217
Iterating global reduction 4 with 1 rules applied. Total rules applied 288 place count 84 transition count 217
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 294 place count 84 transition count 211
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 300 place count 81 transition count 208
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 303 place count 78 transition count 199
Iterating global reduction 4 with 3 rules applied. Total rules applied 306 place count 78 transition count 199
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 309 place count 78 transition count 196
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 311 place count 76 transition count 194
Applied a total of 311 rules in 46 ms. Remains 76 /248 variables (removed 172) and now considering 194/470 (removed 276) transitions.
[2026-05-25 10:22:19] [INFO ] Flow matrix only has 184 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16544460794926512993.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16629719537480815518.kers'
[2026-05-25 10:22:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16544460794926512993.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16629719537480815518.kers]
Normalized transition count is 183 out of 184 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 183 rows 75 cols 643 entries
Finished phase 1 with 68 SingleSign rule and 0 generalized
[2026-05-25 10:22:19] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16629719537480815518.kers
Total runtime 1 ms.
[2026-05-25 10:22:19] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-25 10:22:19] [INFO ] Flow matrix only has 184 transitions (discarded 10 similar events)
[2026-05-25 10:22:19] [INFO ] Invariant cache hit.
[2026-05-25 10:22:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 10:22:19] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2026-05-25 10:22:19] [INFO ] Redundant transitions in 1 ms returned []
Running 168 sub problems to find dead transitions.
[2026-05-25 10:22:19] [INFO ] Flow matrix only has 184 transitions (discarded 10 similar events)
[2026-05-25 10:22:19] [INFO ] Invariant cache hit.
[2026-05-25 10:22:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 183/256 variables, 73/81 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 3/259 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (OVERLAPS) 0/259 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/260 variables, and 87 constraints, problems are : Problem set: 0 solved, 168 unsolved in 11918 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 76/76 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 183/256 variables, 73/81 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 21/103 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (OVERLAPS) 3/259 variables, 3/108 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 147/255 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (OVERLAPS) 0/259 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 12 (OVERLAPS) 0/259 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/260 variables, and 256 constraints, problems are : Problem set: 0 solved, 168 unsolved in 21763 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 76/76 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 33704ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 33705ms
Starting structural reductions in SI_CTL mode, iteration 1 : 76/248 places, 194/470 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33924 ms. Remains : 76/248 places, 194/470 transitions.
[2026-05-25 10:22:53] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:22:53] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:22:53] [INFO ] Input system was already deterministic with 194 transitions.
[2026-05-25 10:22:53] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:22:53] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:22:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality8867408396991120359.gal : 2 ms
[2026-05-25 10:22:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality9337818554447659575.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/CTLCardinality8867408396991120359.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9337818554447659575.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.88308e+06,1.28309,48716,2,5784,5,159814,6,0,494,184976,0


Converting to forward existential form...Done !
original formula: EG(EF((p195==1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (p195==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t12, t13, t16, t19, t20, t28, t29, t32, t35, t36, t43, t44, t73, t74, t75, t76, t...474
Detected timeout of ITS tools.
[2026-05-25 10:23:23] [INFO ] Flatten gal took : 22 ms
[2026-05-25 10:23:23] [INFO ] Applying decomposition
[2026-05-25 10:23:23] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4335285836825513773.txt' '-o' '/tmp/graph4335285836825513773.bin' '-w' '/tmp/graph4335285836825513773.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4335285836825513773.bin' '-l' '-1' '-v' '-w' '/tmp/graph4335285836825513773.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:23:23] [INFO ] Decomposing Gal with order
[2026-05-25 10:23:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:23:23] [INFO ] Removed a total of 327 redundant transitions.
[2026-05-25 10:23:23] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:23:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 2 ms.
[2026-05-25 10:23:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality13286184483294869701.gal : 1 ms
[2026-05-25 10:23:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality17308830621973604460.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/CTLCardinality13286184483294869701.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17308830621973604460.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.88308e+06,0.09205,7440,224,42,6417,210,348,10700,73,437,0


Converting to forward existential form...Done !
original formula: EG(EF((i3.u8.p195==1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (i3.u8.p195==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t73, t74, t75, t85, t86, t87, t103, t104, t105, t129, t131, t132, t133, t135, t137, t138, t14...441
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,1,6.94381,198404,1,0,307008,3387,1969,807348,364,26709,662345
FORMULA MedleyA-PT-23-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 470/470 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 203 transition count 417
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 203 transition count 417
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 113 place count 180 transition count 382
Iterating global reduction 0 with 23 rules applied. Total rules applied 136 place count 180 transition count 382
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 147 place count 169 transition count 358
Iterating global reduction 0 with 11 rules applied. Total rules applied 158 place count 169 transition count 358
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 161 place count 169 transition count 355
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 170 place count 160 transition count 333
Iterating global reduction 1 with 9 rules applied. Total rules applied 179 place count 160 transition count 333
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 184 place count 160 transition count 328
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 186 place count 158 transition count 323
Iterating global reduction 2 with 2 rules applied. Total rules applied 188 place count 158 transition count 323
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 190 place count 158 transition count 321
Applied a total of 190 rules in 31 ms. Remains 158 /248 variables (removed 90) and now considering 321/470 (removed 149) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5836549488898264180.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4154608104206596004.kers'
[2026-05-25 10:23:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5836549488898264180.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4154608104206596004.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 321 rows 158 cols 1105 entries
Finished phase 1 with 149 SingleSign rule and 0 generalized
[2026-05-25 10:23:30] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4154608104206596004.kers
Total runtime 1 ms.
[2026-05-25 10:23:30] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-25 10:23:30] [INFO ] Invariant cache hit.
[2026-05-25 10:23:31] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Running 320 sub problems to find dead transitions.
[2026-05-25 10:23:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 2/158 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (OVERLAPS) 321/479 variables, 158/167 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/479 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (OVERLAPS) 0/479 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 171 constraints, problems are : Problem set: 0 solved, 320 unsolved in 20448 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 2/158 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 321/479 variables, 158/168 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 320/488 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 3/492 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/479 variables, and 494 constraints, problems are : Problem set: 0 solved, 320 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/3 constraints]
After SMT, in 50507ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 50508ms
Starting structural reductions in LTL mode, iteration 1 : 158/248 places, 321/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50811 ms. Remains : 158/248 places, 321/470 transitions.
[2026-05-25 10:24:21] [INFO ] Flatten gal took : 16 ms
[2026-05-25 10:24:21] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:24:21] [INFO ] Input system was already deterministic with 321 transitions.
[2026-05-25 10:24:21] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:24:21] [INFO ] Flatten gal took : 18 ms
[2026-05-25 10:24:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality16252441983390627243.gal : 2 ms
[2026-05-25 10:24:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality7998060941283367533.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/CTLCardinality16252441983390627243.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7998060941283367533.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.
Detected timeout of ITS tools.
[2026-05-25 10:24:51] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:24:51] [INFO ] Applying decomposition
[2026-05-25 10:24:51] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10355706596789115037.txt' '-o' '/tmp/graph10355706596789115037.bin' '-w' '/tmp/graph10355706596789115037.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10355706596789115037.bin' '-l' '-1' '-v' '-w' '/tmp/graph10355706596789115037.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:24:51] [INFO ] Decomposing Gal with order
[2026-05-25 10:24:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:24:51] [INFO ] Removed a total of 451 redundant transitions.
[2026-05-25 10:24:51] [INFO ] Flatten gal took : 25 ms
[2026-05-25 10:24:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 3 ms.
[2026-05-25 10:24:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality11018821158723951294.gal : 2 ms
[2026-05-25 10:24:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality6385412837736827913.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/CTLCardinality11018821158723951294.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6385412837736827913.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.84251e+09,9.47306,279836,2488,70,517817,629,688,946729,87,1852,0


Converting to forward existential form...Done !
original formula: E(((i3.u17.p127==0)||(i3.u12.p122==1)) U EX(((EX(EG(((i5.u36.p284==0)||(i5.u28.p269==1)))) * !(((i9.u45.p367==0)||(i1.u2.p16==1)))) * (EF...236
=> equivalent forward existential formula: [(FwdU(((EY(FwdU(Init,((i3.u17.p127==0)||(i3.u12.p122==1)))) * (EX(EG(((i5.u36.p284==0)||(i5.u28.p269==1)))) * !...289
Reverse transition relation is NOT exact ! Due to transitions t20, t53, t124, t142, t145, t146, t181, t184, t185, t207, t210, t211, t216, t217, t218, t219,...906
Detected timeout of ITS tools.
[2026-05-25 10:25:21] [INFO ] Flatten gal took : 17 ms
[2026-05-25 10:25:21] [INFO ] Flatten gal took : 20 ms
[2026-05-25 10:25:22] [INFO ] Applying decomposition
[2026-05-25 10:25:22] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9916093639529124890.txt' '-o' '/tmp/graph9916093639529124890.bin' '-w' '/tmp/graph9916093639529124890.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9916093639529124890.bin' '-l' '-1' '-v' '-w' '/tmp/graph9916093639529124890.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:25:22] [INFO ] Decomposing Gal with order
[2026-05-25 10:25:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:25:22] [INFO ] Removed a total of 666 redundant transitions.
[2026-05-25 10:25:22] [INFO ] Flatten gal took : 23 ms
[2026-05-25 10:25:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 3 ms.
[2026-05-25 10:25:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality11383269358843342089.gal : 3 ms
[2026-05-25 10:25:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality2794865485624085768.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/CTLCardinality11383269358843342089.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2794865485624085768.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 6 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.77416e+11,36.299,805052,6375,126,1.19272e+06,2395,1027,2.7801e+06,107,10519,0


Converting to forward existential form...Done !
original formula: EF((AF(AG((i5.u35.p153==0))) * !(E(!(((i10.u86.p377==0)||(i5.u42.p198==1))) U EX(TRUE)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(!(E(TRUE U !((i5.u35.p153==0)))))))) * !(E(!(((i10.u86.p377==0)||(i5.u42.p198==1))) ...178
Reverse transition relation is NOT exact ! Due to transitions t26, t93, t126, t214, t217, t228, t229, t231, t232, t233, t234, t241, t242, t244, t245, t246,...1668
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 15
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 15
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,1,620.5,4821428,1,0,5.85843e+06,12078,3959,1.39075e+07,416,58491,4146036
FORMULA MedleyA-PT-23-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AG(((((i4.u39.p164==1)&&((i3.i1.i2.u26.p122==0)||(i6.u63.p296==1)))||((i9.u78.p354!=0)&&(i7.u58.p274!=1))) + AF(((i6.u56.p270==0)||(i3.i...253
=> equivalent forward existential formula: [FwdG((Init * !(!(E(TRUE U !(((((i4.u39.p164==1)&&((i3.i1.i2.u26.p122==0)||(i6.u63.p296==1)))||((i9.u78.p354!=0)...325
(forward)formula 1,1,944.803,5784916,1,0,7.59417e+06,15268,2914,2.23251e+07,285,93045,7477124
FORMULA MedleyA-PT-23-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EX(EF(EG(((i6.u71.p320==0)||(i9.u81.p351==1))))) * EX(AF((i6.u69.p324==1))))
=> equivalent forward existential formula: [(EY((Init * EX(E(TRUE U EG(((i6.u71.p320==0)||(i9.u81.p351==1))))))) * !(EG(!((i6.u69.p324==1)))))] != FALSE
(forward)formula 2,0,1447.36,8330924,1,0,1.10789e+07,17994,3399,2.71007e+07,304,122812,13383941
FORMULA MedleyA-PT-23-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(A(!(((!((((((i5.u48.p184==1)||(i7.u59.p261==0))||(i6.u71.p327==1))&&(i5.u37.p160==1))&&((i3.i0.i0.u19.p73==0)||(i5.u37.p161==1)))) + A...397
=> equivalent forward existential formula: [FwdG(Init,!((E(!(E(!((E(!((i5.u35.p152==0)) U (!((((i5.u33.p157==0)||(i3.i1.i2.u26.p121==1))&&((i8.u76.p337==0)...950
(forward)formula 3,1,1490.01,8330924,1,0,1.10789e+07,19636,4416,2.71007e+07,415,122812,17345146
FORMULA MedleyA-PT-23-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
Detected timeout of ITS tools.
[2026-05-25 10:52:41] [INFO ] Applying decomposition
[2026-05-25 10:52:41] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:52:41] [INFO ] Decomposing Gal with order
[2026-05-25 10:52:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:52:41] [INFO ] Removed a total of 459 redundant transitions.
[2026-05-25 10:52:41] [INFO ] Flatten gal took : 16 ms
[2026-05-25 10:52:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 284 labels/synchronizations in 4 ms.
[2026-05-25 10:52:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality2013242229832132192.gal : 2 ms
[2026-05-25 10:52:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality12523202861431078235.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/CTLCardinality2013242229832132192.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12523202861431078235.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 2 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.77416e+11,231.903,5531124,5801,9313,7.16121e+06,717546,324,3.50997e+07,564,1.56044e+07,0


Converting to forward existential form...Done !
original formula: AF(AG(EF(EX((i0.i1.u13.p297==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(E(TRUE U EX((i0.i1.u13.p297==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t235, t246, t271, t319, i0.t401, i0.t391, i0.t387, i0.i0.u3.t217, i0.i0.u3.t219, i0.i0.u3.t22...1386

BK_TIME_CONFINEMENT_REACHED

--------------------
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="MedleyA-PT-23"
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 MedleyA-PT-23, 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 r178-oct2-177969020000273"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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