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-177969020000281.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 MedleyB-PT-B01, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020000281
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 6.9K Mar 7 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Mar 7 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 7 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Mar 7 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 11:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K 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 21K Mar 15 11:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 18:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Mar 7 18:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 7 18:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Mar 7 18:23 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 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 231K 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 MedleyB-PT-B01-CTLCardinality-2024-00
FORMULA_NAME MedleyB-PT-B01-CTLCardinality-2024-01
FORMULA_NAME MedleyB-PT-B01-CTLCardinality-2024-02
FORMULA_NAME MedleyB-PT-B01-CTLCardinality-2024-03
FORMULA_NAME MedleyB-PT-B01-CTLCardinality-2024-04
FORMULA_NAME MedleyB-PT-B01-CTLCardinality-2024-05
FORMULA_NAME MedleyB-PT-B01-CTLCardinality-2024-06
FORMULA_NAME MedleyB-PT-B01-CTLCardinality-2024-07
FORMULA_NAME MedleyB-PT-B01-CTLCardinality-2024-08
FORMULA_NAME MedleyB-PT-B01-CTLCardinality-2024-09
FORMULA_NAME MedleyB-PT-B01-CTLCardinality-2024-10
FORMULA_NAME MedleyB-PT-B01-CTLCardinality-2024-11
FORMULA_NAME MedleyB-PT-B01-CTLCardinality-2024-12
FORMULA_NAME MedleyB-PT-B01-CTLCardinality-2024-13
FORMULA_NAME MedleyB-PT-B01-CTLCardinality-2024-14
FORMULA_NAME MedleyB-PT-B01-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779704312793

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-25 10:18:34] [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:18:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 10:18:34] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2026-05-25 10:18:34] [INFO ] Transformed 925 places.
[2026-05-25 10:18:34] [INFO ] Transformed 1037 transitions.
[2026-05-25 10:18:34] [INFO ] Found NUPN structural information;
[2026-05-25 10:18:34] [INFO ] Parsed PT model containing 925 places and 1037 transitions and 2433 arcs in 296 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Support contains 110 out of 925 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 925/925 places, 1037/1037 transitions.
Discarding 66 places :
Symmetric choice reduction at 0 with 66 rule applications. Total rules 66 place count 859 transition count 971
Iterating global reduction 0 with 66 rules applied. Total rules applied 132 place count 859 transition count 971
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 169 place count 822 transition count 934
Iterating global reduction 0 with 37 rules applied. Total rules applied 206 place count 822 transition count 934
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 227 place count 801 transition count 913
Iterating global reduction 0 with 21 rules applied. Total rules applied 248 place count 801 transition count 913
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 264 place count 785 transition count 897
Iterating global reduction 0 with 16 rules applied. Total rules applied 280 place count 785 transition count 897
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 289 place count 776 transition count 888
Iterating global reduction 0 with 9 rules applied. Total rules applied 298 place count 776 transition count 888
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 305 place count 769 transition count 881
Iterating global reduction 0 with 7 rules applied. Total rules applied 312 place count 769 transition count 881
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 318 place count 763 transition count 875
Iterating global reduction 0 with 6 rules applied. Total rules applied 324 place count 763 transition count 875
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 330 place count 757 transition count 869
Iterating global reduction 0 with 6 rules applied. Total rules applied 336 place count 757 transition count 869
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 342 place count 751 transition count 863
Iterating global reduction 0 with 6 rules applied. Total rules applied 348 place count 751 transition count 863
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 353 place count 746 transition count 858
Iterating global reduction 0 with 5 rules applied. Total rules applied 358 place count 746 transition count 858
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 359 place count 745 transition count 857
Iterating global reduction 0 with 1 rules applied. Total rules applied 360 place count 745 transition count 857
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 361 place count 744 transition count 856
Iterating global reduction 0 with 1 rules applied. Total rules applied 362 place count 744 transition count 856
Applied a total of 362 rules in 571 ms. Remains 744 /925 variables (removed 181) and now considering 856/1037 (removed 181) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-172114566955303331.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6748894057774782042.kers'
[2026-05-25 10:18:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-172114566955303331.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6748894057774782042.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 856 rows 744 cols 2069 entries
Finished phase 1 with 740 SingleSign rule and 0 generalized
[2026-05-25 10:18:35] [INFO ] Computed 4 invariants in 3 ms
Computed 4 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-6748894057774782042.kers
Total runtime 6 ms.
[2026-05-25 10:18:36] [INFO ] Implicit Places using invariants in 824 ms returned []
[2026-05-25 10:18:36] [INFO ] Invariant cache hit.
[2026-05-25 10:18:37] [INFO ] Implicit Places using invariants and state equation in 919 ms returned []
Implicit Place search using SMT with State Equation took 1777 ms to find 0 implicit places.
Running 855 sub problems to find dead transitions.
[2026-05-25 10:18:37] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/743 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 855 unsolved
SMT process timed out in 30292ms, After SMT, problems are : Problem set: 0 solved, 855 unsolved
Search for dead transitions found 0 dead transitions in 30306ms
Starting structural reductions in LTL mode, iteration 1 : 744/925 places, 856/1037 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32749 ms. Remains : 744/925 places, 856/1037 transitions.
Starting structural reductions in LTL mode, iteration 0 : 744/744 places, 856/856 transitions.
Applied a total of 0 rules in 12 ms. Remains 744 /744 variables (removed 0) and now considering 856/856 (removed 0) transitions.
[2026-05-25 10:19:07] [INFO ] Invariant cache hit.
[2026-05-25 10:19:08] [INFO ] Implicit Places using invariants in 420 ms returned []
[2026-05-25 10:19:08] [INFO ] Invariant cache hit.
[2026-05-25 10:19:08] [INFO ] Implicit Places using invariants and state equation in 905 ms returned []
Implicit Place search using SMT with State Equation took 1347 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1359 ms. Remains : 744/744 places, 856/856 transitions.
Support contains 110 out of 744 places after structural reductions.
[2026-05-25 10:19:09] [INFO ] Flatten gal took : 84 ms
[2026-05-25 10:19:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyB-PT-B01-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 10:19:09] [INFO ] Flatten gal took : 33 ms
[2026-05-25 10:19:09] [INFO ] Input system was already deterministic with 856 transitions.
Support contains 109 out of 744 places (down from 110) after GAL structural reductions.
RANDOM walk for 40000 steps (655 resets) in 2133 ms. (18 steps per ms) remains 32/61 properties
BEST_FIRST walk for 4003 steps (16 resets) in 36 ms. (108 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (16 resets) in 60 ms. (65 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (16 resets) in 49 ms. (80 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (15 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (16 resets) in 25 ms. (153 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (13 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (15 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (15 resets) in 24 ms. (160 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (14 resets) in 25 ms. (154 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (15 resets) in 24 ms. (160 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (15 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (16 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (16 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (16 resets) in 54 ms. (72 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (14 resets) in 27 ms. (142 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (16 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (15 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (16 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (14 resets) in 39 ms. (100 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (16 resets) in 35 ms. (111 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (16 resets) in 24 ms. (160 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (13 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (15 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (16 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (13 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (15 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (13 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (15 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (14 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (15 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (15 resets) in 24 ms. (160 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (14 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
[2026-05-25 10:19:10] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 677/744 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/744 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 856/1600 variables, 744/748 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1600 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 0/1600 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1600/1600 variables, and 748 constraints, problems are : Problem set: 0 solved, 32 unsolved in 4159 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 744/744 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 1 (OVERLAPS) 677/744 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 29 unsolved
Problem AtomicPropp28 is UNSAT
SMT process timed out in 9457ms, After SMT, problems are : Problem set: 4 solved, 28 unsolved
Fused 28 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 52 out of 744 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 744/744 places, 856/856 transitions.
Graph (trivial) has 647 edges and 744 vertex of which 40 / 744 are part of one of the 7 SCC in 9 ms
Free SCC test removed 33 places
Drop transitions (Empty/Sink Transition effects.) removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Graph (complete) has 1011 edges and 711 vertex of which 709 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 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 441 transitions
Trivial Post-agglo rules discarded 441 transitions
Performed 441 trivial Post agglomeration. Transition count delta: 441
Iterating post reduction 0 with 442 rules applied. Total rules applied 444 place count 709 transition count 369
Reduce places removed 441 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 450 rules applied. Total rules applied 894 place count 268 transition count 360
Reduce places removed 4 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 2 with 28 rules applied. Total rules applied 922 place count 264 transition count 336
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 946 place count 240 transition count 336
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 36 Pre rules applied. Total rules applied 946 place count 240 transition count 300
Deduced a syphon composed of 36 places in 6 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 1018 place count 204 transition count 300
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1022 place count 200 transition count 296
Iterating global reduction 4 with 4 rules applied. Total rules applied 1026 place count 200 transition count 296
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 1074 place count 176 transition count 272
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 1079 place count 176 transition count 267
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1089 place count 166 transition count 228
Iterating global reduction 5 with 10 rules applied. Total rules applied 1099 place count 166 transition count 228
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1101 place count 166 transition count 226
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1102 place count 165 transition count 224
Iterating global reduction 6 with 1 rules applied. Total rules applied 1103 place count 165 transition count 224
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 1109 place count 162 transition count 221
Performed 5 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 1119 place count 157 transition count 229
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1120 place count 157 transition count 228
Free-agglomeration rule applied 33 times.
Iterating global reduction 6 with 33 rules applied. Total rules applied 1153 place count 157 transition count 195
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 6 with 33 rules applied. Total rules applied 1186 place count 124 transition count 195
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 1196 place count 124 transition count 185
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1197 place count 124 transition count 185
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1198 place count 124 transition count 184
Applied a total of 1198 rules in 180 ms. Remains 124 /744 variables (removed 620) and now considering 184/856 (removed 672) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 124/744 places, 184/856 transitions.
RANDOM walk for 40000 steps (4073 resets) in 557 ms. (71 steps per ms) remains 13/28 properties
BEST_FIRST walk for 40003 steps (842 resets) in 96 ms. (412 steps per ms) remains 10/13 properties
BEST_FIRST walk for 40002 steps (690 resets) in 209 ms. (190 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (855 resets) in 62 ms. (634 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40003 steps (867 resets) in 83 ms. (476 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (871 resets) in 50 ms. (784 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (859 resets) in 85 ms. (465 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (899 resets) in 82 ms. (481 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (854 resets) in 57 ms. (689 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (297 resets) in 81 ms. (487 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40002 steps (887 resets) in 24 ms. (1600 steps per ms) remains 6/6 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2662658840617647986.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3759226029033951210.kers'
[2026-05-25 10:19:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2662658840617647986.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3759226029033951210.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 184 rows 124 cols 472 entries
Finished phase 1 with 121 SingleSign rule and 0 generalized
[2026-05-25 10:19:20] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3759226029033951210.kers
Total runtime 1 ms.
[2026-05-25 10:19:20] [INFO ] State equation strengthened by 58 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/87 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 144/231 variables, 87/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 39/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 38/269 variables, 13/142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 14/156 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 27/296 variables, 16/172 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/296 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 9/305 variables, 6/182 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/305 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 3/308 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/308 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/308 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/308 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 185 constraints, problems are : Problem set: 0 solved, 6 unsolved in 672 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 124/124 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/87 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 144/231 variables, 87/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 39/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 38/269 variables, 13/146 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 14/160 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 3/163 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 27/296 variables, 16/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/296 variables, 4/183 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/296 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 9/305 variables, 6/189 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/305 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 3/308 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/308 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/308 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/308 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 192 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1480 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 124/124 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2175ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Finished Parikh walk after 46 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=46 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 10 ms.
Successfully simplified 4 atomic propositions for a total of 15 simplifications.
FORMULA MedleyB-PT-B01-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 10:19:22] [INFO ] Flatten gal took : 25 ms
[2026-05-25 10:19:22] [INFO ] Flatten gal took : 24 ms
[2026-05-25 10:19:22] [INFO ] Input system was already deterministic with 856 transitions.
Computed a total of 134 stabilizing places and 140 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 744/744 places, 856/856 transitions.
Graph (trivial) has 735 edges and 744 vertex of which 51 / 744 are part of one of the 9 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 525 transitions
Trivial Post-agglo rules discarded 525 transitions
Performed 525 trivial Post agglomeration. Transition count delta: 525
Iterating post reduction 0 with 525 rules applied. Total rules applied 526 place count 701 transition count 282
Reduce places removed 525 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 535 rules applied. Total rules applied 1061 place count 176 transition count 272
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 1067 place count 172 transition count 270
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1069 place count 170 transition count 270
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 34 Pre rules applied. Total rules applied 1069 place count 170 transition count 236
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 1137 place count 136 transition count 236
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 1154 place count 119 transition count 219
Iterating global reduction 4 with 17 rules applied. Total rules applied 1171 place count 119 transition count 219
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1171 place count 119 transition count 218
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1173 place count 118 transition count 218
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1177 place count 114 transition count 214
Iterating global reduction 4 with 4 rules applied. Total rules applied 1181 place count 114 transition count 214
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1185 place count 110 transition count 210
Iterating global reduction 4 with 4 rules applied. Total rules applied 1189 place count 110 transition count 210
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1193 place count 106 transition count 206
Iterating global reduction 4 with 4 rules applied. Total rules applied 1197 place count 106 transition count 206
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1199 place count 106 transition count 204
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 5 with 34 rules applied. Total rules applied 1233 place count 89 transition count 187
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1236 place count 89 transition count 184
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 1255 place count 70 transition count 130
Iterating global reduction 6 with 19 rules applied. Total rules applied 1274 place count 70 transition count 130
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1282 place count 70 transition count 122
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1290 place count 62 transition count 111
Iterating global reduction 7 with 8 rules applied. Total rules applied 1298 place count 62 transition count 111
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 1305 place count 55 transition count 101
Iterating global reduction 7 with 7 rules applied. Total rules applied 1312 place count 55 transition count 101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1315 place count 55 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1317 place count 54 transition count 97
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1318 place count 53 transition count 94
Iterating global reduction 8 with 1 rules applied. Total rules applied 1319 place count 53 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1320 place count 53 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 1323 place count 53 transition count 90
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 1329 place count 50 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1330 place count 49 transition count 86
Applied a total of 1330 rules in 61 ms. Remains 49 /744 variables (removed 695) and now considering 86/856 (removed 770) transitions.
[2026-05-25 10:19:22] [INFO ] Flow matrix only has 82 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16116052311114464229.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1470893813232642001.kers'
[2026-05-25 10:19:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16116052311114464229.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1470893813232642001.kers]
Normalized transition count is 81 out of 82 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 81 rows 48 cols 238 entries
Finished phase 1 with 47 SingleSign rule and 0 generalized
[2026-05-25 10:19:22] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1470893813232642001.kers
Total runtime 1 ms.
[2026-05-25 10:19:23] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-25 10:19:23] [INFO ] Flow matrix only has 82 transitions (discarded 4 similar events)
[2026-05-25 10:19:23] [INFO ] Invariant cache hit.
[2026-05-25 10:19:23] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-25 10:19:23] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2026-05-25 10:19:23] [INFO ] Redundant transitions in 1 ms returned []
Running 79 sub problems to find dead transitions.
[2026-05-25 10:19:23] [INFO ] Flow matrix only has 82 transitions (discarded 4 similar events)
[2026-05-25 10:19:23] [INFO ] Invariant cache hit.
[2026-05-25 10:19:23] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 3/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 81/130 variables, 49/62 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 1/131 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (OVERLAPS) 0/131 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 69 constraints, problems are : Problem set: 0 solved, 79 unsolved in 5137 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 3/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 81/130 variables, 49/62 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 79/147 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 1/131 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (OVERLAPS) 0/131 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 148 constraints, problems are : Problem set: 0 solved, 79 unsolved in 5029 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10190ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 10190ms
Starting structural reductions in SI_CTL mode, iteration 1 : 49/744 places, 86/856 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10444 ms. Remains : 49/744 places, 86/856 transitions.
[2026-05-25 10:19:33] [INFO ] Flatten gal took : 10 ms
[2026-05-25 10:19:33] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:19:33] [INFO ] Input system was already deterministic with 86 transitions.
[2026-05-25 10:19:33] [INFO ] Flatten gal took : 9 ms
[2026-05-25 10:19:33] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:19:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality16370060845316302652.gal : 4 ms
[2026-05-25 10:19:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality4211682885588548679.ctl : 8 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/CTLCardinality16370060845316302652.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4211682885588548679.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,5838,0.0808,5328,2,794,5,5385,6,0,276,5702,0


Converting to forward existential form...Done !
original formula: AG(AF(((p230==0)||(p456==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((p230==0)||(p456==1))))] = FALSE
Hit Full ! (commute/partial/dont) 82/4/4
(forward)formula 0,0,0.195557,10000,1,0,21,28253,20,2,1495,23174,20
FORMULA MedleyB-PT-B01-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 744/744 places, 856/856 transitions.
Graph (trivial) has 726 edges and 744 vertex of which 48 / 744 are part of one of the 9 SCC in 3 ms
Free SCC test removed 39 places
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 517 transitions
Trivial Post-agglo rules discarded 517 transitions
Performed 517 trivial Post agglomeration. Transition count delta: 517
Iterating post reduction 0 with 517 rules applied. Total rules applied 518 place count 704 transition count 294
Reduce places removed 517 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 526 rules applied. Total rules applied 1044 place count 187 transition count 285
Reduce places removed 4 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 8 rules applied. Total rules applied 1052 place count 183 transition count 281
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1056 place count 179 transition count 281
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 37 Pre rules applied. Total rules applied 1056 place count 179 transition count 244
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 1130 place count 142 transition count 244
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1146 place count 126 transition count 228
Iterating global reduction 4 with 16 rules applied. Total rules applied 1162 place count 126 transition count 228
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1162 place count 126 transition count 227
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1164 place count 125 transition count 227
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1167 place count 122 transition count 224
Iterating global reduction 4 with 3 rules applied. Total rules applied 1170 place count 122 transition count 224
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1173 place count 119 transition count 221
Iterating global reduction 4 with 3 rules applied. Total rules applied 1176 place count 119 transition count 221
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1179 place count 116 transition count 218
Iterating global reduction 4 with 3 rules applied. Total rules applied 1182 place count 116 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1183 place count 116 transition count 217
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 5 with 32 rules applied. Total rules applied 1215 place count 100 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1218 place count 100 transition count 198
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1235 place count 83 transition count 147
Iterating global reduction 6 with 17 rules applied. Total rules applied 1252 place count 83 transition count 147
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1259 place count 83 transition count 140
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 1266 place count 76 transition count 131
Iterating global reduction 7 with 7 rules applied. Total rules applied 1273 place count 76 transition count 131
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 1280 place count 69 transition count 122
Iterating global reduction 7 with 7 rules applied. Total rules applied 1287 place count 69 transition count 122
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1291 place count 69 transition count 118
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1293 place count 68 transition count 117
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1294 place count 67 transition count 113
Iterating global reduction 8 with 1 rules applied. Total rules applied 1295 place count 67 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1296 place count 67 transition count 112
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1300 place count 67 transition count 108
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 1308 place count 63 transition count 104
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 1311 place count 63 transition count 104
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1312 place count 62 transition count 103
Applied a total of 1312 rules in 94 ms. Remains 62 /744 variables (removed 682) and now considering 103/856 (removed 753) transitions.
[2026-05-25 10:19:33] [INFO ] Flow matrix only has 98 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17394758514518216170.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7862713300989428114.kers'
[2026-05-25 10:19:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17394758514518216170.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7862713300989428114.kers]
Normalized transition count is 97 out of 98 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 97 rows 61 cols 271 entries
Finished phase 1 with 60 SingleSign rule and 0 generalized
[2026-05-25 10:19:33] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7862713300989428114.kers
Total runtime 2 ms.
[2026-05-25 10:19:33] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-25 10:19:33] [INFO ] Flow matrix only has 98 transitions (discarded 5 similar events)
[2026-05-25 10:19:33] [INFO ] Invariant cache hit.
[2026-05-25 10:19:33] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-25 10:19:33] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2026-05-25 10:19:33] [INFO ] Redundant transitions in 1 ms returned []
Running 95 sub problems to find dead transitions.
[2026-05-25 10:19:33] [INFO ] Flow matrix only has 98 transitions (discarded 5 similar events)
[2026-05-25 10:19:33] [INFO ] Invariant cache hit.
[2026-05-25 10:19:33] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 3/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 97/159 variables, 62/76 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 6/82 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 1/160 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/160 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 12 (OVERLAPS) 0/160 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 83 constraints, problems are : Problem set: 0 solved, 95 unsolved in 8451 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 3/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 97/159 variables, 62/77 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 95/178 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 1/160 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/160 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/160 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 13 (OVERLAPS) 0/160 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/160 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 15 (OVERLAPS) 0/160 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 181 constraints, problems are : Problem set: 0 solved, 95 unsolved in 12553 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21030ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 21030ms
Starting structural reductions in SI_CTL mode, iteration 1 : 62/744 places, 103/856 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21274 ms. Remains : 62/744 places, 103/856 transitions.
[2026-05-25 10:19:54] [INFO ] Flatten gal took : 3 ms
[2026-05-25 10:19:54] [INFO ] Flatten gal took : 3 ms
[2026-05-25 10:19:54] [INFO ] Input system was already deterministic with 103 transitions.
[2026-05-25 10:19:55] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:19:55] [INFO ] Flatten gal took : 3 ms
[2026-05-25 10:19:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality1779411710249959031.gal : 2 ms
[2026-05-25 10:19:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality10792411733220971916.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/CTLCardinality1779411710249959031.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10792411733220971916.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,8950,0.043416,5756,2,1043,5,6894,6,0,344,7061,0


Converting to forward existential form...Done !
original formula: E(AG((p169==1)) U (EF(AG(((EG((p573==1)) * ((p412==0)||(p450==1))) * (p363==0)))) + (p315==1)))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,!(E(TRUE U !((p169==1))))),TRUE) * !(E(TRUE U !(((EG((p573==1)) * ((p412==0)||(p450==1))) * (p...242
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t4, t6, t7, t9, t17, t39, t50, t51, t72, t73, t74, t75, t76, t77, t78, t79, t80, ...297
(forward)formula 0,0,0.377949,20932,1,0,269,83466,236,115,2410,73227,313
FORMULA MedleyB-PT-B01-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 744/744 places, 856/856 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 722 transition count 834
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 722 transition count 834
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 59 place count 707 transition count 819
Iterating global reduction 0 with 15 rules applied. Total rules applied 74 place count 707 transition count 819
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 87 place count 694 transition count 806
Iterating global reduction 0 with 13 rules applied. Total rules applied 100 place count 694 transition count 806
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 111 place count 683 transition count 795
Iterating global reduction 0 with 11 rules applied. Total rules applied 122 place count 683 transition count 795
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 123 place count 683 transition count 794
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 133 place count 673 transition count 784
Iterating global reduction 1 with 10 rules applied. Total rules applied 143 place count 673 transition count 784
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 144 place count 673 transition count 783
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 151 place count 666 transition count 776
Iterating global reduction 2 with 7 rules applied. Total rules applied 158 place count 666 transition count 776
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 165 place count 659 transition count 769
Iterating global reduction 2 with 7 rules applied. Total rules applied 172 place count 659 transition count 769
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 178 place count 653 transition count 763
Iterating global reduction 2 with 6 rules applied. Total rules applied 184 place count 653 transition count 763
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 190 place count 647 transition count 757
Iterating global reduction 2 with 6 rules applied. Total rules applied 196 place count 647 transition count 757
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 200 place count 643 transition count 753
Iterating global reduction 2 with 4 rules applied. Total rules applied 204 place count 643 transition count 753
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 207 place count 640 transition count 750
Iterating global reduction 2 with 3 rules applied. Total rules applied 210 place count 640 transition count 750
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 213 place count 637 transition count 747
Iterating global reduction 2 with 3 rules applied. Total rules applied 216 place count 637 transition count 747
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 219 place count 634 transition count 744
Iterating global reduction 2 with 3 rules applied. Total rules applied 222 place count 634 transition count 744
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 225 place count 631 transition count 741
Iterating global reduction 2 with 3 rules applied. Total rules applied 228 place count 631 transition count 741
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 231 place count 628 transition count 738
Iterating global reduction 2 with 3 rules applied. Total rules applied 234 place count 628 transition count 738
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 237 place count 625 transition count 735
Iterating global reduction 2 with 3 rules applied. Total rules applied 240 place count 625 transition count 735
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 243 place count 622 transition count 732
Iterating global reduction 2 with 3 rules applied. Total rules applied 246 place count 622 transition count 732
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 249 place count 619 transition count 729
Iterating global reduction 2 with 3 rules applied. Total rules applied 252 place count 619 transition count 729
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 254 place count 619 transition count 727
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 255 place count 618 transition count 726
Iterating global reduction 3 with 1 rules applied. Total rules applied 256 place count 618 transition count 726
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 257 place count 617 transition count 725
Iterating global reduction 3 with 1 rules applied. Total rules applied 258 place count 617 transition count 725
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 259 place count 616 transition count 724
Iterating global reduction 3 with 1 rules applied. Total rules applied 260 place count 616 transition count 724
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 261 place count 616 transition count 723
Applied a total of 261 rules in 346 ms. Remains 616 /744 variables (removed 128) and now considering 723/856 (removed 133) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6851222959221855460.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17296079822967766840.kers'
[2026-05-25 10:19:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6851222959221855460.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17296079822967766840.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 723 rows 616 cols 1781 entries
Finished phase 1 with 612 SingleSign rule and 0 generalized
[2026-05-25 10:19:55] [INFO ] Computed 4 invariants in 8 ms
Computed 4 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-17296079822967766840.kers
Total runtime 9 ms.
[2026-05-25 10:19:56] [INFO ] Implicit Places using invariants in 461 ms returned []
[2026-05-25 10:19:56] [INFO ] Invariant cache hit.
[2026-05-25 10:19:56] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 1041 ms to find 0 implicit places.
Running 722 sub problems to find dead transitions.
[2026-05-25 10:19:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (OVERLAPS) 1/616 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 722 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 616/1339 variables, and 10 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/616 constraints, PredecessorRefiner: 722/722 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 722 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (OVERLAPS) 1/616 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/616 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 722 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 616/1339 variables, and 17 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/616 constraints, PredecessorRefiner: 0/722 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60181ms problems are : Problem set: 0 solved, 722 unsolved
Search for dead transitions found 0 dead transitions in 60185ms
Starting structural reductions in LTL mode, iteration 1 : 616/744 places, 723/856 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61576 ms. Remains : 616/744 places, 723/856 transitions.
[2026-05-25 10:20:57] [INFO ] Flatten gal took : 21 ms
[2026-05-25 10:20:57] [INFO ] Flatten gal took : 14 ms
[2026-05-25 10:20:57] [INFO ] Input system was already deterministic with 723 transitions.
[2026-05-25 10:20:57] [INFO ] Flatten gal took : 15 ms
[2026-05-25 10:20:57] [INFO ] Flatten gal took : 15 ms
[2026-05-25 10:20:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality16797932135775347675.gal : 9 ms
[2026-05-25 10:20:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality11901821541870280387.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/CTLCardinality16797932135775347675.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11901821541870280387.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,7.06352e+07,4.79416,116024,2,13130,5,368555,6,0,3189,519056,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 10:21:27] [INFO ] Flatten gal took : 13 ms
[2026-05-25 10:21:27] [INFO ] Applying decomposition
[2026-05-25 10:21:27] [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/graph1362765873437356364.txt' '-o' '/tmp/graph1362765873437356364.bin' '-w' '/tmp/graph1362765873437356364.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1362765873437356364.bin' '-l' '-1' '-v' '-w' '/tmp/graph1362765873437356364.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:21:27] [INFO ] Decomposing Gal with order
[2026-05-25 10:21:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:21:27] [INFO ] Removed a total of 376 redundant transitions.
[2026-05-25 10:21:27] [INFO ] Flatten gal took : 76 ms
[2026-05-25 10:21:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 12 ms.
[2026-05-25 10:21:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality2575377396287687447.gal : 7 ms
[2026-05-25 10:21:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality13752745346125228033.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/CTLCardinality2575377396287687447.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13752745346125228033.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,7.06352e+07,3.2595,114848,1284,27,224248,628,958,484300,78,1428,0


Converting to forward existential form...Done !
original formula: E((EG(AF(!(((i13.i1.i1.u100.p368==0)||(i17.u200.p740==1))))) * ((AX(((i27.u215.p844==0)||(i20.u146.p595==1))) + (i6.u48.p144==0)) + (i23....259
=> equivalent forward existential formula: [((FwdU(Init,(EG(!(EG(!(!(((i13.i1.i1.u100.p368==0)||(i17.u200.p740==1))))))) * ((!(EX(!(((i27.u215.p844==0)||(i...323
Reverse transition relation is NOT exact ! Due to transitions t70, t162, t164, t220, t254, t335, t336, t389, t392, t425, t457, t511, t512, t565, t568, t585...495
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 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 a local SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
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 an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
(forward)formula 0,0,24.8123,685812,1,0,953787,700,8027,4.84827e+06,390,2883,2038327
FORMULA MedleyB-PT-B01-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 744/744 places, 856/856 transitions.
Graph (trivial) has 734 edges and 744 vertex of which 51 / 744 are part of one of the 9 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 523 transitions
Trivial Post-agglo rules discarded 523 transitions
Performed 523 trivial Post agglomeration. Transition count delta: 523
Iterating post reduction 0 with 523 rules applied. Total rules applied 524 place count 701 transition count 284
Reduce places removed 523 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 533 rules applied. Total rules applied 1057 place count 178 transition count 274
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 1063 place count 174 transition count 272
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1065 place count 172 transition count 272
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 1065 place count 172 transition count 237
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 1135 place count 137 transition count 237
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 1152 place count 120 transition count 220
Iterating global reduction 4 with 17 rules applied. Total rules applied 1169 place count 120 transition count 220
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1169 place count 120 transition count 219
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1171 place count 119 transition count 219
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1175 place count 115 transition count 215
Iterating global reduction 4 with 4 rules applied. Total rules applied 1179 place count 115 transition count 215
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1183 place count 111 transition count 211
Iterating global reduction 4 with 4 rules applied. Total rules applied 1187 place count 111 transition count 211
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1191 place count 107 transition count 207
Iterating global reduction 4 with 4 rules applied. Total rules applied 1195 place count 107 transition count 207
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1197 place count 107 transition count 205
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 1231 place count 90 transition count 188
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1234 place count 90 transition count 185
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 1253 place count 71 transition count 131
Iterating global reduction 6 with 19 rules applied. Total rules applied 1272 place count 71 transition count 131
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1280 place count 71 transition count 123
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1288 place count 63 transition count 112
Iterating global reduction 7 with 8 rules applied. Total rules applied 1296 place count 63 transition count 112
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1304 place count 55 transition count 101
Iterating global reduction 7 with 8 rules applied. Total rules applied 1312 place count 55 transition count 101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1315 place count 55 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1317 place count 54 transition count 97
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1318 place count 53 transition count 94
Iterating global reduction 8 with 1 rules applied. Total rules applied 1319 place count 53 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1320 place count 53 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 1323 place count 53 transition count 90
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 1329 place count 50 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1330 place count 49 transition count 86
Applied a total of 1330 rules in 40 ms. Remains 49 /744 variables (removed 695) and now considering 86/856 (removed 770) transitions.
[2026-05-25 10:21:52] [INFO ] Flow matrix only has 82 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8911081846251434353.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13567587206651985710.kers'
[2026-05-25 10:21:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8911081846251434353.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13567587206651985710.kers]
Normalized transition count is 81 out of 82 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 81 rows 48 cols 238 entries
Finished phase 1 with 47 SingleSign rule and 0 generalized
[2026-05-25 10:21:52] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13567587206651985710.kers
Total runtime 0 ms.
[2026-05-25 10:21:52] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-25 10:21:52] [INFO ] Flow matrix only has 82 transitions (discarded 4 similar events)
[2026-05-25 10:21:52] [INFO ] Invariant cache hit.
[2026-05-25 10:21:52] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-25 10:21:52] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2026-05-25 10:21:52] [INFO ] Redundant transitions in 0 ms returned []
Running 79 sub problems to find dead transitions.
[2026-05-25 10:21:52] [INFO ] Flow matrix only has 82 transitions (discarded 4 similar events)
[2026-05-25 10:21:52] [INFO ] Invariant cache hit.
[2026-05-25 10:21:52] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 3/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 81/130 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 1/131 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (OVERLAPS) 0/131 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 67 constraints, problems are : Problem set: 0 solved, 79 unsolved in 4504 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 3/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 81/130 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 79/145 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 1/131 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/131 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 12 (OVERLAPS) 0/131 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 147 constraints, problems are : Problem set: 0 solved, 79 unsolved in 4867 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9389ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 9389ms
Starting structural reductions in SI_CTL mode, iteration 1 : 49/744 places, 86/856 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9585 ms. Remains : 49/744 places, 86/856 transitions.
[2026-05-25 10:22:02] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:22:02] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:22:02] [INFO ] Input system was already deterministic with 86 transitions.
[2026-05-25 10:22:02] [INFO ] Flatten gal took : 2 ms
[2026-05-25 10:22:02] [INFO ] Flatten gal took : 2 ms
[2026-05-25 10:22:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality10137749479895565365.gal : 0 ms
[2026-05-25 10:22:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality13736263369533931388.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/CTLCardinality10137749479895565365.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13736263369533931388.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,5930,0.08216,5224,2,690,5,4750,6,0,276,5064,0


Converting to forward existential form...Done !
original formula: EG(((p236==0)||(p133==1)))
=> equivalent forward existential formula: [FwdG(Init,((p236==0)||(p133==1)))] != FALSE
Hit Full ! (commute/partial/dont) 82/0/4
(forward)formula 0,1,0.205537,10548,1,0,23,26963,19,4,1471,28723,22
FORMULA MedleyB-PT-B01-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 744/744 places, 856/856 transitions.
Graph (trivial) has 719 edges and 744 vertex of which 51 / 744 are part of one of the 9 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 507 transitions
Trivial Post-agglo rules discarded 507 transitions
Performed 507 trivial Post agglomeration. Transition count delta: 507
Iterating post reduction 0 with 507 rules applied. Total rules applied 508 place count 701 transition count 300
Reduce places removed 507 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 517 rules applied. Total rules applied 1025 place count 194 transition count 290
Reduce places removed 4 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 10 rules applied. Total rules applied 1035 place count 190 transition count 284
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 1041 place count 184 transition count 284
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 1041 place count 184 transition count 249
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 1111 place count 149 transition count 249
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1127 place count 133 transition count 233
Iterating global reduction 4 with 16 rules applied. Total rules applied 1143 place count 133 transition count 233
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1143 place count 133 transition count 232
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1145 place count 132 transition count 232
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1149 place count 128 transition count 228
Iterating global reduction 4 with 4 rules applied. Total rules applied 1153 place count 128 transition count 228
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1157 place count 124 transition count 224
Iterating global reduction 4 with 4 rules applied. Total rules applied 1161 place count 124 transition count 224
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1165 place count 120 transition count 220
Iterating global reduction 4 with 4 rules applied. Total rules applied 1169 place count 120 transition count 220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1171 place count 120 transition count 218
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 5 with 34 rules applied. Total rules applied 1205 place count 103 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1208 place count 103 transition count 198
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 1226 place count 85 transition count 145
Iterating global reduction 6 with 18 rules applied. Total rules applied 1244 place count 85 transition count 145
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1251 place count 85 transition count 138
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1256 place count 80 transition count 131
Iterating global reduction 7 with 5 rules applied. Total rules applied 1261 place count 80 transition count 131
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1266 place count 75 transition count 124
Iterating global reduction 7 with 5 rules applied. Total rules applied 1271 place count 75 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1273 place count 75 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1275 place count 74 transition count 121
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1279 place count 74 transition count 117
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 8 with 6 rules applied. Total rules applied 1285 place count 71 transition count 114
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1286 place count 70 transition count 113
Applied a total of 1286 rules in 34 ms. Remains 70 /744 variables (removed 674) and now considering 113/856 (removed 743) transitions.
[2026-05-25 10:22:02] [INFO ] Flow matrix only has 109 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15786602568530157476.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3505819648390242884.kers'
[2026-05-25 10:22:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15786602568530157476.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3505819648390242884.kers]
Normalized transition count is 108 out of 109 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 108 rows 70 cols 306 entries
Finished phase 1 with 68 SingleSign rule and 0 generalized
[2026-05-25 10:22:02] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3505819648390242884.kers
Total runtime 3 ms.
[2026-05-25 10:22:02] [INFO ] Implicit Places using invariants in 102 ms returned []
[2026-05-25 10:22:02] [INFO ] Flow matrix only has 109 transitions (discarded 4 similar events)
[2026-05-25 10:22:02] [INFO ] Invariant cache hit.
[2026-05-25 10:22:02] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-25 10:22:02] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2026-05-25 10:22:02] [INFO ] Redundant transitions in 1 ms returned []
Running 104 sub problems to find dead transitions.
[2026-05-25 10:22:02] [INFO ] Flow matrix only has 109 transitions (discarded 4 similar events)
[2026-05-25 10:22:02] [INFO ] Invariant cache hit.
[2026-05-25 10:22:02] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 3/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 108/178 variables, 70/81 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 6/87 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 1/179 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 12 (OVERLAPS) 0/179 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 89 constraints, problems are : Problem set: 0 solved, 104 unsolved in 8958 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 3/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 108/178 variables, 70/82 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 6/88 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 104/192 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 1/179 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 11 (OVERLAPS) 0/179 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 193 constraints, problems are : Problem set: 0 solved, 104 unsolved in 6862 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15852ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 15852ms
Starting structural reductions in SI_CTL mode, iteration 1 : 70/744 places, 113/856 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16091 ms. Remains : 70/744 places, 113/856 transitions.
[2026-05-25 10:22:18] [INFO ] Flatten gal took : 3 ms
[2026-05-25 10:22:18] [INFO ] Flatten gal took : 2 ms
[2026-05-25 10:22:18] [INFO ] Input system was already deterministic with 113 transitions.
[2026-05-25 10:22:18] [INFO ] Flatten gal took : 1 ms
[2026-05-25 10:22:18] [INFO ] Flatten gal took : 2 ms
[2026-05-25 10:22:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality10036718217795904483.gal : 3 ms
[2026-05-25 10:22:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality6511815644230696062.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/CTLCardinality10036718217795904483.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6511815644230696062.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,38562,0.096597,8144,2,1415,5,14901,6,0,387,18843,0


Converting to forward existential form...Done !
original formula: (AF((AG(E(((p236==0)||(p718==1)) U (p709==1))) * (p698==0))) * A(!(E(!((EG((p654==1)) + (p261==1))) U (AF(((p918==0)||(p90==1))) * !(AF((...182
=> equivalent forward existential formula: ([FwdG(Init,!((!(E(TRUE U !(E(((p236==0)||(p718==1)) U (p709==1))))) * (p698==0))))] = FALSE * ([FwdG((FwdU((Fwd...319
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t12, t13, t14, t19, t20, t21, t49, t57, t58, t82, t83, t84, t85, t86, t87, t88, t...291
Hit Full ! (commute/partial/dont) 111/0/2
(forward)formula 0,0,3.09333,100960,1,0,524,556243,287,240,2789,439676,619
FORMULA MedleyB-PT-B01-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 744/744 places, 856/856 transitions.
Graph (trivial) has 724 edges and 744 vertex of which 42 / 744 are part of one of the 8 SCC in 2 ms
Free SCC test removed 34 places
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 518 transitions
Trivial Post-agglo rules discarded 518 transitions
Performed 518 trivial Post agglomeration. Transition count delta: 518
Iterating post reduction 0 with 518 rules applied. Total rules applied 519 place count 709 transition count 298
Reduce places removed 518 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 528 rules applied. Total rules applied 1047 place count 191 transition count 288
Reduce places removed 4 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 8 rules applied. Total rules applied 1055 place count 187 transition count 284
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1059 place count 183 transition count 284
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 1059 place count 183 transition count 249
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 1129 place count 148 transition count 249
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 1146 place count 131 transition count 232
Iterating global reduction 4 with 17 rules applied. Total rules applied 1163 place count 131 transition count 232
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1163 place count 131 transition count 231
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1165 place count 130 transition count 231
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1169 place count 126 transition count 227
Iterating global reduction 4 with 4 rules applied. Total rules applied 1173 place count 126 transition count 227
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1177 place count 122 transition count 223
Iterating global reduction 4 with 4 rules applied. Total rules applied 1181 place count 122 transition count 223
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1185 place count 118 transition count 219
Iterating global reduction 4 with 4 rules applied. Total rules applied 1189 place count 118 transition count 219
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1191 place count 118 transition count 217
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 5 with 34 rules applied. Total rules applied 1225 place count 101 transition count 200
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1228 place count 101 transition count 197
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 1246 place count 83 transition count 145
Iterating global reduction 6 with 18 rules applied. Total rules applied 1264 place count 83 transition count 145
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1270 place count 83 transition count 139
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1276 place count 77 transition count 131
Iterating global reduction 7 with 6 rules applied. Total rules applied 1282 place count 77 transition count 131
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1288 place count 71 transition count 123
Iterating global reduction 7 with 6 rules applied. Total rules applied 1294 place count 71 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1297 place count 71 transition count 120
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1299 place count 70 transition count 119
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1300 place count 69 transition count 115
Iterating global reduction 8 with 1 rules applied. Total rules applied 1301 place count 69 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1302 place count 69 transition count 114
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1306 place count 69 transition count 110
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 1314 place count 65 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1315 place count 64 transition count 105
Applied a total of 1315 rules in 84 ms. Remains 64 /744 variables (removed 680) and now considering 105/856 (removed 751) transitions.
[2026-05-25 10:22:21] [INFO ] Flow matrix only has 101 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6702333969986436804.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14023647137932472655.kers'
[2026-05-25 10:22:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6702333969986436804.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14023647137932472655.kers]
Normalized transition count is 100 out of 101 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 100 rows 63 cols 277 entries
Finished phase 1 with 62 SingleSign rule and 0 generalized
[2026-05-25 10:22:21] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-14023647137932472655.kers
Total runtime 15 ms.
[2026-05-25 10:22:21] [INFO ] Implicit Places using invariants in 103 ms returned []
[2026-05-25 10:22:21] [INFO ] Flow matrix only has 101 transitions (discarded 4 similar events)
[2026-05-25 10:22:21] [INFO ] Invariant cache hit.
[2026-05-25 10:22:21] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-25 10:22:21] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2026-05-25 10:22:21] [INFO ] Redundant transitions in 1 ms returned []
Running 98 sub problems to find dead transitions.
[2026-05-25 10:22:21] [INFO ] Flow matrix only has 101 transitions (discarded 4 similar events)
[2026-05-25 10:22:21] [INFO ] Invariant cache hit.
[2026-05-25 10:22:21] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 3/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 100/164 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 6/82 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 1/165 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/165 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 0/165 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 83 constraints, problems are : Problem set: 0 solved, 98 unsolved in 5681 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 64/64 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 3/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 100/164 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 6/82 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 98/180 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 1/165 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/165 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/165 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (OVERLAPS) 0/165 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 183 constraints, problems are : Problem set: 0 solved, 98 unsolved in 7874 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 64/64 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13563ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 13564ms
Starting structural reductions in SI_CTL mode, iteration 1 : 64/744 places, 105/856 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13821 ms. Remains : 64/744 places, 105/856 transitions.
[2026-05-25 10:22:35] [INFO ] Flatten gal took : 2 ms
[2026-05-25 10:22:35] [INFO ] Flatten gal took : 2 ms
[2026-05-25 10:22:35] [INFO ] Input system was already deterministic with 105 transitions.
[2026-05-25 10:22:35] [INFO ] Flatten gal took : 3 ms
[2026-05-25 10:22:35] [INFO ] Flatten gal took : 2 ms
[2026-05-25 10:22:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality9705735854678544910.gal : 1 ms
[2026-05-25 10:22:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality13806402915172848767.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/CTLCardinality9705735854678544910.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13806402915172848767.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,10818,0.047823,5864,2,943,5,7095,6,0,355,7327,0


Converting to forward existential form...Done !
original formula: EG(EF(!(E(((p154==0)||(p139==1)) U ((p226!=1)&&(((p315==0)||(p96==1))||((p310==0)||(p667==1))))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(E(((p154==0)||(p139==1)) U ((p226!=1)&&(((p315==0)||(p96==1))||((p310==0)||(p667==1)))))))...166
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t6, t7, t8, t17, t18, t21, t30, t46, t49, t57, t58, t80, t81, t82, t83, t84, t85,...291
(forward)formula 0,0,0.313118,17964,1,0,216,56432,234,94,2394,68435,240
FORMULA MedleyB-PT-B01-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 744/744 places, 856/856 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 718 transition count 830
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 718 transition count 830
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 70 place count 700 transition count 812
Iterating global reduction 0 with 18 rules applied. Total rules applied 88 place count 700 transition count 812
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 103 place count 685 transition count 797
Iterating global reduction 0 with 15 rules applied. Total rules applied 118 place count 685 transition count 797
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 131 place count 672 transition count 784
Iterating global reduction 0 with 13 rules applied. Total rules applied 144 place count 672 transition count 784
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 145 place count 672 transition count 783
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 157 place count 660 transition count 771
Iterating global reduction 1 with 12 rules applied. Total rules applied 169 place count 660 transition count 771
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 170 place count 660 transition count 770
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 179 place count 651 transition count 761
Iterating global reduction 2 with 9 rules applied. Total rules applied 188 place count 651 transition count 761
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 189 place count 651 transition count 760
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 196 place count 644 transition count 753
Iterating global reduction 3 with 7 rules applied. Total rules applied 203 place count 644 transition count 753
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 209 place count 638 transition count 747
Iterating global reduction 3 with 6 rules applied. Total rules applied 215 place count 638 transition count 747
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 220 place count 633 transition count 742
Iterating global reduction 3 with 5 rules applied. Total rules applied 225 place count 633 transition count 742
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 228 place count 630 transition count 739
Iterating global reduction 3 with 3 rules applied. Total rules applied 231 place count 630 transition count 739
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 233 place count 628 transition count 737
Iterating global reduction 3 with 2 rules applied. Total rules applied 235 place count 628 transition count 737
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 237 place count 626 transition count 735
Iterating global reduction 3 with 2 rules applied. Total rules applied 239 place count 626 transition count 735
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 241 place count 624 transition count 733
Iterating global reduction 3 with 2 rules applied. Total rules applied 243 place count 624 transition count 733
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 245 place count 622 transition count 731
Iterating global reduction 3 with 2 rules applied. Total rules applied 247 place count 622 transition count 731
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 249 place count 620 transition count 729
Iterating global reduction 3 with 2 rules applied. Total rules applied 251 place count 620 transition count 729
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 253 place count 618 transition count 727
Iterating global reduction 3 with 2 rules applied. Total rules applied 255 place count 618 transition count 727
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 257 place count 616 transition count 725
Iterating global reduction 3 with 2 rules applied. Total rules applied 259 place count 616 transition count 725
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 261 place count 614 transition count 723
Iterating global reduction 3 with 2 rules applied. Total rules applied 263 place count 614 transition count 723
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 264 place count 614 transition count 722
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 265 place count 613 transition count 721
Iterating global reduction 4 with 1 rules applied. Total rules applied 266 place count 613 transition count 721
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 267 place count 612 transition count 720
Iterating global reduction 4 with 1 rules applied. Total rules applied 268 place count 612 transition count 720
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 269 place count 611 transition count 719
Iterating global reduction 4 with 1 rules applied. Total rules applied 270 place count 611 transition count 719
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 271 place count 611 transition count 718
Applied a total of 271 rules in 348 ms. Remains 611 /744 variables (removed 133) and now considering 718/856 (removed 138) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12521381111094693969.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10264113181269754851.kers'
[2026-05-25 10:22:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12521381111094693969.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10264113181269754851.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 718 rows 611 cols 1777 entries
Finished phase 1 with 607 SingleSign rule and 0 generalized
[2026-05-25 10:22:36] [INFO ] Computed 4 invariants in 3 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10264113181269754851.kers
Total runtime 4 ms.
[2026-05-25 10:22:36] [INFO ] Implicit Places using invariants in 321 ms returned []
[2026-05-25 10:22:36] [INFO ] Invariant cache hit.
[2026-05-25 10:22:37] [INFO ] Implicit Places using invariants and state equation in 701 ms returned []
Implicit Place search using SMT with State Equation took 1030 ms to find 0 implicit places.
Running 717 sub problems to find dead transitions.
[2026-05-25 10:22:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 717 unsolved
At refinement iteration 1 (OVERLAPS) 1/611 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 717 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 611/1329 variables, and 4 constraints, problems are : Problem set: 0 solved, 717 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/611 constraints, PredecessorRefiner: 717/717 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 717 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 717 unsolved
At refinement iteration 1 (OVERLAPS) 1/611 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 717 unsolved
SMT process timed out in 60251ms, After SMT, problems are : Problem set: 0 solved, 717 unsolved
Search for dead transitions found 0 dead transitions in 60255ms
Starting structural reductions in LTL mode, iteration 1 : 611/744 places, 718/856 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61636 ms. Remains : 611/744 places, 718/856 transitions.
[2026-05-25 10:23:37] [INFO ] Flatten gal took : 12 ms
[2026-05-25 10:23:37] [INFO ] Flatten gal took : 9 ms
[2026-05-25 10:23:37] [INFO ] Input system was already deterministic with 718 transitions.
[2026-05-25 10:23:37] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:23:37] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:23:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality5659437894211538346.gal : 3 ms
[2026-05-25 10:23:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality2410181199911068602.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/CTLCardinality5659437894211538346.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2410181199911068602.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,6.93989e+07,5.37517,109676,2,12555,5,340042,6,0,3164,470458,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 10:24:07] [INFO ] Flatten gal took : 29 ms
[2026-05-25 10:24:07] [INFO ] Applying decomposition
[2026-05-25 10:24:07] [INFO ] Flatten gal took : 14 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/graph13018358630417915164.txt' '-o' '/tmp/graph13018358630417915164.bin' '-w' '/tmp/graph13018358630417915164.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13018358630417915164.bin' '-l' '-1' '-v' '-w' '/tmp/graph13018358630417915164.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:24:07] [INFO ] Decomposing Gal with order
[2026-05-25 10:24:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:24:07] [INFO ] Removed a total of 388 redundant transitions.
[2026-05-25 10:24:07] [INFO ] Flatten gal took : 22 ms
[2026-05-25 10:24:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 8 ms.
[2026-05-25 10:24:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality2741504134279074846.gal : 5 ms
[2026-05-25 10:24:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality5505456865178413683.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/CTLCardinality2741504134279074846.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5505456865178413683.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,6.93989e+07,2.5492,74504,1412,20,149505,439,962,285802,62,872,0


Converting to forward existential form...Done !
original formula: A(EX(!(AG((i17.u154.p597!=1)))) U (i8.i0.i1.u131.p489==1))
=> equivalent forward existential formula: [((Init * !(EG(!((i8.i0.i1.u131.p489==1))))) * !(E(!((i8.i0.i1.u131.p489==1)) U (!(EX(!(!(E(TRUE U !((i17.u154.p...211
Reverse transition relation is NOT exact ! Due to transitions t150, t206, t240, t335, t562, t578, t579, t582, t585, t590, t593, t596, t597, t600, t603, t60...522
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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
(forward)formula 0,0,27.2421,703332,1,0,917611,449,8282,5.29269e+06,295,1056,1820320
FORMULA MedleyB-PT-B01-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 744/744 places, 856/856 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 717 transition count 829
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 717 transition count 829
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 73 place count 698 transition count 810
Iterating global reduction 0 with 19 rules applied. Total rules applied 92 place count 698 transition count 810
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 108 place count 682 transition count 794
Iterating global reduction 0 with 16 rules applied. Total rules applied 124 place count 682 transition count 794
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 138 place count 668 transition count 780
Iterating global reduction 0 with 14 rules applied. Total rules applied 152 place count 668 transition count 780
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 153 place count 668 transition count 779
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 166 place count 655 transition count 766
Iterating global reduction 1 with 13 rules applied. Total rules applied 179 place count 655 transition count 766
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 180 place count 655 transition count 765
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 190 place count 645 transition count 755
Iterating global reduction 2 with 10 rules applied. Total rules applied 200 place count 645 transition count 755
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 201 place count 645 transition count 754
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 209 place count 637 transition count 746
Iterating global reduction 3 with 8 rules applied. Total rules applied 217 place count 637 transition count 746
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 224 place count 630 transition count 739
Iterating global reduction 3 with 7 rules applied. Total rules applied 231 place count 630 transition count 739
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 237 place count 624 transition count 733
Iterating global reduction 3 with 6 rules applied. Total rules applied 243 place count 624 transition count 733
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 247 place count 620 transition count 729
Iterating global reduction 3 with 4 rules applied. Total rules applied 251 place count 620 transition count 729
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 254 place count 617 transition count 726
Iterating global reduction 3 with 3 rules applied. Total rules applied 257 place count 617 transition count 726
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 260 place count 614 transition count 723
Iterating global reduction 3 with 3 rules applied. Total rules applied 263 place count 614 transition count 723
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 266 place count 611 transition count 720
Iterating global reduction 3 with 3 rules applied. Total rules applied 269 place count 611 transition count 720
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 272 place count 608 transition count 717
Iterating global reduction 3 with 3 rules applied. Total rules applied 275 place count 608 transition count 717
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 278 place count 605 transition count 714
Iterating global reduction 3 with 3 rules applied. Total rules applied 281 place count 605 transition count 714
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 284 place count 602 transition count 711
Iterating global reduction 3 with 3 rules applied. Total rules applied 287 place count 602 transition count 711
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 290 place count 599 transition count 708
Iterating global reduction 3 with 3 rules applied. Total rules applied 293 place count 599 transition count 708
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 296 place count 596 transition count 705
Iterating global reduction 3 with 3 rules applied. Total rules applied 299 place count 596 transition count 705
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 301 place count 596 transition count 703
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 302 place count 595 transition count 702
Iterating global reduction 4 with 1 rules applied. Total rules applied 303 place count 595 transition count 702
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 304 place count 594 transition count 701
Iterating global reduction 4 with 1 rules applied. Total rules applied 305 place count 594 transition count 701
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 306 place count 593 transition count 700
Iterating global reduction 4 with 1 rules applied. Total rules applied 307 place count 593 transition count 700
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 308 place count 593 transition count 699
Applied a total of 308 rules in 366 ms. Remains 593 /744 variables (removed 151) and now considering 699/856 (removed 157) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16975013888653525431.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15168496671377453277.kers'
[2026-05-25 10:24:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16975013888653525431.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15168496671377453277.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 699 rows 593 cols 1733 entries
Finished phase 1 with 589 SingleSign rule and 0 generalized
[2026-05-25 10:24:35] [INFO ] Computed 4 invariants in 3 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15168496671377453277.kers
Total runtime 4 ms.
[2026-05-25 10:24:35] [INFO ] Implicit Places using invariants in 368 ms returned []
[2026-05-25 10:24:35] [INFO ] Invariant cache hit.
[2026-05-25 10:24:36] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 812 ms to find 0 implicit places.
Running 698 sub problems to find dead transitions.
[2026-05-25 10:24:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (OVERLAPS) 1/593 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 593/1292 variables, and 6 constraints, problems are : Problem set: 0 solved, 698 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/593 constraints, PredecessorRefiner: 698/698 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 698 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (OVERLAPS) 1/593 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/593 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/1292 variables, and 16 constraints, problems are : Problem set: 0 solved, 698 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/593 constraints, PredecessorRefiner: 0/698 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60156ms problems are : Problem set: 0 solved, 698 unsolved
Search for dead transitions found 0 dead transitions in 60159ms
Starting structural reductions in LTL mode, iteration 1 : 593/744 places, 699/856 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61339 ms. Remains : 593/744 places, 699/856 transitions.
[2026-05-25 10:25:36] [INFO ] Flatten gal took : 23 ms
[2026-05-25 10:25:36] [INFO ] Flatten gal took : 9 ms
[2026-05-25 10:25:36] [INFO ] Input system was already deterministic with 699 transitions.
[2026-05-25 10:25:36] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:25:36] [INFO ] Flatten gal took : 11 ms
[2026-05-25 10:25:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality9888848675298698712.gal : 2 ms
[2026-05-25 10:25:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality16231009800049576888.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/CTLCardinality9888848675298698712.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16231009800049576888.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 10:26:06] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:26:06] [INFO ] Applying decomposition
[2026-05-25 10:26:06] [INFO ] Flatten gal took : 8 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/graph9702304271198354235.txt' '-o' '/tmp/graph9702304271198354235.bin' '-w' '/tmp/graph9702304271198354235.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9702304271198354235.bin' '-l' '-1' '-v' '-w' '/tmp/graph9702304271198354235.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:26:06] [INFO ] Decomposing Gal with order
[2026-05-25 10:26:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:26:06] [INFO ] Removed a total of 368 redundant transitions.
[2026-05-25 10:26:06] [INFO ] Flatten gal took : 25 ms
[2026-05-25 10:26:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 11 ms.
[2026-05-25 10:26:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality9163979371722816563.gal : 10 ms
[2026-05-25 10:26:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality15229650596249287555.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/CTLCardinality9163979371722816563.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15229650596249287555.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.52054e+07,1.25951,45580,1241,22,84602,517,931,176026,66,1107,0


Converting to forward existential form...Done !
original formula: EX(AX(E((i17.u101.p394==0) U ((i13.u127.p469==0)||(i10.u93.p364==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(E((i17.u101.p394==0) U ((i13.u127.p469==0)||(i10.u93.p364==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t68, t206, t240, t378, t493, t549, t565, t566, t569, t572, t577, t580, t583, t584, t587, t590...481
(forward)formula 0,1,2.12428,55792,1,0,89862,517,6967,237527,295,1107,388834
FORMULA MedleyB-PT-B01-CTLCardinality-2024-09 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 : 744/744 places, 856/856 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 719 transition count 831
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 719 transition count 831
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 68 place count 701 transition count 813
Iterating global reduction 0 with 18 rules applied. Total rules applied 86 place count 701 transition count 813
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 101 place count 686 transition count 798
Iterating global reduction 0 with 15 rules applied. Total rules applied 116 place count 686 transition count 798
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 129 place count 673 transition count 785
Iterating global reduction 0 with 13 rules applied. Total rules applied 142 place count 673 transition count 785
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 143 place count 673 transition count 784
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 155 place count 661 transition count 772
Iterating global reduction 1 with 12 rules applied. Total rules applied 167 place count 661 transition count 772
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 168 place count 661 transition count 771
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 177 place count 652 transition count 762
Iterating global reduction 2 with 9 rules applied. Total rules applied 186 place count 652 transition count 762
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 187 place count 652 transition count 761
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 194 place count 645 transition count 754
Iterating global reduction 3 with 7 rules applied. Total rules applied 201 place count 645 transition count 754
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 207 place count 639 transition count 748
Iterating global reduction 3 with 6 rules applied. Total rules applied 213 place count 639 transition count 748
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 218 place count 634 transition count 743
Iterating global reduction 3 with 5 rules applied. Total rules applied 223 place count 634 transition count 743
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 226 place count 631 transition count 740
Iterating global reduction 3 with 3 rules applied. Total rules applied 229 place count 631 transition count 740
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 231 place count 629 transition count 738
Iterating global reduction 3 with 2 rules applied. Total rules applied 233 place count 629 transition count 738
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 235 place count 627 transition count 736
Iterating global reduction 3 with 2 rules applied. Total rules applied 237 place count 627 transition count 736
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 239 place count 625 transition count 734
Iterating global reduction 3 with 2 rules applied. Total rules applied 241 place count 625 transition count 734
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 243 place count 623 transition count 732
Iterating global reduction 3 with 2 rules applied. Total rules applied 245 place count 623 transition count 732
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 247 place count 621 transition count 730
Iterating global reduction 3 with 2 rules applied. Total rules applied 249 place count 621 transition count 730
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 251 place count 619 transition count 728
Iterating global reduction 3 with 2 rules applied. Total rules applied 253 place count 619 transition count 728
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 255 place count 617 transition count 726
Iterating global reduction 3 with 2 rules applied. Total rules applied 257 place count 617 transition count 726
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 259 place count 615 transition count 724
Iterating global reduction 3 with 2 rules applied. Total rules applied 261 place count 615 transition count 724
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 263 place count 615 transition count 722
Applied a total of 263 rules in 394 ms. Remains 615 /744 variables (removed 129) and now considering 722/856 (removed 134) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-33911399424331516.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2727858403877139474.kers'
[2026-05-25 10:26:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-33911399424331516.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2727858403877139474.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 722 rows 615 cols 1785 entries
Finished phase 1 with 611 SingleSign rule and 0 generalized
[2026-05-25 10:26:09] [INFO ] Computed 4 invariants in 9 ms
Computed 4 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-2727858403877139474.kers
Total runtime 10 ms.
[2026-05-25 10:26:09] [INFO ] Implicit Places using invariants in 296 ms returned []
[2026-05-25 10:26:09] [INFO ] Invariant cache hit.
[2026-05-25 10:26:10] [INFO ] Implicit Places using invariants and state equation in 619 ms returned []
Implicit Place search using SMT with State Equation took 930 ms to find 0 implicit places.
Running 721 sub problems to find dead transitions.
[2026-05-25 10:26:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 1 (OVERLAPS) 1/615 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 721 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1337 variables, and 8 constraints, problems are : Problem set: 0 solved, 721 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/615 constraints, PredecessorRefiner: 721/721 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 721 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 1 (OVERLAPS) 1/615 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/615 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 721 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 615/1337 variables, and 20 constraints, problems are : Problem set: 0 solved, 721 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/615 constraints, PredecessorRefiner: 0/721 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60202ms problems are : Problem set: 0 solved, 721 unsolved
Search for dead transitions found 0 dead transitions in 60205ms
Starting structural reductions in LTL mode, iteration 1 : 615/744 places, 722/856 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61533 ms. Remains : 615/744 places, 722/856 transitions.
[2026-05-25 10:27:10] [INFO ] Flatten gal took : 12 ms
[2026-05-25 10:27:10] [INFO ] Flatten gal took : 10 ms
[2026-05-25 10:27:10] [INFO ] Input system was already deterministic with 722 transitions.
[2026-05-25 10:27:10] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:27:10] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:27:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality158463233517548254.gal : 2 ms
[2026-05-25 10:27:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality12074214119844996352.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/CTLCardinality158463233517548254.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12074214119844996352.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 10:27:40] [INFO ] Flatten gal took : 23 ms
[2026-05-25 10:27:40] [INFO ] Applying decomposition
[2026-05-25 10:27:40] [INFO ] Flatten gal took : 20 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/graph15199762570474733540.txt' '-o' '/tmp/graph15199762570474733540.bin' '-w' '/tmp/graph15199762570474733540.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15199762570474733540.bin' '-l' '-1' '-v' '-w' '/tmp/graph15199762570474733540.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:27:40] [INFO ] Decomposing Gal with order
[2026-05-25 10:27:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:27:40] [INFO ] Removed a total of 379 redundant transitions.
[2026-05-25 10:27:40] [INFO ] Flatten gal took : 21 ms
[2026-05-25 10:27:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2026-05-25 10:27:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality8231210850223134149.gal : 4 ms
[2026-05-25 10:27:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality16093888771550730889.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/CTLCardinality8231210850223134149.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16093888771550730889.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,7.2906e+07,2.32618,84780,1526,25,167350,614,965,345282,65,1278,0


Converting to forward existential form...Done !
original formula: EG((AG(EX(E((i29.u231.p906==0) U (i18.u137.p567==1)))) + EX(((i10.u196.p740==0)||(i26.u209.p819==1)))))
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !(EX(E((i29.u231.p906==0) U (i18.u137.p567==1)))))) + EX(((i10.u196.p740==0)||(i26.u209.p...176
Reverse transition relation is NOT exact ! Due to transitions t24, t166, t220, t222, t256, t283, t336, t338, t391, t394, t427, t509, t563, t581, t582, t588...543
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 an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 744/744 places, 856/856 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 721 transition count 833
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 721 transition count 833
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 63 place count 704 transition count 816
Iterating global reduction 0 with 17 rules applied. Total rules applied 80 place count 704 transition count 816
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 94 place count 690 transition count 802
Iterating global reduction 0 with 14 rules applied. Total rules applied 108 place count 690 transition count 802
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 119 place count 679 transition count 791
Iterating global reduction 0 with 11 rules applied. Total rules applied 130 place count 679 transition count 791
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 131 place count 679 transition count 790
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 141 place count 669 transition count 780
Iterating global reduction 1 with 10 rules applied. Total rules applied 151 place count 669 transition count 780
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 152 place count 669 transition count 779
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 159 place count 662 transition count 772
Iterating global reduction 2 with 7 rules applied. Total rules applied 166 place count 662 transition count 772
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 167 place count 662 transition count 771
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 172 place count 657 transition count 766
Iterating global reduction 3 with 5 rules applied. Total rules applied 177 place count 657 transition count 766
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 182 place count 652 transition count 761
Iterating global reduction 3 with 5 rules applied. Total rules applied 187 place count 652 transition count 761
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 191 place count 648 transition count 757
Iterating global reduction 3 with 4 rules applied. Total rules applied 195 place count 648 transition count 757
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 197 place count 646 transition count 755
Iterating global reduction 3 with 2 rules applied. Total rules applied 199 place count 646 transition count 755
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 200 place count 645 transition count 754
Iterating global reduction 3 with 1 rules applied. Total rules applied 201 place count 645 transition count 754
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 202 place count 644 transition count 753
Iterating global reduction 3 with 1 rules applied. Total rules applied 203 place count 644 transition count 753
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 204 place count 643 transition count 752
Iterating global reduction 3 with 1 rules applied. Total rules applied 205 place count 643 transition count 752
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 206 place count 642 transition count 751
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 642 transition count 751
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 208 place count 641 transition count 750
Iterating global reduction 3 with 1 rules applied. Total rules applied 209 place count 641 transition count 750
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 210 place count 640 transition count 749
Iterating global reduction 3 with 1 rules applied. Total rules applied 211 place count 640 transition count 749
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 212 place count 639 transition count 748
Iterating global reduction 3 with 1 rules applied. Total rules applied 213 place count 639 transition count 748
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 214 place count 638 transition count 747
Iterating global reduction 3 with 1 rules applied. Total rules applied 215 place count 638 transition count 747
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 216 place count 638 transition count 746
Applied a total of 216 rules in 317 ms. Remains 638 /744 variables (removed 106) and now considering 746/856 (removed 110) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17075342823291714067.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14054946353333651655.kers'
[2026-05-25 10:28:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17075342823291714067.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14054946353333651655.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 746 rows 638 cols 1839 entries
Finished phase 1 with 634 SingleSign rule and 0 generalized
[2026-05-25 10:28:11] [INFO ] Computed 4 invariants in 21 ms
Computed 4 P flows in 31 ms.
Exported basis to /tmp/petrispot-output-14054946353333651655.kers
Total runtime 32 ms.
[2026-05-25 10:28:11] [INFO ] Implicit Places using invariants in 388 ms returned []
[2026-05-25 10:28:11] [INFO ] Invariant cache hit.
[2026-05-25 10:28:12] [INFO ] Implicit Places using invariants and state equation in 683 ms returned []
Implicit Place search using SMT with State Equation took 1086 ms to find 0 implicit places.
Running 745 sub problems to find dead transitions.
[2026-05-25 10:28:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/637 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 1 (OVERLAPS) 1/638 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 745 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 638/1384 variables, and 4 constraints, problems are : Problem set: 0 solved, 745 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/638 constraints, PredecessorRefiner: 745/745 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 745 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/637 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 1 (OVERLAPS) 1/638 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 745 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 638/1384 variables, and 14 constraints, problems are : Problem set: 0 solved, 745 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/638 constraints, PredecessorRefiner: 0/745 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60192ms problems are : Problem set: 0 solved, 745 unsolved
Search for dead transitions found 0 dead transitions in 60195ms
Starting structural reductions in LTL mode, iteration 1 : 638/744 places, 746/856 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61603 ms. Remains : 638/744 places, 746/856 transitions.
[2026-05-25 10:29:12] [INFO ] Flatten gal took : 20 ms
[2026-05-25 10:29:12] [INFO ] Flatten gal took : 12 ms
[2026-05-25 10:29:12] [INFO ] Input system was already deterministic with 746 transitions.
[2026-05-25 10:29:12] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:29:12] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:29:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality11163817189645064405.gal : 2 ms
[2026-05-25 10:29:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality2476158644711724372.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/CTLCardinality11163817189645064405.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2476158644711724372.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 10:29:42] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:29:42] [INFO ] Applying decomposition
[2026-05-25 10:29:42] [INFO ] Flatten gal took : 8 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/graph17340995576669234515.txt' '-o' '/tmp/graph17340995576669234515.bin' '-w' '/tmp/graph17340995576669234515.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17340995576669234515.bin' '-l' '-1' '-v' '-w' '/tmp/graph17340995576669234515.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:29:42] [INFO ] Decomposing Gal with order
[2026-05-25 10:29:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:29:42] [INFO ] Removed a total of 387 redundant transitions.
[2026-05-25 10:29:42] [INFO ] Flatten gal took : 23 ms
[2026-05-25 10:29:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 6 ms.
[2026-05-25 10:29:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality6077560058245343594.gal : 6 ms
[2026-05-25 10:29:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality13761368755278002841.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/CTLCardinality6077560058245343594.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13761368755278002841.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,7.64937e+07,0.450783,20464,1150,20,32345,460,1060,53156,70,968,0


Converting to forward existential form...Done !
original formula: A((!((E((i9.i1.i0.u83.p338!=1) U ((i19.u150.p571!=0)||((i28.u224.p798==1)&&((i14.i0.i0.u114.p419==0)||(i10.u90.p354==1))))) + A((i7.u1.p3...538
=> equivalent forward existential formula: [((Init * !(EG(!((E(TRUE U ((((i4.i1.i1.u45.p132==0)||(i28.u140.p528==1))||((i15.u129.p461==0)||(i25.u212.p745==...1498
Reverse transition relation is NOT exact ! Due to transitions t110, t222, t256, t269, t353, t354, t411, t444, t471, t526, t598, t602, t605, t608, t613, t61...518
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 744/744 places, 856/856 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 718 transition count 830
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 718 transition count 830
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 70 place count 700 transition count 812
Iterating global reduction 0 with 18 rules applied. Total rules applied 88 place count 700 transition count 812
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 103 place count 685 transition count 797
Iterating global reduction 0 with 15 rules applied. Total rules applied 118 place count 685 transition count 797
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 131 place count 672 transition count 784
Iterating global reduction 0 with 13 rules applied. Total rules applied 144 place count 672 transition count 784
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 145 place count 672 transition count 783
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 157 place count 660 transition count 771
Iterating global reduction 1 with 12 rules applied. Total rules applied 169 place count 660 transition count 771
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 170 place count 660 transition count 770
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 179 place count 651 transition count 761
Iterating global reduction 2 with 9 rules applied. Total rules applied 188 place count 651 transition count 761
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 189 place count 651 transition count 760
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 196 place count 644 transition count 753
Iterating global reduction 3 with 7 rules applied. Total rules applied 203 place count 644 transition count 753
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 209 place count 638 transition count 747
Iterating global reduction 3 with 6 rules applied. Total rules applied 215 place count 638 transition count 747
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 219 place count 634 transition count 743
Iterating global reduction 3 with 4 rules applied. Total rules applied 223 place count 634 transition count 743
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 225 place count 632 transition count 741
Iterating global reduction 3 with 2 rules applied. Total rules applied 227 place count 632 transition count 741
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 228 place count 631 transition count 740
Iterating global reduction 3 with 1 rules applied. Total rules applied 229 place count 631 transition count 740
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 230 place count 630 transition count 739
Iterating global reduction 3 with 1 rules applied. Total rules applied 231 place count 630 transition count 739
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 232 place count 629 transition count 738
Iterating global reduction 3 with 1 rules applied. Total rules applied 233 place count 629 transition count 738
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 234 place count 628 transition count 737
Iterating global reduction 3 with 1 rules applied. Total rules applied 235 place count 628 transition count 737
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 236 place count 627 transition count 736
Iterating global reduction 3 with 1 rules applied. Total rules applied 237 place count 627 transition count 736
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 238 place count 626 transition count 735
Iterating global reduction 3 with 1 rules applied. Total rules applied 239 place count 626 transition count 735
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 240 place count 625 transition count 734
Iterating global reduction 3 with 1 rules applied. Total rules applied 241 place count 625 transition count 734
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 242 place count 624 transition count 733
Iterating global reduction 3 with 1 rules applied. Total rules applied 243 place count 624 transition count 733
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 244 place count 623 transition count 732
Iterating global reduction 3 with 1 rules applied. Total rules applied 245 place count 623 transition count 732
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 246 place count 622 transition count 731
Iterating global reduction 3 with 1 rules applied. Total rules applied 247 place count 622 transition count 731
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 248 place count 621 transition count 730
Iterating global reduction 3 with 1 rules applied. Total rules applied 249 place count 621 transition count 730
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 250 place count 621 transition count 729
Applied a total of 250 rules in 408 ms. Remains 621 /744 variables (removed 123) and now considering 729/856 (removed 127) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13238449394277903457.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15026656355231292367.kers'
[2026-05-25 10:30:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13238449394277903457.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15026656355231292367.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 729 rows 621 cols 1803 entries
Finished phase 1 with 617 SingleSign rule and 0 generalized
[2026-05-25 10:30:13] [INFO ] Computed 4 invariants in 3 ms
Computed 4 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-15026656355231292367.kers
Total runtime 5 ms.
[2026-05-25 10:30:13] [INFO ] Implicit Places using invariants in 296 ms returned []
[2026-05-25 10:30:13] [INFO ] Invariant cache hit.
[2026-05-25 10:30:14] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 820 ms to find 0 implicit places.
Running 728 sub problems to find dead transitions.
[2026-05-25 10:30:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 1 (OVERLAPS) 1/621 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 728 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/1350 variables, and 5 constraints, problems are : Problem set: 0 solved, 728 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/621 constraints, PredecessorRefiner: 728/728 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 728 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 1 (OVERLAPS) 1/621 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 728 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 621/1350 variables, and 18 constraints, problems are : Problem set: 0 solved, 728 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/621 constraints, PredecessorRefiner: 0/728 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60189ms problems are : Problem set: 0 solved, 728 unsolved
Search for dead transitions found 0 dead transitions in 60191ms
Starting structural reductions in LTL mode, iteration 1 : 621/744 places, 729/856 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61423 ms. Remains : 621/744 places, 729/856 transitions.
[2026-05-25 10:31:14] [INFO ] Flatten gal took : 18 ms
[2026-05-25 10:31:14] [INFO ] Flatten gal took : 14 ms
[2026-05-25 10:31:14] [INFO ] Input system was already deterministic with 729 transitions.
[2026-05-25 10:31:14] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:31:14] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:31:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality9262936765681215422.gal : 2 ms
[2026-05-25 10:31:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality10761245210202369110.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/CTLCardinality9262936765681215422.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10761245210202369110.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 10:31:44] [INFO ] Flatten gal took : 9 ms
[2026-05-25 10:31:44] [INFO ] Applying decomposition
[2026-05-25 10:31:44] [INFO ] Flatten gal took : 8 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/graph1722812369932355015.txt' '-o' '/tmp/graph1722812369932355015.bin' '-w' '/tmp/graph1722812369932355015.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1722812369932355015.bin' '-l' '-1' '-v' '-w' '/tmp/graph1722812369932355015.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:31:44] [INFO ] Decomposing Gal with order
[2026-05-25 10:31:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:31:44] [INFO ] Removed a total of 390 redundant transitions.
[2026-05-25 10:31:44] [INFO ] Flatten gal took : 21 ms
[2026-05-25 10:31:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2026-05-25 10:31:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality18003095342359088516.gal : 4 ms
[2026-05-25 10:31:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality4093756190782645195.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/CTLCardinality18003095342359088516.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4093756190782645195.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,7.20538e+07,0.504213,24652,1141,24,38829,483,1014,80758,68,868,0


Converting to forward existential form...Done !
original formula: AG((EX(AG(((i12.i1.i1.u140.p521==0)||(i8.u72.p286==1)))) + EX(AG(((i21.i0.i1.u167.p633==0)&&(i28.u56.p196==1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EX(!(E(TRUE U !(((i21.i0.i1.u167.p633==0)&&(i28.u56.p196==1)))))))) * !(EX(!(E(TRUE U !((...213
Reverse transition relation is NOT exact ! Due to transitions t150, t206, t335, t391, t424, t458, t512, t513, t566, t569, t585, t586, t589, t592, t597, t60...538
(forward)formula 0,0,2.79511,109572,1,0,173557,483,7564,571002,310,868,638098
FORMULA MedleyB-PT-B01-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 744/744 places, 856/856 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 717 transition count 829
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 717 transition count 829
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 73 place count 698 transition count 810
Iterating global reduction 0 with 19 rules applied. Total rules applied 92 place count 698 transition count 810
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 107 place count 683 transition count 795
Iterating global reduction 0 with 15 rules applied. Total rules applied 122 place count 683 transition count 795
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 135 place count 670 transition count 782
Iterating global reduction 0 with 13 rules applied. Total rules applied 148 place count 670 transition count 782
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 149 place count 670 transition count 781
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 160 place count 659 transition count 770
Iterating global reduction 1 with 11 rules applied. Total rules applied 171 place count 659 transition count 770
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 172 place count 659 transition count 769
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 181 place count 650 transition count 760
Iterating global reduction 2 with 9 rules applied. Total rules applied 190 place count 650 transition count 760
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 191 place count 650 transition count 759
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 197 place count 644 transition count 753
Iterating global reduction 3 with 6 rules applied. Total rules applied 203 place count 644 transition count 753
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 208 place count 639 transition count 748
Iterating global reduction 3 with 5 rules applied. Total rules applied 213 place count 639 transition count 748
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 217 place count 635 transition count 744
Iterating global reduction 3 with 4 rules applied. Total rules applied 221 place count 635 transition count 744
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 224 place count 632 transition count 741
Iterating global reduction 3 with 3 rules applied. Total rules applied 227 place count 632 transition count 741
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 229 place count 630 transition count 739
Iterating global reduction 3 with 2 rules applied. Total rules applied 231 place count 630 transition count 739
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 232 place count 629 transition count 738
Iterating global reduction 3 with 1 rules applied. Total rules applied 233 place count 629 transition count 738
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 234 place count 628 transition count 737
Iterating global reduction 3 with 1 rules applied. Total rules applied 235 place count 628 transition count 737
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 236 place count 627 transition count 736
Iterating global reduction 3 with 1 rules applied. Total rules applied 237 place count 627 transition count 736
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 238 place count 626 transition count 735
Iterating global reduction 3 with 1 rules applied. Total rules applied 239 place count 626 transition count 735
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 240 place count 625 transition count 734
Iterating global reduction 3 with 1 rules applied. Total rules applied 241 place count 625 transition count 734
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 242 place count 624 transition count 733
Iterating global reduction 3 with 1 rules applied. Total rules applied 243 place count 624 transition count 733
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 244 place count 623 transition count 732
Iterating global reduction 3 with 1 rules applied. Total rules applied 245 place count 623 transition count 732
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 246 place count 623 transition count 731
Applied a total of 246 rules in 285 ms. Remains 623 /744 variables (removed 121) and now considering 731/856 (removed 125) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13013880596645068031.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2311830804197654358.kers'
[2026-05-25 10:31:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13013880596645068031.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2311830804197654358.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 731 rows 623 cols 1809 entries
Finished phase 1 with 619 SingleSign rule and 0 generalized
[2026-05-25 10:31:47] [INFO ] Computed 4 invariants in 19 ms
Computed 4 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-2311830804197654358.kers
Total runtime 21 ms.
[2026-05-25 10:31:48] [INFO ] Implicit Places using invariants in 420 ms returned []
[2026-05-25 10:31:48] [INFO ] Invariant cache hit.
[2026-05-25 10:31:49] [INFO ] Implicit Places using invariants and state equation in 647 ms returned []
Implicit Place search using SMT with State Equation took 1090 ms to find 0 implicit places.
Running 730 sub problems to find dead transitions.
[2026-05-25 10:31:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 1 (OVERLAPS) 1/623 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 730 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1354 variables, and 4 constraints, problems are : Problem set: 0 solved, 730 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/623 constraints, PredecessorRefiner: 730/730 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 730 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 1 (OVERLAPS) 1/623 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 730 unsolved
SMT process timed out in 60300ms, After SMT, problems are : Problem set: 0 solved, 730 unsolved
Search for dead transitions found 0 dead transitions in 60303ms
Starting structural reductions in LTL mode, iteration 1 : 623/744 places, 731/856 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61681 ms. Remains : 623/744 places, 731/856 transitions.
[2026-05-25 10:32:49] [INFO ] Flatten gal took : 9 ms
[2026-05-25 10:32:49] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:32:49] [INFO ] Input system was already deterministic with 731 transitions.
[2026-05-25 10:32:49] [INFO ] Flatten gal took : 10 ms
[2026-05-25 10:32:49] [INFO ] Flatten gal took : 10 ms
[2026-05-25 10:32:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality16018542159114859370.gal : 2 ms
[2026-05-25 10:32:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality3740559981733424730.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/CTLCardinality16018542159114859370.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3740559981733424730.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 10:33:19] [INFO ] Flatten gal took : 9 ms
[2026-05-25 10:33:19] [INFO ] Applying decomposition
[2026-05-25 10:33:19] [INFO ] Flatten gal took : 8 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/graph12780737792438600467.txt' '-o' '/tmp/graph12780737792438600467.bin' '-w' '/tmp/graph12780737792438600467.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12780737792438600467.bin' '-l' '-1' '-v' '-w' '/tmp/graph12780737792438600467.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:33:19] [INFO ] Decomposing Gal with order
[2026-05-25 10:33:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:33:19] [INFO ] Removed a total of 386 redundant transitions.
[2026-05-25 10:33:19] [INFO ] Flatten gal took : 44 ms
[2026-05-25 10:33:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 3 ms.
[2026-05-25 10:33:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality15110311880615233784.gal : 3 ms
[2026-05-25 10:33:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality16415102898683602916.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/CTLCardinality15110311880615233784.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16415102898683602916.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.25992e+07,0.329801,17376,1117,20,26881,528,1000,37906,75,1229,0


Converting to forward existential form...Done !
original formula: AG(E((AX(E(((i15.u133.p493==0)||(i27.u236.p908==1)) U (i7.u25.p71==1))) + AX(EG((i27.u216.p800==1)))) U !(AF(!(AX(((i11.u83.p329==0)||(i1...183
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((!(EX(!(E(((i15.u133.p493==0)||(i27.u236.p908==1)) U (i7.u25.p71==1))))) + !(EX(!(EG((i2...261
Reverse transition relation is NOT exact ! Due to transitions t161, t251, t342, t431, t569, t585, t586, t592, t595, t600, t603, t606, t607, t610, t613, t61...527
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 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 a local 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
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
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
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 1
Fast SCC detection found an SCC at level 2
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
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found a local SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 744/744 places, 856/856 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 722 transition count 834
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 722 transition count 834
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 62 place count 704 transition count 816
Iterating global reduction 0 with 18 rules applied. Total rules applied 80 place count 704 transition count 816
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 95 place count 689 transition count 801
Iterating global reduction 0 with 15 rules applied. Total rules applied 110 place count 689 transition count 801
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 123 place count 676 transition count 788
Iterating global reduction 0 with 13 rules applied. Total rules applied 136 place count 676 transition count 788
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 137 place count 676 transition count 787
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 149 place count 664 transition count 775
Iterating global reduction 1 with 12 rules applied. Total rules applied 161 place count 664 transition count 775
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 162 place count 664 transition count 774
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 170 place count 656 transition count 766
Iterating global reduction 2 with 8 rules applied. Total rules applied 178 place count 656 transition count 766
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 179 place count 656 transition count 765
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 185 place count 650 transition count 759
Iterating global reduction 3 with 6 rules applied. Total rules applied 191 place count 650 transition count 759
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 196 place count 645 transition count 754
Iterating global reduction 3 with 5 rules applied. Total rules applied 201 place count 645 transition count 754
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 205 place count 641 transition count 750
Iterating global reduction 3 with 4 rules applied. Total rules applied 209 place count 641 transition count 750
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 211 place count 639 transition count 748
Iterating global reduction 3 with 2 rules applied. Total rules applied 213 place count 639 transition count 748
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 215 place count 637 transition count 746
Iterating global reduction 3 with 2 rules applied. Total rules applied 217 place count 637 transition count 746
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 219 place count 635 transition count 744
Iterating global reduction 3 with 2 rules applied. Total rules applied 221 place count 635 transition count 744
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 223 place count 633 transition count 742
Iterating global reduction 3 with 2 rules applied. Total rules applied 225 place count 633 transition count 742
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 227 place count 631 transition count 740
Iterating global reduction 3 with 2 rules applied. Total rules applied 229 place count 631 transition count 740
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 231 place count 629 transition count 738
Iterating global reduction 3 with 2 rules applied. Total rules applied 233 place count 629 transition count 738
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 235 place count 627 transition count 736
Iterating global reduction 3 with 2 rules applied. Total rules applied 237 place count 627 transition count 736
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 239 place count 625 transition count 734
Iterating global reduction 3 with 2 rules applied. Total rules applied 241 place count 625 transition count 734
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 243 place count 623 transition count 732
Iterating global reduction 3 with 2 rules applied. Total rules applied 245 place count 623 transition count 732
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 247 place count 623 transition count 730
Applied a total of 247 rules in 286 ms. Remains 623 /744 variables (removed 121) and now considering 730/856 (removed 126) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18349149271108350575.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10712228953723195609.kers'
[2026-05-25 10:33:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18349149271108350575.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10712228953723195609.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 730 rows 623 cols 1803 entries
Finished phase 1 with 619 SingleSign rule and 0 generalized
[2026-05-25 10:33:49] [INFO ] Computed 4 invariants in 3 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10712228953723195609.kers
Total runtime 5 ms.
[2026-05-25 10:33:50] [INFO ] Implicit Places using invariants in 357 ms returned []
[2026-05-25 10:33:50] [INFO ] Invariant cache hit.
[2026-05-25 10:33:50] [INFO ] Implicit Places using invariants and state equation in 613 ms returned []
Implicit Place search using SMT with State Equation took 1004 ms to find 0 implicit places.
Running 729 sub problems to find dead transitions.
[2026-05-25 10:33:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 729 unsolved
At refinement iteration 1 (OVERLAPS) 1/623 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 729 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1353 variables, and 9 constraints, problems are : Problem set: 0 solved, 729 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/623 constraints, PredecessorRefiner: 729/729 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 729 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 729 unsolved
At refinement iteration 1 (OVERLAPS) 1/623 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 729 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/623 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 729 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/623 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 729 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 623/1353 variables, and 19 constraints, problems are : Problem set: 0 solved, 729 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/623 constraints, PredecessorRefiner: 0/729 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60158ms problems are : Problem set: 0 solved, 729 unsolved
Search for dead transitions found 0 dead transitions in 60159ms
Starting structural reductions in LTL mode, iteration 1 : 623/744 places, 730/856 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61452 ms. Remains : 623/744 places, 730/856 transitions.
[2026-05-25 10:34:51] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:34:51] [INFO ] Flatten gal took : 9 ms
[2026-05-25 10:34:51] [INFO ] Input system was already deterministic with 730 transitions.
[2026-05-25 10:34:51] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:34:51] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:34:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality13974152011965257257.gal : 2 ms
[2026-05-25 10:34:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality14840468880500304165.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/CTLCardinality13974152011965257257.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14840468880500304165.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,7.22034e+07,3.8182,110700,2,12735,5,344440,6,0,3224,478988,0


Converting to forward existential form...Done !
original formula: (AG(E(A(((((p29==0)||(p825==1))||(p5==1)) * EX((p657==1))) U AF((p371==1))) U (!(((p473==0)||(p801==1))) * AX(EF((p654==0)))))) + AX(((EG...301
=> equivalent forward existential formula: [(((EY((Init * !(!(E(TRUE U !(E(!((E(!(!(EG(!((p371==1))))) U (!(((((p29==0)||(p825==1))||(p5==1)) * EX((p657==1...575
Reverse transition relation is NOT exact ! Due to transitions t68, t81, t82, t97, t106, t131, t160, t161, t162, t166, t216, t219, t253, t256, t278, t287, t...422
Detected timeout of ITS tools.
[2026-05-25 10:35:21] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:35:21] [INFO ] Applying decomposition
[2026-05-25 10:35:21] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2746495252910923049.txt' '-o' '/tmp/graph2746495252910923049.bin' '-w' '/tmp/graph2746495252910923049.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2746495252910923049.bin' '-l' '-1' '-v' '-w' '/tmp/graph2746495252910923049.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:35:21] [INFO ] Decomposing Gal with order
[2026-05-25 10:35:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:35:21] [INFO ] Removed a total of 371 redundant transitions.
[2026-05-25 10:35:21] [INFO ] Flatten gal took : 46 ms
[2026-05-25 10:35:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2026-05-25 10:35:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality870424516573304336.gal : 4 ms
[2026-05-25 10:35:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality4837226945697859935.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/CTLCardinality870424516573304336.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4837226945697859935.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 -...261
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.22034e+07,1.65795,64172,1381,21,116390,516,911,294060,51,1018,0


Converting to forward existential form...Done !
original formula: (AG(E(A(((((i22.u7.p29==0)||(i23.u228.p825==1))||(i0.u1.p5==1)) * EX((i21.u183.p657==1))) U AF((i22.u107.p371==1))) U (!(((i18.u140.p473=...471
=> equivalent forward existential formula: [(((EY((Init * !(!(E(TRUE U !(E(!((E(!(!(EG(!((i22.u107.p371==1))))) U (!(((((i22.u7.p29==0)||(i23.u228.p825==1)...827
Reverse transition relation is NOT exact ! Due to transitions t68, t131, t161, t162, t216, t219, t287, t399, t432, t512, t514, t567, t572, t587, t588, t594...521
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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 744/744 places, 856/856 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 718 transition count 830
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 718 transition count 830
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 70 place count 700 transition count 812
Iterating global reduction 0 with 18 rules applied. Total rules applied 88 place count 700 transition count 812
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 103 place count 685 transition count 797
Iterating global reduction 0 with 15 rules applied. Total rules applied 118 place count 685 transition count 797
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 131 place count 672 transition count 784
Iterating global reduction 0 with 13 rules applied. Total rules applied 144 place count 672 transition count 784
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 145 place count 672 transition count 783
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 156 place count 661 transition count 772
Iterating global reduction 1 with 11 rules applied. Total rules applied 167 place count 661 transition count 772
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 177 place count 651 transition count 762
Iterating global reduction 1 with 10 rules applied. Total rules applied 187 place count 651 transition count 762
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 188 place count 651 transition count 761
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 195 place count 644 transition count 754
Iterating global reduction 2 with 7 rules applied. Total rules applied 202 place count 644 transition count 754
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 208 place count 638 transition count 748
Iterating global reduction 2 with 6 rules applied. Total rules applied 214 place count 638 transition count 748
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 219 place count 633 transition count 743
Iterating global reduction 2 with 5 rules applied. Total rules applied 224 place count 633 transition count 743
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 228 place count 629 transition count 739
Iterating global reduction 2 with 4 rules applied. Total rules applied 232 place count 629 transition count 739
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 235 place count 626 transition count 736
Iterating global reduction 2 with 3 rules applied. Total rules applied 238 place count 626 transition count 736
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 240 place count 624 transition count 734
Iterating global reduction 2 with 2 rules applied. Total rules applied 242 place count 624 transition count 734
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 244 place count 622 transition count 732
Iterating global reduction 2 with 2 rules applied. Total rules applied 246 place count 622 transition count 732
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 248 place count 620 transition count 730
Iterating global reduction 2 with 2 rules applied. Total rules applied 250 place count 620 transition count 730
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 252 place count 618 transition count 728
Iterating global reduction 2 with 2 rules applied. Total rules applied 254 place count 618 transition count 728
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 256 place count 616 transition count 726
Iterating global reduction 2 with 2 rules applied. Total rules applied 258 place count 616 transition count 726
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 260 place count 614 transition count 724
Iterating global reduction 2 with 2 rules applied. Total rules applied 262 place count 614 transition count 724
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 264 place count 612 transition count 722
Iterating global reduction 2 with 2 rules applied. Total rules applied 266 place count 612 transition count 722
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 268 place count 612 transition count 720
Applied a total of 268 rules in 368 ms. Remains 612 /744 variables (removed 132) and now considering 720/856 (removed 136) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8816125848637224158.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7739185648123484272.kers'
[2026-05-25 10:35:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8816125848637224158.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7739185648123484272.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 720 rows 612 cols 1781 entries
Finished phase 1 with 608 SingleSign rule and 0 generalized
[2026-05-25 10:35:51] [INFO ] Computed 4 invariants in 8 ms
Computed 4 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-7739185648123484272.kers
Total runtime 11 ms.
[2026-05-25 10:35:52] [INFO ] Implicit Places using invariants in 313 ms returned []
[2026-05-25 10:35:52] [INFO ] Invariant cache hit.
[2026-05-25 10:35:52] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 897 ms to find 0 implicit places.
Running 719 sub problems to find dead transitions.
[2026-05-25 10:35:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (OVERLAPS) 1/612 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 719 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 612/1332 variables, and 4 constraints, problems are : Problem set: 0 solved, 719 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/612 constraints, PredecessorRefiner: 719/719 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 719 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (OVERLAPS) 1/612 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 719 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 612/1332 variables, and 8 constraints, problems are : Problem set: 0 solved, 719 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/612 constraints, PredecessorRefiner: 0/719 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60171ms problems are : Problem set: 0 solved, 719 unsolved
Search for dead transitions found 0 dead transitions in 60175ms
Starting structural reductions in LTL mode, iteration 1 : 612/744 places, 720/856 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61443 ms. Remains : 612/744 places, 720/856 transitions.
[2026-05-25 10:36:52] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:36:52] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:36:52] [INFO ] Input system was already deterministic with 720 transitions.
[2026-05-25 10:36:52] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:36:53] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:36:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality1908432516270132502.gal : 2 ms
[2026-05-25 10:36:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality5842256588270413895.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/CTLCardinality1908432516270132502.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5842256588270413895.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,6.97583e+07,3.45942,102768,2,12754,5,322620,6,0,3170,440273,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 10:37:23] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:37:23] [INFO ] Applying decomposition
[2026-05-25 10:37:23] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12278123475436250522.txt' '-o' '/tmp/graph12278123475436250522.bin' '-w' '/tmp/graph12278123475436250522.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12278123475436250522.bin' '-l' '-1' '-v' '-w' '/tmp/graph12278123475436250522.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:37:23] [INFO ] Decomposing Gal with order
[2026-05-25 10:37:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:37:23] [INFO ] Removed a total of 387 redundant transitions.
[2026-05-25 10:37:23] [INFO ] Flatten gal took : 18 ms
[2026-05-25 10:37:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2026-05-25 10:37:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality16505894729168056247.gal : 3 ms
[2026-05-25 10:37:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality2101361950459185306.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/CTLCardinality16505894729168056247.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2101361950459185306.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.97583e+07,0.399343,18436,1120,24,27041,504,993,47466,75,968,0


Converting to forward existential form...Done !
original formula: (A(((i18.u140.p567==0)||(i3.i1.i0.u19.p57==1)) U AX(EG((i22.i1.i0.u186.p709==1)))) + EF(AG(((i6.u62.p243==0)&&(i24.u201.p794==0)))))
=> equivalent forward existential formula: ([((Init * !(EG(!(!(EX(!(EG((i22.i1.i0.u186.p709==1))))))))) * !(E(!(!(EX(!(EG((i22.i1.i0.u186.p709==1)))))) U (...348
Reverse transition relation is NOT exact ! Due to transitions t159, t215, t249, t276, t384, t387, t420, t452, t507, t579, t580, t586, t589, t594, t597, t60...516
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
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 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
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found a local SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
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 an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found a local SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
(forward)formula 0,1,14.1455,427028,1,0,760979,629,8766,1.99923e+06,401,2709,1643164
FORMULA MedleyB-PT-B01-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 10:37:37] [INFO ] Flatten gal took : 11 ms
[2026-05-25 10:37:37] [INFO ] Flatten gal took : 10 ms
[2026-05-25 10:37:37] [INFO ] Applying decomposition
[2026-05-25 10:37:37] [INFO ] Flatten gal took : 11 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/graph16614852898759144535.txt' '-o' '/tmp/graph16614852898759144535.bin' '-w' '/tmp/graph16614852898759144535.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16614852898759144535.bin' '-l' '-1' '-v' '-w' '/tmp/graph16614852898759144535.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:37:37] [INFO ] Decomposing Gal with order
[2026-05-25 10:37:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:37:37] [INFO ] Removed a total of 385 redundant transitions.
[2026-05-25 10:37:37] [INFO ] Flatten gal took : 25 ms
[2026-05-25 10:37:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2026-05-25 10:37:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality16249519646747320759.gal : 6 ms
[2026-05-25 10:37:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality1391891599538234738.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/CTLCardinality16249519646747320759.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1391891599538234738.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 4 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.12373e+08,2.13491,65340,1782,32,125896,945,1039,265833,67,2849,0


Converting to forward existential form...Done !
original formula: EG((AG(EX(E((i33.u287.p906==0) U (i21.u174.p567==1)))) + EX(((i32.u240.p740==0)||(i29.u259.p819==1)))))
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !(EX(E((i33.u287.p906==0) U (i21.u174.p567==1)))))) + EX(((i32.u240.p740==0)||(i29.u259.p...176
Reverse transition relation is NOT exact ! Due to transitions t17, t26, t163, t197, t198, t253, t254, t255, t359, t413, t414, t470, t471, t472, t505, t555,...650
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 an SCC at level 3
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
(forward)formula 0,1,70.4503,1615308,1,0,1.89371e+06,945,8798,1.34981e+07,306,2849,3018656
FORMULA MedleyB-PT-B01-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
ITS-tools command line returned an error code 139
[2026-05-25 10:40:05] [INFO ] Applying decomposition
[2026-05-25 10:40:05] [INFO ] Flatten gal took : 10 ms
[2026-05-25 10:40:05] [INFO ] Decomposing Gal with order
[2026-05-25 10:40:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:40:05] [INFO ] Removed a total of 218 redundant transitions.
[2026-05-25 10:40:05] [INFO ] Flatten gal took : 20 ms
[2026-05-25 10:40:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 167 labels/synchronizations in 2 ms.
[2026-05-25 10:40:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality5808305252162884414.gal : 3 ms
[2026-05-25 10:40:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality2708010598189924489.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/CTLCardinality5808305252162884414.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2708010598189924489.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 3 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.12373e+08,1.96765,66956,143,8635,4550,147392,101,15357,1766,884956,0


Converting to forward existential form...Done !
original formula: A((!((E((i0.i0.u4.p338!=1) U ((i0.i0.u4.p571!=0)||((i0.u5.p798==1)&&((i0.i0.u4.p419==0)||(i0.i0.u4.p354==1))))) + A((i0.i0.u3.p301==0) U ...495
=> equivalent forward existential formula: [((Init * !(EG(!((E(TRUE U ((((i0.i0.u3.p132==0)||(i0.i0.u4.p528==1))||((i0.i0.u4.p461==0)||(i0.u5.p745==1))) * ...1387
Reverse transition relation is NOT exact ! Due to transitions t699, u6.t29, u6.t35, i0.u5.t26, i0.u5.t27, i0.u5.t73, i0.u5.t81, i0.u5.t96, i0.u5.t109, i0.u...829
Detected timeout of ITS tools.
[2026-05-25 11:06:29] [INFO ] Flatten gal took : 339 ms
[2026-05-25 11:06:33] [INFO ] Input system was already deterministic with 856 transitions.
[2026-05-25 11:06:33] [INFO ] Transformed 744 places.
[2026-05-25 11:06:33] [INFO ] Transformed 856 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-25 11:06:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality9275362819231403992.gal : 11 ms
[2026-05-25 11:06:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality1531961792869942338.ctl : 12 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/CTLCardinality9275362819231403992.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1531961792869942338.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 3 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.12373e+08,5.46884,117980,2,19269,5,416897,6,0,3834,326291,0


Converting to forward existential form...Done !
original formula: A((!((E((p338!=1) U ((p571!=0)||((p798==1)&&((p419==0)||(p354==1))))) + A((p301==0) U E((p425==1) U (p828==1))))) + EX(TRUE)) U (EF(((((p...330
=> equivalent forward existential formula: [((Init * !(EG(!((E(TRUE U ((((p132==0)||(p528==1))||((p461==0)||(p745==1))) * !(E(TRUE U !((p775==0)))))) + (E(...994
Reverse transition relation is NOT exact ! Due to transitions t17, t26, t27, t29, t35, t73, t81, t96, t109, t119, t123, t128, t163, t197, t198, t202, t252,...478

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="MedleyB-PT-B01"
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 MedleyB-PT-B01, 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-177969020000281"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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