Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r130-smll-177955809000281.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is FireWire-PT-18, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809000281
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 7.9K Mar 7 05:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 7 05:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 7 05:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 7 05:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 7 05:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Mar 7 05:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 7 05:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 7 05:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 168K 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 FireWire-PT-18-CTLCardinality-2024-00
FORMULA_NAME FireWire-PT-18-CTLCardinality-2024-01
FORMULA_NAME FireWire-PT-18-CTLCardinality-2024-02
FORMULA_NAME FireWire-PT-18-CTLCardinality-2024-03
FORMULA_NAME FireWire-PT-18-CTLCardinality-2024-04
FORMULA_NAME FireWire-PT-18-CTLCardinality-2024-05
FORMULA_NAME FireWire-PT-18-CTLCardinality-2024-06
FORMULA_NAME FireWire-PT-18-CTLCardinality-2024-07
FORMULA_NAME FireWire-PT-18-CTLCardinality-2024-08
FORMULA_NAME FireWire-PT-18-CTLCardinality-2024-09
FORMULA_NAME FireWire-PT-18-CTLCardinality-2024-10
FORMULA_NAME FireWire-PT-18-CTLCardinality-2024-11
FORMULA_NAME FireWire-PT-18-CTLCardinality-2024-12
FORMULA_NAME FireWire-PT-18-CTLCardinality-2024-13
FORMULA_NAME FireWire-PT-18-CTLCardinality-2024-14
FORMULA_NAME FireWire-PT-18-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779839022530

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-26 23:43:44] [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-26 23:43:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 23:43:45] [INFO ] Load time of PNML (sax parser for PT used): 210 ms
[2026-05-26 23:43:45] [INFO ] Transformed 437 places.
[2026-05-26 23:43:45] [INFO ] Transformed 707 transitions.
[2026-05-26 23:43:45] [INFO ] Found NUPN structural information;
[2026-05-26 23:43:45] [INFO ] Parsed PT model containing 437 places and 707 transitions and 2170 arcs in 397 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 34 ms.
FORMULA FireWire-PT-18-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 120 out of 437 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 437/437 places, 707/707 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 430 transition count 707
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 74 place count 363 transition count 640
Iterating global reduction 1 with 67 rules applied. Total rules applied 141 place count 363 transition count 640
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 151 place count 353 transition count 590
Iterating global reduction 1 with 10 rules applied. Total rules applied 161 place count 353 transition count 590
Applied a total of 161 rules in 151 ms. Remains 353 /437 variables (removed 84) and now considering 590/707 (removed 117) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8642372690745825170.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11919045075121232181.kers'
[2026-05-26 23:43:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8642372690745825170.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11919045075121232181.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 590 rows 353 cols 1831 entries
Finished phase 1 with 346 SingleSign rule and 0 generalized
[2026-05-26 23:43:45] [INFO ] Computed 7 invariants in 6 ms
Computed 7 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-11919045075121232181.kers
Total runtime 9 ms.
[2026-05-26 23:43:46] [INFO ] Implicit Places using invariants in 770 ms returned []
[2026-05-26 23:43:46] [INFO ] Invariant cache hit.
[2026-05-26 23:43:47] [INFO ] Implicit Places using invariants and state equation in 930 ms returned []
Implicit Place search using SMT with State Equation took 1763 ms to find 0 implicit places.
Running 589 sub problems to find dead transitions.
[2026-05-26 23:43:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/349 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/350 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 350/943 variables, and 21 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/353 constraints, PredecessorRefiner: 589/589 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 589 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/349 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/350 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/943 variables, and 33 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/353 constraints, PredecessorRefiner: 0/589 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60708ms problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 60753ms
Starting structural reductions in LTL mode, iteration 1 : 353/437 places, 590/707 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62755 ms. Remains : 353/437 places, 590/707 transitions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 590/590 transitions.
Applied a total of 0 rules in 14 ms. Remains 353 /353 variables (removed 0) and now considering 590/590 (removed 0) transitions.
[2026-05-26 23:44:48] [INFO ] Invariant cache hit.
[2026-05-26 23:44:48] [INFO ] Implicit Places using invariants in 353 ms returned []
[2026-05-26 23:44:48] [INFO ] Invariant cache hit.
[2026-05-26 23:44:49] [INFO ] Implicit Places using invariants and state equation in 693 ms returned []
Implicit Place search using SMT with State Equation took 1048 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1062 ms. Remains : 353/353 places, 590/590 transitions.
Support contains 120 out of 353 places after structural reductions.
[2026-05-26 23:44:49] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2026-05-26 23:44:49] [INFO ] Flatten gal took : 148 ms
FORMULA FireWire-PT-18-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-18-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-26 23:44:49] [INFO ] Flatten gal took : 84 ms
[2026-05-26 23:44:49] [INFO ] Input system was already deterministic with 590 transitions.
Support contains 106 out of 353 places (down from 120) after GAL structural reductions.
RANDOM walk for 40000 steps (19 resets) in 2483 ms. (16 steps per ms) remains 47/66 properties
BEST_FIRST walk for 4002 steps (8 resets) in 63 ms. (62 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (10 resets) in 38 ms. (102 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (9 resets) in 31 ms. (125 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (9 resets) in 53 ms. (74 steps per ms) remains 46/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (9 resets) in 21 ms. (182 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (9 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (11 resets) in 24 ms. (160 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (9 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (9 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (10 resets) in 15 ms. (250 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (10 resets) in 15 ms. (250 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (9 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (9 resets) in 23 ms. (166 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (11 resets) in 18 ms. (210 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (8 resets) in 13 ms. (285 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (9 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (9 resets) in 15 ms. (250 steps per ms) remains 45/46 properties
BEST_FIRST walk for 4002 steps (10 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (11 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (9 resets) in 32 ms. (121 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (9 resets) in 12 ms. (307 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
[2026-05-26 23:44:51] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 254/325 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (OVERLAPS) 569/894 variables, 325/332 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/894 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 30/924 variables, 17/349 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/924 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 15/939 variables, 8/357 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/939 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 4/943 variables, 3/360 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/943 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 45 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 943/943 variables, and 360 constraints, problems are : Problem set: 0 solved, 45 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 254/325 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 45 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 325/943 variables, and 19 constraints, problems are : Problem set: 0 solved, 45 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/353 constraints, PredecessorRefiner: 0/45 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10046ms problems are : Problem set: 0 solved, 45 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 71 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 590/590 transitions.
Graph (trivial) has 169 edges and 353 vertex of which 12 / 353 are part of one of the 3 SCC in 12 ms
Free SCC test removed 9 places
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 344 transition count 544
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 40 rules applied. Total rules applied 73 place count 312 transition count 536
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 80 place count 305 transition count 536
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 80 place count 305 transition count 525
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 102 place count 294 transition count 525
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 108 place count 288 transition count 518
Iterating global reduction 3 with 6 rules applied. Total rules applied 114 place count 288 transition count 518
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 114 place count 288 transition count 516
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 118 place count 286 transition count 516
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 119 place count 285 transition count 515
Iterating global reduction 3 with 1 rules applied. Total rules applied 120 place count 285 transition count 515
Performed 24 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 24 places in 3 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 168 place count 261 transition count 490
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 196 place count 247 transition count 518
Free-agglomeration rule applied 24 times.
Iterating global reduction 3 with 24 rules applied. Total rules applied 220 place count 247 transition count 494
Reduce places removed 24 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 247 place count 223 transition count 491
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 249 place count 221 transition count 489
Iterating global reduction 4 with 2 rules applied. Total rules applied 251 place count 221 transition count 489
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 252 place count 221 transition count 488
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 258 place count 221 transition count 482
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 260 place count 221 transition count 482
Applied a total of 260 rules in 333 ms. Remains 221 /353 variables (removed 132) and now considering 482/590 (removed 108) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 333 ms. Remains : 221/353 places, 482/590 transitions.
RANDOM walk for 40000 steps (1102 resets) in 1156 ms. (34 steps per ms) remains 28/45 properties
BEST_FIRST walk for 4003 steps (28 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (22 resets) in 31 ms. (125 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (27 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (28 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (27 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (29 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (29 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (27 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (26 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (23 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (27 resets) in 27 ms. (142 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (26 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (22 resets) in 21 ms. (181 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4004 steps (31 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (29 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (23 resets) in 26 ms. (148 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (26 resets) in 18 ms. (210 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4003 steps (30 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (26 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (26 resets) in 27 ms. (143 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (26 resets) in 54 ms. (72 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (28 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (27 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (28 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (31 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (28 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (28 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
[2026-05-26 23:45:02] [INFO ] Flow matrix only has 478 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4418874719155568028.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4707430794376010479.kers'
[2026-05-26 23:45:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4418874719155568028.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4707430794376010479.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 478 rows 221 cols 1634 entries
Finished phase 1 with 214 SingleSign rule and 0 generalized
[2026-05-26 23:45:02] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4707430794376010479.kers
Total runtime 4 ms.
[2026-05-26 23:45:02] [INFO ] State equation strengthened by 33 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 157/205 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 5/210 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 478/688 variables, 210/217 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/688 variables, 33/250 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/688 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 11/699 variables, 11/261 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/699 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 0/699 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 699/699 variables, and 261 constraints, problems are : Problem set: 0 solved, 26 unsolved in 2515 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 221/221 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 157/205 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 5/210 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (OVERLAPS) 478/688 variables, 210/228 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/688 variables, 33/261 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/688 variables, 24/285 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/688 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/688 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 14 (OVERLAPS) 11/699 variables, 11/297 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/699 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/699 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 18 (OVERLAPS) 0/699 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 699/699 variables, and 301 constraints, problems are : Problem set: 0 solved, 26 unsolved in 17767 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 221/221 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20317ms problems are : Problem set: 0 solved, 26 unsolved
Fused 26 Parikh solutions to 25 different solutions.
Parikh walk visited 0 properties in 2894 ms.
Support contains 48 out of 221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 482/482 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 221 transition count 478
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 217 transition count 477
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 216 transition count 477
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 11 place count 215 transition count 474
Iterating global reduction 3 with 1 rules applied. Total rules applied 12 place count 215 transition count 474
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 30 place count 206 transition count 465
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 31 place count 206 transition count 464
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 32 place count 205 transition count 461
Iterating global reduction 4 with 1 rules applied. Total rules applied 33 place count 205 transition count 461
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 47 place count 198 transition count 477
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 56 place count 198 transition count 468
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 57 place count 198 transition count 467
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 58 place count 197 transition count 467
Applied a total of 58 rules in 80 ms. Remains 197 /221 variables (removed 24) and now considering 467/482 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 197/221 places, 467/482 transitions.
RANDOM walk for 40000 steps (1215 resets) in 1068 ms. (37 steps per ms) remains 24/26 properties
BEST_FIRST walk for 4004 steps (33 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (33 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (29 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (30 resets) in 32 ms. (121 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (30 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (30 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (30 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (31 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (20 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (34 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (25 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (29 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (33 resets) in 21 ms. (182 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (31 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (34 resets) in 21 ms. (182 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (33 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (32 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (34 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (31 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (32 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (35 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (26 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (31 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (30 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
Interrupted probabilistic random walk after 334951 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :11 out of 24
Probabilistic random walk after 334951 steps, saw 82825 distinct states, run finished after 3010 ms. (steps per millisecond=111 ) properties seen :11
[2026-05-26 23:45:29] [INFO ] Flow matrix only has 462 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14657046937093445010.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14650297708625466715.kers'
[2026-05-26 23:45:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14657046937093445010.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14650297708625466715.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 462 rows 197 cols 1628 entries
Finished phase 1 with 190 SingleSign rule and 0 generalized
[2026-05-26 23:45:29] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14650297708625466715.kers
Total runtime 3 ms.
[2026-05-26 23:45:29] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 149/173 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 9/182 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 457/639 variables, 182/189 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/639 variables, 38/227 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/639 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 19/658 variables, 14/241 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/658 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 1/659 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/659 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 0/659 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 659/659 variables, and 242 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1461 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 197/197 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 149/173 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 9/182 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 457/639 variables, 182/197 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/639 variables, 38/235 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/639 variables, 12/247 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/639 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 19/658 variables, 14/264 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/658 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/658 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (OVERLAPS) 1/659 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/659 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (OVERLAPS) 0/659 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 659/659 variables, and 266 constraints, problems are : Problem set: 0 solved, 13 unsolved in 6997 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 197/197 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8476ms problems are : Problem set: 0 solved, 13 unsolved
Parikh walk visited 0 properties in 6686 ms.
Support contains 24 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 467/467 transitions.
Graph (complete) has 863 edges and 197 vertex of which 196 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 196 transition count 465
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 195 transition count 465
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 195 transition count 462
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 192 transition count 462
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 16 place count 186 transition count 454
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 186 transition count 454
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 186 transition count 453
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 33 place count 181 transition count 448
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 35 place count 179 transition count 445
Iterating global reduction 3 with 2 rules applied. Total rules applied 37 place count 179 transition count 445
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 47 place count 174 transition count 465
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 48 place count 174 transition count 464
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 50 place count 172 transition count 452
Iterating global reduction 4 with 2 rules applied. Total rules applied 52 place count 172 transition count 452
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 54 place count 170 transition count 448
Iterating global reduction 4 with 2 rules applied. Total rules applied 56 place count 170 transition count 448
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 58 place count 168 transition count 442
Iterating global reduction 4 with 2 rules applied. Total rules applied 60 place count 168 transition count 442
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 62 place count 166 transition count 438
Iterating global reduction 4 with 2 rules applied. Total rules applied 64 place count 166 transition count 438
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 66 place count 164 transition count 432
Iterating global reduction 4 with 2 rules applied. Total rules applied 68 place count 164 transition count 432
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 70 place count 162 transition count 428
Iterating global reduction 4 with 2 rules applied. Total rules applied 72 place count 162 transition count 428
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 73 place count 161 transition count 425
Iterating global reduction 4 with 1 rules applied. Total rules applied 74 place count 161 transition count 425
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 75 place count 160 transition count 423
Iterating global reduction 4 with 1 rules applied. Total rules applied 76 place count 160 transition count 423
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 77 place count 159 transition count 420
Iterating global reduction 4 with 1 rules applied. Total rules applied 78 place count 159 transition count 420
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 79 place count 158 transition count 418
Iterating global reduction 4 with 1 rules applied. Total rules applied 80 place count 158 transition count 418
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 81 place count 157 transition count 416
Iterating global reduction 4 with 1 rules applied. Total rules applied 82 place count 157 transition count 416
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 83 place count 156 transition count 414
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 156 transition count 414
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 88 place count 156 transition count 410
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 92 place count 156 transition count 406
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 100 place count 152 transition count 402
Applied a total of 100 rules in 118 ms. Remains 152 /197 variables (removed 45) and now considering 402/467 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 152/197 places, 402/467 transitions.
RANDOM walk for 40000 steps (1263 resets) in 241 ms. (165 steps per ms) remains 9/13 properties
BEST_FIRST walk for 40003 steps (350 resets) in 98 ms. (404 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (47 resets) in 117 ms. (338 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (10 resets) in 104 ms. (380 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (360 resets) in 67 ms. (588 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (337 resets) in 58 ms. (678 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (343 resets) in 98 ms. (404 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (346 resets) in 67 ms. (588 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (353 resets) in 59 ms. (666 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (345 resets) in 93 ms. (425 steps per ms) remains 9/9 properties
[2026-05-26 23:45:44] [INFO ] Flow matrix only has 395 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-6772173275927797317.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4452085211163528754.kers'
[2026-05-26 23:45:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6772173275927797317.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4452085211163528754.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 395 rows 152 cols 1376 entries
Finished phase 1 with 145 SingleSign rule and 0 generalized
[2026-05-26 23:45:44] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4452085211163528754.kers
Total runtime 2 ms.
[2026-05-26 23:45:44] [INFO ] State equation strengthened by 58 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 116/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 7/142 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 395/537 variables, 142/149 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 58/207 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 10/547 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/547 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/547 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 547/547 variables, and 217 constraints, problems are : Problem set: 0 solved, 9 unsolved in 678 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 116/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 7/142 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 395/537 variables, 142/153 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 58/211 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/537 variables, 8/219 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/537 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 10/547 variables, 10/229 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/547 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/547 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/547 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/547 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 0/547 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/547 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 0/547 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 547/547 variables, and 234 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3552 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4248ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 1 properties in 3203 ms.
Support contains 15 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 402/402 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 152 transition count 399
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 149 transition count 399
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 148 transition count 396
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 148 transition count 396
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 147 transition count 394
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 147 transition count 394
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 146 transition count 391
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 146 transition count 391
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 145 transition count 389
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 145 transition count 389
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 144 transition count 387
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 144 transition count 387
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 143 transition count 385
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 143 transition count 385
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 place count 139 transition count 381
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 30 place count 137 transition count 394
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 137 transition count 390
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 137 transition count 389
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 39 place count 136 transition count 386
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 41 place count 136 transition count 386
Applied a total of 41 rules in 66 ms. Remains 136 /152 variables (removed 16) and now considering 386/402 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 136/152 places, 386/402 transitions.
RANDOM walk for 40000 steps (1326 resets) in 298 ms. (133 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (360 resets) in 79 ms. (500 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (15 resets) in 95 ms. (416 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (296 resets) in 101 ms. (392 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (361 resets) in 72 ms. (547 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (360 resets) in 69 ms. (571 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (361 resets) in 72 ms. (547 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (358 resets) in 85 ms. (465 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (389 resets) in 76 ms. (519 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 410737 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :4 out of 8
Probabilistic random walk after 410737 steps, saw 121256 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :4
[2026-05-26 23:45:55] [INFO ] Flow matrix only has 379 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-11821651092356381687.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17150975991882580345.kers'
[2026-05-26 23:45:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11821651092356381687.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17150975991882580345.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 379 rows 136 cols 1350 entries
Finished phase 1 with 129 SingleSign rule and 0 generalized
[2026-05-26 23:45:55] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17150975991882580345.kers
Total runtime 2 ms.
[2026-05-26 23:45:55] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 67/74 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 51/125 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 377/502 variables, 125/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 56/188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 12/514 variables, 10/198 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/514 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/515 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/515 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/515 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 515/515 variables, and 199 constraints, problems are : Problem set: 0 solved, 4 unsolved in 500 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 136/136 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 67/74 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 51/125 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 377/502 variables, 125/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 56/188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 4/192 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/502 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 12/514 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/514 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/515 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/515 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/515 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 515/515 variables, and 204 constraints, problems are : Problem set: 0 solved, 4 unsolved in 942 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 136/136 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1456ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 892 ms.
Support contains 7 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 386/386 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 136 transition count 385
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 135 transition count 385
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 135 transition count 382
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 132 transition count 382
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 129 transition count 379
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 127 transition count 377
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 127 transition count 377
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 21 place count 127 transition count 374
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 23 place count 126 transition count 376
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 126 transition count 375
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 25 place count 125 transition count 375
Applied a total of 25 rules in 32 ms. Remains 125 /136 variables (removed 11) and now considering 375/386 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 125/136 places, 375/386 transitions.
RANDOM walk for 40000 steps (2193 resets) in 170 ms. (233 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (503 resets) in 61 ms. (645 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (28 resets) in 74 ms. (533 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (488 resets) in 51 ms. (769 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (481 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 443125 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :0 out of 4
Probabilistic random walk after 443125 steps, saw 125269 distinct states, run finished after 3001 ms. (steps per millisecond=147 ) properties seen :0
[2026-05-26 23:46:01] [INFO ] Flow matrix only has 368 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-6878200056847252070.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17002241846171378570.kers'
[2026-05-26 23:46:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6878200056847252070.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17002241846171378570.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 368 rows 125 cols 1326 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-26 23:46:01] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17002241846171378570.kers
Total runtime 2 ms.
[2026-05-26 23:46:01] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 62/69 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 47/116 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 368/484 variables, 116/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 56/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 9/493 variables, 9/188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/493 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/493 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 493/493 variables, and 188 constraints, problems are : Problem set: 0 solved, 4 unsolved in 329 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 62/69 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 47/116 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 368/484 variables, 116/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 56/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 4/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/484 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/484 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 9/493 variables, 9/195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/493 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/493 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 493/493 variables, and 195 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1247 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1589ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 709 ms.
Support contains 7 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 375/375 transitions.
Applied a total of 0 rules in 6 ms. Remains 125 /125 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 125/125 places, 375/375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 375/375 transitions.
Applied a total of 0 rules in 6 ms. Remains 125 /125 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2026-05-26 23:46:03] [INFO ] Flow matrix only has 368 transitions (discarded 7 similar events)
[2026-05-26 23:46:03] [INFO ] Invariant cache hit.
[2026-05-26 23:46:03] [INFO ] Implicit Places using invariants in 142 ms returned []
[2026-05-26 23:46:03] [INFO ] Flow matrix only has 368 transitions (discarded 7 similar events)
[2026-05-26 23:46:03] [INFO ] Invariant cache hit.
[2026-05-26 23:46:03] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-26 23:46:04] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
[2026-05-26 23:46:04] [INFO ] Redundant transitions in 52 ms returned [254]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 372 sub problems to find dead transitions.
[2026-05-26 23:46:04] [INFO ] Flow matrix only has 367 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-16523802195966648550.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8189405374631396329.kers'
[2026-05-26 23:46:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16523802195966648550.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8189405374631396329.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 367 rows 125 cols 1322 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-26 23:46:04] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8189405374631396329.kers
Total runtime 2 ms.
[2026-05-26 23:46:04] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (OVERLAPS) 367/490 variables, 123/137 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 56/193 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 7 (OVERLAPS) 2/492 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 492/492 variables, and 195 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (OVERLAPS) 367/490 variables, 123/137 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 56/193 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 363/556 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 1/557 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/492 variables, and 557 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 123/125 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 363/372 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60361ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 60366ms
Starting structural reductions in REACHABILITY mode, iteration 1 : 125/125 places, 374/375 transitions.
Applied a total of 0 rules in 9 ms. Remains 125 /125 variables (removed 0) and now considering 374/374 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 60998 ms. Remains : 125/125 places, 374/375 transitions.
[2026-05-26 23:47:04] [INFO ] Flatten gal took : 40 ms
[2026-05-26 23:47:04] [INFO ] Flatten gal took : 36 ms
[2026-05-26 23:47:04] [INFO ] Input system was already deterministic with 590 transitions.
Computed a total of 106 stabilizing places and 158 stable transitions
Graph (complete) has 1084 edges and 353 vertex of which 350 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.19 ms
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 590/590 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 350 transition count 590
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 43 place count 310 transition count 545
Iterating global reduction 1 with 40 rules applied. Total rules applied 83 place count 310 transition count 545
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 84 place count 310 transition count 544
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 98 place count 296 transition count 503
Iterating global reduction 2 with 14 rules applied. Total rules applied 112 place count 296 transition count 503
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 114 place count 296 transition count 501
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 119 place count 291 transition count 493
Iterating global reduction 3 with 5 rules applied. Total rules applied 124 place count 291 transition count 493
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 125 place count 291 transition count 492
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 127 place count 289 transition count 487
Iterating global reduction 4 with 2 rules applied. Total rules applied 129 place count 289 transition count 487
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 131 place count 287 transition count 482
Iterating global reduction 4 with 2 rules applied. Total rules applied 133 place count 287 transition count 482
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 135 place count 285 transition count 477
Iterating global reduction 4 with 2 rules applied. Total rules applied 137 place count 285 transition count 477
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 139 place count 283 transition count 472
Iterating global reduction 4 with 2 rules applied. Total rules applied 141 place count 283 transition count 472
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 143 place count 281 transition count 467
Iterating global reduction 4 with 2 rules applied. Total rules applied 145 place count 281 transition count 467
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 147 place count 279 transition count 462
Iterating global reduction 4 with 2 rules applied. Total rules applied 149 place count 279 transition count 462
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 151 place count 277 transition count 457
Iterating global reduction 4 with 2 rules applied. Total rules applied 153 place count 277 transition count 457
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 155 place count 275 transition count 452
Iterating global reduction 4 with 2 rules applied. Total rules applied 157 place count 275 transition count 452
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 159 place count 273 transition count 448
Iterating global reduction 4 with 2 rules applied. Total rules applied 161 place count 273 transition count 448
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 162 place count 272 transition count 446
Iterating global reduction 4 with 1 rules applied. Total rules applied 163 place count 272 transition count 446
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 164 place count 271 transition count 445
Iterating global reduction 4 with 1 rules applied. Total rules applied 165 place count 271 transition count 445
Applied a total of 165 rules in 90 ms. Remains 271 /353 variables (removed 82) and now considering 445/590 (removed 145) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-200011359402538047.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5977007488715297585.kers'
[2026-05-26 23:47:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-200011359402538047.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5977007488715297585.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 445 rows 271 cols 1354 entries
Finished phase 1 with 264 SingleSign rule and 0 generalized
[2026-05-26 23:47:04] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5977007488715297585.kers
Total runtime 3 ms.
[2026-05-26 23:47:05] [INFO ] Implicit Places using invariants in 214 ms returned []
[2026-05-26 23:47:05] [INFO ] Invariant cache hit.
[2026-05-26 23:47:05] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
Running 444 sub problems to find dead transitions.
[2026-05-26 23:47:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (OVERLAPS) 1/271 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 4 (OVERLAPS) 445/716 variables, 271/288 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/716 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 716/716 variables, and 289 constraints, problems are : Problem set: 0 solved, 444 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 444 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (OVERLAPS) 1/271 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 5 (OVERLAPS) 445/716 variables, 271/290 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/716 variables, 444/734 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 716/716 variables, and 736 constraints, problems are : Problem set: 0 solved, 444 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60105ms problems are : Problem set: 0 solved, 444 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Starting structural reductions in LTL mode, iteration 1 : 271/353 places, 445/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60907 ms. Remains : 271/353 places, 445/590 transitions.
[2026-05-26 23:48:05] [INFO ] Flatten gal took : 24 ms
[2026-05-26 23:48:05] [INFO ] Flatten gal took : 24 ms
[2026-05-26 23:48:05] [INFO ] Input system was already deterministic with 445 transitions.
[2026-05-26 23:48:05] [INFO ] Flatten gal took : 22 ms
[2026-05-26 23:48:05] [INFO ] Flatten gal took : 20 ms
[2026-05-26 23:48:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality8792113862331016945.gal : 18 ms
[2026-05-26 23:48:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality1460542234473654784.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/CTLCardinality8792113862331016945.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1460542234473654784.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-26 23:48:35] [INFO ] Flatten gal took : 21 ms
[2026-05-26 23:48:35] [INFO ] Applying decomposition
[2026-05-26 23:48:35] [INFO ] Flatten gal took : 27 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/graph14340560749452908390.txt' '-o' '/tmp/graph14340560749452908390.bin' '-w' '/tmp/graph14340560749452908390.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14340560749452908390.bin' '-l' '-1' '-v' '-w' '/tmp/graph14340560749452908390.weights' '-q' '0' '-e' '0.001'
[2026-05-26 23:48:36] [INFO ] Decomposing Gal with order
[2026-05-26 23:48:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 23:48:36] [INFO ] Removed a total of 443 redundant transitions.
[2026-05-26 23:48:36] [INFO ] Flatten gal took : 116 ms
[2026-05-26 23:48:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 24 ms.
[2026-05-26 23:48:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality6542014222604134746.gal : 14 ms
[2026-05-26 23:48:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality16546294345391234350.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/CTLCardinality6542014222604134746.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16546294345391234350.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,2.76449e+10,7.83803,176284,3021,237,260687,5957,1067,895927,141,28201,0


Converting to forward existential form...Done !
original formula: AX(AG(A((i10.i1.u65.p357==1) U (!(((i1.i0.u8.p239==0)||(i6.i0.u49.p185==1))) + A(((i6.i1.u35.p173==0)||(i1.i1.u74.p343==1)) U ((i0.u7.p34...183
=> equivalent forward existential formula: (([(FwdU(((FwdU(FwdU(EY(Init),TRUE),!((!(((i1.i0.u8.p239==0)||(i6.i0.u49.p185==1))) + !((E(!(((i0.u7.p34==0)||(i...1194
Reverse transition relation is NOT exact ! Due to transitions t63, t151, t188, t193, t202, t211, t217, t218, t219, t224, t229, t234, t239, t247, t250, t251...1169
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,0,20.2851,365872,1,0,555761,9492,7402,1.83452e+06,881,41994,1721712
FORMULA FireWire-PT-18-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 590/590 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 350 transition count 590
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 43 place count 310 transition count 543
Iterating global reduction 1 with 40 rules applied. Total rules applied 83 place count 310 transition count 543
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 84 place count 310 transition count 542
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 95 place count 299 transition count 504
Iterating global reduction 2 with 11 rules applied. Total rules applied 106 place count 299 transition count 504
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 108 place count 299 transition count 502
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 111 place count 296 transition count 497
Iterating global reduction 3 with 3 rules applied. Total rules applied 114 place count 296 transition count 497
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 115 place count 296 transition count 496
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 116 place count 295 transition count 494
Iterating global reduction 4 with 1 rules applied. Total rules applied 117 place count 295 transition count 494
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 118 place count 294 transition count 491
Iterating global reduction 4 with 1 rules applied. Total rules applied 119 place count 294 transition count 491
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 120 place count 293 transition count 489
Iterating global reduction 4 with 1 rules applied. Total rules applied 121 place count 293 transition count 489
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 122 place count 292 transition count 486
Iterating global reduction 4 with 1 rules applied. Total rules applied 123 place count 292 transition count 486
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 124 place count 291 transition count 484
Iterating global reduction 4 with 1 rules applied. Total rules applied 125 place count 291 transition count 484
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 126 place count 290 transition count 481
Iterating global reduction 4 with 1 rules applied. Total rules applied 127 place count 290 transition count 481
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 128 place count 289 transition count 479
Iterating global reduction 4 with 1 rules applied. Total rules applied 129 place count 289 transition count 479
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 130 place count 288 transition count 476
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 288 transition count 476
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 132 place count 287 transition count 474
Iterating global reduction 4 with 1 rules applied. Total rules applied 133 place count 287 transition count 474
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 134 place count 286 transition count 472
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 286 transition count 472
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 136 place count 285 transition count 470
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 285 transition count 470
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 138 place count 284 transition count 469
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 284 transition count 469
Applied a total of 139 rules in 77 ms. Remains 284 /353 variables (removed 69) and now considering 469/590 (removed 121) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17752605950053120978.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14076335682326108061.kers'
[2026-05-26 23:48:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17752605950053120978.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14076335682326108061.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 469 rows 284 cols 1447 entries
Finished phase 1 with 277 SingleSign rule and 0 generalized
[2026-05-26 23:48:56] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-14076335682326108061.kers
Total runtime 6 ms.
[2026-05-26 23:48:57] [INFO ] Implicit Places using invariants in 287 ms returned []
[2026-05-26 23:48:57] [INFO ] Invariant cache hit.
[2026-05-26 23:48:57] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
Running 468 sub problems to find dead transitions.
[2026-05-26 23:48:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 1 (OVERLAPS) 1/284 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/284 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 468 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 284/753 variables, and 25 constraints, problems are : Problem set: 0 solved, 468 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/284 constraints, PredecessorRefiner: 468/468 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 468 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 1 (OVERLAPS) 1/284 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/284 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 7/32 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 6 (OVERLAPS) 469/753 variables, 284/318 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/753 variables, 468/786 constraints. Problems are: Problem set: 0 solved, 468 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 753/753 variables, and 789 constraints, problems are : Problem set: 0 solved, 468 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 284/284 constraints, PredecessorRefiner: 468/468 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60132ms problems are : Problem set: 0 solved, 468 unsolved
Search for dead transitions found 0 dead transitions in 60135ms
Starting structural reductions in LTL mode, iteration 1 : 284/353 places, 469/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60985 ms. Remains : 284/353 places, 469/590 transitions.
[2026-05-26 23:49:57] [INFO ] Flatten gal took : 16 ms
[2026-05-26 23:49:57] [INFO ] Flatten gal took : 16 ms
[2026-05-26 23:49:57] [INFO ] Input system was already deterministic with 469 transitions.
[2026-05-26 23:49:57] [INFO ] Flatten gal took : 13 ms
[2026-05-26 23:49:58] [INFO ] Flatten gal took : 14 ms
[2026-05-26 23:49:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality1711347671064319701.gal : 4 ms
[2026-05-26 23:49:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality12722829576272270329.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/CTLCardinality1711347671064319701.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12722829576272270329.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-26 23:50:28] [INFO ] Flatten gal took : 13 ms
[2026-05-26 23:50:28] [INFO ] Applying decomposition
[2026-05-26 23:50:28] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1788989739162169208.txt' '-o' '/tmp/graph1788989739162169208.bin' '-w' '/tmp/graph1788989739162169208.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1788989739162169208.bin' '-l' '-1' '-v' '-w' '/tmp/graph1788989739162169208.weights' '-q' '0' '-e' '0.001'
[2026-05-26 23:50:28] [INFO ] Decomposing Gal with order
[2026-05-26 23:50:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 23:50:28] [INFO ] Removed a total of 508 redundant transitions.
[2026-05-26 23:50:28] [INFO ] Flatten gal took : 38 ms
[2026-05-26 23:50:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 8 ms.
[2026-05-26 23:50:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality488776919401618330.gal : 6 ms
[2026-05-26 23:50:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality2460422304756824168.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/CTLCardinality488776919401618330.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2460422304756824168.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.0361e+10,21.4155,469188,4071,60,588841,741,1122,3.55186e+06,87,2104,0


Converting to forward existential form...Done !
original formula: (AG(((A(AG((i9.i1.u87.p371==0)) U AF((i5.u47.p194==1))) + ((i6.i0.u49.p203==0)&&(i3.i0.u13.p71==1))) * ((AX(((i5.u47.p247==0)&&(i7.i3.u65...376
=> equivalent forward existential formula: (([FwdG((FwdU((FwdU((Init * !(E(TRUE U !(E(TRUE U !(((i1.u34.p150==0)||(i0.i1.u25.p169==1)))))))),TRUE) * !(((i6...815
Reverse transition relation is NOT exact ! Due to transitions t64, t145, t152, t190, t191, t193, t202, t211, t219, t224, t229, t234, t239, t243, t250, t251...1205
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 590/590 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 350 transition count 590
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 46 place count 307 transition count 540
Iterating global reduction 1 with 43 rules applied. Total rules applied 89 place count 307 transition count 540
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 90 place count 307 transition count 539
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 103 place count 294 transition count 499
Iterating global reduction 2 with 13 rules applied. Total rules applied 116 place count 294 transition count 499
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 117 place count 294 transition count 498
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 122 place count 289 transition count 490
Iterating global reduction 3 with 5 rules applied. Total rules applied 127 place count 289 transition count 490
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 128 place count 289 transition count 489
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 130 place count 287 transition count 484
Iterating global reduction 4 with 2 rules applied. Total rules applied 132 place count 287 transition count 484
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 134 place count 285 transition count 479
Iterating global reduction 4 with 2 rules applied. Total rules applied 136 place count 285 transition count 479
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 138 place count 283 transition count 474
Iterating global reduction 4 with 2 rules applied. Total rules applied 140 place count 283 transition count 474
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 142 place count 281 transition count 469
Iterating global reduction 4 with 2 rules applied. Total rules applied 144 place count 281 transition count 469
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 146 place count 279 transition count 464
Iterating global reduction 4 with 2 rules applied. Total rules applied 148 place count 279 transition count 464
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 150 place count 277 transition count 459
Iterating global reduction 4 with 2 rules applied. Total rules applied 152 place count 277 transition count 459
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 154 place count 275 transition count 454
Iterating global reduction 4 with 2 rules applied. Total rules applied 156 place count 275 transition count 454
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 158 place count 273 transition count 449
Iterating global reduction 4 with 2 rules applied. Total rules applied 160 place count 273 transition count 449
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 162 place count 271 transition count 445
Iterating global reduction 4 with 2 rules applied. Total rules applied 164 place count 271 transition count 445
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 166 place count 269 transition count 441
Iterating global reduction 4 with 2 rules applied. Total rules applied 168 place count 269 transition count 441
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 170 place count 267 transition count 438
Iterating global reduction 4 with 2 rules applied. Total rules applied 172 place count 267 transition count 438
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 173 place count 266 transition count 437
Iterating global reduction 4 with 1 rules applied. Total rules applied 174 place count 266 transition count 437
Applied a total of 174 rules in 89 ms. Remains 266 /353 variables (removed 87) and now considering 437/590 (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-8254438952152297060.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14965569279964637907.kers'
[2026-05-26 23:50:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8254438952152297060.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14965569279964637907.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 437 rows 266 cols 1324 entries
Finished phase 1 with 259 SingleSign rule and 0 generalized
[2026-05-26 23:50:58] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14965569279964637907.kers
Total runtime 3 ms.
[2026-05-26 23:50:58] [INFO ] Implicit Places using invariants in 411 ms returned []
[2026-05-26 23:50:58] [INFO ] Invariant cache hit.
[2026-05-26 23:50:59] [INFO ] Implicit Places using invariants and state equation in 662 ms returned []
Implicit Place search using SMT with State Equation took 1083 ms to find 0 implicit places.
Running 436 sub problems to find dead transitions.
[2026-05-26 23:50:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 436 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 266/703 variables, and 16 constraints, problems are : Problem set: 0 solved, 436 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/266 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 436 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 6 (OVERLAPS) 437/703 variables, 266/284 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 436/720 constraints. Problems are: Problem set: 0 solved, 436 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 703/703 variables, and 721 constraints, problems are : Problem set: 0 solved, 436 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 266/266 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60146ms problems are : Problem set: 0 solved, 436 unsolved
Search for dead transitions found 0 dead transitions in 60148ms
Starting structural reductions in LTL mode, iteration 1 : 266/353 places, 437/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61322 ms. Remains : 266/353 places, 437/590 transitions.
[2026-05-26 23:51:59] [INFO ] Flatten gal took : 17 ms
[2026-05-26 23:51:59] [INFO ] Flatten gal took : 17 ms
[2026-05-26 23:51:59] [INFO ] Input system was already deterministic with 437 transitions.
[2026-05-26 23:51:59] [INFO ] Flatten gal took : 21 ms
[2026-05-26 23:51:59] [INFO ] Flatten gal took : 17 ms
[2026-05-26 23:51:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality12395992444622362433.gal : 4 ms
[2026-05-26 23:51:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality12686764540914650986.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/CTLCardinality12395992444622362433.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12686764540914650986.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.
Detected timeout of ITS tools.
[2026-05-26 23:52:29] [INFO ] Flatten gal took : 11 ms
[2026-05-26 23:52:29] [INFO ] Applying decomposition
[2026-05-26 23:52:29] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph365116303896560049.txt' '-o' '/tmp/graph365116303896560049.bin' '-w' '/tmp/graph365116303896560049.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph365116303896560049.bin' '-l' '-1' '-v' '-w' '/tmp/graph365116303896560049.weights' '-q' '0' '-e' '0.001'
[2026-05-26 23:52:30] [INFO ] Decomposing Gal with order
[2026-05-26 23:52:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 23:52:30] [INFO ] Removed a total of 459 redundant transitions.
[2026-05-26 23:52:30] [INFO ] Flatten gal took : 62 ms
[2026-05-26 23:52:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 8 ms.
[2026-05-26 23:52:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality16289249324299576866.gal : 27 ms
[2026-05-26 23:52:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality858369681281739125.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/CTLCardinality16289249324299576866.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality858369681281739125.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 SI_CTL mode, iteration 0 : 353/353 places, 590/590 transitions.
Graph (trivial) has 257 edges and 353 vertex of which 12 / 353 are part of one of the 3 SCC in 1 ms
Free SCC test removed 9 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 1074 edges and 344 vertex of which 341 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 340 transition count 526
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 109 place count 287 transition count 525
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 109 place count 287 transition count 508
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 143 place count 270 transition count 508
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 171 place count 242 transition count 472
Iterating global reduction 2 with 28 rules applied. Total rules applied 199 place count 242 transition count 472
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 201 place count 242 transition count 470
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 201 place count 242 transition count 464
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 213 place count 236 transition count 464
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 223 place count 226 transition count 447
Iterating global reduction 3 with 10 rules applied. Total rules applied 233 place count 226 transition count 447
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 235 place count 226 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 236 place count 225 transition count 445
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 239 place count 222 transition count 439
Iterating global reduction 5 with 3 rules applied. Total rules applied 242 place count 222 transition count 439
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 244 place count 222 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 245 place count 221 transition count 437
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 247 place count 219 transition count 432
Iterating global reduction 7 with 2 rules applied. Total rules applied 249 place count 219 transition count 432
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 251 place count 217 transition count 427
Iterating global reduction 7 with 2 rules applied. Total rules applied 253 place count 217 transition count 427
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 255 place count 215 transition count 422
Iterating global reduction 7 with 2 rules applied. Total rules applied 257 place count 215 transition count 422
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 259 place count 213 transition count 417
Iterating global reduction 7 with 2 rules applied. Total rules applied 261 place count 213 transition count 417
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 263 place count 211 transition count 412
Iterating global reduction 7 with 2 rules applied. Total rules applied 265 place count 211 transition count 412
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 267 place count 209 transition count 407
Iterating global reduction 7 with 2 rules applied. Total rules applied 269 place count 209 transition count 407
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 270 place count 208 transition count 405
Iterating global reduction 7 with 1 rules applied. Total rules applied 271 place count 208 transition count 405
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 272 place count 207 transition count 402
Iterating global reduction 7 with 1 rules applied. Total rules applied 273 place count 207 transition count 402
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 274 place count 206 transition count 400
Iterating global reduction 7 with 1 rules applied. Total rules applied 275 place count 206 transition count 400
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 276 place count 205 transition count 398
Iterating global reduction 7 with 1 rules applied. Total rules applied 277 place count 205 transition count 398
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 278 place count 204 transition count 396
Iterating global reduction 7 with 1 rules applied. Total rules applied 279 place count 204 transition count 396
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 315 place count 186 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 317 place count 186 transition count 376
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 318 place count 185 transition count 376
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 320 place count 183 transition count 354
Iterating global reduction 9 with 2 rules applied. Total rules applied 322 place count 183 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 323 place count 183 transition count 353
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 10 with 2 rules applied. Total rules applied 325 place count 182 transition count 352
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 326 place count 181 transition count 351
Applied a total of 326 rules in 166 ms. Remains 181 /353 variables (removed 172) and now considering 351/590 (removed 239) transitions.
[2026-05-26 23:53:00] [INFO ] Flow matrix only has 347 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17905614816997768803.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16926303966006895404.kers'
[2026-05-26 23:53:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17905614816997768803.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16926303966006895404.kers]
Normalized transition count is 346 out of 347 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 346 rows 181 cols 1142 entries
Finished phase 1 with 174 SingleSign rule and 0 generalized
[2026-05-26 23:53:00] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16926303966006895404.kers
Total runtime 3 ms.
[2026-05-26 23:53:00] [INFO ] Implicit Places using invariants in 169 ms returned []
[2026-05-26 23:53:00] [INFO ] Flow matrix only has 347 transitions (discarded 4 similar events)
[2026-05-26 23:53:00] [INFO ] Invariant cache hit.
[2026-05-26 23:53:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-26 23:53:00] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
[2026-05-26 23:53:01] [INFO ] Redundant transitions in 9 ms returned []
Running 342 sub problems to find dead transitions.
[2026-05-26 23:53:01] [INFO ] Flow matrix only has 347 transitions (discarded 4 similar events)
[2026-05-26 23:53:01] [INFO ] Invariant cache hit.
[2026-05-26 23:53:01] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 3 (OVERLAPS) 346/525 variables, 179/196 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 342 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 525/528 variables, and 199 constraints, problems are : Problem set: 0 solved, 342 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 179/181 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 342/342 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 342 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 3 (OVERLAPS) 346/525 variables, 179/197 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 342/541 constraints. Problems are: Problem set: 0 solved, 342 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/528 variables, and 541 constraints, problems are : Problem set: 0 solved, 342 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 179/181 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 342/342 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60117ms problems are : Problem set: 0 solved, 342 unsolved
Search for dead transitions found 0 dead transitions in 60119ms
Starting structural reductions in SI_CTL mode, iteration 1 : 181/353 places, 351/590 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60806 ms. Remains : 181/353 places, 351/590 transitions.
[2026-05-26 23:54:01] [INFO ] Flatten gal took : 16 ms
[2026-05-26 23:54:01] [INFO ] Flatten gal took : 15 ms
[2026-05-26 23:54:01] [INFO ] Input system was already deterministic with 351 transitions.
[2026-05-26 23:54:01] [INFO ] Flatten gal took : 30 ms
[2026-05-26 23:54:01] [INFO ] Flatten gal took : 31 ms
[2026-05-26 23:54:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality2319155205164827448.gal : 5 ms
[2026-05-26 23:54:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality12671949561127528715.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/CTLCardinality2319155205164827448.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12671949561127528715.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.07062e+09,15.1082,268172,2,10870,5,652898,6,0,1071,1.09288e+06,0


Converting to forward existential form...Done !
original formula: EG(EF((p425==1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (p425==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t22, t29, t32, t37, t39, t44, t64, t72, t74, t79, t81, t87, t89, t90, t96, t97, t101, t10...732
Detected timeout of ITS tools.
[2026-05-26 23:54:31] [INFO ] Flatten gal took : 13 ms
[2026-05-26 23:54:31] [INFO ] Applying decomposition
[2026-05-26 23:54:31] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14291442125023757231.txt' '-o' '/tmp/graph14291442125023757231.bin' '-w' '/tmp/graph14291442125023757231.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14291442125023757231.bin' '-l' '-1' '-v' '-w' '/tmp/graph14291442125023757231.weights' '-q' '0' '-e' '0.001'
[2026-05-26 23:54:31] [INFO ] Decomposing Gal with order
[2026-05-26 23:54:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 23:54:31] [INFO ] Removed a total of 425 redundant transitions.
[2026-05-26 23:54:31] [INFO ] Flatten gal took : 26 ms
[2026-05-26 23:54:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 67 labels/synchronizations in 11 ms.
[2026-05-26 23:54:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality636122828883050353.gal : 5 ms
[2026-05-26 23:54:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality17392599073622451868.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/CTLCardinality636122828883050353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17392599073622451868.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.07062e+09,7.87974,152196,1283,97,157973,1131,827,1.03814e+06,86,5779,0


Converting to forward existential form...Done !
original formula: EG(EF((i8.i0.u61.p425==1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (i8.i0.u61.p425==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t87, t90, t96, t97, t101, t108, t163, t238, t256, t267, t269, t270, t271, t273, t274, t281, t...999
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 353/353 places, 590/590 transitions.
Graph (trivial) has 243 edges and 353 vertex of which 12 / 353 are part of one of the 3 SCC in 3 ms
Free SCC test removed 9 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 1074 edges and 344 vertex of which 341 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 340 transition count 531
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 292 transition count 529
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 101 place count 291 transition count 529
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 101 place count 291 transition count 513
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 133 place count 275 transition count 513
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 160 place count 248 transition count 478
Iterating global reduction 3 with 27 rules applied. Total rules applied 187 place count 248 transition count 478
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 188 place count 248 transition count 477
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 188 place count 248 transition count 471
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 200 place count 242 transition count 471
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 210 place count 232 transition count 454
Iterating global reduction 4 with 10 rules applied. Total rules applied 220 place count 232 transition count 454
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 221 place count 232 transition count 453
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 224 place count 229 transition count 447
Iterating global reduction 5 with 3 rules applied. Total rules applied 227 place count 229 transition count 447
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 229 place count 229 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 230 place count 228 transition count 445
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 232 place count 226 transition count 440
Iterating global reduction 7 with 2 rules applied. Total rules applied 234 place count 226 transition count 440
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 236 place count 224 transition count 435
Iterating global reduction 7 with 2 rules applied. Total rules applied 238 place count 224 transition count 435
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 240 place count 222 transition count 430
Iterating global reduction 7 with 2 rules applied. Total rules applied 242 place count 222 transition count 430
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 243 place count 221 transition count 428
Iterating global reduction 7 with 1 rules applied. Total rules applied 244 place count 221 transition count 428
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 245 place count 220 transition count 425
Iterating global reduction 7 with 1 rules applied. Total rules applied 246 place count 220 transition count 425
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 247 place count 219 transition count 423
Iterating global reduction 7 with 1 rules applied. Total rules applied 248 place count 219 transition count 423
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 249 place count 218 transition count 420
Iterating global reduction 7 with 1 rules applied. Total rules applied 250 place count 218 transition count 420
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 251 place count 217 transition count 418
Iterating global reduction 7 with 1 rules applied. Total rules applied 252 place count 217 transition count 418
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 253 place count 216 transition count 416
Iterating global reduction 7 with 1 rules applied. Total rules applied 254 place count 216 transition count 416
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 255 place count 215 transition count 414
Iterating global reduction 7 with 1 rules applied. Total rules applied 256 place count 215 transition count 414
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 292 place count 197 transition count 396
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 294 place count 197 transition count 394
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 295 place count 196 transition count 394
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 297 place count 194 transition count 372
Iterating global reduction 9 with 2 rules applied. Total rules applied 299 place count 194 transition count 372
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 300 place count 194 transition count 371
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 10 with 2 rules applied. Total rules applied 302 place count 193 transition count 370
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 303 place count 192 transition count 369
Applied a total of 303 rules in 177 ms. Remains 192 /353 variables (removed 161) and now considering 369/590 (removed 221) transitions.
[2026-05-26 23:55:01] [INFO ] Flow matrix only has 365 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1686045995087151893.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15372016764169985785.kers'
[2026-05-26 23:55:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1686045995087151893.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15372016764169985785.kers]
Normalized transition count is 364 out of 365 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 364 rows 192 cols 1198 entries
Finished phase 1 with 185 SingleSign rule and 0 generalized
[2026-05-26 23:55:01] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-15372016764169985785.kers
Total runtime 5 ms.
[2026-05-26 23:55:02] [INFO ] Implicit Places using invariants in 256 ms returned []
[2026-05-26 23:55:02] [INFO ] Flow matrix only has 365 transitions (discarded 4 similar events)
[2026-05-26 23:55:02] [INFO ] Invariant cache hit.
[2026-05-26 23:55:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-26 23:55:02] [INFO ] Implicit Places using invariants and state equation in 619 ms returned []
Implicit Place search using SMT with State Equation took 879 ms to find 0 implicit places.
[2026-05-26 23:55:02] [INFO ] Redundant transitions in 6 ms returned []
Running 359 sub problems to find dead transitions.
[2026-05-26 23:55:02] [INFO ] Flow matrix only has 365 transitions (discarded 4 similar events)
[2026-05-26 23:55:02] [INFO ] Invariant cache hit.
[2026-05-26 23:55:02] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 4 (OVERLAPS) 364/554 variables, 190/206 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 359 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 359 unsolved
SMT process timed out in 30118ms, After SMT, problems are : Problem set: 0 solved, 359 unsolved
Search for dead transitions found 0 dead transitions in 30121ms
Starting structural reductions in SI_CTL mode, iteration 1 : 192/353 places, 369/590 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31194 ms. Remains : 192/353 places, 369/590 transitions.
[2026-05-26 23:55:32] [INFO ] Flatten gal took : 8 ms
[2026-05-26 23:55:32] [INFO ] Flatten gal took : 8 ms
[2026-05-26 23:55:32] [INFO ] Input system was already deterministic with 369 transitions.
[2026-05-26 23:55:32] [INFO ] Flatten gal took : 7 ms
[2026-05-26 23:55:32] [INFO ] Flatten gal took : 7 ms
[2026-05-26 23:55:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality7862433238436116325.gal : 3 ms
[2026-05-26 23:55:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality4734464438191374957.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/CTLCardinality7862433238436116325.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4734464438191374957.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.24715e+09,13.0159,227756,2,11079,5,499990,6,0,1133,937137,0


Converting to forward existential form...Done !
original formula: E(EG(!(EF((p9==1)))) U ((AF((p82!=1)) * (p140==1)) * (((p411==0)||(p241==1))&&(((p14!=1)||(p191==0))||(p355==1)))))
=> equivalent forward existential formula: [(((FwdU(Init,EG(!(E(TRUE U (p9==1))))) * (((p411==0)||(p241==1))&&(((p14!=1)||(p191==0))||(p355==1)))) * (p140=...191
Reverse transition relation is NOT exact ! Due to transitions t2, t22, t30, t33, t38, t40, t46, t57, t67, t75, t77, t82, t85, t86, t92, t94, t95, t101, t10...769
Detected timeout of ITS tools.
[2026-05-26 23:56:02] [INFO ] Flatten gal took : 9 ms
[2026-05-26 23:56:02] [INFO ] Applying decomposition
[2026-05-26 23:56:02] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15218948954826932075.txt' '-o' '/tmp/graph15218948954826932075.bin' '-w' '/tmp/graph15218948954826932075.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15218948954826932075.bin' '-l' '-1' '-v' '-w' '/tmp/graph15218948954826932075.weights' '-q' '0' '-e' '0.001'
[2026-05-26 23:56:02] [INFO ] Decomposing Gal with order
[2026-05-26 23:56:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 23:56:02] [INFO ] Removed a total of 452 redundant transitions.
[2026-05-26 23:56:02] [INFO ] Flatten gal took : 22 ms
[2026-05-26 23:56:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 10 ms.
[2026-05-26 23:56:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality15218152803716544904.gal : 6 ms
[2026-05-26 23:56:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality4225058971797799627.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/CTLCardinality15218152803716544904.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4225058971797799627.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.24715e+09,5.2167,95800,1211,73,133782,1472,756,305468,88,4503,0


Converting to forward existential form...Done !
original formula: E(EG(!(EF((i1.u1.p9==1)))) U ((AF((i3.u10.p82!=1)) * (i1.u20.p140==1)) * (((i11.u67.p411==0)||(i5.i1.u39.p241==1))&&(((i1.u2.p14!=1)||(i5...194
=> equivalent forward existential formula: [(((FwdU(Init,EG(!(E(TRUE U (i1.u1.p9==1))))) * (((i11.u67.p411==0)||(i5.i1.u39.p241==1))&&(((i1.u2.p14!=1)||(i5...252
Reverse transition relation is NOT exact ! Due to transitions t92, t95, t101, t103, t107, t113, t122, t164, t210, t228, t254, t281, t283, t284, t285, t287,...911
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 590/590 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 351 transition count 590
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 37 place count 316 transition count 549
Iterating global reduction 1 with 35 rules applied. Total rules applied 72 place count 316 transition count 549
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 73 place count 316 transition count 548
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 84 place count 305 transition count 529
Iterating global reduction 2 with 11 rules applied. Total rules applied 95 place count 305 transition count 529
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 96 place count 305 transition count 528
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 101 place count 300 transition count 520
Iterating global reduction 3 with 5 rules applied. Total rules applied 106 place count 300 transition count 520
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 107 place count 300 transition count 519
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 109 place count 298 transition count 514
Iterating global reduction 4 with 2 rules applied. Total rules applied 111 place count 298 transition count 514
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 113 place count 296 transition count 509
Iterating global reduction 4 with 2 rules applied. Total rules applied 115 place count 296 transition count 509
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 117 place count 294 transition count 504
Iterating global reduction 4 with 2 rules applied. Total rules applied 119 place count 294 transition count 504
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 121 place count 292 transition count 499
Iterating global reduction 4 with 2 rules applied. Total rules applied 123 place count 292 transition count 499
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 124 place count 291 transition count 497
Iterating global reduction 4 with 1 rules applied. Total rules applied 125 place count 291 transition count 497
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 126 place count 290 transition count 494
Iterating global reduction 4 with 1 rules applied. Total rules applied 127 place count 290 transition count 494
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 128 place count 289 transition count 492
Iterating global reduction 4 with 1 rules applied. Total rules applied 129 place count 289 transition count 492
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 130 place count 288 transition count 489
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 288 transition count 489
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 132 place count 287 transition count 487
Iterating global reduction 4 with 1 rules applied. Total rules applied 133 place count 287 transition count 487
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 134 place count 286 transition count 485
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 286 transition count 485
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 136 place count 285 transition count 483
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 285 transition count 483
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 138 place count 284 transition count 482
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 284 transition count 482
Applied a total of 139 rules in 50 ms. Remains 284 /353 variables (removed 69) and now considering 482/590 (removed 108) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9189021541207645819.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18163520139770558141.kers'
[2026-05-26 23:56:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9189021541207645819.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18163520139770558141.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 482 rows 284 cols 1486 entries
Finished phase 1 with 277 SingleSign rule and 0 generalized
[2026-05-26 23:56:33] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-18163520139770558141.kers
Total runtime 4 ms.
[2026-05-26 23:56:33] [INFO ] Implicit Places using invariants in 323 ms returned []
[2026-05-26 23:56:33] [INFO ] Invariant cache hit.
[2026-05-26 23:56:34] [INFO ] Implicit Places using invariants and state equation in 700 ms returned []
Implicit Place search using SMT with State Equation took 1035 ms to find 0 implicit places.
Running 481 sub problems to find dead transitions.
[2026-05-26 23:56:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (OVERLAPS) 1/283 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 283/766 variables, and 19 constraints, problems are : Problem set: 0 solved, 481 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/284 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 481 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (OVERLAPS) 1/283 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 482/765 variables, 283/304 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 474/778 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/766 variables, and 779 constraints, problems are : Problem set: 0 solved, 481 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 283/284 constraints, PredecessorRefiner: 474/481 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60137ms problems are : Problem set: 0 solved, 481 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Starting structural reductions in LTL mode, iteration 1 : 284/353 places, 482/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61231 ms. Remains : 284/353 places, 482/590 transitions.
[2026-05-26 23:57:34] [INFO ] Flatten gal took : 10 ms
[2026-05-26 23:57:34] [INFO ] Flatten gal took : 11 ms
[2026-05-26 23:57:34] [INFO ] Input system was already deterministic with 482 transitions.
[2026-05-26 23:57:34] [INFO ] Flatten gal took : 15 ms
[2026-05-26 23:57:34] [INFO ] Flatten gal took : 16 ms
[2026-05-26 23:57:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality11189231497510744322.gal : 4 ms
[2026-05-26 23:57:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality2519377709486363073.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/CTLCardinality11189231497510744322.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2519377709486363073.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-26 23:58:04] [INFO ] Flatten gal took : 10 ms
[2026-05-26 23:58:04] [INFO ] Applying decomposition
[2026-05-26 23:58:04] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11023317818660599280.txt' '-o' '/tmp/graph11023317818660599280.bin' '-w' '/tmp/graph11023317818660599280.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11023317818660599280.bin' '-l' '-1' '-v' '-w' '/tmp/graph11023317818660599280.weights' '-q' '0' '-e' '0.001'
[2026-05-26 23:58:04] [INFO ] Decomposing Gal with order
[2026-05-26 23:58:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 23:58:04] [INFO ] Removed a total of 523 redundant transitions.
[2026-05-26 23:58:04] [INFO ] Flatten gal took : 40 ms
[2026-05-26 23:58:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 10 ms.
[2026-05-26 23:58:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality2983672655641625580.gal : 7 ms
[2026-05-26 23:58:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality7619321347749114519.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/CTLCardinality2983672655641625580.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7619321347749114519.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.65493e+10,28.5833,603148,4969,68,940545,795,1108,3.407e+06,93,2838,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 590/590 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 350 transition count 590
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 44 place count 309 transition count 543
Iterating global reduction 1 with 41 rules applied. Total rules applied 85 place count 309 transition count 543
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 86 place count 309 transition count 542
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 99 place count 296 transition count 505
Iterating global reduction 2 with 13 rules applied. Total rules applied 112 place count 296 transition count 505
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 114 place count 296 transition count 503
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 118 place count 292 transition count 497
Iterating global reduction 3 with 4 rules applied. Total rules applied 122 place count 292 transition count 497
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 123 place count 292 transition count 496
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 124 place count 291 transition count 494
Iterating global reduction 4 with 1 rules applied. Total rules applied 125 place count 291 transition count 494
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 126 place count 290 transition count 491
Iterating global reduction 4 with 1 rules applied. Total rules applied 127 place count 290 transition count 491
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 128 place count 289 transition count 489
Iterating global reduction 4 with 1 rules applied. Total rules applied 129 place count 289 transition count 489
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 130 place count 288 transition count 486
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 288 transition count 486
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 132 place count 287 transition count 484
Iterating global reduction 4 with 1 rules applied. Total rules applied 133 place count 287 transition count 484
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 134 place count 286 transition count 481
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 286 transition count 481
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 136 place count 285 transition count 479
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 285 transition count 479
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 138 place count 284 transition count 476
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 284 transition count 476
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 140 place count 283 transition count 474
Iterating global reduction 4 with 1 rules applied. Total rules applied 141 place count 283 transition count 474
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 142 place count 282 transition count 472
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 282 transition count 472
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 144 place count 281 transition count 470
Iterating global reduction 4 with 1 rules applied. Total rules applied 145 place count 281 transition count 470
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 146 place count 280 transition count 469
Iterating global reduction 4 with 1 rules applied. Total rules applied 147 place count 280 transition count 469
Applied a total of 147 rules in 41 ms. Remains 280 /353 variables (removed 73) and now considering 469/590 (removed 121) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2924693605130141668.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14632961985125766545.kers'
[2026-05-26 23:58:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2924693605130141668.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14632961985125766545.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 469 rows 280 cols 1450 entries
Finished phase 1 with 273 SingleSign rule and 0 generalized
[2026-05-26 23:58:34] [INFO ] Computed 7 invariants in 4 ms
Computed 7 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-14632961985125766545.kers
Total runtime 5 ms.
[2026-05-26 23:58:35] [INFO ] Implicit Places using invariants in 352 ms returned []
[2026-05-26 23:58:35] [INFO ] Invariant cache hit.
[2026-05-26 23:58:35] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 916 ms to find 0 implicit places.
Running 468 sub problems to find dead transitions.
[2026-05-26 23:58:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 1 (OVERLAPS) 1/280 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/280 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 468 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 468 unsolved
SMT process timed out in 30090ms, After SMT, problems are : Problem set: 0 solved, 468 unsolved
Search for dead transitions found 0 dead transitions in 30092ms
Starting structural reductions in LTL mode, iteration 1 : 280/353 places, 469/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31052 ms. Remains : 280/353 places, 469/590 transitions.
[2026-05-26 23:59:05] [INFO ] Flatten gal took : 8 ms
[2026-05-26 23:59:05] [INFO ] Flatten gal took : 9 ms
[2026-05-26 23:59:05] [INFO ] Input system was already deterministic with 469 transitions.
[2026-05-26 23:59:05] [INFO ] Flatten gal took : 10 ms
[2026-05-26 23:59:05] [INFO ] Flatten gal took : 10 ms
[2026-05-26 23:59:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality11228975003812245915.gal : 2 ms
[2026-05-26 23:59:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality16690709367020008613.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/CTLCardinality11228975003812245915.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16690709367020008613.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.
Detected timeout of ITS tools.
[2026-05-26 23:59:35] [INFO ] Flatten gal took : 10 ms
[2026-05-26 23:59:35] [INFO ] Applying decomposition
[2026-05-26 23:59:35] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5806370747055727704.txt' '-o' '/tmp/graph5806370747055727704.bin' '-w' '/tmp/graph5806370747055727704.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5806370747055727704.bin' '-l' '-1' '-v' '-w' '/tmp/graph5806370747055727704.weights' '-q' '0' '-e' '0.001'
[2026-05-26 23:59:35] [INFO ] Decomposing Gal with order
[2026-05-26 23:59:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 23:59:36] [INFO ] Removed a total of 507 redundant transitions.
[2026-05-26 23:59:36] [INFO ] Flatten gal took : 26 ms
[2026-05-26 23:59:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 7 ms.
[2026-05-26 23:59:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality13344634931324158982.gal : 5 ms
[2026-05-26 23:59:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality1023383339105523149.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/CTLCardinality13344634931324158982.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1023383339105523149.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,2.55376e+10,10.234,170624,2086,86,212625,1230,1074,967462,99,4750,0


Converting to forward existential form...Done !
original formula: AG(AX(EF(((i11.i2.u87.p305==0) * EX(((i7.i0.u50.p206==0)||(i10.u67.p323==1)))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(TRUE U ((i11.i2.u87.p305==0) * EX(((i7.i0.u50.p206==0)||(i10.u67.p323==1)))))))] = F...159
Reverse transition relation is NOT exact ! Due to transitions t60, t67, t145, t152, t188, t190, t191, t193, t202, t204, t211, t216, t217, t219, t248, t250,...1203
(forward)formula 0,0,14.1439,170624,1,0,212625,1497,6394,967462,475,5283,555068
FORMULA FireWire-PT-18-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 590/590 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 350 transition count 590
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 40 place count 313 transition count 547
Iterating global reduction 1 with 37 rules applied. Total rules applied 77 place count 313 transition count 547
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 88 place count 302 transition count 509
Iterating global reduction 1 with 11 rules applied. Total rules applied 99 place count 302 transition count 509
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 100 place count 302 transition count 508
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 104 place count 298 transition count 501
Iterating global reduction 2 with 4 rules applied. Total rules applied 108 place count 298 transition count 501
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 297 transition count 499
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 297 transition count 499
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 296 transition count 496
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 296 transition count 496
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 295 transition count 494
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 295 transition count 494
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 294 transition count 491
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 294 transition count 491
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 117 place count 293 transition count 489
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 293 transition count 489
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 119 place count 292 transition count 486
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 292 transition count 486
Applied a total of 120 rules in 28 ms. Remains 292 /353 variables (removed 61) and now considering 486/590 (removed 104) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15932336634346366593.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18160452214304304335.kers'
[2026-05-26 23:59:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15932336634346366593.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18160452214304304335.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 486 rows 292 cols 1506 entries
Finished phase 1 with 285 SingleSign rule and 0 generalized
[2026-05-26 23:59:50] [INFO ] Computed 7 invariants in 4 ms
Computed 7 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-18160452214304304335.kers
Total runtime 6 ms.
[2026-05-26 23:59:50] [INFO ] Implicit Places using invariants in 261 ms returned []
[2026-05-26 23:59:50] [INFO ] Invariant cache hit.
[2026-05-26 23:59:51] [INFO ] Implicit Places using invariants and state equation in 711 ms returned []
Implicit Place search using SMT with State Equation took 974 ms to find 0 implicit places.
Running 485 sub problems to find dead transitions.
[2026-05-26 23:59:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/291 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 1 (OVERLAPS) 1/292 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 485 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 485 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 292/778 variables, and 17 constraints, problems are : Problem set: 0 solved, 485 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/292 constraints, PredecessorRefiner: 485/485 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 485 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/291 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 1 (OVERLAPS) 1/292 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 6 (OVERLAPS) 486/778 variables, 292/311 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/778 variables, 485/796 constraints. Problems are: Problem set: 0 solved, 485 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 778/778 variables, and 796 constraints, problems are : Problem set: 0 solved, 485 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 292/292 constraints, PredecessorRefiner: 485/485 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60108ms problems are : Problem set: 0 solved, 485 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Starting structural reductions in LTL mode, iteration 1 : 292/353 places, 486/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61116 ms. Remains : 292/353 places, 486/590 transitions.
[2026-05-27 00:00:51] [INFO ] Flatten gal took : 10 ms
[2026-05-27 00:00:51] [INFO ] Flatten gal took : 9 ms
[2026-05-27 00:00:51] [INFO ] Input system was already deterministic with 486 transitions.
[2026-05-27 00:00:51] [INFO ] Flatten gal took : 9 ms
[2026-05-27 00:00:51] [INFO ] Flatten gal took : 10 ms
[2026-05-27 00:00:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality6309996643979369634.gal : 2 ms
[2026-05-27 00:00:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality17280478390726177545.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/CTLCardinality6309996643979369634.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17280478390726177545.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-27 00:01:21] [INFO ] Flatten gal took : 13 ms
[2026-05-27 00:01:21] [INFO ] Applying decomposition
[2026-05-27 00:01:21] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10109736458777667316.txt' '-o' '/tmp/graph10109736458777667316.bin' '-w' '/tmp/graph10109736458777667316.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10109736458777667316.bin' '-l' '-1' '-v' '-w' '/tmp/graph10109736458777667316.weights' '-q' '0' '-e' '0.001'
[2026-05-27 00:01:21] [INFO ] Decomposing Gal with order
[2026-05-27 00:01:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 00:01:21] [INFO ] Removed a total of 526 redundant transitions.
[2026-05-27 00:01:21] [INFO ] Flatten gal took : 23 ms
[2026-05-27 00:01:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 7 ms.
[2026-05-27 00:01:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality7182876819521074384.gal : 4 ms
[2026-05-27 00:01:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality11980374211182111928.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/CTLCardinality7182876819521074384.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11980374211182111928.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 : 353/353 places, 590/590 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 351 transition count 590
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 40 place count 313 transition count 546
Iterating global reduction 1 with 38 rules applied. Total rules applied 78 place count 313 transition count 546
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 79 place count 313 transition count 545
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 91 place count 301 transition count 509
Iterating global reduction 2 with 12 rules applied. Total rules applied 103 place count 301 transition count 509
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 105 place count 301 transition count 507
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 108 place count 298 transition count 504
Iterating global reduction 3 with 3 rules applied. Total rules applied 111 place count 298 transition count 504
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 112 place count 298 transition count 503
Applied a total of 112 rules in 13 ms. Remains 298 /353 variables (removed 55) and now considering 503/590 (removed 87) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5589622103361813295.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-935236033299330806.kers'
[2026-05-27 00:01:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5589622103361813295.kers, --Pflows, --basisKERS=/tmp/petrispot-output-935236033299330806.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 503 rows 298 cols 1571 entries
Finished phase 1 with 291 SingleSign rule and 0 generalized
[2026-05-27 00:01:51] [INFO ] Computed 7 invariants in 4 ms
Computed 7 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-935236033299330806.kers
Total runtime 5 ms.
[2026-05-27 00:01:52] [INFO ] Implicit Places using invariants in 377 ms returned []
[2026-05-27 00:01:52] [INFO ] Invariant cache hit.
[2026-05-27 00:01:52] [INFO ] Implicit Places using invariants and state equation in 776 ms returned []
Implicit Place search using SMT with State Equation took 1155 ms to find 0 implicit places.
Running 502 sub problems to find dead transitions.
[2026-05-27 00:01:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (OVERLAPS) 1/297 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 297/801 variables, and 18 constraints, problems are : Problem set: 0 solved, 502 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/298 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (OVERLAPS) 1/297 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 297/801 variables, and 24 constraints, problems are : Problem set: 0 solved, 502 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/298 constraints, PredecessorRefiner: 0/502 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60129ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 60130ms
Starting structural reductions in LTL mode, iteration 1 : 298/353 places, 503/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61301 ms. Remains : 298/353 places, 503/590 transitions.
[2026-05-27 00:02:53] [INFO ] Flatten gal took : 15 ms
[2026-05-27 00:02:53] [INFO ] Flatten gal took : 16 ms
[2026-05-27 00:02:53] [INFO ] Input system was already deterministic with 503 transitions.
[2026-05-27 00:02:53] [INFO ] Flatten gal took : 16 ms
[2026-05-27 00:02:53] [INFO ] Flatten gal took : 16 ms
[2026-05-27 00:02:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality17924873352205120520.gal : 4 ms
[2026-05-27 00:02:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality16883845719878659697.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/CTLCardinality17924873352205120520.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16883845719878659697.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.
Detected timeout of ITS tools.
[2026-05-27 00:03:23] [INFO ] Flatten gal took : 17 ms
[2026-05-27 00:03:23] [INFO ] Applying decomposition
[2026-05-27 00:03:23] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17974728505249165488.txt' '-o' '/tmp/graph17974728505249165488.bin' '-w' '/tmp/graph17974728505249165488.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17974728505249165488.bin' '-l' '-1' '-v' '-w' '/tmp/graph17974728505249165488.weights' '-q' '0' '-e' '0.001'
[2026-05-27 00:03:23] [INFO ] Decomposing Gal with order
[2026-05-27 00:03:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 00:03:23] [INFO ] Removed a total of 557 redundant transitions.
[2026-05-27 00:03:23] [INFO ] Flatten gal took : 40 ms
[2026-05-27 00:03:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 8 ms.
[2026-05-27 00:03:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality11834430472412803392.gal : 8 ms
[2026-05-27 00:03:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality9802404081405322414.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/CTLCardinality11834430472412803392.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9802404081405322414.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 : 353/353 places, 590/590 transitions.
Graph (trivial) has 256 edges and 353 vertex of which 12 / 353 are part of one of the 3 SCC in 1 ms
Free SCC test removed 9 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 1074 edges and 344 vertex of which 341 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 340 transition count 526
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 109 place count 287 transition count 525
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 109 place count 287 transition count 508
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 143 place count 270 transition count 508
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 170 place count 243 transition count 473
Iterating global reduction 2 with 27 rules applied. Total rules applied 197 place count 243 transition count 473
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 199 place count 243 transition count 471
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 199 place count 243 transition count 466
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 209 place count 238 transition count 466
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 218 place count 229 transition count 451
Iterating global reduction 3 with 9 rules applied. Total rules applied 227 place count 229 transition count 451
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 229 place count 229 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 230 place count 228 transition count 449
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 232 place count 226 transition count 444
Iterating global reduction 5 with 2 rules applied. Total rules applied 234 place count 226 transition count 444
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 236 place count 224 transition count 439
Iterating global reduction 5 with 2 rules applied. Total rules applied 238 place count 224 transition count 439
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 240 place count 222 transition count 434
Iterating global reduction 5 with 2 rules applied. Total rules applied 242 place count 222 transition count 434
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 244 place count 220 transition count 429
Iterating global reduction 5 with 2 rules applied. Total rules applied 246 place count 220 transition count 429
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 248 place count 218 transition count 424
Iterating global reduction 5 with 2 rules applied. Total rules applied 250 place count 218 transition count 424
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 252 place count 216 transition count 419
Iterating global reduction 5 with 2 rules applied. Total rules applied 254 place count 216 transition count 419
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 256 place count 214 transition count 414
Iterating global reduction 5 with 2 rules applied. Total rules applied 258 place count 214 transition count 414
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 260 place count 212 transition count 409
Iterating global reduction 5 with 2 rules applied. Total rules applied 262 place count 212 transition count 409
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 264 place count 210 transition count 404
Iterating global reduction 5 with 2 rules applied. Total rules applied 266 place count 210 transition count 404
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 268 place count 208 transition count 400
Iterating global reduction 5 with 2 rules applied. Total rules applied 270 place count 208 transition count 400
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 272 place count 206 transition count 396
Iterating global reduction 5 with 2 rules applied. Total rules applied 274 place count 206 transition count 396
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 275 place count 205 transition count 394
Iterating global reduction 5 with 1 rules applied. Total rules applied 276 place count 205 transition count 394
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 314 place count 186 transition count 375
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 316 place count 186 transition count 373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 317 place count 185 transition count 373
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 319 place count 183 transition count 351
Iterating global reduction 7 with 2 rules applied. Total rules applied 321 place count 183 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 322 place count 183 transition count 350
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 324 place count 182 transition count 349
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 325 place count 181 transition count 348
Applied a total of 325 rules in 89 ms. Remains 181 /353 variables (removed 172) and now considering 348/590 (removed 242) transitions.
[2026-05-27 00:03:53] [INFO ] Flow matrix only has 344 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9730629887330123149.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6246445119070258286.kers'
[2026-05-27 00:03:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9730629887330123149.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6246445119070258286.kers]
Normalized transition count is 343 out of 344 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 343 rows 181 cols 1124 entries
Finished phase 1 with 174 SingleSign rule and 0 generalized
[2026-05-27 00:03:53] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6246445119070258286.kers
Total runtime 3 ms.
[2026-05-27 00:03:53] [INFO ] Implicit Places using invariants in 195 ms returned []
[2026-05-27 00:03:53] [INFO ] Flow matrix only has 344 transitions (discarded 4 similar events)
[2026-05-27 00:03:53] [INFO ] Invariant cache hit.
[2026-05-27 00:03:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-27 00:03:54] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
[2026-05-27 00:03:54] [INFO ] Redundant transitions in 4 ms returned []
Running 339 sub problems to find dead transitions.
[2026-05-27 00:03:54] [INFO ] Flow matrix only has 344 transitions (discarded 4 similar events)
[2026-05-27 00:03:54] [INFO ] Invariant cache hit.
[2026-05-27 00:03:54] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 4 (OVERLAPS) 343/522 variables, 179/194 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 522/525 variables, and 198 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 179/181 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 339 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (OVERLAPS) 343/522 variables, 179/196 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 339/537 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 1/538 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 522/525 variables, and 538 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 179/181 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 339 unsolved
Search for dead transitions found 0 dead transitions in 60114ms
Starting structural reductions in SI_CTL mode, iteration 1 : 181/353 places, 348/590 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60899 ms. Remains : 181/353 places, 348/590 transitions.
[2026-05-27 00:04:54] [INFO ] Flatten gal took : 9 ms
[2026-05-27 00:04:54] [INFO ] Flatten gal took : 11 ms
[2026-05-27 00:04:54] [INFO ] Input system was already deterministic with 348 transitions.
[2026-05-27 00:04:54] [INFO ] Flatten gal took : 10 ms
[2026-05-27 00:04:54] [INFO ] Flatten gal took : 38 ms
[2026-05-27 00:04:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2414226707116222014.gal : 3 ms
[2026-05-27 00:04:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4190201058662655847.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2414226707116222014.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4190201058662655847.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 40000 steps (1734 resets) in 286 ms. (139 steps per ms) remains 1/1 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40003 steps (405 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality4190201058662655847.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 20
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :20 after 39
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :39 after 169
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :169 after 299
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :299 after 533
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :533 after 881
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :881 after 3426
Reachability property FireWire-PT-18-CTLCardinality-2024-12 is true.
FORMULA FireWire-PT-18-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,15069,0.458399,11384,2,1745,15,17387,6,0,1069,18897,0
Total reachable state count : 15069

Verifying 1 reachability properties.
Reachability property FireWire-PT-18-CTLCardinality-2024-12 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FireWire-PT-18-CTLCardinality-2024-12,70,0.461254,11504,2,232,15,17387,7,0,1072,18897,0
Interrupted probabilistic random walk after 1258212 steps, run timeout after 3001 ms. (steps per millisecond=419 ) properties seen :0 out of 1
Probabilistic random walk after 1258212 steps, saw 258764 distinct states, run finished after 3001 ms. (steps per millisecond=419 ) properties seen :0
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 590/590 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 350 transition count 590
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 44 place count 309 transition count 542
Iterating global reduction 1 with 41 rules applied. Total rules applied 85 place count 309 transition count 542
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 86 place count 309 transition count 541
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 99 place count 296 transition count 501
Iterating global reduction 2 with 13 rules applied. Total rules applied 112 place count 296 transition count 501
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 114 place count 296 transition count 499
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 117 place count 293 transition count 495
Iterating global reduction 3 with 3 rules applied. Total rules applied 120 place count 293 transition count 495
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 121 place count 293 transition count 494
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 122 place count 292 transition count 491
Iterating global reduction 4 with 1 rules applied. Total rules applied 123 place count 292 transition count 491
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 124 place count 291 transition count 489
Iterating global reduction 4 with 1 rules applied. Total rules applied 125 place count 291 transition count 489
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 126 place count 290 transition count 486
Iterating global reduction 4 with 1 rules applied. Total rules applied 127 place count 290 transition count 486
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 128 place count 289 transition count 484
Iterating global reduction 4 with 1 rules applied. Total rules applied 129 place count 289 transition count 484
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 130 place count 288 transition count 481
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 288 transition count 481
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 132 place count 287 transition count 479
Iterating global reduction 4 with 1 rules applied. Total rules applied 133 place count 287 transition count 479
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 134 place count 286 transition count 476
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 286 transition count 476
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 136 place count 285 transition count 474
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 285 transition count 474
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 138 place count 284 transition count 472
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 284 transition count 472
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 140 place count 283 transition count 470
Iterating global reduction 4 with 1 rules applied. Total rules applied 141 place count 283 transition count 470
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 142 place count 282 transition count 469
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 282 transition count 469
Applied a total of 143 rules in 44 ms. Remains 282 /353 variables (removed 71) and now considering 469/590 (removed 121) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-296143469707077108.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13952739828644538291.kers'
[2026-05-27 00:04:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-296143469707077108.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13952739828644538291.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 469 rows 282 cols 1449 entries
Finished phase 1 with 275 SingleSign rule and 0 generalized
[2026-05-27 00:04:57] [INFO ] Computed 7 invariants in 4 ms
Computed 7 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-13952739828644538291.kers
Total runtime 6 ms.
[2026-05-27 00:04:57] [INFO ] Implicit Places using invariants in 368 ms returned []
[2026-05-27 00:04:57] [INFO ] Invariant cache hit.
[2026-05-27 00:04:58] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 975 ms to find 0 implicit places.
Running 468 sub problems to find dead transitions.
[2026-05-27 00:04:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 1 (OVERLAPS) 1/282 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 4 (OVERLAPS) 469/751 variables, 282/298 constraints. Problems are: Problem set: 0 solved, 468 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 751/751 variables, and 298 constraints, problems are : Problem set: 0 solved, 468 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 468/468 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 468 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 1 (OVERLAPS) 1/282 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 4 (OVERLAPS) 469/751 variables, 282/298 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/751 variables, 468/766 constraints. Problems are: Problem set: 0 solved, 468 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 751/751 variables, and 769 constraints, problems are : Problem set: 0 solved, 468 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 468/468 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60125ms problems are : Problem set: 0 solved, 468 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Starting structural reductions in LTL mode, iteration 1 : 282/353 places, 469/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61149 ms. Remains : 282/353 places, 469/590 transitions.
[2026-05-27 00:05:58] [INFO ] Flatten gal took : 13 ms
[2026-05-27 00:05:58] [INFO ] Flatten gal took : 15 ms
[2026-05-27 00:05:58] [INFO ] Input system was already deterministic with 469 transitions.
[2026-05-27 00:05:58] [INFO ] Flatten gal took : 15 ms
[2026-05-27 00:05:58] [INFO ] Flatten gal took : 15 ms
[2026-05-27 00:05:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality5510892305767991203.gal : 4 ms
[2026-05-27 00:05:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality5738725949014951331.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/CTLCardinality5510892305767991203.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5738725949014951331.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-27 00:06:28] [INFO ] Flatten gal took : 9 ms
[2026-05-27 00:06:28] [INFO ] Applying decomposition
[2026-05-27 00:06:28] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17673994665895725247.txt' '-o' '/tmp/graph17673994665895725247.bin' '-w' '/tmp/graph17673994665895725247.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17673994665895725247.bin' '-l' '-1' '-v' '-w' '/tmp/graph17673994665895725247.weights' '-q' '0' '-e' '0.001'
[2026-05-27 00:06:28] [INFO ] Decomposing Gal with order
[2026-05-27 00:06:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 00:06:28] [INFO ] Removed a total of 508 redundant transitions.
[2026-05-27 00:06:28] [INFO ] Flatten gal took : 21 ms
[2026-05-27 00:06:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 4 ms.
[2026-05-27 00:06:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality3392319725163613116.gal : 4 ms
[2026-05-27 00:06:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality10875142326048272963.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/CTLCardinality3392319725163613116.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10875142326048272963.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 : 353/353 places, 590/590 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 351 transition count 590
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 44 place count 309 transition count 541
Iterating global reduction 1 with 42 rules applied. Total rules applied 86 place count 309 transition count 541
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 87 place count 309 transition count 540
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 102 place count 294 transition count 497
Iterating global reduction 2 with 15 rules applied. Total rules applied 117 place count 294 transition count 497
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 119 place count 294 transition count 495
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 124 place count 289 transition count 487
Iterating global reduction 3 with 5 rules applied. Total rules applied 129 place count 289 transition count 487
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 130 place count 289 transition count 486
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 132 place count 287 transition count 481
Iterating global reduction 4 with 2 rules applied. Total rules applied 134 place count 287 transition count 481
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 136 place count 285 transition count 476
Iterating global reduction 4 with 2 rules applied. Total rules applied 138 place count 285 transition count 476
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 140 place count 283 transition count 471
Iterating global reduction 4 with 2 rules applied. Total rules applied 142 place count 283 transition count 471
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 144 place count 281 transition count 466
Iterating global reduction 4 with 2 rules applied. Total rules applied 146 place count 281 transition count 466
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 148 place count 279 transition count 461
Iterating global reduction 4 with 2 rules applied. Total rules applied 150 place count 279 transition count 461
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 152 place count 277 transition count 456
Iterating global reduction 4 with 2 rules applied. Total rules applied 154 place count 277 transition count 456
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 156 place count 275 transition count 451
Iterating global reduction 4 with 2 rules applied. Total rules applied 158 place count 275 transition count 451
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 160 place count 273 transition count 446
Iterating global reduction 4 with 2 rules applied. Total rules applied 162 place count 273 transition count 446
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 164 place count 271 transition count 442
Iterating global reduction 4 with 2 rules applied. Total rules applied 166 place count 271 transition count 442
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 168 place count 269 transition count 438
Iterating global reduction 4 with 2 rules applied. Total rules applied 170 place count 269 transition count 438
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 172 place count 267 transition count 435
Iterating global reduction 4 with 2 rules applied. Total rules applied 174 place count 267 transition count 435
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 175 place count 266 transition count 434
Iterating global reduction 4 with 1 rules applied. Total rules applied 176 place count 266 transition count 434
Applied a total of 176 rules in 72 ms. Remains 266 /353 variables (removed 87) and now considering 434/590 (removed 156) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3811982334070503007.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12208694078405824331.kers'
[2026-05-27 00:06:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3811982334070503007.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12208694078405824331.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 434 rows 266 cols 1318 entries
Finished phase 1 with 259 SingleSign rule and 0 generalized
[2026-05-27 00:06:59] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12208694078405824331.kers
Total runtime 3 ms.
[2026-05-27 00:06:59] [INFO ] Implicit Places using invariants in 318 ms returned []
[2026-05-27 00:06:59] [INFO ] Invariant cache hit.
[2026-05-27 00:06:59] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 871 ms to find 0 implicit places.
Running 433 sub problems to find dead transitions.
[2026-05-27 00:06:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 433 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 265/700 variables, and 16 constraints, problems are : Problem set: 0 solved, 433 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/266 constraints, PredecessorRefiner: 433/433 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 433 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 7/30 constraints. Problems are: Problem set: 0 solved, 433 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 265/700 variables, and 30 constraints, problems are : Problem set: 0 solved, 433 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/266 constraints, PredecessorRefiner: 0/433 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60140ms problems are : Problem set: 0 solved, 433 unsolved
Search for dead transitions found 0 dead transitions in 60142ms
Starting structural reductions in LTL mode, iteration 1 : 266/353 places, 434/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61088 ms. Remains : 266/353 places, 434/590 transitions.
[2026-05-27 00:08:00] [INFO ] Flatten gal took : 13 ms
[2026-05-27 00:08:00] [INFO ] Flatten gal took : 13 ms
[2026-05-27 00:08:00] [INFO ] Input system was already deterministic with 434 transitions.
[2026-05-27 00:08:00] [INFO ] Flatten gal took : 13 ms
[2026-05-27 00:08:00] [INFO ] Flatten gal took : 13 ms
[2026-05-27 00:08:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality5978220680685028342.gal : 3 ms
[2026-05-27 00:08:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality8212932478115715831.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/CTLCardinality5978220680685028342.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8212932478115715831.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-27 00:08:30] [INFO ] Flatten gal took : 11 ms
[2026-05-27 00:08:30] [INFO ] Applying decomposition
[2026-05-27 00:08:30] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9867399591573932372.txt' '-o' '/tmp/graph9867399591573932372.bin' '-w' '/tmp/graph9867399591573932372.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9867399591573932372.bin' '-l' '-1' '-v' '-w' '/tmp/graph9867399591573932372.weights' '-q' '0' '-e' '0.001'
[2026-05-27 00:08:30] [INFO ] Decomposing Gal with order
[2026-05-27 00:08:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 00:08:30] [INFO ] Removed a total of 459 redundant transitions.
[2026-05-27 00:08:30] [INFO ] Flatten gal took : 39 ms
[2026-05-27 00:08:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 4 ms.
[2026-05-27 00:08:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality8054837414457790885.gal : 3 ms
[2026-05-27 00:08:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality5643841241229345150.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/CTLCardinality8054837414457790885.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5643841241229345150.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.2745e+10,16.8353,430416,2092,81,325698,842,1000,4.21963e+06,87,3843,0


Converting to forward existential form...Done !
original formula: ((EX((AG(EX(((i10.u81.p363==0)||(i8.i0.u57.p274==1)))) * (i8.i1.u56.p273==1))) + EF(EG((i8.i2.u53.p256==1)))) + AF(AG((i5.u41.p178!=0))))
=> equivalent forward existential formula: [FwdG((Init * !((EX((!(E(TRUE U !(EX(((i10.u81.p363==0)||(i8.i0.u57.p274==1)))))) * (i8.i1.u56.p273==1))) + E(TR...233
Reverse transition relation is NOT exact ! Due to transitions t56, t63, t141, t148, t184, t189, t198, t200, t207, t212, t213, t215, t244, t246, t247, t288,...1162
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 590/590 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 351 transition count 590
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 39 place count 314 transition count 548
Iterating global reduction 1 with 37 rules applied. Total rules applied 76 place count 314 transition count 548
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 77 place count 314 transition count 547
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 90 place count 301 transition count 506
Iterating global reduction 2 with 13 rules applied. Total rules applied 103 place count 301 transition count 506
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 105 place count 301 transition count 504
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 109 place count 297 transition count 497
Iterating global reduction 3 with 4 rules applied. Total rules applied 113 place count 297 transition count 497
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 114 place count 297 transition count 496
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 116 place count 295 transition count 491
Iterating global reduction 4 with 2 rules applied. Total rules applied 118 place count 295 transition count 491
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 120 place count 293 transition count 486
Iterating global reduction 4 with 2 rules applied. Total rules applied 122 place count 293 transition count 486
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 124 place count 291 transition count 481
Iterating global reduction 4 with 2 rules applied. Total rules applied 126 place count 291 transition count 481
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 128 place count 289 transition count 476
Iterating global reduction 4 with 2 rules applied. Total rules applied 130 place count 289 transition count 476
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 132 place count 287 transition count 471
Iterating global reduction 4 with 2 rules applied. Total rules applied 134 place count 287 transition count 471
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 135 place count 286 transition count 469
Iterating global reduction 4 with 1 rules applied. Total rules applied 136 place count 286 transition count 469
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 137 place count 285 transition count 466
Iterating global reduction 4 with 1 rules applied. Total rules applied 138 place count 285 transition count 466
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 139 place count 284 transition count 464
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 284 transition count 464
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 141 place count 283 transition count 462
Iterating global reduction 4 with 1 rules applied. Total rules applied 142 place count 283 transition count 462
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 143 place count 282 transition count 460
Iterating global reduction 4 with 1 rules applied. Total rules applied 144 place count 282 transition count 460
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 145 place count 281 transition count 459
Iterating global reduction 4 with 1 rules applied. Total rules applied 146 place count 281 transition count 459
Applied a total of 146 rules in 41 ms. Remains 281 /353 variables (removed 72) and now considering 459/590 (removed 131) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1763692428217535167.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17856095921554342180.kers'
[2026-05-27 00:09:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1763692428217535167.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17856095921554342180.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 459 rows 281 cols 1398 entries
Finished phase 1 with 274 SingleSign rule and 0 generalized
[2026-05-27 00:09:00] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17856095921554342180.kers
Total runtime 4 ms.
[2026-05-27 00:09:00] [INFO ] Implicit Places using invariants in 234 ms returned []
[2026-05-27 00:09:00] [INFO ] Invariant cache hit.
[2026-05-27 00:09:01] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
Running 458 sub problems to find dead transitions.
[2026-05-27 00:09:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 1 (OVERLAPS) 1/280 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/280 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 458 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 280/740 variables, and 19 constraints, problems are : Problem set: 0 solved, 458 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/281 constraints, PredecessorRefiner: 458/458 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 1 (OVERLAPS) 1/280 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/280 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 6 (OVERLAPS) 459/739 variables, 280/302 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/739 variables, 455/757 constraints. Problems are: Problem set: 0 solved, 458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 739/740 variables, and 757 constraints, problems are : Problem set: 0 solved, 458 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 280/281 constraints, PredecessorRefiner: 455/458 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60098ms problems are : Problem set: 0 solved, 458 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Starting structural reductions in LTL mode, iteration 1 : 281/353 places, 459/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60879 ms. Remains : 281/353 places, 459/590 transitions.
[2026-05-27 00:10:01] [INFO ] Flatten gal took : 8 ms
[2026-05-27 00:10:01] [INFO ] Flatten gal took : 9 ms
[2026-05-27 00:10:01] [INFO ] Input system was already deterministic with 459 transitions.
[2026-05-27 00:10:01] [INFO ] Flatten gal took : 8 ms
[2026-05-27 00:10:01] [INFO ] Flatten gal took : 8 ms
[2026-05-27 00:10:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality12495201793963357172.gal : 2 ms
[2026-05-27 00:10:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality5000205039929454802.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/CTLCardinality12495201793963357172.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5000205039929454802.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-27 00:10:31] [INFO ] Flatten gal took : 9 ms
[2026-05-27 00:10:31] [INFO ] Applying decomposition
[2026-05-27 00:10:31] [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/graph8335641341480145191.txt' '-o' '/tmp/graph8335641341480145191.bin' '-w' '/tmp/graph8335641341480145191.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8335641341480145191.bin' '-l' '-1' '-v' '-w' '/tmp/graph8335641341480145191.weights' '-q' '0' '-e' '0.001'
[2026-05-27 00:10:31] [INFO ] Decomposing Gal with order
[2026-05-27 00:10:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 00:10:31] [INFO ] Removed a total of 485 redundant transitions.
[2026-05-27 00:10:31] [INFO ] Flatten gal took : 37 ms
[2026-05-27 00:10:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 5 ms.
[2026-05-27 00:10:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality9906708448312842459.gal : 4 ms
[2026-05-27 00:10:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality3905048934163263645.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/CTLCardinality9906708448312842459.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3905048934163263645.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.
[2026-05-27 00:11:01] [INFO ] Flatten gal took : 11 ms
[2026-05-27 00:11:01] [INFO ] Flatten gal took : 17 ms
[2026-05-27 00:11:01] [INFO ] Applying decomposition
[2026-05-27 00:11:01] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8304690974297179871.txt' '-o' '/tmp/graph8304690974297179871.bin' '-w' '/tmp/graph8304690974297179871.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8304690974297179871.bin' '-l' '-1' '-v' '-w' '/tmp/graph8304690974297179871.weights' '-q' '0' '-e' '0.001'
[2026-05-27 00:11:01] [INFO ] Decomposing Gal with order
[2026-05-27 00:11:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 00:11:01] [INFO ] Removed a total of 641 redundant transitions.
[2026-05-27 00:11:01] [INFO ] Flatten gal took : 23 ms
[2026-05-27 00:11:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 8 ms.
[2026-05-27 00:11:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality14265440904533442192.gal : 4 ms
[2026-05-27 00:11:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality3740039199590378774.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/CTLCardinality14265440904533442192.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3740039199590378774.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 10 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.34483e+11,138.06,2326812,6214,149,1.95357e+06,2905,1439,2.14531e+07,120,11428,0


Converting to forward existential form...Done !
original formula: (AG(((A(AG((i9.i2.u108.p371==0)) U AF((i5.i4.u72.p194==1))) + ((i6.i1.u59.p203==0)&&(i4.i2.u17.p71==1))) * ((AX(((i5.i4.u72.p247==0)&&(i7...389
=> equivalent forward existential formula: (([FwdG((FwdU((FwdU((Init * !(E(TRUE U !(E(TRUE U !(((i2.i1.u45.p150==0)||(i5.i2.u36.p169==1)))))))),TRUE) * !((...840
Reverse transition relation is NOT exact ! Due to transitions t31, t70, t78, t186, t235, t240, t251, t261, t266, t267, t269, t274, t279, t284, t289, t293, ...1569
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,1,672.993,3398340,1,0,3.15279e+06,2905,4550,2.72222e+07,317,11428,4762705
FORMULA FireWire-PT-18-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
Detected timeout of ITS tools.
[2026-05-27 00:40:07] [INFO ] Applying decomposition
[2026-05-27 00:40:07] [INFO ] Flatten gal took : 12 ms
[2026-05-27 00:40:07] [INFO ] Decomposing Gal with order
[2026-05-27 00:40:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 00:40:07] [INFO ] Removed a total of 466 redundant transitions.
[2026-05-27 00:40:07] [INFO ] Flatten gal took : 38 ms
[2026-05-27 00:40:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 372 labels/synchronizations in 6 ms.
[2026-05-27 00:40:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality8193926854525432715.gal : 2 ms
[2026-05-27 00:40:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality9525545816797524500.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/CTLCardinality8193926854525432715.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9525545816797524500.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 9 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-18"
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 FireWire-PT-18, 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 r130-smll-177955809000281"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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