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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K Mar 7 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 7 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 7 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 7 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 11:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 11:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Mar 7 18:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Mar 7 18:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Mar 7 18:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Mar 7 18:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:33 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 626K 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-B03-CTLCardinality-2024-00
FORMULA_NAME MedleyB-PT-B03-CTLCardinality-2024-01
FORMULA_NAME MedleyB-PT-B03-CTLCardinality-2024-02
FORMULA_NAME MedleyB-PT-B03-CTLCardinality-2024-03
FORMULA_NAME MedleyB-PT-B03-CTLCardinality-2024-04
FORMULA_NAME MedleyB-PT-B03-CTLCardinality-2024-05
FORMULA_NAME MedleyB-PT-B03-CTLCardinality-2024-06
FORMULA_NAME MedleyB-PT-B03-CTLCardinality-2024-07
FORMULA_NAME MedleyB-PT-B03-CTLCardinality-2024-08
FORMULA_NAME MedleyB-PT-B03-CTLCardinality-2024-09
FORMULA_NAME MedleyB-PT-B03-CTLCardinality-2024-10
FORMULA_NAME MedleyB-PT-B03-CTLCardinality-2024-11
FORMULA_NAME MedleyB-PT-B03-CTLCardinality-2024-12
FORMULA_NAME MedleyB-PT-B03-CTLCardinality-2024-13
FORMULA_NAME MedleyB-PT-B03-CTLCardinality-2024-14
FORMULA_NAME MedleyB-PT-B03-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779705281298

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-B03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-25 10:34:42] [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:34:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 10:34:42] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2026-05-25 10:34:42] [INFO ] Transformed 1529 places.
[2026-05-25 10:34:42] [INFO ] Transformed 2131 transitions.
[2026-05-25 10:34:42] [INFO ] Found NUPN structural information;
[2026-05-25 10:34:42] [INFO ] Parsed PT model containing 1529 places and 2131 transitions and 8591 arcs in 276 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
FORMULA MedleyB-PT-B03-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B03-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 99 out of 1529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1529/1529 places, 2131/2131 transitions.
Discarding 113 places :
Symmetric choice reduction at 0 with 113 rule applications. Total rules 113 place count 1416 transition count 2018
Iterating global reduction 0 with 113 rules applied. Total rules applied 226 place count 1416 transition count 2018
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 287 place count 1355 transition count 1957
Iterating global reduction 0 with 61 rules applied. Total rules applied 348 place count 1355 transition count 1957
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 379 place count 1324 transition count 1926
Iterating global reduction 0 with 31 rules applied. Total rules applied 410 place count 1324 transition count 1926
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 435 place count 1299 transition count 1901
Iterating global reduction 0 with 25 rules applied. Total rules applied 460 place count 1299 transition count 1901
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 479 place count 1280 transition count 1882
Iterating global reduction 0 with 19 rules applied. Total rules applied 498 place count 1280 transition count 1882
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 515 place count 1263 transition count 1865
Iterating global reduction 0 with 17 rules applied. Total rules applied 532 place count 1263 transition count 1865
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 548 place count 1247 transition count 1849
Iterating global reduction 0 with 16 rules applied. Total rules applied 564 place count 1247 transition count 1849
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 579 place count 1232 transition count 1834
Iterating global reduction 0 with 15 rules applied. Total rules applied 594 place count 1232 transition count 1834
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 607 place count 1219 transition count 1821
Iterating global reduction 0 with 13 rules applied. Total rules applied 620 place count 1219 transition count 1821
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 629 place count 1210 transition count 1812
Iterating global reduction 0 with 9 rules applied. Total rules applied 638 place count 1210 transition count 1812
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 640 place count 1208 transition count 1810
Iterating global reduction 0 with 2 rules applied. Total rules applied 642 place count 1208 transition count 1810
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 644 place count 1206 transition count 1808
Iterating global reduction 0 with 2 rules applied. Total rules applied 646 place count 1206 transition count 1808
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 647 place count 1205 transition count 1807
Iterating global reduction 0 with 1 rules applied. Total rules applied 648 place count 1205 transition count 1807
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 649 place count 1204 transition count 1806
Iterating global reduction 0 with 1 rules applied. Total rules applied 650 place count 1204 transition count 1806
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 651 place count 1203 transition count 1805
Iterating global reduction 0 with 1 rules applied. Total rules applied 652 place count 1203 transition count 1805
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 653 place count 1202 transition count 1804
Iterating global reduction 0 with 1 rules applied. Total rules applied 654 place count 1202 transition count 1804
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 655 place count 1201 transition count 1803
Iterating global reduction 0 with 1 rules applied. Total rules applied 656 place count 1201 transition count 1803
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 657 place count 1200 transition count 1802
Iterating global reduction 0 with 1 rules applied. Total rules applied 658 place count 1200 transition count 1802
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 659 place count 1199 transition count 1801
Iterating global reduction 0 with 1 rules applied. Total rules applied 660 place count 1199 transition count 1801
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 661 place count 1198 transition count 1800
Iterating global reduction 0 with 1 rules applied. Total rules applied 662 place count 1198 transition count 1800
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 663 place count 1197 transition count 1799
Iterating global reduction 0 with 1 rules applied. Total rules applied 664 place count 1197 transition count 1799
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 665 place count 1196 transition count 1798
Iterating global reduction 0 with 1 rules applied. Total rules applied 666 place count 1196 transition count 1798
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 667 place count 1196 transition count 1797
Applied a total of 667 rules in 1717 ms. Remains 1196 /1529 variables (removed 333) and now considering 1797/2131 (removed 334) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15634921225981603320.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10933316909484789791.kers'
[2026-05-25 10:34:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15634921225981603320.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10933316909484789791.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1797 rows 1196 cols 7913 entries
Finished phase 1 with 1190 SingleSign rule and 0 generalized
[2026-05-25 10:34:44] [INFO ] Computed 6 invariants in 10 ms
Computed 6 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-10933316909484789791.kers
Total runtime 12 ms.
[2026-05-25 10:34:46] [INFO ] Implicit Places using invariants in 1288 ms returned []
[2026-05-25 10:34:46] [INFO ] Invariant cache hit.
[2026-05-25 10:34:47] [INFO ] Implicit Places using invariants and state equation in 1687 ms returned []
Implicit Place search using SMT with State Equation took 3027 ms to find 0 implicit places.
Running 1796 sub problems to find dead transitions.
[2026-05-25 10:34:47] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1195/2993 variables, and 0 constraints, problems are : Problem set: 0 solved, 1796 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1196 constraints, PredecessorRefiner: 1796/1796 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1796 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1195/2993 variables, and 0 constraints, problems are : Problem set: 0 solved, 1796 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1196 constraints, PredecessorRefiner: 0/1796 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61629ms problems are : Problem set: 0 solved, 1796 unsolved
Search for dead transitions found 0 dead transitions in 61663ms
Starting structural reductions in LTL mode, iteration 1 : 1196/1529 places, 1797/2131 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66478 ms. Remains : 1196/1529 places, 1797/2131 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1196/1196 places, 1797/1797 transitions.
Applied a total of 0 rules in 47 ms. Remains 1196 /1196 variables (removed 0) and now considering 1797/1797 (removed 0) transitions.
[2026-05-25 10:35:49] [INFO ] Invariant cache hit.
[2026-05-25 10:35:50] [INFO ] Implicit Places using invariants in 971 ms returned []
[2026-05-25 10:35:50] [INFO ] Invariant cache hit.
[2026-05-25 10:35:52] [INFO ] Implicit Places using invariants and state equation in 1439 ms returned []
Implicit Place search using SMT with State Equation took 2411 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2459 ms. Remains : 1196/1196 places, 1797/1797 transitions.
Support contains 99 out of 1196 places after structural reductions.
[2026-05-25 10:35:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-25 10:35:52] [INFO ] Flatten gal took : 144 ms
[2026-05-25 10:35:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyB-PT-B03-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B03-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 10:35:52] [INFO ] Flatten gal took : 94 ms
[2026-05-25 10:35:52] [INFO ] Input system was already deterministic with 1797 transitions.
Support contains 72 out of 1196 places (down from 99) after GAL structural reductions.
RANDOM walk for 40000 steps (416 resets) in 1330 ms. (30 steps per ms) remains 27/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 78 ms. (50 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 27/27 properties
[2026-05-25 10:35:53] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 1137/1182 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1182 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 14/1196 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1196 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 1797/2993 variables, 1196/1202 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2993 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2993/2993 variables, and 1202 constraints, problems are : Problem set: 0 solved, 27 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 1196/1196 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 1137/1182 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 27 unsolved
SMT process timed out in 10340ms, After SMT, problems are : Problem set: 0 solved, 27 unsolved
Fused 27 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 45 out of 1196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1196/1196 places, 1797/1797 transitions.
Graph (trivial) has 1101 edges and 1196 vertex of which 66 / 1196 are part of one of the 13 SCC in 8 ms
Free SCC test removed 53 places
Drop transitions (Empty/Sink Transition effects.) removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Graph (complete) has 1854 edges and 1143 vertex of which 1138 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 787 transitions
Trivial Post-agglo rules discarded 787 transitions
Performed 787 trivial Post agglomeration. Transition count delta: 787
Iterating post reduction 0 with 792 rules applied. Total rules applied 794 place count 1138 transition count 932
Reduce places removed 787 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 807 rules applied. Total rules applied 1601 place count 351 transition count 912
Reduce places removed 10 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 2 with 28 rules applied. Total rules applied 1629 place count 341 transition count 894
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 1647 place count 323 transition count 894
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 64 Pre rules applied. Total rules applied 1647 place count 323 transition count 830
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 4 with 128 rules applied. Total rules applied 1775 place count 259 transition count 830
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1781 place count 253 transition count 824
Iterating global reduction 4 with 6 rules applied. Total rules applied 1787 place count 253 transition count 824
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1788 place count 252 transition count 823
Iterating global reduction 4 with 1 rules applied. Total rules applied 1789 place count 252 transition count 823
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 1859 place count 217 transition count 788
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1862 place count 217 transition count 785
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 1885 place count 194 transition count 341
Iterating global reduction 5 with 23 rules applied. Total rules applied 1908 place count 194 transition count 341
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1919 place count 194 transition count 330
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1927 place count 186 transition count 322
Iterating global reduction 6 with 8 rules applied. Total rules applied 1935 place count 186 transition count 322
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1939 place count 182 transition count 318
Iterating global reduction 6 with 4 rules applied. Total rules applied 1943 place count 182 transition count 318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1945 place count 182 transition count 316
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 1959 place count 175 transition count 309
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 1971 place count 169 transition count 314
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1974 place count 169 transition count 311
Free-agglomeration rule applied 42 times.
Iterating global reduction 8 with 42 rules applied. Total rules applied 2016 place count 169 transition count 269
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 8 with 42 rules applied. Total rules applied 2058 place count 127 transition count 269
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 2062 place count 123 transition count 265
Iterating global reduction 9 with 4 rules applied. Total rules applied 2066 place count 123 transition count 265
Drop transitions (Redundant composition of simpler transitions.) removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 9 with 35 rules applied. Total rules applied 2101 place count 123 transition count 230
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2102 place count 123 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2103 place count 122 transition count 229
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 2109 place count 122 transition count 229
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 2112 place count 122 transition count 226
Applied a total of 2112 rules in 277 ms. Remains 122 /1196 variables (removed 1074) and now considering 226/1797 (removed 1571) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 278 ms. Remains : 122/1196 places, 226/1797 transitions.
RANDOM walk for 40000 steps (1485 resets) in 546 ms. (73 steps per ms) remains 2/27 properties
BEST_FIRST walk for 40004 steps (262 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (277 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8995133942520272202.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15293694535106364330.kers'
[2026-05-25 10:36:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8995133942520272202.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15293694535106364330.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 226 rows 121 cols 804 entries
Finished phase 1 with 116 SingleSign rule and 0 generalized
[2026-05-25 10:36:04] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15293694535106364330.kers
Total runtime 1 ms.
[2026-05-25 10:36:04] [INFO ] State equation strengthened by 114 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 74/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 43/122 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 226/348 variables, 122/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 114/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/348 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 242 constraints, problems are : Problem set: 0 solved, 2 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 122/122 constraints, ReadFeed: 114/114 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 74/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp33 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 43/122 variables, 3/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 226/348 variables, 122/129 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 114/243 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 1/244 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 0/244 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/348 variables, 0/244 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 244 constraints, problems are : Problem set: 1 solved, 1 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 122/122 constraints, ReadFeed: 114/114 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 459ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 18 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 11 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyB-PT-B03-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 10:36:04] [INFO ] Flatten gal took : 52 ms
[2026-05-25 10:36:04] [INFO ] Flatten gal took : 47 ms
[2026-05-25 10:36:05] [INFO ] Input system was already deterministic with 1797 transitions.
Computed a total of 213 stabilizing places and 223 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1196/1196 places, 1797/1797 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1170 transition count 1771
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1170 transition count 1771
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 74 place count 1148 transition count 1749
Iterating global reduction 0 with 22 rules applied. Total rules applied 96 place count 1148 transition count 1749
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 113 place count 1131 transition count 1732
Iterating global reduction 0 with 17 rules applied. Total rules applied 130 place count 1131 transition count 1732
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 144 place count 1117 transition count 1718
Iterating global reduction 0 with 14 rules applied. Total rules applied 158 place count 1117 transition count 1718
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 171 place count 1104 transition count 1705
Iterating global reduction 0 with 13 rules applied. Total rules applied 184 place count 1104 transition count 1705
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 185 place count 1104 transition count 1704
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 195 place count 1094 transition count 1694
Iterating global reduction 1 with 10 rules applied. Total rules applied 205 place count 1094 transition count 1694
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 214 place count 1085 transition count 1685
Iterating global reduction 1 with 9 rules applied. Total rules applied 223 place count 1085 transition count 1685
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 231 place count 1077 transition count 1677
Iterating global reduction 1 with 8 rules applied. Total rules applied 239 place count 1077 transition count 1677
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 247 place count 1069 transition count 1669
Iterating global reduction 1 with 8 rules applied. Total rules applied 255 place count 1069 transition count 1669
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 257 place count 1069 transition count 1667
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 261 place count 1065 transition count 1663
Iterating global reduction 2 with 4 rules applied. Total rules applied 265 place count 1065 transition count 1663
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 267 place count 1065 transition count 1661
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 269 place count 1063 transition count 1659
Iterating global reduction 3 with 2 rules applied. Total rules applied 271 place count 1063 transition count 1659
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 273 place count 1061 transition count 1657
Iterating global reduction 3 with 2 rules applied. Total rules applied 275 place count 1061 transition count 1657
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 277 place count 1059 transition count 1655
Iterating global reduction 3 with 2 rules applied. Total rules applied 279 place count 1059 transition count 1655
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 281 place count 1057 transition count 1653
Iterating global reduction 3 with 2 rules applied. Total rules applied 283 place count 1057 transition count 1653
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 285 place count 1055 transition count 1651
Iterating global reduction 3 with 2 rules applied. Total rules applied 287 place count 1055 transition count 1651
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 289 place count 1053 transition count 1649
Iterating global reduction 3 with 2 rules applied. Total rules applied 291 place count 1053 transition count 1649
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 293 place count 1051 transition count 1647
Iterating global reduction 3 with 2 rules applied. Total rules applied 295 place count 1051 transition count 1647
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 296 place count 1051 transition count 1646
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 297 place count 1050 transition count 1645
Iterating global reduction 4 with 1 rules applied. Total rules applied 298 place count 1050 transition count 1645
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 299 place count 1050 transition count 1644
Applied a total of 299 rules in 720 ms. Remains 1050 /1196 variables (removed 146) and now considering 1644/1797 (removed 153) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1129372211069917390.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10472970681732420681.kers'
[2026-05-25 10:36:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1129372211069917390.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10472970681732420681.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1644 rows 1050 cols 7589 entries
Finished phase 1 with 1044 SingleSign rule and 0 generalized
[2026-05-25 10:36:05] [INFO ] Computed 6 invariants in 34 ms
Computed 6 P flows in 34 ms.
Exported basis to /tmp/petrispot-output-10472970681732420681.kers
Total runtime 36 ms.
[2026-05-25 10:36:06] [INFO ] Implicit Places using invariants in 623 ms returned []
[2026-05-25 10:36:06] [INFO ] Invariant cache hit.
[2026-05-25 10:36:07] [INFO ] Implicit Places using invariants and state equation in 1146 ms returned []
Implicit Place search using SMT with State Equation took 1771 ms to find 0 implicit places.
Running 1643 sub problems to find dead transitions.
[2026-05-25 10:36:07] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1049/2694 variables, and 0 constraints, problems are : Problem set: 0 solved, 1643 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1050 constraints, PredecessorRefiner: 1643/1643 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1643 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1049/2694 variables, and 0 constraints, problems are : Problem set: 0 solved, 1643 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1050 constraints, PredecessorRefiner: 0/1643 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61267ms problems are : Problem set: 0 solved, 1643 unsolved
Search for dead transitions found 0 dead transitions in 61280ms
Starting structural reductions in LTL mode, iteration 1 : 1050/1196 places, 1644/1797 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63783 ms. Remains : 1050/1196 places, 1644/1797 transitions.
[2026-05-25 10:37:08] [INFO ] Flatten gal took : 51 ms
[2026-05-25 10:37:09] [INFO ] Flatten gal took : 52 ms
[2026-05-25 10:37:09] [INFO ] Input system was already deterministic with 1644 transitions.
[2026-05-25 10:37:09] [INFO ] Flatten gal took : 45 ms
[2026-05-25 10:37:09] [INFO ] Flatten gal took : 53 ms
[2026-05-25 10:37:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality18181134011194859980.gal : 38 ms
[2026-05-25 10:37:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality5330996499610309845.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18181134011194859980.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5330996499610309845.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 10:37:39] [INFO ] Flatten gal took : 64 ms
[2026-05-25 10:37:39] [INFO ] Applying decomposition
[2026-05-25 10:37:39] [INFO ] Flatten gal took : 44 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/graph5445901618390294173.txt' '-o' '/tmp/graph5445901618390294173.bin' '-w' '/tmp/graph5445901618390294173.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5445901618390294173.bin' '-l' '-1' '-v' '-w' '/tmp/graph5445901618390294173.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:37:39] [INFO ] Decomposing Gal with order
[2026-05-25 10:37:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:37:40] [INFO ] Removed a total of 2819 redundant transitions.
[2026-05-25 10:37:40] [INFO ] Flatten gal took : 161 ms
[2026-05-25 10:37:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 31 ms.
[2026-05-25 10:37:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality9082004867910221742.gal : 19 ms
[2026-05-25 10:37:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality3339699681512108650.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/CTLCardinality9082004867910221742.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3339699681512108650.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1196/1196 places, 1797/1797 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 1166 transition count 1767
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 1166 transition count 1767
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 86 place count 1140 transition count 1741
Iterating global reduction 0 with 26 rules applied. Total rules applied 112 place count 1140 transition count 1741
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 132 place count 1120 transition count 1721
Iterating global reduction 0 with 20 rules applied. Total rules applied 152 place count 1120 transition count 1721
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 169 place count 1103 transition count 1704
Iterating global reduction 0 with 17 rules applied. Total rules applied 186 place count 1103 transition count 1704
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 202 place count 1087 transition count 1688
Iterating global reduction 0 with 16 rules applied. Total rules applied 218 place count 1087 transition count 1688
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 232 place count 1073 transition count 1674
Iterating global reduction 0 with 14 rules applied. Total rules applied 246 place count 1073 transition count 1674
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 258 place count 1061 transition count 1662
Iterating global reduction 0 with 12 rules applied. Total rules applied 270 place count 1061 transition count 1662
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 281 place count 1050 transition count 1651
Iterating global reduction 0 with 11 rules applied. Total rules applied 292 place count 1050 transition count 1651
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 302 place count 1040 transition count 1641
Iterating global reduction 0 with 10 rules applied. Total rules applied 312 place count 1040 transition count 1641
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 313 place count 1040 transition count 1640
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 320 place count 1033 transition count 1633
Iterating global reduction 1 with 7 rules applied. Total rules applied 327 place count 1033 transition count 1633
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 329 place count 1033 transition count 1631
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 333 place count 1029 transition count 1627
Iterating global reduction 2 with 4 rules applied. Total rules applied 337 place count 1029 transition count 1627
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 341 place count 1025 transition count 1623
Iterating global reduction 2 with 4 rules applied. Total rules applied 345 place count 1025 transition count 1623
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 349 place count 1021 transition count 1619
Iterating global reduction 2 with 4 rules applied. Total rules applied 353 place count 1021 transition count 1619
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 357 place count 1017 transition count 1615
Iterating global reduction 2 with 4 rules applied. Total rules applied 361 place count 1017 transition count 1615
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 365 place count 1013 transition count 1611
Iterating global reduction 2 with 4 rules applied. Total rules applied 369 place count 1013 transition count 1611
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 373 place count 1009 transition count 1607
Iterating global reduction 2 with 4 rules applied. Total rules applied 377 place count 1009 transition count 1607
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 381 place count 1005 transition count 1603
Iterating global reduction 2 with 4 rules applied. Total rules applied 385 place count 1005 transition count 1603
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 386 place count 1005 transition count 1602
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 389 place count 1002 transition count 1599
Iterating global reduction 3 with 3 rules applied. Total rules applied 392 place count 1002 transition count 1599
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 393 place count 1002 transition count 1598
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 395 place count 1000 transition count 1596
Iterating global reduction 4 with 2 rules applied. Total rules applied 397 place count 1000 transition count 1596
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 399 place count 998 transition count 1594
Iterating global reduction 4 with 2 rules applied. Total rules applied 401 place count 998 transition count 1594
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 403 place count 996 transition count 1592
Iterating global reduction 4 with 2 rules applied. Total rules applied 405 place count 996 transition count 1592
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 407 place count 994 transition count 1590
Iterating global reduction 4 with 2 rules applied. Total rules applied 409 place count 994 transition count 1590
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 411 place count 994 transition count 1588
Applied a total of 411 rules in 841 ms. Remains 994 /1196 variables (removed 202) and now considering 1588/1797 (removed 209) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8180337471046245598.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8908149790782410445.kers'
[2026-05-25 10:38:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8180337471046245598.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8908149790782410445.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1588 rows 994 cols 7465 entries
Finished phase 1 with 988 SingleSign rule and 0 generalized
[2026-05-25 10:38:11] [INFO ] Computed 6 invariants in 25 ms
Computed 6 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-8908149790782410445.kers
Total runtime 30 ms.
[2026-05-25 10:38:11] [INFO ] Implicit Places using invariants in 818 ms returned []
[2026-05-25 10:38:11] [INFO ] Invariant cache hit.
[2026-05-25 10:38:13] [INFO ] Implicit Places using invariants and state equation in 1310 ms returned []
Implicit Place search using SMT with State Equation took 2169 ms to find 0 implicit places.
Running 1587 sub problems to find dead transitions.
[2026-05-25 10:38:13] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 993/2582 variables, and 0 constraints, problems are : Problem set: 0 solved, 1587 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/994 constraints, PredecessorRefiner: 1587/1587 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1587 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 993/2582 variables, and 0 constraints, problems are : Problem set: 0 solved, 1587 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/994 constraints, PredecessorRefiner: 0/1587 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61149ms problems are : Problem set: 0 solved, 1587 unsolved
Search for dead transitions found 0 dead transitions in 61154ms
Starting structural reductions in LTL mode, iteration 1 : 994/1196 places, 1588/1797 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64169 ms. Remains : 994/1196 places, 1588/1797 transitions.
[2026-05-25 10:39:14] [INFO ] Flatten gal took : 32 ms
[2026-05-25 10:39:14] [INFO ] Flatten gal took : 32 ms
[2026-05-25 10:39:14] [INFO ] Input system was already deterministic with 1588 transitions.
[2026-05-25 10:39:14] [INFO ] Flatten gal took : 29 ms
[2026-05-25 10:39:14] [INFO ] Flatten gal took : 31 ms
[2026-05-25 10:39:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality6749070729392168853.gal : 8 ms
[2026-05-25 10:39:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality2660686770003017198.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/CTLCardinality6749070729392168853.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2660686770003017198.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 10:39:44] [INFO ] Flatten gal took : 52 ms
[2026-05-25 10:39:44] [INFO ] Applying decomposition
[2026-05-25 10:39:44] [INFO ] Flatten gal took : 33 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/graph11199736391124685261.txt' '-o' '/tmp/graph11199736391124685261.bin' '-w' '/tmp/graph11199736391124685261.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11199736391124685261.bin' '-l' '-1' '-v' '-w' '/tmp/graph11199736391124685261.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:39:44] [INFO ] Decomposing Gal with order
[2026-05-25 10:39:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:39:45] [INFO ] Removed a total of 2816 redundant transitions.
[2026-05-25 10:39:45] [INFO ] Flatten gal took : 68 ms
[2026-05-25 10:39:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 18 ms.
[2026-05-25 10:39:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality2759290497269873668.gal : 9 ms
[2026-05-25 10:39:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality10399549799981318744.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/CTLCardinality2759290497269873668.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10399549799981318744.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.382e+12,23.1535,805968,4533,16,1.25452e+06,1646,1889,5.14719e+06,49,3998,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1196/1196 places, 1797/1797 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 1166 transition count 1767
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 1166 transition count 1767
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 86 place count 1140 transition count 1741
Iterating global reduction 0 with 26 rules applied. Total rules applied 112 place count 1140 transition count 1741
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 132 place count 1120 transition count 1721
Iterating global reduction 0 with 20 rules applied. Total rules applied 152 place count 1120 transition count 1721
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 169 place count 1103 transition count 1704
Iterating global reduction 0 with 17 rules applied. Total rules applied 186 place count 1103 transition count 1704
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 202 place count 1087 transition count 1688
Iterating global reduction 0 with 16 rules applied. Total rules applied 218 place count 1087 transition count 1688
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 219 place count 1087 transition count 1687
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 232 place count 1074 transition count 1674
Iterating global reduction 1 with 13 rules applied. Total rules applied 245 place count 1074 transition count 1674
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 256 place count 1063 transition count 1663
Iterating global reduction 1 with 11 rules applied. Total rules applied 267 place count 1063 transition count 1663
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 277 place count 1053 transition count 1653
Iterating global reduction 1 with 10 rules applied. Total rules applied 287 place count 1053 transition count 1653
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 296 place count 1044 transition count 1644
Iterating global reduction 1 with 9 rules applied. Total rules applied 305 place count 1044 transition count 1644
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 306 place count 1044 transition count 1643
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 312 place count 1038 transition count 1637
Iterating global reduction 2 with 6 rules applied. Total rules applied 318 place count 1038 transition count 1637
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 319 place count 1038 transition count 1636
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 323 place count 1034 transition count 1632
Iterating global reduction 3 with 4 rules applied. Total rules applied 327 place count 1034 transition count 1632
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 330 place count 1031 transition count 1629
Iterating global reduction 3 with 3 rules applied. Total rules applied 333 place count 1031 transition count 1629
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 336 place count 1028 transition count 1626
Iterating global reduction 3 with 3 rules applied. Total rules applied 339 place count 1028 transition count 1626
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 342 place count 1025 transition count 1623
Iterating global reduction 3 with 3 rules applied. Total rules applied 345 place count 1025 transition count 1623
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 348 place count 1022 transition count 1620
Iterating global reduction 3 with 3 rules applied. Total rules applied 351 place count 1022 transition count 1620
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 354 place count 1019 transition count 1617
Iterating global reduction 3 with 3 rules applied. Total rules applied 357 place count 1019 transition count 1617
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 360 place count 1016 transition count 1614
Iterating global reduction 3 with 3 rules applied. Total rules applied 363 place count 1016 transition count 1614
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 364 place count 1016 transition count 1613
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 366 place count 1014 transition count 1611
Iterating global reduction 4 with 2 rules applied. Total rules applied 368 place count 1014 transition count 1611
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 370 place count 1012 transition count 1609
Iterating global reduction 4 with 2 rules applied. Total rules applied 372 place count 1012 transition count 1609
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 374 place count 1010 transition count 1607
Iterating global reduction 4 with 2 rules applied. Total rules applied 376 place count 1010 transition count 1607
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 378 place count 1008 transition count 1605
Iterating global reduction 4 with 2 rules applied. Total rules applied 380 place count 1008 transition count 1605
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 382 place count 1006 transition count 1603
Iterating global reduction 4 with 2 rules applied. Total rules applied 384 place count 1006 transition count 1603
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 386 place count 1006 transition count 1601
Applied a total of 386 rules in 817 ms. Remains 1006 /1196 variables (removed 190) and now considering 1601/1797 (removed 196) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1236691864570599451.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4452898023971457452.kers'
[2026-05-25 10:40:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1236691864570599451.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4452898023971457452.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1601 rows 1006 cols 7493 entries
Finished phase 1 with 1000 SingleSign rule and 0 generalized
[2026-05-25 10:40:16] [INFO ] Computed 6 invariants in 18 ms
Computed 6 P flows in 32 ms.
Exported basis to /tmp/petrispot-output-4452898023971457452.kers
Total runtime 36 ms.
[2026-05-25 10:40:16] [INFO ] Implicit Places using invariants in 629 ms returned []
[2026-05-25 10:40:16] [INFO ] Invariant cache hit.
[2026-05-25 10:40:17] [INFO ] Implicit Places using invariants and state equation in 1192 ms returned []
Implicit Place search using SMT with State Equation took 1831 ms to find 0 implicit places.
Running 1600 sub problems to find dead transitions.
[2026-05-25 10:40:17] [INFO ] Invariant cache hit.
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 1005/2607 variables, and 0 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1006 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1005/2607 variables, and 0 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1006 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61289ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 61310ms
Starting structural reductions in LTL mode, iteration 1 : 1006/1196 places, 1601/1797 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63965 ms. Remains : 1006/1196 places, 1601/1797 transitions.
[2026-05-25 10:41:19] [INFO ] Flatten gal took : 28 ms
[2026-05-25 10:41:19] [INFO ] Flatten gal took : 27 ms
[2026-05-25 10:41:19] [INFO ] Input system was already deterministic with 1601 transitions.
[2026-05-25 10:41:19] [INFO ] Flatten gal took : 25 ms
[2026-05-25 10:41:19] [INFO ] Flatten gal took : 26 ms
[2026-05-25 10:41:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality17403765402016572835.gal : 8 ms
[2026-05-25 10:41:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality1658580599967403752.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/CTLCardinality17403765402016572835.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1658580599967403752.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 10:41:49] [INFO ] Flatten gal took : 47 ms
[2026-05-25 10:41:49] [INFO ] Applying decomposition
[2026-05-25 10:41:49] [INFO ] Flatten gal took : 30 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/graph10128619581691494095.txt' '-o' '/tmp/graph10128619581691494095.bin' '-w' '/tmp/graph10128619581691494095.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10128619581691494095.bin' '-l' '-1' '-v' '-w' '/tmp/graph10128619581691494095.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:41:49] [INFO ] Decomposing Gal with order
[2026-05-25 10:41:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:41:49] [INFO ] Removed a total of 2815 redundant transitions.
[2026-05-25 10:41:49] [INFO ] Flatten gal took : 65 ms
[2026-05-25 10:41:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 18 ms.
[2026-05-25 10:41:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality5574327361207818838.gal : 10 ms
[2026-05-25 10:41:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality16653846081280144910.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/CTLCardinality5574327361207818838.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16653846081280144910.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1196/1196 places, 1797/1797 transitions.
Graph (trivial) has 1187 edges and 1196 vertex of which 82 / 1196 are part of one of the 15 SCC in 7 ms
Free SCC test removed 67 places
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 859 transitions
Trivial Post-agglo rules discarded 859 transitions
Performed 859 trivial Post agglomeration. Transition count delta: 859
Iterating post reduction 0 with 859 rules applied. Total rules applied 860 place count 1128 transition count 860
Reduce places removed 859 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 872 rules applied. Total rules applied 1732 place count 269 transition count 847
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 1737 place count 264 transition count 847
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 59 Pre rules applied. Total rules applied 1737 place count 264 transition count 788
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1855 place count 205 transition count 788
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 1872 place count 188 transition count 770
Iterating global reduction 3 with 17 rules applied. Total rules applied 1889 place count 188 transition count 770
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1889 place count 188 transition count 769
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1891 place count 187 transition count 769
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1897 place count 181 transition count 762
Iterating global reduction 3 with 6 rules applied. Total rules applied 1903 place count 181 transition count 762
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1905 place count 181 transition count 760
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1907 place count 179 transition count 757
Iterating global reduction 4 with 2 rules applied. Total rules applied 1909 place count 179 transition count 757
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1910 place count 178 transition count 756
Iterating global reduction 4 with 1 rules applied. Total rules applied 1911 place count 178 transition count 756
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1912 place count 178 transition count 755
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 1972 place count 148 transition count 725
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1979 place count 148 transition count 718
Discarding 30 places :
Symmetric choice reduction at 6 with 30 rule applications. Total rules 2009 place count 118 transition count 272
Iterating global reduction 6 with 30 rules applied. Total rules applied 2039 place count 118 transition count 272
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 2052 place count 118 transition count 259
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 2068 place count 102 transition count 239
Iterating global reduction 7 with 16 rules applied. Total rules applied 2084 place count 102 transition count 239
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 2100 place count 86 transition count 219
Iterating global reduction 7 with 16 rules applied. Total rules applied 2116 place count 86 transition count 219
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 2123 place count 86 transition count 212
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 2125 place count 85 transition count 211
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2126 place count 84 transition count 206
Iterating global reduction 8 with 1 rules applied. Total rules applied 2127 place count 84 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2128 place count 84 transition count 205
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 2133 place count 84 transition count 200
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 2143 place count 79 transition count 195
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2144 place count 78 transition count 194
Applied a total of 2144 rules in 210 ms. Remains 78 /1196 variables (removed 1118) and now considering 194/1797 (removed 1603) transitions.
[2026-05-25 10:42:20] [INFO ] Flow matrix only has 188 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3450040720635205494.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3811192712756658429.kers'
[2026-05-25 10:42:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3450040720635205494.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3811192712756658429.kers]
Normalized transition count is 187 out of 188 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 187 rows 77 cols 988 entries
Finished phase 1 with 76 SingleSign rule and 0 generalized
[2026-05-25 10:42:20] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3811192712756658429.kers
Total runtime 1 ms.
[2026-05-25 10:42:20] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-25 10:42:20] [INFO ] Flow matrix only has 188 transitions (discarded 6 similar events)
[2026-05-25 10:42:20] [INFO ] Invariant cache hit.
[2026-05-25 10:42:20] [INFO ] State equation strengthened by 31 read => feed constraints.
[2026-05-25 10:42:20] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2026-05-25 10:42:20] [INFO ] Redundant transitions in 4 ms returned []
Running 182 sub problems to find dead transitions.
[2026-05-25 10:42:20] [INFO ] Flow matrix only has 188 transitions (discarded 6 similar events)
[2026-05-25 10:42:20] [INFO ] Invariant cache hit.
[2026-05-25 10:42:20] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 5/78 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (OVERLAPS) 187/265 variables, 78/102 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 30/132 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (OVERLAPS) 1/266 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/266 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (OVERLAPS) 0/266 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 133 constraints, problems are : Problem set: 0 solved, 182 unsolved in 15583 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 5/78 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (OVERLAPS) 187/265 variables, 78/106 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 30/136 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 182/318 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 14 (OVERLAPS) 1/266 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 266/266 variables, and 321 constraints, problems are : Problem set: 0 solved, 182 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45652ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 45652ms
Starting structural reductions in SI_CTL mode, iteration 1 : 78/1196 places, 194/1797 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46077 ms. Remains : 78/1196 places, 194/1797 transitions.
[2026-05-25 10:43:06] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:43:06] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:43:06] [INFO ] Input system was already deterministic with 194 transitions.
[2026-05-25 10:43:06] [INFO ] Flatten gal took : 6 ms
RANDOM walk for 1181 steps (104 resets) in 13 ms. (84 steps per ms) remains 0/1 properties
FORMULA MedleyB-PT-B03-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-25 10:43:06] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:43:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality593187637084688143.gal : 1 ms
[2026-05-25 10:43:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13241689165070622252.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality593187637084688143.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13241689165070622252.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 1196/1196 places, 1797/1797 transitions.
Graph (trivial) has 1179 edges and 1196 vertex of which 82 / 1196 are part of one of the 15 SCC in 2 ms
Free SCC test removed 67 places
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 848 transitions
Trivial Post-agglo rules discarded 848 transitions
Performed 848 trivial Post agglomeration. Transition count delta: 848
Iterating post reduction 0 with 848 rules applied. Total rules applied 849 place count 1128 transition count 871
Reduce places removed 848 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 861 rules applied. Total rules applied 1710 place count 280 transition count 858
Reduce places removed 5 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 10 rules applied. Total rules applied 1720 place count 275 transition count 853
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 1725 place count 270 transition count 853
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 57 Pre rules applied. Total rules applied 1725 place count 270 transition count 796
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 1839 place count 213 transition count 796
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 1856 place count 196 transition count 778
Iterating global reduction 4 with 17 rules applied. Total rules applied 1873 place count 196 transition count 778
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1873 place count 196 transition count 777
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 1875 place count 195 transition count 777
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1880 place count 190 transition count 771
Iterating global reduction 4 with 5 rules applied. Total rules applied 1885 place count 190 transition count 771
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1886 place count 190 transition count 770
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1888 place count 188 transition count 767
Iterating global reduction 5 with 2 rules applied. Total rules applied 1890 place count 188 transition count 767
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1891 place count 187 transition count 766
Iterating global reduction 5 with 1 rules applied. Total rules applied 1892 place count 187 transition count 766
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1893 place count 187 transition count 765
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 1953 place count 157 transition count 735
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1959 place count 157 transition count 729
Discarding 31 places :
Symmetric choice reduction at 7 with 31 rule applications. Total rules 1990 place count 126 transition count 282
Iterating global reduction 7 with 31 rules applied. Total rules applied 2021 place count 126 transition count 282
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 2034 place count 126 transition count 269
Discarding 17 places :
Symmetric choice reduction at 8 with 17 rule applications. Total rules 2051 place count 109 transition count 248
Iterating global reduction 8 with 17 rules applied. Total rules applied 2068 place count 109 transition count 248
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 2084 place count 93 transition count 228
Iterating global reduction 8 with 16 rules applied. Total rules applied 2100 place count 93 transition count 228
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 2107 place count 93 transition count 221
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 9 with 2 rules applied. Total rules applied 2109 place count 92 transition count 220
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2110 place count 91 transition count 215
Iterating global reduction 9 with 1 rules applied. Total rules applied 2111 place count 91 transition count 215
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 2116 place count 91 transition count 210
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 2126 place count 86 transition count 205
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2127 place count 85 transition count 204
Applied a total of 2127 rules in 142 ms. Remains 85 /1196 variables (removed 1111) and now considering 204/1797 (removed 1593) transitions.
[2026-05-25 10:43:06] [INFO ] Flow matrix only has 198 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18444967414895268294.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16568811183931582108.kers'
[2026-05-25 10:43:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18444967414895268294.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16568811183931582108.kers]
Normalized transition count is 197 out of 198 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 197 rows 85 cols 1014 entries
Finished phase 1 with 83 SingleSign rule and 0 generalized
[2026-05-25 10:43:06] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16568811183931582108.kers
Total runtime 1 ms.
[2026-05-25 10:43:06] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-25 10:43:06] [INFO ] Flow matrix only has 198 transitions (discarded 6 similar events)
[2026-05-25 10:43:06] [INFO ] Invariant cache hit.
[2026-05-25 10:43:06] [INFO ] State equation strengthened by 31 read => feed constraints.
[2026-05-25 10:43:06] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2026-05-25 10:43:06] [INFO ] Redundant transitions in 5 ms returned []
Running 191 sub problems to find dead transitions.
[2026-05-25 10:43:06] [INFO ] Flow matrix only has 198 transitions (discarded 6 similar events)
[2026-05-25 10:43:06] [INFO ] Invariant cache hit.
[2026-05-25 10:43:06] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (OVERLAPS) 5/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (OVERLAPS) 197/282 variables, 85/108 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 30/138 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 9 (OVERLAPS) 1/283 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 4/143 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 12 (OVERLAPS) 0/283 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 143 constraints, problems are : Problem set: 0 solved, 191 unsolved in 19888 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (OVERLAPS) 5/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (OVERLAPS) 197/282 variables, 85/113 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 191/334 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 12 (OVERLAPS) 1/283 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 283/283 variables, and 337 constraints, problems are : Problem set: 0 solved, 191 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49993ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 49994ms
Starting structural reductions in SI_CTL mode, iteration 1 : 85/1196 places, 204/1797 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50385 ms. Remains : 85/1196 places, 204/1797 transitions.
[2026-05-25 10:43:56] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:43:56] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:43:56] [INFO ] Input system was already deterministic with 204 transitions.
[2026-05-25 10:43:56] [INFO ] Flatten gal took : 4 ms
[2026-05-25 10:43:56] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:43:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality10985290382508044498.gal : 1 ms
[2026-05-25 10:43:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality2554446513220784014.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/CTLCardinality10985290382508044498.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2554446513220784014.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (EG(((p1055==0)||(p549==1))) + EG((AF(EG((p567==0))) + ((p571==0)&&(p1522==1)))))
=> equivalent forward existential formula: ([FwdG(Init,((p1055==0)||(p549==1)))] != FALSE + [FwdG(Init,(!(EG(!(EG((p567==0))))) + ((p571==0)&&(p1522==1))))...166
Hit Full ! (commute/partial/dont) 200/0/4
(forward)formula 0,1,6.16678,179932,1,0,39,619991,19,4,4408,626306,37
FORMULA MedleyB-PT-B03-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 1196/1196 places, 1797/1797 transitions.
Graph (trivial) has 1179 edges and 1196 vertex of which 80 / 1196 are part of one of the 15 SCC in 4 ms
Free SCC test removed 65 places
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 852 transitions
Trivial Post-agglo rules discarded 852 transitions
Performed 852 trivial Post agglomeration. Transition count delta: 852
Iterating post reduction 0 with 852 rules applied. Total rules applied 853 place count 1130 transition count 870
Reduce places removed 852 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 864 rules applied. Total rules applied 1717 place count 278 transition count 858
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 1724 place count 273 transition count 856
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1726 place count 271 transition count 856
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 58 Pre rules applied. Total rules applied 1726 place count 271 transition count 798
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1842 place count 213 transition count 798
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1858 place count 197 transition count 781
Iterating global reduction 4 with 16 rules applied. Total rules applied 1874 place count 197 transition count 781
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1874 place count 197 transition count 780
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 1876 place count 196 transition count 780
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1880 place count 192 transition count 775
Iterating global reduction 4 with 4 rules applied. Total rules applied 1884 place count 192 transition count 775
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1886 place count 192 transition count 773
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1887 place count 191 transition count 771
Iterating global reduction 5 with 1 rules applied. Total rules applied 1888 place count 191 transition count 771
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 1950 place count 160 transition count 740
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1957 place count 160 transition count 733
Discarding 30 places :
Symmetric choice reduction at 6 with 30 rule applications. Total rules 1987 place count 130 transition count 288
Iterating global reduction 6 with 30 rules applied. Total rules applied 2017 place count 130 transition count 288
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 2030 place count 130 transition count 275
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 2045 place count 115 transition count 257
Iterating global reduction 7 with 15 rules applied. Total rules applied 2060 place count 115 transition count 257
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 2075 place count 100 transition count 239
Iterating global reduction 7 with 15 rules applied. Total rules applied 2090 place count 100 transition count 239
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 2097 place count 100 transition count 232
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 2099 place count 99 transition count 231
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2100 place count 98 transition count 225
Iterating global reduction 8 with 1 rules applied. Total rules applied 2101 place count 98 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2102 place count 98 transition count 224
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 2108 place count 98 transition count 218
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 9 with 12 rules applied. Total rules applied 2120 place count 92 transition count 212
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2121 place count 91 transition count 211
Applied a total of 2121 rules in 163 ms. Remains 91 /1196 variables (removed 1105) and now considering 211/1797 (removed 1586) transitions.
[2026-05-25 10:44:02] [INFO ] Flow matrix only has 204 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11831926753443932113.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17654662501543707370.kers'
[2026-05-25 10:44:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11831926753443932113.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17654662501543707370.kers]
Normalized transition count is 203 out of 204 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 203 rows 90 cols 1021 entries
Finished phase 1 with 89 SingleSign rule and 0 generalized
[2026-05-25 10:44:02] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17654662501543707370.kers
Total runtime 2 ms.
[2026-05-25 10:44:03] [INFO ] Implicit Places using invariants in 170 ms returned []
[2026-05-25 10:44:03] [INFO ] Flow matrix only has 204 transitions (discarded 7 similar events)
[2026-05-25 10:44:03] [INFO ] Invariant cache hit.
[2026-05-25 10:44:03] [INFO ] State equation strengthened by 31 read => feed constraints.
[2026-05-25 10:44:03] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2026-05-25 10:44:03] [INFO ] Redundant transitions in 2 ms returned []
Running 200 sub problems to find dead transitions.
[2026-05-25 10:44:03] [INFO ] Flow matrix only has 204 transitions (discarded 7 similar events)
[2026-05-25 10:44:03] [INFO ] Invariant cache hit.
[2026-05-25 10:44:03] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 5/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 203/294 variables, 91/110 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 30/140 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (OVERLAPS) 1/295 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/295 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/295 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 11 (OVERLAPS) 0/295 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 142 constraints, problems are : Problem set: 0 solved, 200 unsolved in 18716 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 5/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 203/294 variables, 91/113 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 200/343 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/294 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/294 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 12 (OVERLAPS) 1/295 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/295 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 295/295 variables, and 346 constraints, problems are : Problem set: 0 solved, 200 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48788ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 48789ms
Starting structural reductions in SI_CTL mode, iteration 1 : 91/1196 places, 211/1797 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 49315 ms. Remains : 91/1196 places, 211/1797 transitions.
[2026-05-25 10:44:52] [INFO ] Flatten gal took : 25 ms
[2026-05-25 10:44:52] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:44:52] [INFO ] Input system was already deterministic with 211 transitions.
[2026-05-25 10:44:52] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:44:52] [INFO ] Flatten gal took : 4 ms
[2026-05-25 10:44:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality11344245469934784600.gal : 1 ms
[2026-05-25 10:44:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality16260792707843304277.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/CTLCardinality11344245469934784600.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16260792707843304277.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.39845e+06,0.690928,29948,2,7719,5,84521,6,0,564,70825,0


Converting to forward existential form...Done !
original formula: (EG(((p1143==0)&&(p1109==1))) + AF(AG(A((p795==1) U ((p1285==0)||(p1127==1))))))
=> equivalent forward existential formula: [FwdG((Init * !(EG(((p1143==0)&&(p1109==1))))),!(!(E(TRUE U !(!((E(!(((p1285==0)||(p1127==1))) U (!((p795==1)) *...235
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t7, t11, t15, t16, t23, t26, t27, t33, t34, t35, t37, t38, t39, t65, t66, t73, t7...395
(forward)formula 0,0,18.3482,511664,1,0,687,2.49436e+06,455,334,6306,1.76978e+06,741
FORMULA MedleyB-PT-B03-CTLCardinality-2024-08 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 : 1196/1196 places, 1797/1797 transitions.
Graph (trivial) has 1181 edges and 1196 vertex of which 82 / 1196 are part of one of the 15 SCC in 2 ms
Free SCC test removed 67 places
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 852 transitions
Trivial Post-agglo rules discarded 852 transitions
Performed 852 trivial Post agglomeration. Transition count delta: 852
Iterating post reduction 0 with 852 rules applied. Total rules applied 853 place count 1128 transition count 867
Reduce places removed 852 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 864 rules applied. Total rules applied 1717 place count 276 transition count 855
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 1724 place count 271 transition count 853
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1726 place count 269 transition count 853
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 59 Pre rules applied. Total rules applied 1726 place count 269 transition count 794
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 1844 place count 210 transition count 794
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 1861 place count 193 transition count 776
Iterating global reduction 4 with 17 rules applied. Total rules applied 1878 place count 193 transition count 776
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1878 place count 193 transition count 775
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 1880 place count 192 transition count 775
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1886 place count 186 transition count 768
Iterating global reduction 4 with 6 rules applied. Total rules applied 1892 place count 186 transition count 768
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1894 place count 186 transition count 766
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1896 place count 184 transition count 763
Iterating global reduction 5 with 2 rules applied. Total rules applied 1898 place count 184 transition count 763
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1899 place count 183 transition count 762
Iterating global reduction 5 with 1 rules applied. Total rules applied 1900 place count 183 transition count 762
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1901 place count 183 transition count 761
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 1961 place count 153 transition count 731
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1968 place count 153 transition count 724
Discarding 29 places :
Symmetric choice reduction at 7 with 29 rule applications. Total rules 1997 place count 124 transition count 280
Iterating global reduction 7 with 29 rules applied. Total rules applied 2026 place count 124 transition count 280
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 2038 place count 124 transition count 268
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 2054 place count 108 transition count 249
Iterating global reduction 8 with 16 rules applied. Total rules applied 2070 place count 108 transition count 249
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 2086 place count 92 transition count 230
Iterating global reduction 8 with 16 rules applied. Total rules applied 2102 place count 92 transition count 230
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 2110 place count 92 transition count 222
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 9 with 2 rules applied. Total rules applied 2112 place count 91 transition count 221
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2113 place count 90 transition count 215
Iterating global reduction 9 with 1 rules applied. Total rules applied 2114 place count 90 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2115 place count 90 transition count 214
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 2120 place count 90 transition count 209
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 2130 place count 85 transition count 204
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2131 place count 84 transition count 203
Applied a total of 2131 rules in 115 ms. Remains 84 /1196 variables (removed 1112) and now considering 203/1797 (removed 1594) transitions.
[2026-05-25 10:45:10] [INFO ] Flow matrix only has 196 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12500284504792669815.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8622022279331577207.kers'
[2026-05-25 10:45:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12500284504792669815.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8622022279331577207.kers]
Normalized transition count is 195 out of 196 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 195 rows 83 cols 1005 entries
Finished phase 1 with 82 SingleSign rule and 0 generalized
[2026-05-25 10:45:10] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8622022279331577207.kers
Total runtime 2 ms.
[2026-05-25 10:45:10] [INFO ] Implicit Places using invariants in 171 ms returned []
[2026-05-25 10:45:10] [INFO ] Flow matrix only has 196 transitions (discarded 7 similar events)
[2026-05-25 10:45:10] [INFO ] Invariant cache hit.
[2026-05-25 10:45:11] [INFO ] State equation strengthened by 31 read => feed constraints.
[2026-05-25 10:45:11] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2026-05-25 10:45:11] [INFO ] Redundant transitions in 5 ms returned []
Running 192 sub problems to find dead transitions.
[2026-05-25 10:45:11] [INFO ] Flow matrix only has 196 transitions (discarded 7 similar events)
[2026-05-25 10:45:11] [INFO ] Invariant cache hit.
[2026-05-25 10:45:11] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 5/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (OVERLAPS) 195/279 variables, 84/109 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 30/139 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 9 (OVERLAPS) 1/280 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/280 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 12 (OVERLAPS) 0/280 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 142 constraints, problems are : Problem set: 0 solved, 192 unsolved in 20652 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 5/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (OVERLAPS) 195/279 variables, 84/112 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 30/142 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 192/334 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 11 (OVERLAPS) 1/280 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/280 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/280 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 280/280 variables, and 338 constraints, problems are : Problem set: 0 solved, 192 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50758ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 50759ms
Starting structural reductions in SI_CTL mode, iteration 1 : 84/1196 places, 203/1797 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51302 ms. Remains : 84/1196 places, 203/1797 transitions.
[2026-05-25 10:46:01] [INFO ] Flatten gal took : 10 ms
[2026-05-25 10:46:01] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:46:02] [INFO ] Input system was already deterministic with 203 transitions.
[2026-05-25 10:46:02] [INFO ] Flatten gal took : 4 ms
[2026-05-25 10:46:02] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:46:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality4909736541860311696.gal : 1 ms
[2026-05-25 10:46:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality14601764072979721872.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/CTLCardinality4909736541860311696.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14601764072979721872.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,987182,0.805829,36396,2,7716,5,96150,6,0,528,83605,0


Converting to forward existential form...Done !
original formula: EG(E((AF(((p183==0)||(p175==1))) * (p1148!=0)) U EF((p311==1))))
=> equivalent forward existential formula: [FwdG(Init,E((!(EG(!(((p183==0)||(p175==1))))) * (p1148!=0)) U E(TRUE U (p311==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t7, t8, t9, t16, t17, t18, t24, t25, t26, t27, t30, t33, t34, t62, t64, t66, t73,...391
(forward)formula 0,1,21.7008,620128,1,0,632,2.72956e+06,435,302,6277,2.25546e+06,662
FORMULA MedleyB-PT-B03-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 1196/1196 places, 1797/1797 transitions.
Graph (trivial) has 1185 edges and 1196 vertex of which 82 / 1196 are part of one of the 15 SCC in 2 ms
Free SCC test removed 67 places
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 856 transitions
Trivial Post-agglo rules discarded 856 transitions
Performed 856 trivial Post agglomeration. Transition count delta: 856
Iterating post reduction 0 with 856 rules applied. Total rules applied 857 place count 1128 transition count 863
Reduce places removed 856 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 869 rules applied. Total rules applied 1726 place count 272 transition count 850
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 1733 place count 267 transition count 848
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1735 place count 265 transition count 848
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 58 Pre rules applied. Total rules applied 1735 place count 265 transition count 790
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1851 place count 207 transition count 790
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 1869 place count 189 transition count 771
Iterating global reduction 4 with 18 rules applied. Total rules applied 1887 place count 189 transition count 771
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1887 place count 189 transition count 770
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 1889 place count 188 transition count 770
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1895 place count 182 transition count 763
Iterating global reduction 4 with 6 rules applied. Total rules applied 1901 place count 182 transition count 763
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1903 place count 182 transition count 761
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1905 place count 180 transition count 758
Iterating global reduction 5 with 2 rules applied. Total rules applied 1907 place count 180 transition count 758
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1908 place count 179 transition count 757
Iterating global reduction 5 with 1 rules applied. Total rules applied 1909 place count 179 transition count 757
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1910 place count 179 transition count 756
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 1970 place count 149 transition count 726
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1977 place count 149 transition count 719
Discarding 31 places :
Symmetric choice reduction at 7 with 31 rule applications. Total rules 2008 place count 118 transition count 272
Iterating global reduction 7 with 31 rules applied. Total rules applied 2039 place count 118 transition count 272
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 2051 place count 118 transition count 260
Discarding 17 places :
Symmetric choice reduction at 8 with 17 rule applications. Total rules 2068 place count 101 transition count 239
Iterating global reduction 8 with 17 rules applied. Total rules applied 2085 place count 101 transition count 239
Discarding 17 places :
Symmetric choice reduction at 8 with 17 rule applications. Total rules 2102 place count 84 transition count 218
Iterating global reduction 8 with 17 rules applied. Total rules applied 2119 place count 84 transition count 218
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 2127 place count 84 transition count 210
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 9 with 2 rules applied. Total rules applied 2129 place count 83 transition count 209
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2130 place count 82 transition count 204
Iterating global reduction 9 with 1 rules applied. Total rules applied 2131 place count 82 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2132 place count 82 transition count 203
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 2137 place count 82 transition count 198
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 2147 place count 77 transition count 193
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2148 place count 76 transition count 192
Applied a total of 2148 rules in 143 ms. Remains 76 /1196 variables (removed 1120) and now considering 192/1797 (removed 1605) transitions.
[2026-05-25 10:46:24] [INFO ] Flow matrix only has 186 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13322229842178667031.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3542547964372593209.kers'
[2026-05-25 10:46:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13322229842178667031.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3542547964372593209.kers]
Normalized transition count is 185 out of 186 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 185 rows 75 cols 984 entries
Finished phase 1 with 74 SingleSign rule and 0 generalized
[2026-05-25 10:46:24] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3542547964372593209.kers
Total runtime 2 ms.
[2026-05-25 10:46:24] [INFO ] Implicit Places using invariants in 153 ms returned []
[2026-05-25 10:46:24] [INFO ] Flow matrix only has 186 transitions (discarded 6 similar events)
[2026-05-25 10:46:24] [INFO ] Invariant cache hit.
[2026-05-25 10:46:24] [INFO ] State equation strengthened by 31 read => feed constraints.
[2026-05-25 10:46:24] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2026-05-25 10:46:24] [INFO ] Redundant transitions in 1 ms returned []
Running 181 sub problems to find dead transitions.
[2026-05-25 10:46:24] [INFO ] Flow matrix only has 186 transitions (discarded 6 similar events)
[2026-05-25 10:46:24] [INFO ] Invariant cache hit.
[2026-05-25 10:46:24] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 5/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 185/261 variables, 76/97 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 30/127 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 1/262 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 0/262 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 12 (OVERLAPS) 0/262 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 129 constraints, problems are : Problem set: 0 solved, 181 unsolved in 22365 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 5/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 185/261 variables, 76/98 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 30/128 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 181/309 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (OVERLAPS) 1/262 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 12 (OVERLAPS) 0/262 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 311 constraints, problems are : Problem set: 0 solved, 181 unsolved in 26840 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49262ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 49262ms
Starting structural reductions in SI_CTL mode, iteration 1 : 76/1196 places, 192/1797 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 49785 ms. Remains : 76/1196 places, 192/1797 transitions.
[2026-05-25 10:47:13] [INFO ] Flatten gal took : 17 ms
[2026-05-25 10:47:13] [INFO ] Flatten gal took : 10 ms
[2026-05-25 10:47:13] [INFO ] Input system was already deterministic with 192 transitions.
[2026-05-25 10:47:13] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:47:13] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:47:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality4878202364762674685.gal : 2 ms
[2026-05-25 10:47:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality12410139351669574651.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/CTLCardinality4878202364762674685.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12410139351669574651.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,800580,0.799731,33400,2,6912,5,86855,6,0,486,86289,0


Converting to forward existential form...Done !
original formula: AG(EF(((p1040==0)||(p345==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((p1040==0)||(p345==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t6, t7, t8, t16, t17, t18, t24, t25, t26, t29, t30, t31, t57, t64, t65, t66, t74,...369
(forward)formula 0,1,5.50142,166004,1,0,355,711353,398,169,5816,417625,387
FORMULA MedleyB-PT-B03-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 1196/1196 places, 1797/1797 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 1163 transition count 1764
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 1163 transition count 1764
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 94 place count 1135 transition count 1736
Iterating global reduction 0 with 28 rules applied. Total rules applied 122 place count 1135 transition count 1736
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 144 place count 1113 transition count 1714
Iterating global reduction 0 with 22 rules applied. Total rules applied 166 place count 1113 transition count 1714
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 185 place count 1094 transition count 1695
Iterating global reduction 0 with 19 rules applied. Total rules applied 204 place count 1094 transition count 1695
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 222 place count 1076 transition count 1677
Iterating global reduction 0 with 18 rules applied. Total rules applied 240 place count 1076 transition count 1677
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 241 place count 1076 transition count 1676
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 256 place count 1061 transition count 1661
Iterating global reduction 1 with 15 rules applied. Total rules applied 271 place count 1061 transition count 1661
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 284 place count 1048 transition count 1648
Iterating global reduction 1 with 13 rules applied. Total rules applied 297 place count 1048 transition count 1648
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 309 place count 1036 transition count 1636
Iterating global reduction 1 with 12 rules applied. Total rules applied 321 place count 1036 transition count 1636
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 332 place count 1025 transition count 1625
Iterating global reduction 1 with 11 rules applied. Total rules applied 343 place count 1025 transition count 1625
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 345 place count 1025 transition count 1623
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 352 place count 1018 transition count 1616
Iterating global reduction 2 with 7 rules applied. Total rules applied 359 place count 1018 transition count 1616
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 361 place count 1018 transition count 1614
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 365 place count 1014 transition count 1610
Iterating global reduction 3 with 4 rules applied. Total rules applied 369 place count 1014 transition count 1610
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 373 place count 1010 transition count 1606
Iterating global reduction 3 with 4 rules applied. Total rules applied 377 place count 1010 transition count 1606
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 381 place count 1006 transition count 1602
Iterating global reduction 3 with 4 rules applied. Total rules applied 385 place count 1006 transition count 1602
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 389 place count 1002 transition count 1598
Iterating global reduction 3 with 4 rules applied. Total rules applied 393 place count 1002 transition count 1598
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 397 place count 998 transition count 1594
Iterating global reduction 3 with 4 rules applied. Total rules applied 401 place count 998 transition count 1594
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 405 place count 994 transition count 1590
Iterating global reduction 3 with 4 rules applied. Total rules applied 409 place count 994 transition count 1590
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 413 place count 990 transition count 1586
Iterating global reduction 3 with 4 rules applied. Total rules applied 417 place count 990 transition count 1586
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 418 place count 990 transition count 1585
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 421 place count 987 transition count 1582
Iterating global reduction 4 with 3 rules applied. Total rules applied 424 place count 987 transition count 1582
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 425 place count 987 transition count 1581
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 427 place count 985 transition count 1579
Iterating global reduction 5 with 2 rules applied. Total rules applied 429 place count 985 transition count 1579
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 431 place count 983 transition count 1577
Iterating global reduction 5 with 2 rules applied. Total rules applied 433 place count 983 transition count 1577
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 435 place count 981 transition count 1575
Iterating global reduction 5 with 2 rules applied. Total rules applied 437 place count 981 transition count 1575
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 439 place count 979 transition count 1573
Iterating global reduction 5 with 2 rules applied. Total rules applied 441 place count 979 transition count 1573
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 443 place count 979 transition count 1571
Applied a total of 443 rules in 901 ms. Remains 979 /1196 variables (removed 217) and now considering 1571/1797 (removed 226) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5220262137214920023.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14332184132571930892.kers'
[2026-05-25 10:47:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5220262137214920023.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14332184132571930892.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1571 rows 979 cols 7431 entries
Finished phase 1 with 973 SingleSign rule and 0 generalized
[2026-05-25 10:47:20] [INFO ] Computed 6 invariants in 26 ms
Computed 6 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-14332184132571930892.kers
Total runtime 28 ms.
[2026-05-25 10:47:21] [INFO ] Implicit Places using invariants in 838 ms returned []
[2026-05-25 10:47:21] [INFO ] Invariant cache hit.
[2026-05-25 10:47:22] [INFO ] Implicit Places using invariants and state equation in 1129 ms returned []
Implicit Place search using SMT with State Equation took 1986 ms to find 0 implicit places.
Running 1570 sub problems to find dead transitions.
[2026-05-25 10:47:22] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 978/2550 variables, and 0 constraints, problems are : Problem set: 0 solved, 1570 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/979 constraints, PredecessorRefiner: 1570/1570 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1570 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 978/2550 variables, and 0 constraints, problems are : Problem set: 0 solved, 1570 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/979 constraints, PredecessorRefiner: 0/1570 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61420ms problems are : Problem set: 0 solved, 1570 unsolved
Search for dead transitions found 0 dead transitions in 61425ms
Starting structural reductions in LTL mode, iteration 1 : 979/1196 places, 1571/1797 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64320 ms. Remains : 979/1196 places, 1571/1797 transitions.
[2026-05-25 10:48:23] [INFO ] Flatten gal took : 22 ms
[2026-05-25 10:48:23] [INFO ] Flatten gal took : 24 ms
[2026-05-25 10:48:23] [INFO ] Input system was already deterministic with 1571 transitions.
[2026-05-25 10:48:23] [INFO ] Flatten gal took : 24 ms
[2026-05-25 10:48:23] [INFO ] Flatten gal took : 27 ms
[2026-05-25 10:48:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality885178206213598673.gal : 10 ms
[2026-05-25 10:48:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality5212525532832778553.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/CTLCardinality885178206213598673.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5212525532832778553.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 10:48:53] [INFO ] Flatten gal took : 24 ms
[2026-05-25 10:48:53] [INFO ] Applying decomposition
[2026-05-25 10:48:53] [INFO ] Flatten gal took : 23 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/graph18347859347808230035.txt' '-o' '/tmp/graph18347859347808230035.bin' '-w' '/tmp/graph18347859347808230035.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18347859347808230035.bin' '-l' '-1' '-v' '-w' '/tmp/graph18347859347808230035.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:48:54] [INFO ] Decomposing Gal with order
[2026-05-25 10:48:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:48:54] [INFO ] Removed a total of 2811 redundant transitions.
[2026-05-25 10:48:54] [INFO ] Flatten gal took : 61 ms
[2026-05-25 10:48:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 17 ms.
[2026-05-25 10:48:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality6507977940381054998.gal : 10 ms
[2026-05-25 10:48:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality10236163855331714989.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/CTLCardinality6507977940381054998.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10236163855331714989.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1196/1196 places, 1797/1797 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 1164 transition count 1765
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 1164 transition count 1765
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 91 place count 1137 transition count 1738
Iterating global reduction 0 with 27 rules applied. Total rules applied 118 place count 1137 transition count 1738
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 140 place count 1115 transition count 1716
Iterating global reduction 0 with 22 rules applied. Total rules applied 162 place count 1115 transition count 1716
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 181 place count 1096 transition count 1697
Iterating global reduction 0 with 19 rules applied. Total rules applied 200 place count 1096 transition count 1697
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 218 place count 1078 transition count 1679
Iterating global reduction 0 with 18 rules applied. Total rules applied 236 place count 1078 transition count 1679
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 237 place count 1078 transition count 1678
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 252 place count 1063 transition count 1663
Iterating global reduction 1 with 15 rules applied. Total rules applied 267 place count 1063 transition count 1663
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 280 place count 1050 transition count 1650
Iterating global reduction 1 with 13 rules applied. Total rules applied 293 place count 1050 transition count 1650
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 305 place count 1038 transition count 1638
Iterating global reduction 1 with 12 rules applied. Total rules applied 317 place count 1038 transition count 1638
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 328 place count 1027 transition count 1627
Iterating global reduction 1 with 11 rules applied. Total rules applied 339 place count 1027 transition count 1627
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 341 place count 1027 transition count 1625
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 348 place count 1020 transition count 1618
Iterating global reduction 2 with 7 rules applied. Total rules applied 355 place count 1020 transition count 1618
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 357 place count 1020 transition count 1616
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 361 place count 1016 transition count 1612
Iterating global reduction 3 with 4 rules applied. Total rules applied 365 place count 1016 transition count 1612
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 369 place count 1012 transition count 1608
Iterating global reduction 3 with 4 rules applied. Total rules applied 373 place count 1012 transition count 1608
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 377 place count 1008 transition count 1604
Iterating global reduction 3 with 4 rules applied. Total rules applied 381 place count 1008 transition count 1604
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 385 place count 1004 transition count 1600
Iterating global reduction 3 with 4 rules applied. Total rules applied 389 place count 1004 transition count 1600
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 393 place count 1000 transition count 1596
Iterating global reduction 3 with 4 rules applied. Total rules applied 397 place count 1000 transition count 1596
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 401 place count 996 transition count 1592
Iterating global reduction 3 with 4 rules applied. Total rules applied 405 place count 996 transition count 1592
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 409 place count 992 transition count 1588
Iterating global reduction 3 with 4 rules applied. Total rules applied 413 place count 992 transition count 1588
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 414 place count 992 transition count 1587
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 417 place count 989 transition count 1584
Iterating global reduction 4 with 3 rules applied. Total rules applied 420 place count 989 transition count 1584
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 421 place count 989 transition count 1583
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 423 place count 987 transition count 1581
Iterating global reduction 5 with 2 rules applied. Total rules applied 425 place count 987 transition count 1581
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 427 place count 985 transition count 1579
Iterating global reduction 5 with 2 rules applied. Total rules applied 429 place count 985 transition count 1579
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 431 place count 983 transition count 1577
Iterating global reduction 5 with 2 rules applied. Total rules applied 433 place count 983 transition count 1577
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 435 place count 981 transition count 1575
Iterating global reduction 5 with 2 rules applied. Total rules applied 437 place count 981 transition count 1575
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 439 place count 981 transition count 1573
Applied a total of 439 rules in 770 ms. Remains 981 /1196 variables (removed 215) and now considering 1573/1797 (removed 224) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4801957303146331369.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1642958012601615464.kers'
[2026-05-25 10:49:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4801957303146331369.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1642958012601615464.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1573 rows 981 cols 7435 entries
Finished phase 1 with 975 SingleSign rule and 0 generalized
[2026-05-25 10:49:25] [INFO ] Computed 6 invariants in 13 ms
Computed 6 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-1642958012601615464.kers
Total runtime 18 ms.
[2026-05-25 10:49:25] [INFO ] Implicit Places using invariants in 749 ms returned []
[2026-05-25 10:49:25] [INFO ] Invariant cache hit.
[2026-05-25 10:49:27] [INFO ] Implicit Places using invariants and state equation in 1213 ms returned []
Implicit Place search using SMT with State Equation took 1963 ms to find 0 implicit places.
Running 1572 sub problems to find dead transitions.
[2026-05-25 10:49:27] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 980/2554 variables, and 0 constraints, problems are : Problem set: 0 solved, 1572 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/981 constraints, PredecessorRefiner: 1572/1572 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1572 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 Int declared 980/2554 variables, and 0 constraints, problems are : Problem set: 0 solved, 1572 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/981 constraints, PredecessorRefiner: 0/1572 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61314ms problems are : Problem set: 0 solved, 1572 unsolved
Search for dead transitions found 0 dead transitions in 61317ms
Starting structural reductions in LTL mode, iteration 1 : 981/1196 places, 1573/1797 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64054 ms. Remains : 981/1196 places, 1573/1797 transitions.
[2026-05-25 10:50:28] [INFO ] Flatten gal took : 22 ms
[2026-05-25 10:50:28] [INFO ] Flatten gal took : 23 ms
[2026-05-25 10:50:28] [INFO ] Input system was already deterministic with 1573 transitions.
[2026-05-25 10:50:28] [INFO ] Flatten gal took : 23 ms
[2026-05-25 10:50:28] [INFO ] Flatten gal took : 23 ms
[2026-05-25 10:50:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality6416427769641212503.gal : 8 ms
[2026-05-25 10:50:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality12951591317611850329.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/CTLCardinality6416427769641212503.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12951591317611850329.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 10:50:58] [INFO ] Flatten gal took : 30 ms
[2026-05-25 10:50:58] [INFO ] Applying decomposition
[2026-05-25 10:50:58] [INFO ] Flatten gal took : 24 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/graph3340689200915104414.txt' '-o' '/tmp/graph3340689200915104414.bin' '-w' '/tmp/graph3340689200915104414.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3340689200915104414.bin' '-l' '-1' '-v' '-w' '/tmp/graph3340689200915104414.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:50:58] [INFO ] Decomposing Gal with order
[2026-05-25 10:50:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:50:58] [INFO ] Removed a total of 2809 redundant transitions.
[2026-05-25 10:50:58] [INFO ] Flatten gal took : 57 ms
[2026-05-25 10:50:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 9 ms.
[2026-05-25 10:50:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality5633975750001734289.gal : 10 ms
[2026-05-25 10:50:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality7094562797175161282.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/CTLCardinality5633975750001734289.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7094562797175161282.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1196/1196 places, 1797/1797 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 1167 transition count 1768
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 1167 transition count 1768
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 82 place count 1143 transition count 1744
Iterating global reduction 0 with 24 rules applied. Total rules applied 106 place count 1143 transition count 1744
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 124 place count 1125 transition count 1726
Iterating global reduction 0 with 18 rules applied. Total rules applied 142 place count 1125 transition count 1726
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 156 place count 1111 transition count 1712
Iterating global reduction 0 with 14 rules applied. Total rules applied 170 place count 1111 transition count 1712
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 184 place count 1097 transition count 1698
Iterating global reduction 0 with 14 rules applied. Total rules applied 198 place count 1097 transition count 1698
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 199 place count 1097 transition count 1697
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 211 place count 1085 transition count 1685
Iterating global reduction 1 with 12 rules applied. Total rules applied 223 place count 1085 transition count 1685
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 234 place count 1074 transition count 1674
Iterating global reduction 1 with 11 rules applied. Total rules applied 245 place count 1074 transition count 1674
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 255 place count 1064 transition count 1664
Iterating global reduction 1 with 10 rules applied. Total rules applied 265 place count 1064 transition count 1664
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 273 place count 1056 transition count 1656
Iterating global reduction 1 with 8 rules applied. Total rules applied 281 place count 1056 transition count 1656
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 282 place count 1056 transition count 1655
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 287 place count 1051 transition count 1650
Iterating global reduction 2 with 5 rules applied. Total rules applied 292 place count 1051 transition count 1650
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 293 place count 1051 transition count 1649
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 296 place count 1048 transition count 1646
Iterating global reduction 3 with 3 rules applied. Total rules applied 299 place count 1048 transition count 1646
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 302 place count 1045 transition count 1643
Iterating global reduction 3 with 3 rules applied. Total rules applied 305 place count 1045 transition count 1643
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 307 place count 1043 transition count 1641
Iterating global reduction 3 with 2 rules applied. Total rules applied 309 place count 1043 transition count 1641
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 311 place count 1041 transition count 1639
Iterating global reduction 3 with 2 rules applied. Total rules applied 313 place count 1041 transition count 1639
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 315 place count 1039 transition count 1637
Iterating global reduction 3 with 2 rules applied. Total rules applied 317 place count 1039 transition count 1637
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 319 place count 1037 transition count 1635
Iterating global reduction 3 with 2 rules applied. Total rules applied 321 place count 1037 transition count 1635
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 323 place count 1035 transition count 1633
Iterating global reduction 3 with 2 rules applied. Total rules applied 325 place count 1035 transition count 1633
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 326 place count 1035 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 327 place count 1034 transition count 1631
Iterating global reduction 4 with 1 rules applied. Total rules applied 328 place count 1034 transition count 1631
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 329 place count 1033 transition count 1630
Iterating global reduction 4 with 1 rules applied. Total rules applied 330 place count 1033 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 331 place count 1032 transition count 1629
Iterating global reduction 4 with 1 rules applied. Total rules applied 332 place count 1032 transition count 1629
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 333 place count 1031 transition count 1628
Iterating global reduction 4 with 1 rules applied. Total rules applied 334 place count 1031 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 335 place count 1030 transition count 1627
Iterating global reduction 4 with 1 rules applied. Total rules applied 336 place count 1030 transition count 1627
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 337 place count 1030 transition count 1626
Applied a total of 337 rules in 801 ms. Remains 1030 /1196 variables (removed 166) and now considering 1626/1797 (removed 171) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1021768605043041772.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1878101780091750304.kers'
[2026-05-25 10:51:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1021768605043041772.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1878101780091750304.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1626 rows 1030 cols 7551 entries
Finished phase 1 with 1024 SingleSign rule and 0 generalized
[2026-05-25 10:51:29] [INFO ] Computed 6 invariants in 9 ms
Computed 6 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-1878101780091750304.kers
Total runtime 11 ms.
[2026-05-25 10:51:30] [INFO ] Implicit Places using invariants in 638 ms returned []
[2026-05-25 10:51:30] [INFO ] Invariant cache hit.
[2026-05-25 10:51:31] [INFO ] Implicit Places using invariants and state equation in 1389 ms returned []
Implicit Place search using SMT with State Equation took 2044 ms to find 0 implicit places.
Running 1625 sub problems to find dead transitions.
[2026-05-25 10:51:31] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1029/2656 variables, and 0 constraints, problems are : Problem set: 0 solved, 1625 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1030 constraints, PredecessorRefiner: 1625/1625 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1625 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1029/2656 variables, and 0 constraints, problems are : Problem set: 0 solved, 1625 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1030 constraints, PredecessorRefiner: 0/1625 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61368ms problems are : Problem set: 0 solved, 1625 unsolved
Search for dead transitions found 0 dead transitions in 61373ms
Starting structural reductions in LTL mode, iteration 1 : 1030/1196 places, 1626/1797 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64225 ms. Remains : 1030/1196 places, 1626/1797 transitions.
[2026-05-25 10:52:33] [INFO ] Flatten gal took : 28 ms
[2026-05-25 10:52:33] [INFO ] Flatten gal took : 24 ms
[2026-05-25 10:52:33] [INFO ] Input system was already deterministic with 1626 transitions.
[2026-05-25 10:52:33] [INFO ] Flatten gal took : 25 ms
[2026-05-25 10:52:33] [INFO ] Flatten gal took : 37 ms
[2026-05-25 10:52:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality7308489776999948780.gal : 9 ms
[2026-05-25 10:52:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality13818263881071848986.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/CTLCardinality7308489776999948780.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13818263881071848986.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 10:53:03] [INFO ] Flatten gal took : 25 ms
[2026-05-25 10:53:03] [INFO ] Applying decomposition
[2026-05-25 10:53:03] [INFO ] Flatten gal took : 23 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/graph15513113127242409632.txt' '-o' '/tmp/graph15513113127242409632.bin' '-w' '/tmp/graph15513113127242409632.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15513113127242409632.bin' '-l' '-1' '-v' '-w' '/tmp/graph15513113127242409632.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:53:03] [INFO ] Decomposing Gal with order
[2026-05-25 10:53:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:53:03] [INFO ] Removed a total of 2820 redundant transitions.
[2026-05-25 10:53:03] [INFO ] Flatten gal took : 51 ms
[2026-05-25 10:53:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 9 ms.
[2026-05-25 10:53:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality3585428190968653312.gal : 9 ms
[2026-05-25 10:53:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality14873682671446642549.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/CTLCardinality3585428190968653312.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14873682671446642549.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.55055e+12,29.2197,993228,4892,16,1.3556e+06,1582,2030,7.08832e+06,50,3784,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 10:53:34] [INFO ] Flatten gal took : 66 ms
[2026-05-25 10:53:34] [INFO ] Flatten gal took : 37 ms
[2026-05-25 10:53:34] [INFO ] Applying decomposition
[2026-05-25 10:53:34] [INFO ] Flatten gal took : 30 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/graph10371511771902396063.txt' '-o' '/tmp/graph10371511771902396063.bin' '-w' '/tmp/graph10371511771902396063.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10371511771902396063.bin' '-l' '-1' '-v' '-w' '/tmp/graph10371511771902396063.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:53:34] [INFO ] Decomposing Gal with order
[2026-05-25 10:53:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:53:34] [INFO ] Removed a total of 2847 redundant transitions.
[2026-05-25 10:53:34] [INFO ] Flatten gal took : 58 ms
[2026-05-25 10:53:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 10 ms.
[2026-05-25 10:53:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality387854729363083267.gal : 11 ms
[2026-05-25 10:53:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality5723830863297893052.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/CTLCardinality387854729363083267.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5723830863297893052.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 6 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.65111e+12,46.9286,1497904,6616,27,2.00793e+06,2380,2249,1.10864e+07,58,8040,0


Converting to forward existential form...Done !
original formula: ((EG((((EF((i3.u27.p67==0)) * (i42.i0.i0.u455.p1365==1)) * ((i32.u358.p1089==1)&&(i45.i1.i2.u77.p230==1))) + A(((i35.i1.i0.u387.p1188==0)...475
=> equivalent forward existential formula: (([(Init * !(EG((((E(TRUE U (i3.u27.p67==0)) * (i42.i0.i0.u455.p1365==1)) * ((i32.u358.p1089==1)&&(i45.i1.i2.u77...683
Reverse transition relation is NOT exact ! Due to transitions t17, t47, t98, t146, t204, t259, t261, t295, t336, t355, t418, t474, t508, t533, t624, t625, ...803
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 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
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Detected timeout of ITS tools.
[2026-05-25 11:19:52] [INFO ] Applying decomposition
[2026-05-25 11:19:52] [INFO ] Flatten gal took : 26 ms
[2026-05-25 11:19:52] [INFO ] Decomposing Gal with order
[2026-05-25 11:19:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 11:19:52] [INFO ] Removed a total of 2642 redundant transitions.
[2026-05-25 11:19:52] [INFO ] Flatten gal took : 84 ms
[2026-05-25 11:19:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 405 labels/synchronizations in 10 ms.
[2026-05-25 11:19:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality14202656414776091930.gal : 4 ms
[2026-05-25 11:19:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality3124681145785667876.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/CTLCardinality14202656414776091930.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3124681145785667876.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 6 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.65111e+12,3.41362,114248,154,8386,14658,248697,178,53340,2092,1.52817e+06,0


Converting to forward existential form...Done !
original formula: ((EG((((EF((i0.i0.i0.i0.u5.p67==0)) * (i0.u9.p1365==1)) * ((i0.i0.u8.p1089==1)&&(i0.i0.i0.i0.u5.p230==1))) + A(((i0.i0.u8.p1188==0)||(i0....480
=> equivalent forward existential formula: (([(Init * !(EG((((E(TRUE U (i0.i0.i0.i0.u5.p67==0)) * (i0.u9.p1365==1)) * ((i0.i0.u8.p1089==1)&&(i0.i0.i0.i0.u5...676
Reverse transition relation is NOT exact ! Due to transitions t1159, i0.u9.t47, i0.u9.t86, i0.u9.t98, i0.u9.t146, i0.u9.t203, i0.u9.t204, i0.u9.t258, i0.u9...1228
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2

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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-B03"
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-B03, 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-177969020100297"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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