fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r082-smll-177946993700417
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for DES-PT-40b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16187.743 3600000.00 3999868.00 19931.50 FT?????T???????? normal

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.r082-smll-177946993700417.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 DES-PT-40b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993700417
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.4K Mar 6 18:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Mar 6 18:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Mar 6 18:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 6 18:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 08:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 08:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 08:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Mar 6 18:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Mar 6 18:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 6 18:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Mar 6 18:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 115K 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 DES-PT-40b-CTLCardinality-2024-00
FORMULA_NAME DES-PT-40b-CTLCardinality-2024-01
FORMULA_NAME DES-PT-40b-CTLCardinality-2024-02
FORMULA_NAME DES-PT-40b-CTLCardinality-2024-03
FORMULA_NAME DES-PT-40b-CTLCardinality-2024-04
FORMULA_NAME DES-PT-40b-CTLCardinality-2024-05
FORMULA_NAME DES-PT-40b-CTLCardinality-2024-06
FORMULA_NAME DES-PT-40b-CTLCardinality-2024-07
FORMULA_NAME DES-PT-40b-CTLCardinality-2024-08
FORMULA_NAME DES-PT-40b-CTLCardinality-2024-09
FORMULA_NAME DES-PT-40b-CTLCardinality-2024-10
FORMULA_NAME DES-PT-40b-CTLCardinality-2024-11
FORMULA_NAME DES-PT-40b-CTLCardinality-2024-12
FORMULA_NAME DES-PT-40b-CTLCardinality-2024-13
FORMULA_NAME DES-PT-40b-CTLCardinality-2024-14
FORMULA_NAME DES-PT-40b-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779712713157

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-40b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-25 12:38:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 12:38:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 12:38:35] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2026-05-25 12:38:35] [INFO ] Transformed 439 places.
[2026-05-25 12:38:35] [INFO ] Transformed 390 transitions.
[2026-05-25 12:38:35] [INFO ] Found NUPN structural information;
[2026-05-25 12:38:35] [INFO ] Parsed PT model containing 439 places and 390 transitions and 1303 arcs in 375 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 22 ms.
FORMULA DES-PT-40b-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 125 out of 439 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 390/390 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 436 transition count 390
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 17 place count 422 transition count 376
Iterating global reduction 1 with 14 rules applied. Total rules applied 31 place count 422 transition count 376
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 416 transition count 370
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 416 transition count 370
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 46 place count 416 transition count 367
Applied a total of 46 rules in 166 ms. Remains 416 /439 variables (removed 23) and now considering 367/390 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13151809796143619443.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6773131726428808216.kers'
[2026-05-25 12:38:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13151809796143619443.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6773131726428808216.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 367 rows 416 cols 1244 entries
Finished phase 1 with 193 SingleSign rule and 161 generalized
[2026-05-25 12:38:36] [INFO ] Computed 62 invariants in 3 ms
Computed 62 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-6773131726428808216.kers
Total runtime 6 ms.
[2026-05-25 12:38:37] [INFO ] Implicit Places using invariants in 1063 ms returned []
[2026-05-25 12:38:37] [INFO ] Invariant cache hit.
[2026-05-25 12:38:39] [INFO ] Implicit Places using invariants and state equation in 2272 ms returned []
Implicit Place search using SMT with State Equation took 3425 ms to find 0 implicit places.
Running 366 sub problems to find dead transitions.
[2026-05-25 12:38:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (OVERLAPS) 1/416 variables, 34/53 constraints. Problems are: Problem set: 0 solved, 366 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/416 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (OVERLAPS) 367/783 variables, 416/478 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 783/783 variables, and 490 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 416/416 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 366 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (OVERLAPS) 1/416 variables, 34/53 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/416 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 12/74 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 6/94 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 10/104 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/783 variables, and 107 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/416 constraints, PredecessorRefiner: 0/366 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60615ms problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 60647ms
Starting structural reductions in LTL mode, iteration 1 : 416/439 places, 367/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64315 ms. Remains : 416/439 places, 367/390 transitions.
Starting structural reductions in LTL mode, iteration 0 : 416/416 places, 367/367 transitions.
Applied a total of 0 rules in 14 ms. Remains 416 /416 variables (removed 0) and now considering 367/367 (removed 0) transitions.
[2026-05-25 12:39:40] [INFO ] Invariant cache hit.
[2026-05-25 12:39:40] [INFO ] Implicit Places using invariants in 287 ms returned []
[2026-05-25 12:39:40] [INFO ] Invariant cache hit.
[2026-05-25 12:39:41] [INFO ] Implicit Places using invariants and state equation in 1204 ms returned []
Implicit Place search using SMT with State Equation took 1496 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1511 ms. Remains : 416/416 places, 367/367 transitions.
Support contains 125 out of 416 places after structural reductions.
[2026-05-25 12:39:42] [INFO ] Flatten gal took : 84 ms
[2026-05-25 12:39:42] [INFO ] Flatten gal took : 44 ms
[2026-05-25 12:39:42] [INFO ] Input system was already deterministic with 367 transitions.
Support contains 114 out of 416 places (down from 125) after GAL structural reductions.
RANDOM walk for 40000 steps (357 resets) in 2720 ms. (14 steps per ms) remains 24/70 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 24/24 properties
[2026-05-25 12:39:43] [INFO ] Invariant cache hit.
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, 24 unsolved
At refinement iteration 1 (OVERLAPS) 142/190 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 18/208 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 190/398 variables, 26/61 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 3/401 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 356/757 variables, 401/463 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/757 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (OVERLAPS) 20/777 variables, 12/475 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/777 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 24 unsolved
SMT process timed out in 5023ms, After SMT, problems are : Problem set: 0 solved, 24 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 48 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 367/367 transitions.
Graph (complete) has 935 edges and 416 vertex of which 413 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 413 transition count 351
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 401 transition count 349
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 30 place count 399 transition count 349
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 30 place count 399 transition count 340
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 48 place count 390 transition count 340
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 59 place count 379 transition count 329
Iterating global reduction 3 with 11 rules applied. Total rules applied 70 place count 379 transition count 329
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 rules applied. Total rules applied 73 place count 379 transition count 326
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 74 place count 378 transition count 326
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 80 place count 372 transition count 320
Iterating global reduction 5 with 6 rules applied. Total rules applied 86 place count 372 transition count 320
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 7 rules applied. Total rules applied 93 place count 372 transition count 313
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 95 place count 371 transition count 312
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 95 place count 371 transition count 310
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 99 place count 369 transition count 310
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 7 with 120 rules applied. Total rules applied 219 place count 309 transition count 250
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 223 place count 307 transition count 251
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 225 place count 307 transition count 249
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 227 place count 305 transition count 249
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 228 place count 304 transition count 248
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 229 place count 303 transition count 248
Applied a total of 229 rules in 225 ms. Remains 303 /416 variables (removed 113) and now considering 248/367 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 225 ms. Remains : 303/416 places, 248/367 transitions.
RANDOM walk for 40000 steps (1198 resets) in 956 ms. (41 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (20 resets) in 38 ms. (102 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (23 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (24 resets) in 25 ms. (154 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (21 resets) in 17 ms. (222 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4003 steps (26 resets) in 27 ms. (142 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (23 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (23 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (22 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (18 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (21 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (25 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (21 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (23 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (17 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (20 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (18 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (22 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (22 resets) in 50 ms. (78 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (22 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (25 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (24 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (27 resets) in 25 ms. (154 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (21 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 429558 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :0 out of 23
Probabilistic random walk after 429558 steps, saw 60684 distinct states, run finished after 3013 ms. (steps per millisecond=142 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6334364430073120565.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4671370934437766979.kers'
[2026-05-25 12:39:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6334364430073120565.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4671370934437766979.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 248 rows 300 cols 1053 entries
Finished phase 1 with 71 SingleSign rule and 170 generalized
[2026-05-25 12:39:52] [INFO ] Computed 62 invariants in 3 ms
Computed 62 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4671370934437766979.kers
Total runtime 4 ms.
[2026-05-25 12:39:52] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 66/112 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 4/116 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 179/295 variables, 26/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 3/298 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 4/302 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/302 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (OVERLAPS) 248/550 variables, 302/364 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/550 variables, 2/366 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/550 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 15 (OVERLAPS) 1/551 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/551 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 17 (OVERLAPS) 0/551 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 367 constraints, problems are : Problem set: 0 solved, 23 unsolved in 7968 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 303/303 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 66/112 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 4/116 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 179/295 variables, 26/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 3/298 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 4/302 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/302 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Problem AtomicPropp46 is UNSAT
At refinement iteration 12 (OVERLAPS) 248/550 variables, 302/364 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/550 variables, 2/366 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/550 variables, 22/388 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/550 variables, 5/393 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/550 variables, 3/396 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/550 variables, 0/396 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 18 (OVERLAPS) 1/551 variables, 1/397 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/551 variables, 1/398 constraints. Problems are: Problem set: 1 solved, 22 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 398 constraints, problems are : Problem set: 1 solved, 22 unsolved in 45018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 303/303 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 22/23 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53009ms problems are : Problem set: 1 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 40 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 248/248 transitions.
Graph (complete) has 931 edges and 303 vertex of which 302 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 300 transition count 245
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 300 transition count 244
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 10 place count 299 transition count 241
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 299 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 298 transition count 240
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 297 transition count 239
Applied a total of 13 rules in 131 ms. Remains 297 /303 variables (removed 6) and now considering 239/248 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 297/303 places, 239/248 transitions.
RANDOM walk for 40000 steps (1354 resets) in 1062 ms. (37 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (32 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (28 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (32 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (23 resets) in 66 ms. (59 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (27 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (28 resets) in 43 ms. (91 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (29 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (24 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (27 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (26 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (30 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (23 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (26 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (25 resets) in 33 ms. (117 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (26 resets) in 25 ms. (154 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (26 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (27 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (23 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (22 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (29 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (27 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (32 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 422498 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :0 out of 22
Probabilistic random walk after 422498 steps, saw 59810 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16639703322906410923.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10406307435369283521.kers'
[2026-05-25 12:40:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16639703322906410923.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10406307435369283521.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 239 rows 290 cols 977 entries
Finished phase 1 with 113 SingleSign rule and 122 generalized
[2026-05-25 12:40:49] [INFO ] Computed 62 invariants in 2 ms
Computed 62 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10406307435369283521.kers
Total runtime 3 ms.
[2026-05-25 12:40:49] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 56/96 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 2/98 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 182/280 variables, 25/52 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 9/289 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 4/293 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 239/532 variables, 293/353 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/532 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/532 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (OVERLAPS) 4/536 variables, 4/359 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/536 variables, 2/361 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/536 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 18 (OVERLAPS) 0/536 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 536/536 variables, and 361 constraints, problems are : Problem set: 0 solved, 22 unsolved in 4951 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 297/297 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 56/96 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 2/98 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 182/280 variables, 25/52 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 9/289 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 4/293 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 239/532 variables, 293/353 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/532 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/532 variables, 14/369 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/532 variables, 3/372 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/532 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (OVERLAPS) 4/536 variables, 4/376 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/536 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/536 variables, 8/386 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/536 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/536 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/536 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 23 (OVERLAPS) 0/536 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 536/536 variables, and 388 constraints, problems are : Problem set: 0 solved, 22 unsolved in 53930 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 297/297 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58900ms problems are : Problem set: 0 solved, 22 unsolved
Parikh walk visited 0 properties in 9745 ms.
Support contains 40 out of 297 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 297/297 places, 239/239 transitions.
Applied a total of 0 rules in 12 ms. Remains 297 /297 variables (removed 0) and now considering 239/239 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 297/297 places, 239/239 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 297/297 places, 239/239 transitions.
Applied a total of 0 rules in 11 ms. Remains 297 /297 variables (removed 0) and now considering 239/239 (removed 0) transitions.
[2026-05-25 12:41:57] [INFO ] Invariant cache hit.
[2026-05-25 12:41:58] [INFO ] Implicit Places using invariants in 317 ms returned []
[2026-05-25 12:41:58] [INFO ] Invariant cache hit.
[2026-05-25 12:41:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 12:41:58] [INFO ] Implicit Places using invariants and state equation in 729 ms returned []
Implicit Place search using SMT with State Equation took 1049 ms to find 0 implicit places.
[2026-05-25 12:41:58] [INFO ] Redundant transitions in 13 ms returned []
Running 234 sub problems to find dead transitions.
[2026-05-25 12:41:58] [INFO ] Invariant cache hit.
[2026-05-25 12:41:58] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/292 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/292 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 3/295 variables, 23/52 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 234 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/297 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (OVERLAPS) 239/536 variables, 297/359 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 2/361 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/536 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 11 (OVERLAPS) 0/536 variables, 2/363 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/536 variables, 2/365 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/536 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 536/536 variables, and 365 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 297/297 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/292 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/292 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (OVERLAPS) 3/295 variables, 23/55 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (OVERLAPS) 2/297 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 11 (OVERLAPS) 239/536 variables, 297/366 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/536 variables, 2/368 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/536 variables, 234/602 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 536/536 variables, and 602 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 297/297 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60109ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61195 ms. Remains : 297/297 places, 239/239 transitions.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2026-05-25 12:42:58] [INFO ] Flatten gal took : 31 ms
[2026-05-25 12:42:58] [INFO ] Flatten gal took : 29 ms
[2026-05-25 12:42:59] [INFO ] Input system was already deterministic with 367 transitions.
Computed a total of 218 stabilizing places and 210 stable transitions
Graph (complete) has 935 edges and 416 vertex of which 408 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.18 ms
Starting structural reductions in LTL mode, iteration 0 : 416/416 places, 367/367 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 401 transition count 352
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 401 transition count 352
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 401 transition count 348
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 394 transition count 341
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 394 transition count 341
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 54 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 393 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 393 transition count 333
Applied a total of 57 rules in 52 ms. Remains 393 /416 variables (removed 23) and now considering 333/367 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14593879645958623319.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4921994691250444382.kers'
[2026-05-25 12:42:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14593879645958623319.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4921994691250444382.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 333 rows 393 cols 1157 entries
Finished phase 1 with 171 SingleSign rule and 160 generalized
[2026-05-25 12:42:59] [INFO ] Computed 62 invariants in 3 ms
Computed 62 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-4921994691250444382.kers
Total runtime 4 ms.
[2026-05-25 12:42:59] [INFO ] Implicit Places using invariants in 330 ms returned []
[2026-05-25 12:42:59] [INFO ] Invariant cache hit.
[2026-05-25 12:43:00] [INFO ] Implicit Places using invariants and state equation in 1456 ms returned []
Implicit Place search using SMT with State Equation took 1792 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2026-05-25 12:43:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 9/464 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 464 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 14/85 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 393/726 variables, and 113 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/393 constraints, PredecessorRefiner: 0/332 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Starting structural reductions in LTL mode, iteration 1 : 393/416 places, 333/367 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61975 ms. Remains : 393/416 places, 333/367 transitions.
[2026-05-25 12:44:01] [INFO ] Flatten gal took : 39 ms
[2026-05-25 12:44:01] [INFO ] Flatten gal took : 39 ms
[2026-05-25 12:44:01] [INFO ] Input system was already deterministic with 333 transitions.
[2026-05-25 12:44:01] [INFO ] Flatten gal took : 50 ms
[2026-05-25 12:44:01] [INFO ] Flatten gal took : 56 ms
[2026-05-25 12:44:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality778892161534749.gal : 41 ms
[2026-05-25 12:44:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality12453295335059682337.ctl : 20 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/CTLCardinality778892161534749.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12453295335059682337.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 -...280
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 12:44:31] [INFO ] Flatten gal took : 22 ms
[2026-05-25 12:44:31] [INFO ] Applying decomposition
[2026-05-25 12:44:31] [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/graph17646958387536037775.txt' '-o' '/tmp/graph17646958387536037775.bin' '-w' '/tmp/graph17646958387536037775.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17646958387536037775.bin' '-l' '-1' '-v' '-w' '/tmp/graph17646958387536037775.weights' '-q' '0' '-e' '0.001'
[2026-05-25 12:44:31] [INFO ] Decomposing Gal with order
[2026-05-25 12:44:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 12:44:31] [INFO ] Removed a total of 11 redundant transitions.
[2026-05-25 12:44:32] [INFO ] Flatten gal took : 103 ms
[2026-05-25 12:44:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 9 ms.
[2026-05-25 12:44:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality3713681248106756249.gal : 13 ms
[2026-05-25 12:44:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality8982170395069146689.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/CTLCardinality3713681248106756249.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8982170395069146689.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.7246e+20,12.6314,241996,13844,4108,521786,28586,625,777498,400,177216,0


Converting to forward existential form...Done !
original formula: EX((i7.i0.i1.u62.p376==1))
=> equivalent forward existential formula: [(EY(Init) * (i7.i0.i1.u62.p376==1))] != FALSE
(forward)formula 0,0,12.7105,242008,1,0,521786,28586,843,777498,631,177216,2427
FORMULA DES-PT-40b-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 SI_CTL mode, iteration 0 : 416/416 places, 367/367 transitions.
Graph (complete) has 935 edges and 416 vertex of which 408 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 407 transition count 346
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 392 transition count 346
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 31 place count 392 transition count 336
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 51 place count 382 transition count 336
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 63 place count 370 transition count 324
Iterating global reduction 2 with 12 rules applied. Total rules applied 75 place count 370 transition count 324
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 2 with 5 rules applied. Total rules applied 80 place count 370 transition count 319
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 81 place count 369 transition count 319
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 81 place count 369 transition count 318
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 83 place count 368 transition count 318
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 89 place count 362 transition count 312
Iterating global reduction 4 with 6 rules applied. Total rules applied 95 place count 362 transition count 312
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 4 with 7 rules applied. Total rules applied 102 place count 362 transition count 305
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 104 place count 361 transition count 304
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 104 place count 361 transition count 302
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 108 place count 359 transition count 302
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 6 with 142 rules applied. Total rules applied 250 place count 288 transition count 231
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 252 place count 286 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 253 place count 285 transition count 229
Applied a total of 253 rules in 221 ms. Remains 285 /416 variables (removed 131) and now considering 229/367 (removed 138) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14844881008978614962.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10091458618302168362.kers'
[2026-05-25 12:44:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14844881008978614962.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10091458618302168362.kers]
Culling duplicate invariants (modulo rational): removing 27 columns.
Culled 27 columns in 0 ms.
// Phase 1: matrix 229 rows 258 cols 856 entries
Finished phase 1 with 172 SingleSign rule and 55 generalized
[2026-05-25 12:44:45] [INFO ] Computed 58 invariants in 2 ms
Computed 58 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10091458618302168362.kers
Total runtime 2 ms.
[2026-05-25 12:44:45] [INFO ] Implicit Places using invariants in 546 ms returned []
[2026-05-25 12:44:45] [INFO ] Invariant cache hit.
[2026-05-25 12:44:46] [INFO ] Implicit Places using invariants and state equation in 738 ms returned []
Implicit Place search using SMT with State Equation took 1293 ms to find 0 implicit places.
[2026-05-25 12:44:46] [INFO ] Redundant transitions in 11 ms returned []
Running 226 sub problems to find dead transitions.
[2026-05-25 12:44:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 2/284 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (OVERLAPS) 229/513 variables, 284/342 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/513 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/513 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 1/514 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/514 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/514 variables, and 345 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (OVERLAPS) 2/284 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (OVERLAPS) 229/513 variables, 284/344 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/513 variables, 226/570 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 513/514 variables, and 572 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 284/285 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Starting structural reductions in SI_CTL mode, iteration 1 : 285/416 places, 229/367 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61641 ms. Remains : 285/416 places, 229/367 transitions.
[2026-05-25 12:45:46] [INFO ] Flatten gal took : 13 ms
[2026-05-25 12:45:46] [INFO ] Flatten gal took : 12 ms
[2026-05-25 12:45:46] [INFO ] Input system was already deterministic with 229 transitions.
[2026-05-25 12:45:46] [INFO ] Flatten gal took : 35 ms
RANDOM walk for 40000 steps (1288 resets) in 213 ms. (186 steps per ms) remains 1/1 properties
[2026-05-25 12:45:46] [INFO ] Flatten gal took : 34 ms
[2026-05-25 12:45:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10559532672799570137.gal : 8 ms
[2026-05-25 12:45:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16967167544454031407.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/ReachabilityCardinality10559532672799570137.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16967167544454031407.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (244 resets) in 110 ms. (360 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 ...330
Loading property file /tmp/ReachabilityCardinality16967167544454031407.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 48
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :48 after 65
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :65 after 856
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :856 after 5872
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5872 after 375168
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.01197e+06 after 1.22449e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.22449e+06 after 1.76838e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.29221e+07 after 5.35501e+08
Interrupted probabilistic random walk after 1104413 steps, run timeout after 3001 ms. (steps per millisecond=368 ) properties seen :0 out of 1
Probabilistic random walk after 1104413 steps, saw 148220 distinct states, run finished after 3001 ms. (steps per millisecond=368 ) properties seen :0
[2026-05-25 12:45:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 161/162 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 35/197 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/199 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/224 variables, 13/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/227 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5.35501e+08 after 6.05197e+09
At refinement iteration 11 (OVERLAPS) 177/404 variables, 227/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 20/424 variables, 11/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/424 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/424 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/425 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/425 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/425 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 49/474 variables, 6/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/474 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/474 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 40/514 variables, 40/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/514 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/514 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 343 constraints, problems are : Problem set: 0 solved, 1 unsolved in 431 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 161/162 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/197 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/199 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/224 variables, 13/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/227 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 177/404 variables, 227/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/404 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 20/424 variables, 11/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/424 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/424 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/425 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/425 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/425 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 49/474 variables, 6/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/474 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/474 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 40/514 variables, 40/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/514 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/514 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 514/514 variables, and 344 constraints, problems are : Problem set: 0 solved, 1 unsolved in 537 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 975ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 306 ms.
Support contains 1 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 229/229 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 285 transition count 225
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 283 transition count 225
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 279 transition count 221
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 277 transition count 223
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 277 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 276 transition count 222
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 276 transition count 222
Applied a total of 21 rules in 46 ms. Remains 276 /285 variables (removed 9) and now considering 222/229 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 276/285 places, 222/229 transitions.
RANDOM walk for 4000000 steps (191108 resets) in 12236 ms. (326 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :6.05197e+09 after 9.99078e+09
BEST_FIRST walk for 4000003 steps (36643 resets) in 5018 ms. (796 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :9.99078e+09 after 1.06825e+10
Interrupted probabilistic random walk after 4808934 steps, run timeout after 12001 ms. (steps per millisecond=400 ) properties seen :0 out of 1
Probabilistic random walk after 4808934 steps, saw 661553 distinct states, run finished after 12001 ms. (steps per millisecond=400 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4599689187758352154.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16583649232988420689.kers'
[2026-05-25 12:46:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4599689187758352154.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16583649232988420689.kers]
Culling duplicate invariants (modulo rational): removing 29 columns.
Culled 29 columns in 0 ms.
// Phase 1: matrix 222 rows 247 cols 866 entries
Finished phase 1 with 166 SingleSign rule and 50 generalized
[2026-05-25 12:46:07] [INFO ] Computed 60 invariants in 2 ms
Computed 60 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16583649232988420689.kers
Total runtime 3 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 167/168 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 39/207 variables, 31/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/209 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/221 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/224 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 178/402 variables, 224/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/402 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/415 variables, 8/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/415 variables, 3/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/415 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/417 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/417 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/417 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 42/459 variables, 3/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/459 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/459 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 39/498 variables, 39/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/498 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/498 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 336 constraints, problems are : Problem set: 0 solved, 1 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 167/168 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/207 variables, 31/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/209 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/221 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/224 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/224 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 178/402 variables, 224/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/402 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/402 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 13/415 variables, 8/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/415 variables, 3/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/415 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/417 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/417 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/417 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 42/459 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/459 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/459 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 39/498 variables, 39/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/498 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/498 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/498 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 498/498 variables, and 340 constraints, problems are : Problem set: 0 solved, 1 unsolved in 716 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1066ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 304 ms.
Support contains 1 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 222/222 transitions.
Applied a total of 0 rules in 9 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 276/276 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 222/222 transitions.
Applied a total of 0 rules in 8 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2026-05-25 12:46:09] [INFO ] Invariant cache hit.
[2026-05-25 12:46:09] [INFO ] Implicit Places using invariants in 254 ms returned []
[2026-05-25 12:46:09] [INFO ] Invariant cache hit.
[2026-05-25 12:46:09] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 745 ms to find 0 implicit places.
[2026-05-25 12:46:09] [INFO ] Redundant transitions in 3 ms returned []
Running 219 sub problems to find dead transitions.
[2026-05-25 12:46:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 219 unsolved
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.70812e+10 after 1.16407e+11
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/275 variables, 11/60 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 222/497 variables, 275/335 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 6/341 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 1/498 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/498 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 219 unsolved
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.69969e+11 after 1.71099e+11
At refinement iteration 11 (OVERLAPS) 0/498 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 343 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 2/275 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 222/497 variables, 275/342 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 219/561 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 497/498 variables, and 561 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 275/276 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60071ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 60072ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60836 ms. Remains : 276/276 places, 222/222 transitions.
RANDOM walk for 400000 steps (19149 resets) in 2438 ms. (164 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2026-05-25 12:47:10] [INFO ] Invariant cache hit.
[2026-05-25 12:47:10] [INFO ] [Real]Absence check using 40 positive place invariants in 11 ms returned sat
[2026-05-25 12:47:10] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 28 ms returned sat
[2026-05-25 12:47:10] [INFO ] After 155ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 12:47:10] [INFO ] After 186ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2026-05-25 12:47:10] [INFO ] After 301ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (190976 resets) in 11887 ms. (336 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (36555 resets) in 5053 ms. (791 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4860873 steps, run timeout after 12001 ms. (steps per millisecond=405 ) properties seen :0 out of 1
Probabilistic random walk after 4860873 steps, saw 669342 distinct states, run finished after 12001 ms. (steps per millisecond=405 ) properties seen :0
[2026-05-25 12:47:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 167/168 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 39/207 variables, 31/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/209 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/221 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/224 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 178/402 variables, 224/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/402 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/415 variables, 8/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/415 variables, 3/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/415 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/417 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/417 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/417 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 42/459 variables, 3/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/459 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/459 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 39/498 variables, 39/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/498 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/498 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 336 constraints, problems are : Problem set: 0 solved, 1 unsolved in 349 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 167/168 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/207 variables, 31/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/209 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/221 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/224 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/224 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 178/402 variables, 224/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/402 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/402 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 13/415 variables, 8/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/415 variables, 3/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/415 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/417 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/417 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/417 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 42/459 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/459 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/459 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 39/498 variables, 39/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/498 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/498 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/498 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 498/498 variables, and 340 constraints, problems are : Problem set: 0 solved, 1 unsolved in 859 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1216ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 302 ms.
Support contains 1 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 222/222 transitions.
Applied a total of 0 rules in 9 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 276/276 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 222/222 transitions.
Applied a total of 0 rules in 7 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2026-05-25 12:47:28] [INFO ] Invariant cache hit.
[2026-05-25 12:47:29] [INFO ] Implicit Places using invariants in 241 ms returned []
[2026-05-25 12:47:29] [INFO ] Invariant cache hit.
[2026-05-25 12:47:29] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 783 ms to find 0 implicit places.
[2026-05-25 12:47:29] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 803 ms. Remains : 276/276 places, 222/222 transitions.
RANDOM walk for 400000 steps (19116 resets) in 1436 ms. (278 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2026-05-25 12:47:30] [INFO ] Invariant cache hit.
[2026-05-25 12:47:30] [INFO ] [Real]Absence check using 40 positive place invariants in 12 ms returned sat
[2026-05-25 12:47:30] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 31 ms returned sat
[2026-05-25 12:47:30] [INFO ] After 161ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 12:47:30] [INFO ] After 186ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2026-05-25 12:47:30] [INFO ] After 293ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
RANDOM walk for 40000 steps (1904 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (385 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 262144
Interrupted probabilistic random walk after 1155720 steps, run timeout after 3001 ms. (steps per millisecond=385 ) properties seen :0 out of 1
Probabilistic random walk after 1155720 steps, saw 160777 distinct states, run finished after 3001 ms. (steps per millisecond=385 ) properties seen :0
[2026-05-25 12:47:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 167/168 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 39/207 variables, 31/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/209 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/221 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/224 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 178/402 variables, 224/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/402 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/415 variables, 8/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/415 variables, 3/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/415 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/417 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/417 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/417 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 42/459 variables, 3/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/459 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/459 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 39/498 variables, 39/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/498 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/498 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 336 constraints, problems are : Problem set: 0 solved, 1 unsolved in 312 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 167/168 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/207 variables, 31/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/209 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/221 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/224 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/224 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD size :7.67908e+11 after 1.22746e+12
At refinement iteration 13 (OVERLAPS) 178/402 variables, 224/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/402 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/402 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 13/415 variables, 8/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/415 variables, 3/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/415 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/417 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/417 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/417 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 42/459 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/459 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/459 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 39/498 variables, 39/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/498 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/498 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/498 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 498/498 variables, and 340 constraints, problems are : Problem set: 0 solved, 1 unsolved in 696 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1013ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 313 ms.
Support contains 1 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 222/222 transitions.
Applied a total of 0 rules in 8 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 276/276 places, 222/222 transitions.
RANDOM walk for 40000 steps (1884 resets) in 161 ms. (246 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (355 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1162023 steps, run timeout after 3001 ms. (steps per millisecond=387 ) properties seen :0 out of 1
Probabilistic random walk after 1162023 steps, saw 161524 distinct states, run finished after 3001 ms. (steps per millisecond=387 ) properties seen :0
[2026-05-25 12:47:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 167/168 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 39/207 variables, 31/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/209 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/221 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/224 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 178/402 variables, 224/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/402 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/415 variables, 8/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/415 variables, 3/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/415 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/417 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/417 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/417 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 42/459 variables, 3/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/459 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/459 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 39/498 variables, 39/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/498 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/498 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 336 constraints, problems are : Problem set: 0 solved, 1 unsolved in 304 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 167/168 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/207 variables, 31/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/209 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/221 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/224 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/224 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 178/402 variables, 224/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/402 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/402 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 13/415 variables, 8/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/415 variables, 3/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/415 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/417 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/417 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/417 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 42/459 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/459 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/459 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 39/498 variables, 39/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/498 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/498 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/498 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 498/498 variables, and 340 constraints, problems are : Problem set: 0 solved, 1 unsolved in 683 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 993ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 315 ms.
Support contains 1 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 222/222 transitions.
Applied a total of 0 rules in 9 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 276/276 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 222/222 transitions.
Applied a total of 0 rules in 8 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2026-05-25 12:47:39] [INFO ] Invariant cache hit.
[2026-05-25 12:47:39] [INFO ] Implicit Places using invariants in 259 ms returned []
[2026-05-25 12:47:39] [INFO ] Invariant cache hit.
[2026-05-25 12:47:39] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 775 ms to find 0 implicit places.
[2026-05-25 12:47:39] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 794 ms. Remains : 276/276 places, 222/222 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 276 transition count 222
Applied a total of 1 rules in 15 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4878105918439899143.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18366581536800723159.kers'
[2026-05-25 12:47:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4878105918439899143.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18366581536800723159.kers]
Culling duplicate invariants (modulo rational): removing 29 columns.
Culled 29 columns in 0 ms.
// Phase 1: matrix 222 rows 247 cols 867 entries
Finished phase 1 with 166 SingleSign rule and 50 generalized
[2026-05-25 12:47:39] [INFO ] Computed 60 invariants in 3 ms
Computed 60 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-18366581536800723159.kers
Total runtime 4 ms.
[2026-05-25 12:47:40] [INFO ] [Real]Absence check using 40 positive place invariants in 12 ms returned sat
[2026-05-25 12:47:40] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 27 ms returned sat
[2026-05-25 12:47:40] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 12:47:40] [INFO ] [Nat]Absence check using 40 positive place invariants in 11 ms returned sat
[2026-05-25 12:47:40] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 26 ms returned sat
[2026-05-25 12:47:40] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 12:47:40] [INFO ] After 181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 12:47:40] [INFO ] After 309ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 451 ms.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 276 transition count 222
Applied a total of 1 rules in 23 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Running SMT prover for 1 properties.
[2026-05-25 12:47:40] [INFO ] Invariant cache hit.
[2026-05-25 12:47:40] [INFO ] [Real]Absence check using 40 positive place invariants in 11 ms returned sat
[2026-05-25 12:47:40] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 27 ms returned sat
[2026-05-25 12:47:40] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 12:47:40] [INFO ] [Nat]Absence check using 40 positive place invariants in 11 ms returned sat
[2026-05-25 12:47:40] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 28 ms returned sat
[2026-05-25 12:47:40] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 12:47:40] [INFO ] After 185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 12:47:40] [INFO ] After 313ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-25 12:47:40] [INFO ] Flatten gal took : 15 ms
[2026-05-25 12:47:40] [INFO ] Flatten gal took : 16 ms
[2026-05-25 12:47:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1158009088718703505.gal : 3 ms
[2026-05-25 12:47:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14778838323584078582.prop : 6 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/ReachabilityCardinality1158009088718703505.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14778838323584078582.prop' '--nowitness' '--gen-order' 'FOLLOW'

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 ...329
Loading property file /tmp/ReachabilityCardinality14778838323584078582.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 40
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :40 after 84
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :84 after 692
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :692 after 9556
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9556 after 128456
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :128456 after 206324
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :206324 after 488128
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.77546e+09 after 2.66254e+09
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.66254e+09 after 2.66934e+09
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.79085e+10 after 2.5311e+10
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.6222e+10 after 2.65673e+10
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :9.91794e+10 after 1.01007e+11
SDD proceeding with computation,1 properties remain. new max is 131072
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:188)
at java.base/java.io.BufferedInputStream.read1(BufferedInputStream.java:343)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:420)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2026-05-25 12:47:55] [INFO ] Flatten gal took : 10 ms
[2026-05-25 12:47:55] [INFO ] Applying decomposition
[2026-05-25 12:47:55] [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/graph16096651086981017097.txt' '-o' '/tmp/graph16096651086981017097.bin' '-w' '/tmp/graph16096651086981017097.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16096651086981017097.bin' '-l' '-1' '-v' '-w' '/tmp/graph16096651086981017097.weights' '-q' '0' '-e' '0.001'
[2026-05-25 12:47:56] [INFO ] Decomposing Gal with order
[2026-05-25 12:47:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 12:47:56] [INFO ] Removed a total of 70 redundant transitions.
[2026-05-25 12:47:56] [INFO ] Flatten gal took : 23 ms
[2026-05-25 12:47:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 3 ms.
[2026-05-25 12:47:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9974690054276581647.gal : 5 ms
[2026-05-25 12:47:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2310548014960556000.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9974690054276581647.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2310548014960556000.prop' '--nowitness'

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 ...307
Loading property file /tmp/ReachabilityCardinality2310548014960556000.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 130
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :130 after 1922
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1922 after 5380
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :50736 after 5.27611e+09
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :5.27611e+09 after 1.26193e+10
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.26193e+10 after 2.10116e+10
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.10116e+10 after 3.46491e+10
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30733 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 12:48:11] [INFO ] Flatten gal took : 9 ms
[2026-05-25 12:48:11] [INFO ] Applying decomposition
[2026-05-25 12:48:11] [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/graph13750484788022788886.txt' '-o' '/tmp/graph13750484788022788886.bin' '-w' '/tmp/graph13750484788022788886.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13750484788022788886.bin' '-l' '-1' '-v' '-w' '/tmp/graph13750484788022788886.weights' '-q' '0' '-e' '0.001'
[2026-05-25 12:48:11] [INFO ] Decomposing Gal with order
[2026-05-25 12:48:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 12:48:11] [INFO ] Removed a total of 40 redundant transitions.
[2026-05-25 12:48:11] [INFO ] Flatten gal took : 20 ms
[2026-05-25 12:48:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 3 ms.
[2026-05-25 12:48:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17789716887370183510.gal : 4 ms
[2026-05-25 12:48:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality180821709538229676.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17789716887370183510.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality180821709538229676.prop' '--nowitness'

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 ...307
Loading property file /tmp/ReachabilityCardinality180821709538229676.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 504
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :504 after 228952
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :305876 after 2.19339e+10
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2.19339e+10 after 4.69914e+10
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4.69914e+10 after 7.20528e+10
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :7.20528e+10 after 1.22169e+11
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.22169e+11 after 2.16138e+11
Reachability property DES-PT-40b-CTLCardinality-2024-01 is true.
FORMULA DES-PT-40b-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
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\_mod\_flat,2.87654e+14,5.61062,109068,15992,3713,252338,13439,336,250026,392,73460,0
Total reachable state count : 287654084070132

Verifying 1 reachability properties.
Reachability property DES-PT-40b-CTLCardinality-2024-01 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
DES-PT-40b-CTLCardinality-2024-01,34020,5.62973,109068,72,272,252338,13439,339,250026,395,73460,0
[2026-05-25 12:48:17] [INFO ] Flatten gal took : 9 ms
[2026-05-25 12:48:17] [INFO ] Flatten gal took : 8 ms
[2026-05-25 12:48:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality337136366568723968.gal : 7 ms
[2026-05-25 12:48:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality647985052712630227.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/CTLCardinality337136366568723968.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality647985052712630227.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 0 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 416/416 places, 367/367 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 401 transition count 352
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 401 transition count 352
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 401 transition count 348
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 394 transition count 341
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 394 transition count 341
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 54 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 393 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 393 transition count 333
Applied a total of 57 rules in 37 ms. Remains 393 /416 variables (removed 23) and now considering 333/367 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-662009919129100720.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15423134373241085620.kers'
[2026-05-25 12:48:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-662009919129100720.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15423134373241085620.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 333 rows 393 cols 1157 entries
Finished phase 1 with 171 SingleSign rule and 160 generalized
[2026-05-25 12:48:47] [INFO ] Computed 62 invariants in 3 ms
Computed 62 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15423134373241085620.kers
Total runtime 4 ms.
[2026-05-25 12:48:47] [INFO ] Implicit Places using invariants in 376 ms returned []
[2026-05-25 12:48:47] [INFO ] Invariant cache hit.
[2026-05-25 12:48:49] [INFO ] Implicit Places using invariants and state equation in 1477 ms returned []
Implicit Place search using SMT with State Equation took 1856 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2026-05-25 12:48:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 9/464 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 464 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 14/85 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (OVERLAPS) 333/726 variables, 393/506 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/726 variables, 332/838 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 838 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60089ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60090ms
Starting structural reductions in LTL mode, iteration 1 : 393/416 places, 333/367 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61984 ms. Remains : 393/416 places, 333/367 transitions.
[2026-05-25 12:49:49] [INFO ] Flatten gal took : 15 ms
[2026-05-25 12:49:49] [INFO ] Flatten gal took : 16 ms
[2026-05-25 12:49:49] [INFO ] Input system was already deterministic with 333 transitions.
[2026-05-25 12:49:49] [INFO ] Flatten gal took : 9 ms
[2026-05-25 12:49:49] [INFO ] Flatten gal took : 10 ms
[2026-05-25 12:49:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality115196574588526895.gal : 3 ms
[2026-05-25 12:49:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality14614521090048331680.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/CTLCardinality115196574588526895.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14614521090048331680.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 12:50:19] [INFO ] Flatten gal took : 7 ms
[2026-05-25 12:50:19] [INFO ] Applying decomposition
[2026-05-25 12:50:19] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14021618927662020695.txt' '-o' '/tmp/graph14021618927662020695.bin' '-w' '/tmp/graph14021618927662020695.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14021618927662020695.bin' '-l' '-1' '-v' '-w' '/tmp/graph14021618927662020695.weights' '-q' '0' '-e' '0.001'
[2026-05-25 12:50:19] [INFO ] Decomposing Gal with order
[2026-05-25 12:50:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 12:50:19] [INFO ] Removed a total of 11 redundant transitions.
[2026-05-25 12:50:19] [INFO ] Flatten gal took : 22 ms
[2026-05-25 12:50:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2026-05-25 12:50:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality9136130709007312207.gal : 5 ms
[2026-05-25 12:50:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality15559138627516790930.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/CTLCardinality9136130709007312207.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15559138627516790930.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 : 416/416 places, 367/367 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 405 transition count 356
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 405 transition count 356
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 405 transition count 352
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 30 place count 401 transition count 348
Iterating global reduction 1 with 4 rules applied. Total rules applied 34 place count 401 transition count 348
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 37 place count 401 transition count 345
Applied a total of 37 rules in 30 ms. Remains 401 /416 variables (removed 15) and now considering 345/367 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6946829097818812911.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12263732550261280047.kers'
[2026-05-25 12:50:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6946829097818812911.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12263732550261280047.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 345 rows 401 cols 1187 entries
Finished phase 1 with 177 SingleSign rule and 162 generalized
[2026-05-25 12:50:49] [INFO ] Computed 62 invariants in 3 ms
Computed 62 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12263732550261280047.kers
Total runtime 5 ms.
[2026-05-25 12:50:49] [INFO ] Implicit Places using invariants in 442 ms returned []
[2026-05-25 12:50:49] [INFO ] Invariant cache hit.
[2026-05-25 12:50:51] [INFO ] Implicit Places using invariants and state equation in 1192 ms returned []
Implicit Place search using SMT with State Equation took 1637 ms to find 0 implicit places.
Running 344 sub problems to find dead transitions.
[2026-05-25 12:50:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 2 (OVERLAPS) 1/401 variables, 34/54 constraints. Problems are: Problem set: 0 solved, 344 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 5 (OVERLAPS) 345/746 variables, 401/463 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/746 variables, 20/483 constraints. Problems are: Problem set: 0 solved, 344 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 746/746 variables, and 483 constraints, problems are : Problem set: 0 solved, 344 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 344/344 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 344 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 2 (OVERLAPS) 1/401 variables, 34/54 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 15/106 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 344 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/746 variables, and 115 constraints, problems are : Problem set: 0 solved, 344 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/401 constraints, PredecessorRefiner: 0/344 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60085ms problems are : Problem set: 0 solved, 344 unsolved
Search for dead transitions found 0 dead transitions in 60087ms
Starting structural reductions in LTL mode, iteration 1 : 401/416 places, 345/367 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61757 ms. Remains : 401/416 places, 345/367 transitions.
[2026-05-25 12:51:51] [INFO ] Flatten gal took : 15 ms
[2026-05-25 12:51:51] [INFO ] Flatten gal took : 16 ms
[2026-05-25 12:51:51] [INFO ] Input system was already deterministic with 345 transitions.
[2026-05-25 12:51:51] [INFO ] Flatten gal took : 15 ms
[2026-05-25 12:51:51] [INFO ] Flatten gal took : 14 ms
[2026-05-25 12:51:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality6040824468609011022.gal : 6 ms
[2026-05-25 12:51:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality16742208783737099648.ctl : 2 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/CTLCardinality6040824468609011022.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16742208783737099648.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 12:52:21] [INFO ] Flatten gal took : 15 ms
[2026-05-25 12:52:21] [INFO ] Applying decomposition
[2026-05-25 12:52:21] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3888391875985704587.txt' '-o' '/tmp/graph3888391875985704587.bin' '-w' '/tmp/graph3888391875985704587.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3888391875985704587.bin' '-l' '-1' '-v' '-w' '/tmp/graph3888391875985704587.weights' '-q' '0' '-e' '0.001'
[2026-05-25 12:52:21] [INFO ] Decomposing Gal with order
[2026-05-25 12:52:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 12:52:21] [INFO ] Removed a total of 15 redundant transitions.
[2026-05-25 12:52:21] [INFO ] Flatten gal took : 54 ms
[2026-05-25 12:52:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 8 ms.
[2026-05-25 12:52:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality5673057845394541555.gal : 13 ms
[2026-05-25 12:52:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality11305566166540160172.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/CTLCardinality5673057845394541555.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11305566166540160172.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 : 416/416 places, 367/367 transitions.
Graph (complete) has 935 edges and 416 vertex of which 408 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 407 transition count 346
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 392 transition count 346
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 31 place count 392 transition count 337
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 49 place count 383 transition count 337
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 59 place count 373 transition count 327
Iterating global reduction 2 with 10 rules applied. Total rules applied 69 place count 373 transition count 327
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 2 with 4 rules applied. Total rules applied 73 place count 373 transition count 323
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 74 place count 372 transition count 323
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 80 place count 366 transition count 317
Iterating global reduction 4 with 6 rules applied. Total rules applied 86 place count 366 transition count 317
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 4 with 7 rules applied. Total rules applied 93 place count 366 transition count 310
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 95 place count 365 transition count 309
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 95 place count 365 transition count 307
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 99 place count 363 transition count 307
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 6 with 132 rules applied. Total rules applied 231 place count 297 transition count 241
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 232 place count 297 transition count 241
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 234 place count 295 transition count 239
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 235 place count 294 transition count 239
Applied a total of 235 rules in 95 ms. Remains 294 /416 variables (removed 122) and now considering 239/367 (removed 128) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1841729051589184897.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6424912863964362496.kers'
[2026-05-25 12:52:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1841729051589184897.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6424912863964362496.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 239 rows 287 cols 946 entries
Finished phase 1 with 206 SingleSign rule and 30 generalized
[2026-05-25 12:52:51] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6424912863964362496.kers
Total runtime 3 ms.
[2026-05-25 12:52:52] [INFO ] Implicit Places using invariants in 735 ms returned []
[2026-05-25 12:52:52] [INFO ] Invariant cache hit.
[2026-05-25 12:52:53] [INFO ] Implicit Places using invariants and state equation in 731 ms returned []
Implicit Place search using SMT with State Equation took 1472 ms to find 0 implicit places.
[2026-05-25 12:52:53] [INFO ] Redundant transitions in 2 ms returned []
Running 235 sub problems to find dead transitions.
[2026-05-25 12:52:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/290 variables, 10/25 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (OVERLAPS) 1/291 variables, 19/44 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (OVERLAPS) 2/293 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 7 (OVERLAPS) 239/532 variables, 293/351 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 3/354 constraints. Problems are: Problem set: 0 solved, 235 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/533 variables, and 355 constraints, problems are : Problem set: 0 solved, 235 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 293/294 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 235 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/290 variables, 10/25 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (OVERLAPS) 1/291 variables, 19/47 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (OVERLAPS) 2/293 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 9 (OVERLAPS) 239/532 variables, 293/355 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 235/590 constraints. Problems are: Problem set: 0 solved, 235 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/533 variables, and 590 constraints, problems are : Problem set: 0 solved, 235 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 293/294 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60110ms problems are : Problem set: 0 solved, 235 unsolved
Search for dead transitions found 0 dead transitions in 60112ms
Starting structural reductions in SI_CTL mode, iteration 1 : 294/416 places, 239/367 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61705 ms. Remains : 294/416 places, 239/367 transitions.
[2026-05-25 12:53:53] [INFO ] Flatten gal took : 8 ms
[2026-05-25 12:53:53] [INFO ] Flatten gal took : 8 ms
[2026-05-25 12:53:53] [INFO ] Input system was already deterministic with 239 transitions.
[2026-05-25 12:53:53] [INFO ] Flatten gal took : 8 ms
[2026-05-25 12:53:53] [INFO ] Flatten gal took : 21 ms
[2026-05-25 12:53:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality4066643316509432229.gal : 2 ms
[2026-05-25 12:53:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality1362581091205209990.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/CTLCardinality4066643316509432229.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1362581091205209990.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 12:54:23] [INFO ] Flatten gal took : 11 ms
[2026-05-25 12:54:23] [INFO ] Applying decomposition
[2026-05-25 12:54:23] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2572238500133641302.txt' '-o' '/tmp/graph2572238500133641302.bin' '-w' '/tmp/graph2572238500133641302.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2572238500133641302.bin' '-l' '-1' '-v' '-w' '/tmp/graph2572238500133641302.weights' '-q' '0' '-e' '0.001'
[2026-05-25 12:54:23] [INFO ] Decomposing Gal with order
[2026-05-25 12:54:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 12:54:23] [INFO ] Removed a total of 14 redundant transitions.
[2026-05-25 12:54:23] [INFO ] Flatten gal took : 42 ms
[2026-05-25 12:54:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2026-05-25 12:54:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality10447300714050377091.gal : 7 ms
[2026-05-25 12:54:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality2569808440538015605.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/CTLCardinality10447300714050377091.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2569808440538015605.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.38448e+15,6.30438,131332,10786,6087,339687,11840,384,210423,398,80722,0


Converting to forward existential form...Done !
original formula: AF(((EF(((i0.u2.p153==0)&&(i7.i0.u26.p340==1))) * (u15.p123==0)) * ((u16.p12==1) * (AF(((u16.p9==0)&&(i0.u2.p205==1))) + !(A(!(((u16.p36=...253
=> equivalent forward existential formula: [FwdG(Init,!(((E(TRUE U ((i0.u2.p153==0)&&(i7.i0.u26.p340==1))) * (u15.p123==0)) * ((u16.p12==1) * (!(EG(!(((u16...465
Reverse transition relation is NOT exact ! Due to transitions t138, t186, t193, t196, u15.t97, u16.t172, u50.t0, u50.t198, i0.t13, i0.u2.t12, i0.u2.t18, i1...405
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 416/416 places, 367/367 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 402 transition count 353
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 402 transition count 353
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 402 transition count 349
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 39 place count 395 transition count 342
Iterating global reduction 1 with 7 rules applied. Total rules applied 46 place count 395 transition count 342
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 52 place count 395 transition count 336
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 394 transition count 335
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 394 transition count 335
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 394 transition count 334
Applied a total of 55 rules in 36 ms. Remains 394 /416 variables (removed 22) and now considering 334/367 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4152409728196997230.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3421607281091829708.kers'
[2026-05-25 12:54:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4152409728196997230.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3421607281091829708.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 334 rows 394 cols 1159 entries
Finished phase 1 with 172 SingleSign rule and 160 generalized
[2026-05-25 12:54:54] [INFO ] Computed 62 invariants in 3 ms
Computed 62 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-3421607281091829708.kers
Total runtime 5 ms.
[2026-05-25 12:54:54] [INFO ] Implicit Places using invariants in 421 ms returned []
[2026-05-25 12:54:54] [INFO ] Invariant cache hit.
[2026-05-25 12:54:56] [INFO ] Implicit Places using invariants and state equation in 2019 ms returned []
Implicit Place search using SMT with State Equation took 2454 ms to find 0 implicit places.
Running 333 sub problems to find dead transitions.
[2026-05-25 12:54:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (OVERLAPS) 1/394 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 333 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (OVERLAPS) 334/728 variables, 394/456 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/728 variables, and 465 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 394/394 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 333 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (OVERLAPS) 1/394 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 14/85 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 19/104 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 8 (OVERLAPS) 334/728 variables, 394/498 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/728 variables, and 831 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 394/394 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60157ms problems are : Problem set: 0 solved, 333 unsolved
Search for dead transitions found 0 dead transitions in 60159ms
Starting structural reductions in LTL mode, iteration 1 : 394/416 places, 334/367 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62652 ms. Remains : 394/416 places, 334/367 transitions.
[2026-05-25 12:55:56] [INFO ] Flatten gal took : 7 ms
[2026-05-25 12:55:56] [INFO ] Flatten gal took : 8 ms
[2026-05-25 12:55:56] [INFO ] Input system was already deterministic with 334 transitions.
[2026-05-25 12:55:56] [INFO ] Flatten gal took : 7 ms
[2026-05-25 12:55:56] [INFO ] Flatten gal took : 8 ms
[2026-05-25 12:55:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality6997990616018360554.gal : 2 ms
[2026-05-25 12:55:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality16466105705968414520.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/CTLCardinality6997990616018360554.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16466105705968414520.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 12:56:26] [INFO ] Flatten gal took : 8 ms
[2026-05-25 12:56:26] [INFO ] Applying decomposition
[2026-05-25 12:56:26] [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/graph9554012833871637063.txt' '-o' '/tmp/graph9554012833871637063.bin' '-w' '/tmp/graph9554012833871637063.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9554012833871637063.bin' '-l' '-1' '-v' '-w' '/tmp/graph9554012833871637063.weights' '-q' '0' '-e' '0.001'
[2026-05-25 12:56:26] [INFO ] Decomposing Gal with order
[2026-05-25 12:56:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 12:56:26] [INFO ] Removed a total of 11 redundant transitions.
[2026-05-25 12:56:26] [INFO ] Flatten gal took : 25 ms
[2026-05-25 12:56:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2026-05-25 12:56:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality2755108078572708996.gal : 5 ms
[2026-05-25 12:56:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality3942439410331045941.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/CTLCardinality2755108078572708996.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3942439410331045941.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.90986e+20,4.98877,113540,9373,4205,227141,26429,635,346511,370,177784,0


Converting to forward existential form...Done !
original formula: (EG((EX(EG((i6.u36.p303==0))) + ((i3.u10.p153==0)&&(i5.u28.p262==1)))) + AF(!(E(((((!((u32.p118==0)||(i7.i0.i2.u49.p342==1)))||(u32.p112=...409
=> equivalent forward existential formula: [FwdG((Init * !(EG((EX(EG((i6.u36.p303==0))) + ((i3.u10.p153==0)&&(i5.u28.p262==1)))))),!(!(E(((((!((u32.p118==0...463
Reverse transition relation is NOT exact ! Due to transitions t0, t248, t295, t296, t328, u33.t76, u32.t79, u77.t17, i3.t116, i3.u10.t213, i3.u10.t214, i3....1198
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 416/416 places, 367/367 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 403 transition count 354
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 403 transition count 354
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 29 place count 403 transition count 351
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 397 transition count 345
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 397 transition count 345
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 47 place count 397 transition count 339
Applied a total of 47 rules in 26 ms. Remains 397 /416 variables (removed 19) and now considering 339/367 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5594207590363215766.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16098961948816622660.kers'
[2026-05-25 12:56:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5594207590363215766.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16098961948816622660.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 339 rows 397 cols 1170 entries
Finished phase 1 with 176 SingleSign rule and 159 generalized
[2026-05-25 12:56:57] [INFO ] Computed 62 invariants in 3 ms
Computed 62 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16098961948816622660.kers
Total runtime 5 ms.
[2026-05-25 12:56:57] [INFO ] Implicit Places using invariants in 458 ms returned []
[2026-05-25 12:56:57] [INFO ] Invariant cache hit.
[2026-05-25 12:56:59] [INFO ] Implicit Places using invariants and state equation in 1898 ms returned []
Implicit Place search using SMT with State Equation took 2397 ms to find 0 implicit places.
Running 338 sub problems to find dead transitions.
[2026-05-25 12:56:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (OVERLAPS) 1/397 variables, 35/56 constraints. Problems are: Problem set: 0 solved, 338 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (OVERLAPS) 339/736 variables, 397/459 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/736 variables, 20/479 constraints. Problems are: Problem set: 0 solved, 338 unsolved
SMT process timed out in 30255ms, After SMT, problems are : Problem set: 0 solved, 338 unsolved
Search for dead transitions found 0 dead transitions in 30258ms
Starting structural reductions in LTL mode, iteration 1 : 397/416 places, 339/367 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32683 ms. Remains : 397/416 places, 339/367 transitions.
[2026-05-25 12:57:29] [INFO ] Flatten gal took : 12 ms
[2026-05-25 12:57:29] [INFO ] Flatten gal took : 15 ms
[2026-05-25 12:57:29] [INFO ] Input system was already deterministic with 339 transitions.
[2026-05-25 12:57:29] [INFO ] Flatten gal took : 12 ms
[2026-05-25 12:57:29] [INFO ] Flatten gal took : 12 ms
[2026-05-25 12:57:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality16392028396248656160.gal : 3 ms
[2026-05-25 12:57:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality16603804292344719787.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/CTLCardinality16392028396248656160.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16603804292344719787.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-25 12:57:59] [INFO ] Flatten gal took : 7 ms
[2026-05-25 12:57:59] [INFO ] Applying decomposition
[2026-05-25 12:57:59] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14895460537764249561.txt' '-o' '/tmp/graph14895460537764249561.bin' '-w' '/tmp/graph14895460537764249561.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14895460537764249561.bin' '-l' '-1' '-v' '-w' '/tmp/graph14895460537764249561.weights' '-q' '0' '-e' '0.001'
[2026-05-25 12:57:59] [INFO ] Decomposing Gal with order
[2026-05-25 12:57:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 12:57:59] [INFO ] Removed a total of 14 redundant transitions.
[2026-05-25 12:57:59] [INFO ] Flatten gal took : 32 ms
[2026-05-25 12:58:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 5 ms.
[2026-05-25 12:58:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality9297436559372490153.gal : 5 ms
[2026-05-25 12:58:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality17442061196733565668.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/CTLCardinality9297436559372490153.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17442061196733565668.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.17061e+20,10.2249,226368,19201,3872,567538,22216,711,378468,373,216833,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 416/416 places, 367/367 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 401 transition count 352
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 401 transition count 352
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 401 transition count 348
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 394 transition count 341
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 394 transition count 341
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 54 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 393 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 393 transition count 333
Applied a total of 57 rules in 37 ms. Remains 393 /416 variables (removed 23) and now considering 333/367 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4030173631560096152.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-393759663209311266.kers'
[2026-05-25 12:58:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4030173631560096152.kers, --Pflows, --basisKERS=/tmp/petrispot-output-393759663209311266.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 333 rows 393 cols 1157 entries
Finished phase 1 with 171 SingleSign rule and 160 generalized
[2026-05-25 12:58:30] [INFO ] Computed 62 invariants in 3 ms
Computed 62 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-393759663209311266.kers
Total runtime 4 ms.
[2026-05-25 12:58:30] [INFO ] Implicit Places using invariants in 583 ms returned []
[2026-05-25 12:58:30] [INFO ] Invariant cache hit.
[2026-05-25 12:58:32] [INFO ] Implicit Places using invariants and state equation in 1722 ms returned []
Implicit Place search using SMT with State Equation took 2367 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2026-05-25 12:58:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 464 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 14/85 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 393/726 variables, and 113 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/393 constraints, PredecessorRefiner: 0/332 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60091ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60092ms
Starting structural reductions in LTL mode, iteration 1 : 393/416 places, 333/367 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62497 ms. Remains : 393/416 places, 333/367 transitions.
[2026-05-25 12:59:32] [INFO ] Flatten gal took : 14 ms
[2026-05-25 12:59:32] [INFO ] Flatten gal took : 13 ms
[2026-05-25 12:59:32] [INFO ] Input system was already deterministic with 333 transitions.
[2026-05-25 12:59:32] [INFO ] Flatten gal took : 12 ms
[2026-05-25 12:59:32] [INFO ] Flatten gal took : 13 ms
[2026-05-25 12:59:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality17864118027620161882.gal : 3 ms
[2026-05-25 12:59:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality13179322560776531798.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/CTLCardinality17864118027620161882.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13179322560776531798.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-25 13:00:02] [INFO ] Flatten gal took : 8 ms
[2026-05-25 13:00:02] [INFO ] Applying decomposition
[2026-05-25 13:00:02] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14248380145394756350.txt' '-o' '/tmp/graph14248380145394756350.bin' '-w' '/tmp/graph14248380145394756350.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14248380145394756350.bin' '-l' '-1' '-v' '-w' '/tmp/graph14248380145394756350.weights' '-q' '0' '-e' '0.001'
[2026-05-25 13:00:02] [INFO ] Decomposing Gal with order
[2026-05-25 13:00:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 13:00:02] [INFO ] Removed a total of 11 redundant transitions.
[2026-05-25 13:00:02] [INFO ] Flatten gal took : 34 ms
[2026-05-25 13:00:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 26 ms.
[2026-05-25 13:00:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality2219720509212762134.gal : 4 ms
[2026-05-25 13:00:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality11529869850745055399.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/CTLCardinality2219720509212762134.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11529869850745055399.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 : 416/416 places, 367/367 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 402 transition count 353
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 402 transition count 353
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 402 transition count 350
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 38 place count 395 transition count 343
Iterating global reduction 1 with 7 rules applied. Total rules applied 45 place count 395 transition count 343
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 51 place count 395 transition count 337
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 394 transition count 336
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 394 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 394 transition count 335
Applied a total of 54 rules in 72 ms. Remains 394 /416 variables (removed 22) and now considering 335/367 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4788767834418648759.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12960927825365673187.kers'
[2026-05-25 13:00:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4788767834418648759.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12960927825365673187.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 335 rows 394 cols 1163 entries
Finished phase 1 with 172 SingleSign rule and 160 generalized
[2026-05-25 13:00:33] [INFO ] Computed 62 invariants in 3 ms
Computed 62 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12960927825365673187.kers
Total runtime 4 ms.
[2026-05-25 13:00:33] [INFO ] Implicit Places using invariants in 404 ms returned []
[2026-05-25 13:00:33] [INFO ] Invariant cache hit.
[2026-05-25 13:00:35] [INFO ] Implicit Places using invariants and state equation in 1881 ms returned []
Implicit Place search using SMT with State Equation took 2306 ms to find 0 implicit places.
Running 334 sub problems to find dead transitions.
[2026-05-25 13:00:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 1/394 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 334 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (OVERLAPS) 335/729 variables, 394/456 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 729/729 variables, and 464 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 394/394 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 1/394 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 8/70 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 15/85 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 7/96 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/729 variables, and 96 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/394 constraints, PredecessorRefiner: 0/334 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60081ms problems are : Problem set: 0 solved, 334 unsolved
Search for dead transitions found 0 dead transitions in 60082ms
Starting structural reductions in LTL mode, iteration 1 : 394/416 places, 335/367 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62470 ms. Remains : 394/416 places, 335/367 transitions.
[2026-05-25 13:01:35] [INFO ] Flatten gal took : 11 ms
[2026-05-25 13:01:35] [INFO ] Flatten gal took : 12 ms
[2026-05-25 13:01:35] [INFO ] Input system was already deterministic with 335 transitions.
[2026-05-25 13:01:35] [INFO ] Flatten gal took : 12 ms
[2026-05-25 13:01:35] [INFO ] Flatten gal took : 11 ms
[2026-05-25 13:01:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality476365706324884144.gal : 2 ms
[2026-05-25 13:01:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality6606657027311850194.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/CTLCardinality476365706324884144.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6606657027311850194.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 13:02:05] [INFO ] Flatten gal took : 7 ms
[2026-05-25 13:02:05] [INFO ] Applying decomposition
[2026-05-25 13:02:05] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14012380578791718996.txt' '-o' '/tmp/graph14012380578791718996.bin' '-w' '/tmp/graph14012380578791718996.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14012380578791718996.bin' '-l' '-1' '-v' '-w' '/tmp/graph14012380578791718996.weights' '-q' '0' '-e' '0.001'
[2026-05-25 13:02:05] [INFO ] Decomposing Gal with order
[2026-05-25 13:02:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 13:02:05] [INFO ] Removed a total of 12 redundant transitions.
[2026-05-25 13:02:05] [INFO ] Flatten gal took : 21 ms
[2026-05-25 13:02:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2026-05-25 13:02:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality6491660322137732009.gal : 4 ms
[2026-05-25 13:02:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality6625201507853855130.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/CTLCardinality6491660322137732009.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6625201507853855130.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 : 416/416 places, 367/367 transitions.
Graph (complete) has 935 edges and 416 vertex of which 408 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 407 transition count 346
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 392 transition count 346
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 31 place count 392 transition count 336
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 51 place count 382 transition count 336
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 62 place count 371 transition count 325
Iterating global reduction 2 with 11 rules applied. Total rules applied 73 place count 371 transition count 325
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 2 with 4 rules applied. Total rules applied 77 place count 371 transition count 321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 370 transition count 321
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 78 place count 370 transition count 320
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 80 place count 369 transition count 320
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 86 place count 363 transition count 314
Iterating global reduction 4 with 6 rules applied. Total rules applied 92 place count 363 transition count 314
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 4 with 7 rules applied. Total rules applied 99 place count 363 transition count 307
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 101 place count 362 transition count 306
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 101 place count 362 transition count 304
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 105 place count 360 transition count 304
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 6 with 142 rules applied. Total rules applied 247 place count 289 transition count 233
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 249 place count 289 transition count 233
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 251 place count 287 transition count 231
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 252 place count 286 transition count 231
Applied a total of 252 rules in 107 ms. Remains 286 /416 variables (removed 130) and now considering 231/367 (removed 136) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8733440863234391278.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15960151287986716762.kers'
[2026-05-25 13:02:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8733440863234391278.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15960151287986716762.kers]
Culling duplicate invariants (modulo rational): removing 27 columns.
Culled 27 columns in 0 ms.
// Phase 1: matrix 231 rows 259 cols 872 entries
Finished phase 1 with 173 SingleSign rule and 55 generalized
[2026-05-25 13:02:35] [INFO ] Computed 58 invariants in 2 ms
Computed 58 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15960151287986716762.kers
Total runtime 7 ms.
[2026-05-25 13:02:36] [INFO ] Implicit Places using invariants in 469 ms returned []
[2026-05-25 13:02:36] [INFO ] Invariant cache hit.
[2026-05-25 13:02:37] [INFO ] Implicit Places using invariants and state equation in 794 ms returned []
Implicit Place search using SMT with State Equation took 1281 ms to find 0 implicit places.
[2026-05-25 13:02:37] [INFO ] Redundant transitions in 2 ms returned []
Running 228 sub problems to find dead transitions.
[2026-05-25 13:02:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (OVERLAPS) 2/285 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (OVERLAPS) 231/516 variables, 285/343 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 1/517 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 517/517 variables, and 347 constraints, problems are : Problem set: 0 solved, 228 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 2/285 variables, 12/61 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (OVERLAPS) 231/516 variables, 285/346 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 228/574 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 516/517 variables, and 574 constraints, problems are : Problem set: 0 solved, 228 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 285/286 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 60102ms
Starting structural reductions in SI_CTL mode, iteration 1 : 286/416 places, 231/367 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61508 ms. Remains : 286/416 places, 231/367 transitions.
[2026-05-25 13:03:37] [INFO ] Flatten gal took : 6 ms
[2026-05-25 13:03:37] [INFO ] Flatten gal took : 6 ms
[2026-05-25 13:03:37] [INFO ] Input system was already deterministic with 231 transitions.
[2026-05-25 13:03:37] [INFO ] Flatten gal took : 6 ms
[2026-05-25 13:03:37] [INFO ] Flatten gal took : 7 ms
[2026-05-25 13:03:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality7105213706641038262.gal : 1 ms
[2026-05-25 13:03:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality10240908897669161901.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/CTLCardinality7105213706641038262.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10240908897669161901.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 13:04:07] [INFO ] Flatten gal took : 6 ms
[2026-05-25 13:04:07] [INFO ] Applying decomposition
[2026-05-25 13:04:07] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7940064500056057800.txt' '-o' '/tmp/graph7940064500056057800.bin' '-w' '/tmp/graph7940064500056057800.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7940064500056057800.bin' '-l' '-1' '-v' '-w' '/tmp/graph7940064500056057800.weights' '-q' '0' '-e' '0.001'
[2026-05-25 13:04:07] [INFO ] Decomposing Gal with order
[2026-05-25 13:04:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 13:04:07] [INFO ] Removed a total of 17 redundant transitions.
[2026-05-25 13:04:07] [INFO ] Flatten gal took : 13 ms
[2026-05-25 13:04:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2026-05-25 13:04:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality5633771795959191532.gal : 2 ms
[2026-05-25 13:04:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality15777808831363274463.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/CTLCardinality5633771795959191532.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15777808831363274463.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,5.19231e+14,5.25109,120716,13210,6477,314718,11877,342,190251,391,80012,0


Converting to forward existential form...Done !
original formula: EG(AG((i1.i1.u2.p185==0)))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !((i1.i1.u2.p185==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t129, t179, t184, t187, t229, u14.t90, u15.t160, u50.t0, u50.t189, i0.t7, i0.u3.t11, i0.u3.t1...738
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 416/416 places, 367/367 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 401 transition count 352
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 401 transition count 352
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 401 transition count 348
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 394 transition count 341
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 394 transition count 341
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 54 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 393 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 393 transition count 333
Applied a total of 57 rules in 34 ms. Remains 393 /416 variables (removed 23) and now considering 333/367 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6082752606896511150.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5908992399474008760.kers'
[2026-05-25 13:04:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6082752606896511150.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5908992399474008760.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 333 rows 393 cols 1157 entries
Finished phase 1 with 171 SingleSign rule and 160 generalized
[2026-05-25 13:04:37] [INFO ] Computed 62 invariants in 3 ms
Computed 62 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5908992399474008760.kers
Total runtime 4 ms.
[2026-05-25 13:04:38] [INFO ] Implicit Places using invariants in 482 ms returned []
[2026-05-25 13:04:38] [INFO ] Invariant cache hit.
[2026-05-25 13:04:39] [INFO ] Implicit Places using invariants and state equation in 1575 ms returned []
Implicit Place search using SMT with State Equation took 2094 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2026-05-25 13:04:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 464 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 14/85 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (OVERLAPS) 333/726 variables, 393/506 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 838 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60110ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60121ms
Starting structural reductions in LTL mode, iteration 1 : 393/416 places, 333/367 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62250 ms. Remains : 393/416 places, 333/367 transitions.
[2026-05-25 13:05:39] [INFO ] Flatten gal took : 7 ms
[2026-05-25 13:05:39] [INFO ] Flatten gal took : 7 ms
[2026-05-25 13:05:39] [INFO ] Input system was already deterministic with 333 transitions.
[2026-05-25 13:05:39] [INFO ] Flatten gal took : 7 ms
[2026-05-25 13:05:39] [INFO ] Flatten gal took : 7 ms
[2026-05-25 13:05:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality8814439360918225544.gal : 2 ms
[2026-05-25 13:05:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality10712811676307450393.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/CTLCardinality8814439360918225544.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10712811676307450393.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 13:06:09] [INFO ] Flatten gal took : 8 ms
[2026-05-25 13:06:09] [INFO ] Applying decomposition
[2026-05-25 13:06:09] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17185444297817005900.txt' '-o' '/tmp/graph17185444297817005900.bin' '-w' '/tmp/graph17185444297817005900.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17185444297817005900.bin' '-l' '-1' '-v' '-w' '/tmp/graph17185444297817005900.weights' '-q' '0' '-e' '0.001'
[2026-05-25 13:06:10] [INFO ] Decomposing Gal with order
[2026-05-25 13:06:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 13:06:10] [INFO ] Removed a total of 11 redundant transitions.
[2026-05-25 13:06:10] [INFO ] Flatten gal took : 15 ms
[2026-05-25 13:06:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2026-05-25 13:06:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality17642251306024744385.gal : 4 ms
[2026-05-25 13:06:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality1194277670110158406.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/CTLCardinality17642251306024744385.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1194277670110158406.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 : 416/416 places, 367/367 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 402 transition count 353
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 402 transition count 353
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 402 transition count 349
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 396 transition count 343
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 396 transition count 343
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 49 place count 396 transition count 338
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 395 transition count 337
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 395 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 395 transition count 336
Applied a total of 52 rules in 39 ms. Remains 395 /416 variables (removed 21) and now considering 336/367 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-332428088977143718.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8977307696444432720.kers'
[2026-05-25 13:06:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-332428088977143718.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8977307696444432720.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 336 rows 395 cols 1165 entries
Finished phase 1 with 173 SingleSign rule and 160 generalized
[2026-05-25 13:06:40] [INFO ] Computed 62 invariants in 3 ms
Computed 62 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8977307696444432720.kers
Total runtime 4 ms.
[2026-05-25 13:06:40] [INFO ] Implicit Places using invariants in 464 ms returned []
[2026-05-25 13:06:40] [INFO ] Invariant cache hit.
[2026-05-25 13:06:42] [INFO ] Implicit Places using invariants and state equation in 1773 ms returned []
Implicit Place search using SMT with State Equation took 2271 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2026-05-25 13:06:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 1/395 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/395 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (OVERLAPS) 336/731 variables, 395/457 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/731 variables, 20/477 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 731/731 variables, and 477 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 395/395 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 1/395 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/395 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 9/111 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 395/731 variables, and 116 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/395 constraints, PredecessorRefiner: 0/335 constraints, Known Traps: 54/54 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60103ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 60105ms
Starting structural reductions in LTL mode, iteration 1 : 395/416 places, 336/367 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62417 ms. Remains : 395/416 places, 336/367 transitions.
[2026-05-25 13:07:42] [INFO ] Flatten gal took : 11 ms
[2026-05-25 13:07:42] [INFO ] Flatten gal took : 12 ms
[2026-05-25 13:07:42] [INFO ] Input system was already deterministic with 336 transitions.
[2026-05-25 13:07:42] [INFO ] Flatten gal took : 11 ms
[2026-05-25 13:07:42] [INFO ] Flatten gal took : 11 ms
[2026-05-25 13:07:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality5290824150442279858.gal : 3 ms
[2026-05-25 13:07:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality12461167564478917569.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/CTLCardinality5290824150442279858.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12461167564478917569.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 13:08:12] [INFO ] Flatten gal took : 7 ms
[2026-05-25 13:08:12] [INFO ] Applying decomposition
[2026-05-25 13:08:12] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7186604858603347592.txt' '-o' '/tmp/graph7186604858603347592.bin' '-w' '/tmp/graph7186604858603347592.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7186604858603347592.bin' '-l' '-1' '-v' '-w' '/tmp/graph7186604858603347592.weights' '-q' '0' '-e' '0.001'
[2026-05-25 13:08:12] [INFO ] Decomposing Gal with order
[2026-05-25 13:08:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 13:08:12] [INFO ] Removed a total of 13 redundant transitions.
[2026-05-25 13:08:12] [INFO ] Flatten gal took : 20 ms
[2026-05-25 13:08:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2026-05-25 13:08:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality17727248584716211634.gal : 4 ms
[2026-05-25 13:08:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality9355461374959511281.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/CTLCardinality17727248584716211634.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9355461374959511281.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 : 416/416 places, 367/367 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 401 transition count 352
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 401 transition count 352
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 401 transition count 348
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 394 transition count 341
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 394 transition count 341
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 54 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 393 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 393 transition count 333
Applied a total of 57 rules in 32 ms. Remains 393 /416 variables (removed 23) and now considering 333/367 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5000833491880467778.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15104509134830578812.kers'
[2026-05-25 13:08:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5000833491880467778.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15104509134830578812.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 333 rows 393 cols 1157 entries
Finished phase 1 with 171 SingleSign rule and 160 generalized
[2026-05-25 13:08:42] [INFO ] Computed 62 invariants in 3 ms
Computed 62 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15104509134830578812.kers
Total runtime 4 ms.
[2026-05-25 13:08:43] [INFO ] Implicit Places using invariants in 427 ms returned []
[2026-05-25 13:08:43] [INFO ] Invariant cache hit.
[2026-05-25 13:08:45] [INFO ] Implicit Places using invariants and state equation in 1669 ms returned []
Implicit Place search using SMT with State Equation took 2111 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2026-05-25 13:08:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 464 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 14/85 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 393/726 variables, and 113 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/393 constraints, PredecessorRefiner: 0/332 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Starting structural reductions in LTL mode, iteration 1 : 393/416 places, 333/367 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62240 ms. Remains : 393/416 places, 333/367 transitions.
[2026-05-25 13:09:45] [INFO ] Flatten gal took : 10 ms
[2026-05-25 13:09:45] [INFO ] Flatten gal took : 11 ms
[2026-05-25 13:09:45] [INFO ] Input system was already deterministic with 333 transitions.
[2026-05-25 13:09:45] [INFO ] Flatten gal took : 11 ms
[2026-05-25 13:09:45] [INFO ] Flatten gal took : 11 ms
[2026-05-25 13:09:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality2602775251098551867.gal : 3 ms
[2026-05-25 13:09:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality12789576148850620430.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/CTLCardinality2602775251098551867.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12789576148850620430.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 13:10:15] [INFO ] Flatten gal took : 7 ms
[2026-05-25 13:10:15] [INFO ] Applying decomposition
[2026-05-25 13:10:15] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1921228256461787584.txt' '-o' '/tmp/graph1921228256461787584.bin' '-w' '/tmp/graph1921228256461787584.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1921228256461787584.bin' '-l' '-1' '-v' '-w' '/tmp/graph1921228256461787584.weights' '-q' '0' '-e' '0.001'
[2026-05-25 13:10:15] [INFO ] Decomposing Gal with order
[2026-05-25 13:10:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 13:10:15] [INFO ] Removed a total of 11 redundant transitions.
[2026-05-25 13:10:15] [INFO ] Flatten gal took : 14 ms
[2026-05-25 13:10:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2026-05-25 13:10:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality18023748549535120658.gal : 4 ms
[2026-05-25 13:10:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality7260592815673011179.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/CTLCardinality18023748549535120658.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7260592815673011179.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 : 416/416 places, 367/367 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 404 transition count 355
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 404 transition count 355
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 27 place count 404 transition count 352
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 399 transition count 347
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 399 transition count 347
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 41 place count 399 transition count 343
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 398 transition count 342
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 398 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 398 transition count 341
Applied a total of 44 rules in 42 ms. Remains 398 /416 variables (removed 18) and now considering 341/367 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-404287773414913129.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16623431255658788009.kers'
[2026-05-25 13:10:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-404287773414913129.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16623431255658788009.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 341 rows 398 cols 1179 entries
Finished phase 1 with 175 SingleSign rule and 161 generalized
[2026-05-25 13:10:45] [INFO ] Computed 62 invariants in 3 ms
Computed 62 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16623431255658788009.kers
Total runtime 4 ms.
[2026-05-25 13:10:45] [INFO ] Implicit Places using invariants in 345 ms returned []
[2026-05-25 13:10:45] [INFO ] Invariant cache hit.
[2026-05-25 13:10:46] [INFO ] Implicit Places using invariants and state equation in 780 ms returned []
Implicit Place search using SMT with State Equation took 1150 ms to find 0 implicit places.
Running 340 sub problems to find dead transitions.
[2026-05-25 13:10:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/397 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (OVERLAPS) 1/398 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 340 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (OVERLAPS) 341/739 variables, 398/460 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/739 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 739/739 variables, and 480 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 398/398 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/397 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (OVERLAPS) 1/398 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 14/96 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 8/104 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 398/739 variables, and 117 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/398 constraints, PredecessorRefiner: 0/340 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60085ms problems are : Problem set: 0 solved, 340 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Starting structural reductions in LTL mode, iteration 1 : 398/416 places, 341/367 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61279 ms. Remains : 398/416 places, 341/367 transitions.
[2026-05-25 13:11:46] [INFO ] Flatten gal took : 12 ms
[2026-05-25 13:11:46] [INFO ] Flatten gal took : 11 ms
[2026-05-25 13:11:46] [INFO ] Input system was already deterministic with 341 transitions.
[2026-05-25 13:11:46] [INFO ] Flatten gal took : 12 ms
[2026-05-25 13:11:46] [INFO ] Flatten gal took : 11 ms
[2026-05-25 13:11:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality14819305141836484926.gal : 2 ms
[2026-05-25 13:11:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality6710160376639014003.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/CTLCardinality14819305141836484926.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6710160376639014003.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 13:12:16] [INFO ] Flatten gal took : 7 ms
[2026-05-25 13:12:16] [INFO ] Applying decomposition
[2026-05-25 13:12:16] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5480407254119167083.txt' '-o' '/tmp/graph5480407254119167083.bin' '-w' '/tmp/graph5480407254119167083.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5480407254119167083.bin' '-l' '-1' '-v' '-w' '/tmp/graph5480407254119167083.weights' '-q' '0' '-e' '0.001'
[2026-05-25 13:12:16] [INFO ] Decomposing Gal with order
[2026-05-25 13:12:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 13:12:16] [INFO ] Removed a total of 14 redundant transitions.
[2026-05-25 13:12:16] [INFO ] Flatten gal took : 12 ms
[2026-05-25 13:12:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2026-05-25 13:12:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality7360986725323462661.gal : 3 ms
[2026-05-25 13:12:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality12773480293194689740.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/CTLCardinality7360986725323462661.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12773480293194689740.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.0621e+21,16.6265,232020,14911,4201,482935,26581,700,479477,373,173983,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 416/416 places, 367/367 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 401 transition count 352
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 401 transition count 352
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 401 transition count 348
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 394 transition count 341
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 394 transition count 341
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 54 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 393 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 393 transition count 333
Applied a total of 57 rules in 36 ms. Remains 393 /416 variables (removed 23) and now considering 333/367 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8914372085027277629.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8627338814699803267.kers'
[2026-05-25 13:12:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8914372085027277629.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8627338814699803267.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 333 rows 393 cols 1157 entries
Finished phase 1 with 171 SingleSign rule and 160 generalized
[2026-05-25 13:12:47] [INFO ] Computed 62 invariants in 3 ms
Computed 62 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-8627338814699803267.kers
Total runtime 6 ms.
[2026-05-25 13:12:47] [INFO ] Implicit Places using invariants in 516 ms returned []
[2026-05-25 13:12:47] [INFO ] Invariant cache hit.
[2026-05-25 13:12:49] [INFO ] Implicit Places using invariants and state equation in 1831 ms returned []
Implicit Place search using SMT with State Equation took 2358 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2026-05-25 13:12:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 464 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 14/85 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 393/726 variables, and 113 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/393 constraints, PredecessorRefiner: 0/332 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Starting structural reductions in LTL mode, iteration 1 : 393/416 places, 333/367 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62508 ms. Remains : 393/416 places, 333/367 transitions.
[2026-05-25 13:13:49] [INFO ] Flatten gal took : 11 ms
[2026-05-25 13:13:49] [INFO ] Flatten gal took : 11 ms
[2026-05-25 13:13:49] [INFO ] Input system was already deterministic with 333 transitions.
[2026-05-25 13:13:49] [INFO ] Flatten gal took : 11 ms
[2026-05-25 13:13:49] [INFO ] Flatten gal took : 11 ms
[2026-05-25 13:13:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality4123580227959302350.gal : 2 ms
[2026-05-25 13:13:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality3038828554678383690.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/CTLCardinality4123580227959302350.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3038828554678383690.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 13:14:19] [INFO ] Flatten gal took : 11 ms
[2026-05-25 13:14:19] [INFO ] Applying decomposition
[2026-05-25 13:14:19] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12314485294917826423.txt' '-o' '/tmp/graph12314485294917826423.bin' '-w' '/tmp/graph12314485294917826423.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12314485294917826423.bin' '-l' '-1' '-v' '-w' '/tmp/graph12314485294917826423.weights' '-q' '0' '-e' '0.001'
[2026-05-25 13:14:19] [INFO ] Decomposing Gal with order
[2026-05-25 13:14:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 13:14:19] [INFO ] Removed a total of 11 redundant transitions.
[2026-05-25 13:14:19] [INFO ] Flatten gal took : 12 ms
[2026-05-25 13:14:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2026-05-25 13:14:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality14847358018275060690.gal : 5 ms
[2026-05-25 13:14:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality5283353628501632840.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/CTLCardinality14847358018275060690.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5283353628501632840.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.
[2026-05-25 13:14:49] [INFO ] Flatten gal took : 8 ms
[2026-05-25 13:14:49] [INFO ] Flatten gal took : 7 ms
[2026-05-25 13:14:49] [INFO ] Applying decomposition
[2026-05-25 13:14:49] [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/graph17549181530763287075.txt' '-o' '/tmp/graph17549181530763287075.bin' '-w' '/tmp/graph17549181530763287075.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17549181530763287075.bin' '-l' '-1' '-v' '-w' '/tmp/graph17549181530763287075.weights' '-q' '0' '-e' '0.001'
[2026-05-25 13:14:49] [INFO ] Decomposing Gal with order
[2026-05-25 13:14:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 13:14:49] [INFO ] Removed a total of 28 redundant transitions.
[2026-05-25 13:14:49] [INFO ] Flatten gal took : 17 ms
[2026-05-25 13:14:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 4 ms.
[2026-05-25 13:14:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality7964980879364007903.gal : 4 ms
[2026-05-25 13:14:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality8358106711936983083.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/CTLCardinality7964980879364007903.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8358106711936983083.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 13 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,5.94693e+21,12.4584,255848,22223,4201,621728,28331,765,519979,419,165970,0


Converting to forward existential form...Done !
original formula: EF(EG(AF(EX(((i9.i2.u65.p370==0)&&(u40.p24==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG(!(EX(((i9.i2.u65.p370==0)&&(u40.p24==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t56, t129, t131, t140, t324, t325, u80.t17, u38.t79, u40.t76, i2.i1.u7.t147, i2.i1.u7.t14...848

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="DES-PT-40b"
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 DES-PT-40b, 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 r082-smll-177946993700417"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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