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-177946993800450.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-60b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993800450
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 5.5K Mar 6 18:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Mar 6 18:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Mar 6 18:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Mar 6 18:24 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.5K Mar 15 09:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 09:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 09:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 09:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 6 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Mar 6 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 6 18:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 6 18:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 09:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 09:00 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 139K 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-60b-CTLFireability-2024-00
FORMULA_NAME DES-PT-60b-CTLFireability-2024-01
FORMULA_NAME DES-PT-60b-CTLFireability-2024-02
FORMULA_NAME DES-PT-60b-CTLFireability-2024-03
FORMULA_NAME DES-PT-60b-CTLFireability-2024-04
FORMULA_NAME DES-PT-60b-CTLFireability-2024-05
FORMULA_NAME DES-PT-60b-CTLFireability-2024-06
FORMULA_NAME DES-PT-60b-CTLFireability-2024-07
FORMULA_NAME DES-PT-60b-CTLFireability-2024-08
FORMULA_NAME DES-PT-60b-CTLFireability-2024-09
FORMULA_NAME DES-PT-60b-CTLFireability-2024-10
FORMULA_NAME DES-PT-60b-CTLFireability-2024-11
FORMULA_NAME DES-PT-60b-CTLFireability-2024-12
FORMULA_NAME DES-PT-60b-CTLFireability-2024-13
FORMULA_NAME DES-PT-60b-CTLFireability-2024-14
FORMULA_NAME DES-PT-60b-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779743717603

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-60b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 21:15:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 21:15:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 21:15:20] [INFO ] Load time of PNML (sax parser for PT used): 231 ms
[2026-05-25 21:15:20] [INFO ] Transformed 519 places.
[2026-05-25 21:15:20] [INFO ] Transformed 470 transitions.
[2026-05-25 21:15:20] [INFO ] Found NUPN structural information;
[2026-05-25 21:15:20] [INFO ] Parsed PT model containing 519 places and 470 transitions and 1623 arcs in 504 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
Support contains 84 out of 519 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 519/519 places, 470/470 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 516 transition count 470
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 22 place count 497 transition count 451
Iterating global reduction 1 with 19 rules applied. Total rules applied 41 place count 497 transition count 451
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 52 place count 486 transition count 440
Iterating global reduction 1 with 11 rules applied. Total rules applied 63 place count 486 transition count 440
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 71 place count 486 transition count 432
Applied a total of 71 rules in 306 ms. Remains 486 /519 variables (removed 33) and now considering 432/470 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10520965208664854737.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2888141612732875434.kers'
[2026-05-25 21:15:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10520965208664854737.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2888141612732875434.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 432 rows 486 cols 1527 entries
Finished phase 1 with 202 SingleSign rule and 222 generalized
[2026-05-25 21:15:21] [INFO ] Computed 62 invariants in 8 ms
Computed 62 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-2888141612732875434.kers
Total runtime 11 ms.
[2026-05-25 21:15:22] [INFO ] Implicit Places using invariants in 1272 ms returned []
[2026-05-25 21:15:22] [INFO ] Invariant cache hit.
[2026-05-25 21:15:26] [INFO ] Implicit Places using invariants and state equation in 3923 ms returned []
Implicit Place search using SMT with State Equation took 5264 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2026-05-25 21:15:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/485 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (OVERLAPS) 1/486 variables, 34/53 constraints. Problems are: Problem set: 0 solved, 431 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/486 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 5 (OVERLAPS) 432/918 variables, 486/548 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 918/918 variables, and 548 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 486/486 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 431 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/485 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (OVERLAPS) 1/486 variables, 34/53 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/486 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 11/93 constraints. Problems are: Problem set: 0 solved, 431 unsolved
SMT process timed out in 60727ms, After SMT, problems are : Problem set: 0 solved, 431 unsolved
Search for dead transitions found 0 dead transitions in 60749ms
Starting structural reductions in LTL mode, iteration 1 : 486/519 places, 432/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66381 ms. Remains : 486/519 places, 432/470 transitions.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 432/432 transitions.
Applied a total of 0 rules in 12 ms. Remains 486 /486 variables (removed 0) and now considering 432/432 (removed 0) transitions.
[2026-05-25 21:16:27] [INFO ] Invariant cache hit.
[2026-05-25 21:16:27] [INFO ] Implicit Places using invariants in 334 ms returned []
[2026-05-25 21:16:27] [INFO ] Invariant cache hit.
[2026-05-25 21:16:30] [INFO ] Implicit Places using invariants and state equation in 2623 ms returned []
Implicit Place search using SMT with State Equation took 2959 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2974 ms. Remains : 486/486 places, 432/432 transitions.
Support contains 84 out of 486 places after structural reductions.
[2026-05-25 21:16:30] [INFO ] Flatten gal took : 146 ms
[2026-05-25 21:16:30] [INFO ] Flatten gal took : 76 ms
[2026-05-25 21:16:31] [INFO ] Input system was already deterministic with 432 transitions.
Support contains 82 out of 486 places (down from 84) after GAL structural reductions.
RANDOM walk for 40000 steps (352 resets) in 2118 ms. (18 steps per ms) remains 30/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
[2026-05-25 21:16:31] [INFO ] Invariant cache hit.
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, 30 unsolved
At refinement iteration 1 (OVERLAPS) 53/93 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 106/199 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 265/464 variables, 26/60 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 6/470 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 9 (OVERLAPS) 418/888 variables, 470/532 constraints. Problems are: Problem set: 1 solved, 29 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 888/918 variables, and 532 constraints, problems are : Problem set: 1 solved, 29 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 470/486 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 53/90 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 106/196 variables, 25/34 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 2/36 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 268/464 variables, 26/62 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 1/63 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 0/63 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 6/470 variables, 2/65 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/470 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 418/888 variables, 470/535 constraints. Problems are: Problem set: 1 solved, 29 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 888/918 variables, and 564 constraints, problems are : Problem set: 1 solved, 29 unsolved in 5026 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 470/486 constraints, PredecessorRefiner: 29/30 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10093ms problems are : Problem set: 1 solved, 29 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 37 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 432/432 transitions.
Graph (complete) has 1155 edges and 486 vertex of which 480 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 480 transition count 413
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 31 place count 466 transition count 413
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 31 place count 466 transition count 401
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 55 place count 454 transition count 401
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 62 place count 447 transition count 394
Iterating global reduction 2 with 7 rules applied. Total rules applied 69 place count 447 transition count 394
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 2 with 3 rules applied. Total rules applied 72 place count 447 transition count 391
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 446 transition count 390
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 78 place count 442 transition count 386
Iterating global reduction 4 with 4 rules applied. Total rules applied 82 place count 442 transition count 386
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 85 place count 442 transition count 383
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 85 place count 442 transition count 381
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 89 place count 440 transition count 381
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 4 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 5 with 138 rules applied. Total rules applied 227 place count 371 transition count 312
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 231 place count 369 transition count 314
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 233 place count 369 transition count 312
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 235 place count 367 transition count 312
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 236 place count 367 transition count 311
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 237 place count 366 transition count 311
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 239 place count 366 transition count 311
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 240 place count 365 transition count 310
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 241 place count 364 transition count 310
Applied a total of 241 rules in 263 ms. Remains 364 /486 variables (removed 122) and now considering 310/432 (removed 122) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 263 ms. Remains : 364/486 places, 310/432 transitions.
RANDOM walk for 40000 steps (934 resets) in 808 ms. (49 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (15 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (20 resets) in 33 ms. (117 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (18 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (20 resets) in 35 ms. (111 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (14 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (22 resets) in 32 ms. (121 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (17 resets) in 92 ms. (43 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (20 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (17 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (18 resets) in 33 ms. (117 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (21 resets) in 41 ms. (95 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (21 resets) in 37 ms. (105 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (18 resets) in 35 ms. (111 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (16 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (19 resets) in 36 ms. (108 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (19 resets) in 35 ms. (111 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (16 resets) in 35 ms. (111 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (15 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (17 resets) in 28 ms. (138 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (20 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (18 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (18 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (13 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (19 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (19 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (20 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (14 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (12 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (20 resets) in 25 ms. (154 steps per ms) remains 29/29 properties
Interrupted probabilistic random walk after 392693 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :0 out of 29
Probabilistic random walk after 392693 steps, saw 54388 distinct states, run finished after 3012 ms. (steps per millisecond=130 ) 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-9176585123986307624.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4767517492002428262.kers'
[2026-05-25 21:16:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9176585123986307624.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4767517492002428262.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 310 rows 362 cols 1357 entries
Finished phase 1 with 151 SingleSign rule and 153 generalized
[2026-05-25 21:16:45] [INFO ] Computed 60 invariants in 3 ms
Computed 60 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4767517492002428262.kers
Total runtime 4 ms.
[2026-05-25 21:16:45] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 23/60 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 52/112 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 196/308 variables, 24/57 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 2/310 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 1/311 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 310/621 variables, 311/371 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/621 variables, 6/377 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/621 variables, 2/379 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/621 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 15 (OVERLAPS) 53/674 variables, 53/432 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/674 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/674 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 18 (OVERLAPS) 0/674 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 674/674 variables, and 433 constraints, problems are : Problem set: 0 solved, 29 unsolved in 21269 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 364/364 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 23/60 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 52/112 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 196/308 variables, 24/58 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 2/310 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/310 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (OVERLAPS) 1/311 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/311 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 15 (OVERLAPS) 310/621 variables, 311/376 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/621 variables, 6/382 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/621 variables, 21/403 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 621/674 variables, and 403 constraints, problems are : Problem set: 0 solved, 29 unsolved in 45010 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/364 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 21/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 66319ms problems are : Problem set: 0 solved, 29 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 37 out of 364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 310/310 transitions.
Applied a total of 0 rules in 19 ms. Remains 364 /364 variables (removed 0) and now considering 310/310 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 364/364 places, 310/310 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 310/310 transitions.
Applied a total of 0 rules in 16 ms. Remains 364 /364 variables (removed 0) and now considering 310/310 (removed 0) transitions.
[2026-05-25 21:17:52] [INFO ] Invariant cache hit.
[2026-05-25 21:17:52] [INFO ] Implicit Places using invariants in 590 ms returned []
[2026-05-25 21:17:52] [INFO ] Invariant cache hit.
[2026-05-25 21:17:53] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-25 21:17:53] [INFO ] Implicit Places using invariants and state equation in 985 ms returned []
Implicit Place search using SMT with State Equation took 1580 ms to find 0 implicit places.
[2026-05-25 21:17:53] [INFO ] Redundant transitions in 34 ms returned []
Running 307 sub problems to find dead transitions.
[2026-05-25 21:17:53] [INFO ] Invariant cache hit.
[2026-05-25 21:17:53] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (OVERLAPS) 3/364 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (OVERLAPS) 310/674 variables, 364/424 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/674 variables, 6/430 constraints. Problems are: Problem set: 0 solved, 307 unsolved
SMT process timed out in 30194ms, After SMT, problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 30197ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31839 ms. Remains : 364/364 places, 310/310 transitions.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2026-05-25 21:18:24] [INFO ] Flatten gal took : 33 ms
[2026-05-25 21:18:24] [INFO ] Flatten gal took : 34 ms
[2026-05-25 21:18:24] [INFO ] Input system was already deterministic with 432 transitions.
Computed a total of 299 stabilizing places and 291 stable transitions
Graph (complete) has 1155 edges and 486 vertex of which 480 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.22 ms
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 432/432 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 478 transition count 424
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 478 transition count 424
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 478 transition count 422
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 473 transition count 417
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 473 transition count 417
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 32 place count 473 transition count 413
Applied a total of 32 rules in 39 ms. Remains 473 /486 variables (removed 13) and now considering 413/432 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7152613773691539663.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8268426564544911251.kers'
[2026-05-25 21:18:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7152613773691539663.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8268426564544911251.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 413 rows 473 cols 1477 entries
Finished phase 1 with 191 SingleSign rule and 220 generalized
[2026-05-25 21:18:24] [INFO ] Computed 62 invariants in 8 ms
Computed 62 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-8268426564544911251.kers
Total runtime 10 ms.
[2026-05-25 21:18:24] [INFO ] Implicit Places using invariants in 520 ms returned []
[2026-05-25 21:18:24] [INFO ] Invariant cache hit.
[2026-05-25 21:18:28] [INFO ] Implicit Places using invariants and state equation in 3466 ms returned []
Implicit Place search using SMT with State Equation took 3990 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2026-05-25 21:18:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 412 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (OVERLAPS) 413/886 variables, 473/535 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/886 variables, 20/555 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 886/886 variables, and 555 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 6/108 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 473/886 variables, and 117 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/473 constraints, PredecessorRefiner: 0/412 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60216ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 60218ms
Starting structural reductions in LTL mode, iteration 1 : 473/486 places, 413/432 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64251 ms. Remains : 473/486 places, 413/432 transitions.
[2026-05-25 21:19:28] [INFO ] Flatten gal took : 47 ms
[2026-05-25 21:19:28] [INFO ] Flatten gal took : 42 ms
[2026-05-25 21:19:28] [INFO ] Input system was already deterministic with 413 transitions.
[2026-05-25 21:19:28] [INFO ] Flatten gal took : 40 ms
[2026-05-25 21:19:28] [INFO ] Flatten gal took : 35 ms
[2026-05-25 21:19:28] [INFO ] Time to serialize gal into /tmp/CTLFireability6447655658924329679.gal : 27 ms
[2026-05-25 21:19:28] [INFO ] Time to serialize properties into /tmp/CTLFireability13879132502269744466.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6447655658924329679.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13879132502269744466.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 21:19:59] [INFO ] Flatten gal took : 20 ms
[2026-05-25 21:19:59] [INFO ] Applying decomposition
[2026-05-25 21:19:59] [INFO ] Flatten gal took : 21 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/graph2577381286058964403.txt' '-o' '/tmp/graph2577381286058964403.bin' '-w' '/tmp/graph2577381286058964403.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2577381286058964403.bin' '-l' '-1' '-v' '-w' '/tmp/graph2577381286058964403.weights' '-q' '0' '-e' '0.001'
[2026-05-25 21:19:59] [INFO ] Decomposing Gal with order
[2026-05-25 21:19:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 21:19:59] [INFO ] Removed a total of 10 redundant transitions.
[2026-05-25 21:19:59] [INFO ] Flatten gal took : 118 ms
[2026-05-25 21:19:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 16 ms.
[2026-05-25 21:19:59] [INFO ] Time to serialize gal into /tmp/CTLFireability1502883567710104591.gal : 12 ms
[2026-05-25 21:19:59] [INFO ] Time to serialize properties into /tmp/CTLFireability16545755832671843670.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/CTLFireability1502883567710104591.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16545755832671843670.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.09421e+21,14.1743,288560,28172,8204,694320,47061,639,537169,506,406174,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 486/486 places, 432/432 transitions.
Graph (complete) has 1155 edges and 486 vertex of which 480 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 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 479 transition count 413
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 464 transition count 413
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 464 transition count 403
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 454 transition count 403
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 58 place count 447 transition count 396
Iterating global reduction 2 with 7 rules applied. Total rules applied 65 place count 447 transition count 396
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 2 with 3 rules applied. Total rules applied 68 place count 447 transition count 393
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 70 place count 446 transition count 392
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 74 place count 442 transition count 388
Iterating global reduction 4 with 4 rules applied. Total rules applied 78 place count 442 transition count 388
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 81 place count 442 transition count 385
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 81 place count 442 transition count 383
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 85 place count 440 transition count 383
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 5 with 142 rules applied. Total rules applied 227 place count 369 transition count 312
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 229 place count 367 transition count 310
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 230 place count 366 transition count 310
Applied a total of 230 rules in 175 ms. Remains 366 /486 variables (removed 120) and now considering 310/432 (removed 122) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5885338709985206536.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8358662764462514539.kers'
[2026-05-25 21:20:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5885338709985206536.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8358662764462514539.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 0 ms.
// Phase 1: matrix 310 rows 341 cols 1240 entries
Finished phase 1 with 174 SingleSign rule and 134 generalized
[2026-05-25 21:20:29] [INFO ] Computed 58 invariants in 3 ms
Computed 58 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-8358662764462514539.kers
Total runtime 4 ms.
[2026-05-25 21:20:30] [INFO ] Implicit Places using invariants in 470 ms returned []
[2026-05-25 21:20:30] [INFO ] Invariant cache hit.
[2026-05-25 21:20:31] [INFO ] Implicit Places using invariants and state equation in 992 ms returned []
Implicit Place search using SMT with State Equation took 1469 ms to find 0 implicit places.
[2026-05-25 21:20:31] [INFO ] Redundant transitions in 23 ms returned []
Running 307 sub problems to find dead transitions.
[2026-05-25 21:20:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (OVERLAPS) 2/365 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (OVERLAPS) 310/675 variables, 365/423 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/675 variables, 3/426 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 675/676 variables, and 426 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 365/366 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 2/365 variables, 12/61 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (OVERLAPS) 310/675 variables, 365/426 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/675 variables, 307/733 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 675/676 variables, and 733 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 365/366 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60204ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 60206ms
Starting structural reductions in SI_CTL mode, iteration 1 : 366/486 places, 310/432 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61882 ms. Remains : 366/486 places, 310/432 transitions.
[2026-05-25 21:21:31] [INFO ] Flatten gal took : 16 ms
[2026-05-25 21:21:31] [INFO ] Flatten gal took : 17 ms
[2026-05-25 21:21:31] [INFO ] Input system was already deterministic with 310 transitions.
[2026-05-25 21:21:31] [INFO ] Flatten gal took : 32 ms
[2026-05-25 21:21:31] [INFO ] Flatten gal took : 40 ms
RANDOM walk for 40000 steps (1261 resets) in 311 ms. (128 steps per ms) remains 1/1 properties
[2026-05-25 21:21:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6072952109375771655.gal : 8 ms
[2026-05-25 21:21:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12794267311327928700.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/ReachabilityCardinality6072952109375771655.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12794267311327928700.prop' '--nowitness' '--gen-order' 'FOLLOW'

BEST_FIRST walk for 40003 steps (263 resets) in 98 ms. (404 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 ...329
Loading property file /tmp/ReachabilityCardinality12794267311327928700.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 8
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :8 after 152
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :152 after 224
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :224 after 296
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :296 after 7008
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :7008 after 30160
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :30160 after 212194
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.01197e+06 after 1.2372e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.2372e+06 after 1.32356e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.32356e+06 after 4.50322e+06
Interrupted probabilistic random walk after 969808 steps, run timeout after 3001 ms. (steps per millisecond=323 ) properties seen :0 out of 1
Probabilistic random walk after 969808 steps, saw 130468 distinct states, run finished after 3001 ms. (steps per millisecond=323 ) properties seen :0
[2026-05-25 21:21:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 210/216 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/233 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/271 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 17/288 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/288 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 238/526 variables, 288/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/526 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 20/546 variables, 11/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/546 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/546 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/547 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/547 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/547 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 69/616 variables, 6/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/616 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/616 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 60/676 variables, 60/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/676 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/676 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 676/676 variables, and 424 constraints, problems are : Problem set: 0 solved, 1 unsolved in 547 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 366/366 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 16384
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 210/216 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/233 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD size :1.29221e+07 after 2.25745e+09
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/271 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 17/288 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/288 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 238/526 variables, 288/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/526 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/526 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 20/546 variables, 11/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/546 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/546 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/547 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/547 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/547 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 69/616 variables, 6/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/616 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/616 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 60/676 variables, 60/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/676 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/676 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 676/676 variables, and 425 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1815 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 366/366 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2368ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 641 ms.
Support contains 2 out of 366 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 310/310 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 366 transition count 306
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 364 transition count 306
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 360 transition count 302
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 2 with 4 rules applied. Total rules applied 18 place count 358 transition count 304
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 358 transition count 303
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 357 transition count 303
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 357 transition count 303
Applied a total of 21 rules in 71 ms. Remains 357 /366 variables (removed 9) and now considering 303/310 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 357/366 places, 303/310 transitions.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.25745e+09 after 6.25414e+09
RANDOM walk for 4000000 steps (191265 resets) in 13196 ms. (303 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (36395 resets) in 5705 ms. (701 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.35047e+10 after 1.56841e+10
Interrupted probabilistic random walk after 5246526 steps, run timeout after 15001 ms. (steps per millisecond=349 ) properties seen :0 out of 1
Probabilistic random walk after 5246526 steps, saw 766208 distinct states, run finished after 15002 ms. (steps per millisecond=349 ) 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-8970253591829330490.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5796988563206917274.kers'
[2026-05-25 21:21:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8970253591829330490.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5796988563206917274.kers]
Culling duplicate invariants (modulo rational): removing 27 columns.
Culled 27 columns in 0 ms.
// Phase 1: matrix 303 rows 330 cols 1250 entries
Finished phase 1 with 168 SingleSign rule and 129 generalized
[2026-05-25 21:21:57] [INFO ] Computed 60 invariants in 4 ms
Computed 60 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-5796988563206917274.kers
Total runtime 5 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 225/231 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 41/272 variables, 31/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/274 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/284 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/285 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 239/524 variables, 285/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/524 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 13/537 variables, 8/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/537 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/537 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/539 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/539 variables, 2/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/539 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 62/601 variables, 3/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/601 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/601 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 59/660 variables, 59/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/660 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/660 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 660/660 variables, and 417 constraints, problems are : Problem set: 0 solved, 1 unsolved in 572 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 357/357 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 225/231 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 41/272 variables, 31/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/274 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/284 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/285 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 239/524 variables, 285/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/524 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/524 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/524 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 13/537 variables, 8/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/537 variables, 3/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/537 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/537 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/539 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/539 variables, 2/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/539 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 62/601 variables, 3/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/601 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/601 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 59/660 variables, 59/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/660 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/660 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 660/660 variables, and 421 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1415 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2007ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 617 ms.
Support contains 2 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 303/303 transitions.
SDD proceeding with computation,1 properties remain. new max is 131072
Applied a total of 0 rules in 29 ms. Remains 357 /357 variables (removed 0) and now considering 303/303 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 357/357 places, 303/303 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 303/303 transitions.
Applied a total of 0 rules in 18 ms. Remains 357 /357 variables (removed 0) and now considering 303/303 (removed 0) transitions.
[2026-05-25 21:22:00] [INFO ] Invariant cache hit.
SDD size :1.71294e+10 after 1.05207e+11
[2026-05-25 21:22:01] [INFO ] Implicit Places using invariants in 445 ms returned []
[2026-05-25 21:22:01] [INFO ] Invariant cache hit.
[2026-05-25 21:22:01] [INFO ] Implicit Places using invariants and state equation in 754 ms returned []
Implicit Place search using SMT with State Equation took 1201 ms to find 0 implicit places.
[2026-05-25 21:22:01] [INFO ] Redundant transitions in 2 ms returned []
Running 300 sub problems to find dead transitions.
[2026-05-25 21:22:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 300 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/356 variables, 11/60 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (OVERLAPS) 303/659 variables, 356/416 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/659 variables, 4/420 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/659 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 659/660 variables, and 421 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 356/357 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
SDD proceeding with computation,1 properties remain. new max is 262144
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 300 unsolved
SDD size :2.19362e+11 after 5.02131e+11
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 2/356 variables, 11/64 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 303/659 variables, 356/421 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/659 variables, 300/721 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 659/660 variables, and 721 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 356/357 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60149ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60150ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61382 ms. Remains : 357/357 places, 303/303 transitions.
RANDOM walk for 400000 steps (19194 resets) in 2664 ms. (150 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2026-05-25 21:23:02] [INFO ] Invariant cache hit.
[2026-05-25 21:23:02] [INFO ] [Real]Absence check using 40 positive place invariants in 14 ms returned sat
[2026-05-25 21:23:02] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 31 ms returned sat
[2026-05-25 21:23:03] [INFO ] After 196ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 21:23:03] [INFO ] After 240ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 21:23:03] [INFO ] After 377ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 21:23:03] [INFO ] [Nat]Absence check using 40 positive place invariants in 11 ms returned sat
[2026-05-25 21:23:03] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 35 ms returned sat
[2026-05-25 21:23:03] [INFO ] After 239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 21:23:03] [INFO ] After 271ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 21:23:03] [INFO ] After 397ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (190582 resets) in 12819 ms. (312 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (36492 resets) in 5988 ms. (667 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4221212 steps, run timeout after 12001 ms. (steps per millisecond=351 ) properties seen :0 out of 1
Probabilistic random walk after 4221212 steps, saw 613565 distinct states, run finished after 12004 ms. (steps per millisecond=351 ) properties seen :0
[2026-05-25 21:23:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 225/231 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 41/272 variables, 31/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/274 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/284 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/285 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 239/524 variables, 285/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/524 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 13/537 variables, 8/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/537 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/537 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/539 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/539 variables, 2/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/539 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 62/601 variables, 3/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/601 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/601 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 59/660 variables, 59/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/660 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/660 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 660/660 variables, and 417 constraints, problems are : Problem set: 0 solved, 1 unsolved in 725 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 357/357 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 225/231 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 41/272 variables, 31/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/274 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/284 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/285 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 239/524 variables, 285/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/524 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/524 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/524 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 13/537 variables, 8/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/537 variables, 3/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/537 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/537 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/539 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/539 variables, 2/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/539 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 62/601 variables, 3/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/601 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/601 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 59/660 variables, 59/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/660 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/660 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 660/660 variables, and 421 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1803 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2536ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 673 ms.
Support contains 2 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 303/303 transitions.
Applied a total of 0 rules in 24 ms. Remains 357 /357 variables (removed 0) and now considering 303/303 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 357/357 places, 303/303 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 303/303 transitions.
Applied a total of 0 rules in 18 ms. Remains 357 /357 variables (removed 0) and now considering 303/303 (removed 0) transitions.
[2026-05-25 21:23:23] [INFO ] Invariant cache hit.
[2026-05-25 21:23:24] [INFO ] Implicit Places using invariants in 342 ms returned []
[2026-05-25 21:23:24] [INFO ] Invariant cache hit.
[2026-05-25 21:23:24] [INFO ] Implicit Places using invariants and state equation in 908 ms returned []
Implicit Place search using SMT with State Equation took 1259 ms to find 0 implicit places.
[2026-05-25 21:23:24] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1286 ms. Remains : 357/357 places, 303/303 transitions.
RANDOM walk for 400000 steps (19230 resets) in 1792 ms. (223 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2026-05-25 21:23:25] [INFO ] Invariant cache hit.
[2026-05-25 21:23:25] [INFO ] [Real]Absence check using 40 positive place invariants in 15 ms returned sat
[2026-05-25 21:23:25] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 50 ms returned sat
[2026-05-25 21:23:26] [INFO ] After 330ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 21:23:26] [INFO ] After 385ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 21:23:26] [INFO ] After 557ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 21:23:26] [INFO ] [Nat]Absence check using 40 positive place invariants in 17 ms returned sat
[2026-05-25 21:23:26] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 58 ms returned sat
[2026-05-25 21:23:26] [INFO ] After 359ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 21:23:26] [INFO ] After 417ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 21:23:26] [INFO ] After 603ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 40000 steps (1913 resets) in 187 ms. (212 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (376 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 960650 steps, run timeout after 3001 ms. (steps per millisecond=320 ) properties seen :0 out of 1
Probabilistic random walk after 960650 steps, saw 134431 distinct states, run finished after 3001 ms. (steps per millisecond=320 ) properties seen :0
[2026-05-25 21:23:29] [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) 227/228 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 44/272 variables, 33/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/274 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/284 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/285 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 239/524 variables, 285/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/524 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/537 variables, 8/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/537 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/537 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/539 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/539 variables, 2/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/539 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/601 variables, 3/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/601 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/601 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 59/660 variables, 59/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/660 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/660 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 660/660 variables, and 417 constraints, problems are : Problem set: 0 solved, 1 unsolved in 727 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 357/357 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) 227/228 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/272 variables, 33/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/274 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/284 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/285 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/285 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 239/524 variables, 285/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/524 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/524 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 13/537 variables, 8/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/537 variables, 3/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/537 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/539 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/539 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/539 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 62/601 variables, 3/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/601 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/601 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 59/660 variables, 59/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/660 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/660 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/660 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 660/660 variables, and 420 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1332 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2082ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 545 ms.
Support contains 1 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 303/303 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 357 transition count 302
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 356 transition count 302
Applied a total of 2 rules in 16 ms. Remains 356 /357 variables (removed 1) and now considering 302/303 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 356/357 places, 302/303 transitions.
RANDOM walk for 40000 steps (1880 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (381 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 524288
Interrupted probabilistic random walk after 1021303 steps, run timeout after 3001 ms. (steps per millisecond=340 ) properties seen :0 out of 1
Probabilistic random walk after 1021303 steps, saw 143544 distinct states, run finished after 3004 ms. (steps per millisecond=339 ) 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-4662794591161476798.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8278968166352052954.kers'
[2026-05-25 21:23:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4662794591161476798.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8278968166352052954.kers]
Culling duplicate invariants (modulo rational): removing 29 columns.
Culled 29 columns in 0 ms.
// Phase 1: matrix 302 rows 327 cols 1186 entries
Finished phase 1 with 226 SingleSign rule and 70 generalized
[2026-05-25 21:23:35] [INFO ] Computed 60 invariants in 4 ms
Computed 60 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-8278968166352052954.kers
Total runtime 5 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) 227/228 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 43/271 variables, 33/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/273 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/283 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/284 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 238/522 variables, 284/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/522 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/535 variables, 8/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/535 variables, 3/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/535 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/537 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/537 variables, 2/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/537 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/599 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/599 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/599 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 59/658 variables, 59/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/658 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/658 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 658/658 variables, and 416 constraints, problems are : Problem set: 0 solved, 1 unsolved in 557 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 356/356 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) 227/228 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/271 variables, 33/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/273 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/283 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/284 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD size :9.40437e+11 after 2.19129e+12
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 238/522 variables, 284/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/522 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/522 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 13/535 variables, 8/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/535 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/535 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/537 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/537 variables, 2/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/537 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 62/599 variables, 3/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/599 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/599 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 59/658 variables, 59/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/658 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/658 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 658/658 variables, and 417 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1040 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1626ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 511 ms.
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 11 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 356/356 places, 302/302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 10 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
[2026-05-25 21:23:37] [INFO ] Invariant cache hit.
[2026-05-25 21:23:38] [INFO ] Implicit Places using invariants in 406 ms returned []
[2026-05-25 21:23:38] [INFO ] Invariant cache hit.
[2026-05-25 21:23:39] [INFO ] Implicit Places using invariants and state equation in 970 ms returned []
Implicit Place search using SMT with State Equation took 1381 ms to find 0 implicit places.
[2026-05-25 21:23:39] [INFO ] Redundant transitions in 2 ms returned []
Running 299 sub problems to find dead transitions.
[2026-05-25 21:23:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 299 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/355 variables, 11/60 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (OVERLAPS) 302/657 variables, 355/415 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/657 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/657 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 8 (OVERLAPS) 1/658 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 658/658 variables, and 419 constraints, problems are : Problem set: 0 solved, 299 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 2/355 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (OVERLAPS) 302/657 variables, 355/418 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/657 variables, 299/717 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/658 variables, and 717 constraints, problems are : Problem set: 0 solved, 299 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 355/356 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60150ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 60151ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61551 ms. Remains : 356/356 places, 302/302 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 356 transition count 302
Applied a total of 1 rules in 34 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (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-17419456762324043769.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3167023895923836586.kers'
[2026-05-25 21:24:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17419456762324043769.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3167023895923836586.kers]
Culling duplicate invariants (modulo rational): removing 29 columns.
Culled 29 columns in 1 ms.
// Phase 1: matrix 302 rows 327 cols 1187 entries
Finished phase 1 with 226 SingleSign rule and 70 generalized
[2026-05-25 21:24:39] [INFO ] Computed 60 invariants in 6 ms
Computed 60 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-3167023895923836586.kers
Total runtime 8 ms.
[2026-05-25 21:24:39] [INFO ] [Real]Absence check using 40 positive place invariants in 16 ms returned sat
[2026-05-25 21:24:39] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 88 ms returned sat
[2026-05-25 21:24:39] [INFO ] After 393ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 21:24:39] [INFO ] [Nat]Absence check using 40 positive place invariants in 10 ms returned sat
[2026-05-25 21:24:40] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 32 ms returned sat
[2026-05-25 21:24:40] [INFO ] After 210ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 21:24:40] [INFO ] After 239ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 21:24:40] [INFO ] After 488ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 949 ms.
RANDOM walk for 12699 steps (606 resets) in 77 ms. (162 steps per ms) remains 0/1 properties
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 357 transition count 303
Applied a total of 1 rules in 22 ms. Remains 357 /357 variables (removed 0) and now considering 303/303 (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-15577021138181853766.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3404361395150257761.kers'
[2026-05-25 21:24:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15577021138181853766.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3404361395150257761.kers]
Culling duplicate invariants (modulo rational): removing 27 columns.
Culled 27 columns in 0 ms.
// Phase 1: matrix 303 rows 330 cols 1251 entries
Finished phase 1 with 168 SingleSign rule and 129 generalized
[2026-05-25 21:24:40] [INFO ] Computed 60 invariants in 8 ms
Computed 60 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-3404361395150257761.kers
Total runtime 9 ms.
[2026-05-25 21:24:40] [INFO ] [Real]Absence check using 40 positive place invariants in 12 ms returned sat
[2026-05-25 21:24:40] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 47 ms returned sat
[2026-05-25 21:24:40] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 21:24:40] [INFO ] [Nat]Absence check using 40 positive place invariants in 14 ms returned sat
[2026-05-25 21:24:40] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 48 ms returned sat
[2026-05-25 21:24:41] [INFO ] After 346ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 21:24:41] [INFO ] After 396ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 21:24:41] [INFO ] After 610ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-25 21:24:41] [INFO ] Flatten gal took : 19 ms
[2026-05-25 21:24:41] [INFO ] Flatten gal took : 18 ms
[2026-05-25 21:24:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7710391275858874149.gal : 5 ms
[2026-05-25 21:24:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10007719792342846718.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/ReachabilityCardinality7710391275858874149.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10007719792342846718.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/ReachabilityCardinality10007719792342846718.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 8
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :8 after 56
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :56 after 80
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :80 after 152
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :152 after 868
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :868 after 1508
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1508 after 5544
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5544 after 89778
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :89778 after 229608
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :229608 after 314248
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.84298e+06 after 1.99605e+09
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.99605e+09 after 2.66614e+09
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.78396e+09 after 2.8039e+09
Detected timeout of ITS tools.
[2026-05-25 21:24:56] [INFO ] Flatten gal took : 13 ms
[2026-05-25 21:24:56] [INFO ] Applying decomposition
[2026-05-25 21:24:56] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17940490434473747314.txt' '-o' '/tmp/graph17940490434473747314.bin' '-w' '/tmp/graph17940490434473747314.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17940490434473747314.bin' '-l' '-1' '-v' '-w' '/tmp/graph17940490434473747314.weights' '-q' '0' '-e' '0.001'
[2026-05-25 21:24:56] [INFO ] Decomposing Gal with order
[2026-05-25 21:24:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 21:24:56] [INFO ] Removed a total of 36 redundant transitions.
[2026-05-25 21:24:56] [INFO ] Flatten gal took : 25 ms
[2026-05-25 21:24:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2026-05-25 21:24:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5812710441878527171.gal : 5 ms
[2026-05-25 21:24:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13005442293364962612.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/ReachabilityCardinality5812710441878527171.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13005442293364962612.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 ...308
Loading property file /tmp/ReachabilityCardinality13005442293364962612.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 226
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :226 after 4132
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :4132 after 50736
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :50736 after 2.05727e+09
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.05727e+09 after 3.41591e+09
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3.41591e+09 after 5.11422e+09
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5.11422e+09 after 8.17117e+09
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3.6728e+13 after 3.67305e+13
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 31144 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 21:25:11] [INFO ] Flatten gal took : 10 ms
[2026-05-25 21:25:11] [INFO ] Applying decomposition
[2026-05-25 21:25: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/graph11117357830313614366.txt' '-o' '/tmp/graph11117357830313614366.bin' '-w' '/tmp/graph11117357830313614366.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11117357830313614366.bin' '-l' '-1' '-v' '-w' '/tmp/graph11117357830313614366.weights' '-q' '0' '-e' '0.001'
[2026-05-25 21:25:11] [INFO ] Decomposing Gal with order
[2026-05-25 21:25:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 21:25:11] [INFO ] Removed a total of 8 redundant transitions.
[2026-05-25 21:25:11] [INFO ] Flatten gal took : 19 ms
[2026-05-25 21:25:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2026-05-25 21:25:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17371932376648251099.gal : 5 ms
[2026-05-25 21:25:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5021341180472080393.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/ReachabilityCardinality17371932376648251099.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5021341180472080393.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 ...308
Loading property file /tmp/ReachabilityCardinality5021341180472080393.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 2
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2 after 102
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :102 after 35652
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :35652 after 305876
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :305876 after 1.86393e+10
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.86393e+10 after 3.10006e+10
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3.10006e+10 after 4.64522e+10
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.64522e+10 after 7.42651e+10
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3.07021e+14 after 3.26712e+14
Reachability property DES-PT-60b-CTLFireability-2024-01 is true.
FORMULA DES-PT-60b-CTLFireability-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 2049 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,7.7977e+14,6.37867,131312,14092,7642,331675,19414,318,206963,550,102812,0
Total reachable state count : 779769844438136

Verifying 1 reachability properties.
Reachability property DES-PT-60b-CTLFireability-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-60b-CTLFireability-2024-01,2.14861e+10,6.40622,131568,538,889,331675,19414,326,206963,557,102812,0
[2026-05-25 21:25:18] [INFO ] Flatten gal took : 11 ms
[2026-05-25 21:25:18] [INFO ] Flatten gal took : 12 ms
[2026-05-25 21:25:18] [INFO ] Time to serialize gal into /tmp/CTLFireability16573150617700455069.gal : 5 ms
[2026-05-25 21:25:18] [INFO ] Time to serialize properties into /tmp/CTLFireability13272693225661041043.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/CTLFireability16573150617700455069.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13272693225661041043.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 0 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 486/486 places, 432/432 transitions.
Graph (complete) has 1155 edges and 486 vertex of which 480 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 479 transition count 414
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 465 transition count 414
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 29 place count 465 transition count 403
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 51 place count 454 transition count 403
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 58 place count 447 transition count 396
Iterating global reduction 2 with 7 rules applied. Total rules applied 65 place count 447 transition count 396
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 2 with 3 rules applied. Total rules applied 68 place count 447 transition count 393
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 70 place count 446 transition count 392
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 74 place count 442 transition count 388
Iterating global reduction 4 with 4 rules applied. Total rules applied 78 place count 442 transition count 388
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 81 place count 442 transition count 385
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 81 place count 442 transition count 383
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 85 place count 440 transition count 383
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 5 with 142 rules applied. Total rules applied 227 place count 369 transition count 312
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 229 place count 367 transition count 310
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 230 place count 366 transition count 310
Applied a total of 230 rules in 151 ms. Remains 366 /486 variables (removed 120) and now considering 310/432 (removed 122) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2615886079886065854.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3659913916167729086.kers'
[2026-05-25 21:25:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2615886079886065854.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3659913916167729086.kers]
Culling duplicate invariants (modulo rational): removing 27 columns.
Culled 27 columns in 0 ms.
// Phase 1: matrix 310 rows 339 cols 1178 entries
Finished phase 1 with 233 SingleSign rule and 75 generalized
[2026-05-25 21:25:48] [INFO ] Computed 58 invariants in 5 ms
Computed 58 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-3659913916167729086.kers
Total runtime 7 ms.
[2026-05-25 21:25:48] [INFO ] Implicit Places using invariants in 517 ms returned []
[2026-05-25 21:25:48] [INFO ] Invariant cache hit.
[2026-05-25 21:25:49] [INFO ] Implicit Places using invariants and state equation in 818 ms returned []
Implicit Place search using SMT with State Equation took 1342 ms to find 0 implicit places.
[2026-05-25 21:25:49] [INFO ] Redundant transitions in 2 ms returned []
Running 307 sub problems to find dead transitions.
[2026-05-25 21:25:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (OVERLAPS) 2/365 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (OVERLAPS) 310/675 variables, 365/423 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/675 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 675/676 variables, and 428 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 365/366 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 2/365 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 310/675 variables, 365/428 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/675 variables, 307/735 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 675/676 variables, and 735 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 365/366 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60155ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Starting structural reductions in SI_CTL mode, iteration 1 : 366/486 places, 310/432 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61664 ms. Remains : 366/486 places, 310/432 transitions.
[2026-05-25 21:26:49] [INFO ] Flatten gal took : 10 ms
[2026-05-25 21:26:49] [INFO ] Flatten gal took : 13 ms
[2026-05-25 21:26:50] [INFO ] Input system was already deterministic with 310 transitions.
[2026-05-25 21:26:50] [INFO ] Flatten gal took : 11 ms
[2026-05-25 21:26:50] [INFO ] Flatten gal took : 10 ms
[2026-05-25 21:26:50] [INFO ] Time to serialize gal into /tmp/CTLFireability3603181268204393666.gal : 3 ms
[2026-05-25 21:26:50] [INFO ] Time to serialize properties into /tmp/CTLFireability7961585165708601193.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/CTLFireability3603181268204393666.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7961585165708601193.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 21:27:20] [INFO ] Flatten gal took : 13 ms
[2026-05-25 21:27:20] [INFO ] Applying decomposition
[2026-05-25 21:27:20] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16639046699184821035.txt' '-o' '/tmp/graph16639046699184821035.bin' '-w' '/tmp/graph16639046699184821035.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16639046699184821035.bin' '-l' '-1' '-v' '-w' '/tmp/graph16639046699184821035.weights' '-q' '0' '-e' '0.001'
[2026-05-25 21:27:20] [INFO ] Decomposing Gal with order
[2026-05-25 21:27:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 21:27:20] [INFO ] Removed a total of 8 redundant transitions.
[2026-05-25 21:27:20] [INFO ] Flatten gal took : 20 ms
[2026-05-25 21:27:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2026-05-25 21:27:20] [INFO ] Time to serialize gal into /tmp/CTLFireability15510027106605145032.gal : 4 ms
[2026-05-25 21:27:20] [INFO ] Time to serialize properties into /tmp/CTLFireability6277907058717175177.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/CTLFireability15510027106605145032.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6277907058717175177.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.00307e+15,10.0577,204236,19298,13901,508939,25445,320,311736,555,221467,0


Converting to forward existential form...Done !
original formula: AF((i12.i0.u44.p487==1))
=> equivalent forward existential formula: [FwdG(Init,!((i12.i0.u44.p487==1)))] = FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,1,23.5862,361892,1,0,687795,178914,1075,1.08916e+06,4343,1.22014e+06,531431
FORMULA DES-PT-60b-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 486/486 places, 432/432 transitions.
Graph (complete) has 1155 edges and 486 vertex of which 480 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 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 479 transition count 413
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 464 transition count 413
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 464 transition count 403
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 454 transition count 403
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 58 place count 447 transition count 396
Iterating global reduction 2 with 7 rules applied. Total rules applied 65 place count 447 transition count 396
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 2 with 3 rules applied. Total rules applied 68 place count 447 transition count 393
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 70 place count 446 transition count 392
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 74 place count 442 transition count 388
Iterating global reduction 4 with 4 rules applied. Total rules applied 78 place count 442 transition count 388
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 81 place count 442 transition count 385
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 81 place count 442 transition count 383
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 85 place count 440 transition count 383
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 5 with 142 rules applied. Total rules applied 227 place count 369 transition count 312
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 229 place count 367 transition count 310
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 230 place count 366 transition count 310
Applied a total of 230 rules in 88 ms. Remains 366 /486 variables (removed 120) and now considering 310/432 (removed 122) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4270383776630604812.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16459560815940119835.kers'
[2026-05-25 21:27:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4270383776630604812.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16459560815940119835.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 1 ms.
// Phase 1: matrix 310 rows 341 cols 1240 entries
Finished phase 1 with 174 SingleSign rule and 134 generalized
[2026-05-25 21:27:44] [INFO ] Computed 58 invariants in 6 ms
Computed 58 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-16459560815940119835.kers
Total runtime 14 ms.
[2026-05-25 21:27:44] [INFO ] Implicit Places using invariants in 410 ms returned []
[2026-05-25 21:27:44] [INFO ] Invariant cache hit.
[2026-05-25 21:27:45] [INFO ] Implicit Places using invariants and state equation in 954 ms returned []
Implicit Place search using SMT with State Equation took 1370 ms to find 0 implicit places.
[2026-05-25 21:27:45] [INFO ] Redundant transitions in 2 ms returned []
Running 307 sub problems to find dead transitions.
[2026-05-25 21:27:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (OVERLAPS) 2/365 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (OVERLAPS) 310/675 variables, 365/423 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/675 variables, 3/426 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 675/676 variables, and 426 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 365/366 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 2/365 variables, 12/61 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (OVERLAPS) 310/675 variables, 365/426 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/675 variables, 307/733 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 675/676 variables, and 733 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 365/366 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60129ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 60130ms
Starting structural reductions in SI_CTL mode, iteration 1 : 366/486 places, 310/432 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61599 ms. Remains : 366/486 places, 310/432 transitions.
[2026-05-25 21:28:45] [INFO ] Flatten gal took : 16 ms
[2026-05-25 21:28:45] [INFO ] Flatten gal took : 31 ms
[2026-05-25 21:28:45] [INFO ] Input system was already deterministic with 310 transitions.
[2026-05-25 21:28:45] [INFO ] Flatten gal took : 29 ms
[2026-05-25 21:28:45] [INFO ] Flatten gal took : 45 ms
[2026-05-25 21:28:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9856158510856393579.gal : 11 ms
[2026-05-25 21:28:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16222895291852434376.prop : 0 ms
RANDOM walk for 40000 steps (1315 resets) in 305 ms. (130 steps per ms) remains 1/1 properties
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/ReachabilityCardinality9856158510856393579.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16222895291852434376.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
BEST_FIRST walk for 40002 steps (241 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality16222895291852434376.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 8
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :8 after 152
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :152 after 224
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :224 after 296
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :296 after 7008
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :7008 after 30160
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :30160 after 212194
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.01197e+06 after 1.2372e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.2372e+06 after 1.32356e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.32356e+06 after 4.50322e+06
Interrupted probabilistic random walk after 994965 steps, run timeout after 3001 ms. (steps per millisecond=331 ) properties seen :0 out of 1
Probabilistic random walk after 994965 steps, saw 133187 distinct states, run finished after 3001 ms. (steps per millisecond=331 ) properties seen :0
[2026-05-25 21:28:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 210/216 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/233 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/271 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 17/288 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/288 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 238/526 variables, 288/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/526 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 20/546 variables, 11/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/546 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/546 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/547 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/547 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/547 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 69/616 variables, 6/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/616 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/616 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 60/676 variables, 60/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/676 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/676 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 676/676 variables, and 424 constraints, problems are : Problem set: 0 solved, 1 unsolved in 639 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 366/366 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
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.29221e+07 after 2.25745e+09
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 210/216 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/233 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/271 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 17/288 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/288 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 238/526 variables, 288/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/526 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/526 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 20/546 variables, 11/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/546 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/546 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/547 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/547 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/547 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 69/616 variables, 6/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/616 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/616 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 60/676 variables, 60/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/676 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/676 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 676/676 variables, and 425 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1269 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 366/366 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1913ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 621 ms.
Support contains 2 out of 366 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 310/310 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 366 transition count 306
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 364 transition count 306
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 360 transition count 302
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 358 transition count 304
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 358 transition count 303
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 357 transition count 303
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 357 transition count 303
Applied a total of 21 rules in 60 ms. Remains 357 /366 variables (removed 9) and now considering 303/310 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 357/366 places, 303/310 transitions.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.25745e+09 after 6.25414e+09
RANDOM walk for 4000000 steps (191513 resets) in 13589 ms. (294 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (36550 resets) in 6043 ms. (661 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.35047e+10 after 1.56841e+10
Interrupted probabilistic random walk after 5272233 steps, run timeout after 15001 ms. (steps per millisecond=351 ) properties seen :0 out of 1
Probabilistic random walk after 5272233 steps, saw 769677 distinct states, run finished after 15001 ms. (steps per millisecond=351 ) 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-13305109105355176627.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1712165322790468077.kers'
[2026-05-25 21:29:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13305109105355176627.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1712165322790468077.kers]
Culling duplicate invariants (modulo rational): removing 27 columns.
Culled 27 columns in 0 ms.
// Phase 1: matrix 303 rows 330 cols 1250 entries
Finished phase 1 with 168 SingleSign rule and 129 generalized
[2026-05-25 21:29:11] [INFO ] Computed 60 invariants in 5 ms
Computed 60 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-1712165322790468077.kers
Total runtime 6 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 225/231 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 41/272 variables, 31/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/274 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/284 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/285 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 239/524 variables, 285/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/524 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 13/537 variables, 8/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/537 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/537 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/539 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/539 variables, 2/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/539 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 62/601 variables, 3/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/601 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/601 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 59/660 variables, 59/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/660 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/660 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 660/660 variables, and 417 constraints, problems are : Problem set: 0 solved, 1 unsolved in 520 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 357/357 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 225/231 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 41/272 variables, 31/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/274 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/284 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/285 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 239/524 variables, 285/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/524 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/524 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/524 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 13/537 variables, 8/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/537 variables, 3/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/537 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/539 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/539 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/539 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 62/601 variables, 3/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/601 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/601 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 59/660 variables, 59/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/660 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/660 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/660 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 660/660 variables, and 421 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1498 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2052ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1097 ms.
Support contains 2 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 303/303 transitions.
Applied a total of 0 rules in 14 ms. Remains 357 /357 variables (removed 0) and now considering 303/303 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 357/357 places, 303/303 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 303/303 transitions.
Applied a total of 0 rules in 10 ms. Remains 357 /357 variables (removed 0) and now considering 303/303 (removed 0) transitions.
[2026-05-25 21:29:14] [INFO ] Invariant cache hit.
[2026-05-25 21:29:15] [INFO ] Implicit Places using invariants in 319 ms returned []
[2026-05-25 21:29:15] [INFO ] Invariant cache hit.
[2026-05-25 21:29:16] [INFO ] Implicit Places using invariants and state equation in 837 ms returned []
Implicit Place search using SMT with State Equation took 1159 ms to find 0 implicit places.
[2026-05-25 21:29:16] [INFO ] Redundant transitions in 2 ms returned []
Running 300 sub problems to find dead transitions.
[2026-05-25 21:29:16] [INFO ] Invariant cache hit.
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.71294e+10 after 1.05207e+11
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 300 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/356 variables, 11/60 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (OVERLAPS) 303/659 variables, 356/416 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/659 variables, 4/420 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/659 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 659/660 variables, and 421 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 356/357 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 2/356 variables, 11/64 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 300 unsolved
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :2.19362e+11 after 5.02131e+11
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 303/659 variables, 356/421 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/659 variables, 300/721 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 659/660 variables, and 721 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 356/357 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60128ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60129ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61308 ms. Remains : 357/357 places, 303/303 transitions.
RANDOM walk for 400000 steps (19177 resets) in 1465 ms. (272 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2026-05-25 21:30:16] [INFO ] Invariant cache hit.
[2026-05-25 21:30:16] [INFO ] [Real]Absence check using 40 positive place invariants in 11 ms returned sat
[2026-05-25 21:30:16] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 33 ms returned sat
[2026-05-25 21:30:17] [INFO ] After 278ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 21:30:17] [INFO ] After 330ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 21:30:17] [INFO ] After 445ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 21:30:17] [INFO ] [Nat]Absence check using 40 positive place invariants in 17 ms returned sat
[2026-05-25 21:30:17] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 52 ms returned sat
[2026-05-25 21:30:17] [INFO ] After 333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 21:30:17] [INFO ] After 382ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 21:30:17] [INFO ] After 569ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (191206 resets) in 12908 ms. (309 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (36260 resets) in 5206 ms. (768 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3958301 steps, run timeout after 12001 ms. (steps per millisecond=329 ) properties seen :0 out of 1
Probabilistic random walk after 3958301 steps, saw 574352 distinct states, run finished after 12004 ms. (steps per millisecond=329 ) properties seen :0
[2026-05-25 21:30:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 225/231 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 41/272 variables, 31/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/274 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/284 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/285 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 239/524 variables, 285/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/524 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 13/537 variables, 8/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/537 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/537 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/539 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/539 variables, 2/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/539 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 62/601 variables, 3/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/601 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/601 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 59/660 variables, 59/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/660 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/660 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 660/660 variables, and 417 constraints, problems are : Problem set: 0 solved, 1 unsolved in 575 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 357/357 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 225/231 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 41/272 variables, 31/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/274 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/284 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/285 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 239/524 variables, 285/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/524 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/524 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/524 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 13/537 variables, 8/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/537 variables, 3/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/537 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/539 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/539 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/539 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 62/601 variables, 3/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/601 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/601 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 59/660 variables, 59/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/660 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/660 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/660 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 660/660 variables, and 421 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2136 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2718ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1044 ms.
Support contains 2 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 303/303 transitions.
Applied a total of 0 rules in 10 ms. Remains 357 /357 variables (removed 0) and now considering 303/303 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 357/357 places, 303/303 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 303/303 transitions.
Applied a total of 0 rules in 10 ms. Remains 357 /357 variables (removed 0) and now considering 303/303 (removed 0) transitions.
[2026-05-25 21:30:38] [INFO ] Invariant cache hit.
[2026-05-25 21:30:38] [INFO ] Implicit Places using invariants in 288 ms returned []
[2026-05-25 21:30:38] [INFO ] Invariant cache hit.
[2026-05-25 21:30:39] [INFO ] Implicit Places using invariants and state equation in 848 ms returned []
Implicit Place search using SMT with State Equation took 1141 ms to find 0 implicit places.
[2026-05-25 21:30:39] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1158 ms. Remains : 357/357 places, 303/303 transitions.
RANDOM walk for 400000 steps (19054 resets) in 1242 ms. (321 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2026-05-25 21:30:39] [INFO ] Invariant cache hit.
[2026-05-25 21:30:39] [INFO ] [Real]Absence check using 40 positive place invariants in 12 ms returned sat
[2026-05-25 21:30:39] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 36 ms returned sat
[2026-05-25 21:30:40] [INFO ] After 252ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 21:30:40] [INFO ] After 295ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 21:30:40] [INFO ] After 417ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 21:30:40] [INFO ] [Nat]Absence check using 40 positive place invariants in 14 ms returned sat
[2026-05-25 21:30:40] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 35 ms returned sat
[2026-05-25 21:30:40] [INFO ] After 264ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 21:30:40] [INFO ] After 305ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 21:30:40] [INFO ] After 453ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 40000 steps (1864 resets) in 205 ms. (194 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (374 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 972601 steps, run timeout after 3001 ms. (steps per millisecond=324 ) properties seen :0 out of 1
Probabilistic random walk after 972601 steps, saw 136392 distinct states, run finished after 3001 ms. (steps per millisecond=324 ) properties seen :0
[2026-05-25 21:30:43] [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) 227/228 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 44/272 variables, 33/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/274 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/284 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/285 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 239/524 variables, 285/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/524 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/537 variables, 8/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/537 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/537 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/539 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/539 variables, 2/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/539 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/601 variables, 3/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/601 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/601 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 59/660 variables, 59/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/660 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/660 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 660/660 variables, and 417 constraints, problems are : Problem set: 0 solved, 1 unsolved in 763 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 357/357 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) 227/228 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/272 variables, 33/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/274 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/284 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/285 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 239/524 variables, 285/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/524 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/524 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/524 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 13/537 variables, 8/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/537 variables, 3/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/537 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/537 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/539 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/539 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/539 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 62/601 variables, 3/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/601 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/601 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 59/660 variables, 59/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/660 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/660 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 660/660 variables, and 420 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1240 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2008ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 586 ms.
Support contains 1 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 303/303 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 357 transition count 302
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 356 transition count 302
Applied a total of 2 rules in 18 ms. Remains 356 /357 variables (removed 1) and now considering 302/303 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 356/357 places, 302/303 transitions.
RANDOM walk for 40000 steps (1924 resets) in 240 ms. (165 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (366 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 930167 steps, run timeout after 3001 ms. (steps per millisecond=309 ) properties seen :0 out of 1
Probabilistic random walk after 930167 steps, saw 130661 distinct states, run finished after 3001 ms. (steps per millisecond=309 ) 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-2823894635000637664.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18441368133344783535.kers'
[2026-05-25 21:30:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2823894635000637664.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18441368133344783535.kers]
Culling duplicate invariants (modulo rational): removing 29 columns.
Culled 29 columns in 0 ms.
// Phase 1: matrix 302 rows 327 cols 1186 entries
Finished phase 1 with 226 SingleSign rule and 70 generalized
[2026-05-25 21:30:49] [INFO ] Computed 60 invariants in 3 ms
Computed 60 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-18441368133344783535.kers
Total runtime 4 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) 227/228 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 43/271 variables, 33/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/273 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/283 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/284 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 238/522 variables, 284/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/522 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/535 variables, 8/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/535 variables, 3/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/535 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/537 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/537 variables, 2/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/537 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/599 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/599 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/599 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 59/658 variables, 59/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/658 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/658 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 658/658 variables, and 416 constraints, problems are : Problem set: 0 solved, 1 unsolved in 578 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 356/356 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) 227/228 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/271 variables, 33/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/273 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/283 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/284 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 238/522 variables, 284/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/522 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/522 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/522 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 13/535 variables, 8/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/535 variables, 3/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/535 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/535 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/537 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/537 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/537 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 62/599 variables, 3/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/599 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/599 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 59/658 variables, 59/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/658 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/658 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 658/658 variables, and 419 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1252 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1843ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 798 ms.
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 9 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 356/356 places, 302/302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 8 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
[2026-05-25 21:30:52] [INFO ] Invariant cache hit.
[2026-05-25 21:30:52] [INFO ] Implicit Places using invariants in 429 ms returned []
[2026-05-25 21:30:52] [INFO ] Invariant cache hit.
[2026-05-25 21:30:53] [INFO ] Implicit Places using invariants and state equation in 945 ms returned []
Implicit Place search using SMT with State Equation took 1380 ms to find 0 implicit places.
[2026-05-25 21:30:53] [INFO ] Redundant transitions in 2 ms returned []
Running 299 sub problems to find dead transitions.
[2026-05-25 21:30:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 299 unsolved
SDD proceeding with computation,1 properties remain. new max is 524288
SDD size :9.40437e+11 after 2.19129e+12
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 299 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/355 variables, 11/60 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (OVERLAPS) 302/657 variables, 355/415 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/657 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 657/658 variables, and 418 constraints, problems are : Problem set: 0 solved, 299 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 355/356 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 2/355 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (OVERLAPS) 302/657 variables, 355/418 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/657 variables, 299/717 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/658 variables, and 717 constraints, problems are : Problem set: 0 solved, 299 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 355/356 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60134ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 60136ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61533 ms. Remains : 356/356 places, 302/302 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 356 transition count 302
Applied a total of 1 rules in 18 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (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-13296587247293356997.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15384854926732708877.kers'
[2026-05-25 21:31:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13296587247293356997.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15384854926732708877.kers]
Culling duplicate invariants (modulo rational): removing 29 columns.
Culled 29 columns in 0 ms.
// Phase 1: matrix 302 rows 327 cols 1187 entries
Finished phase 1 with 226 SingleSign rule and 70 generalized
[2026-05-25 21:31:53] [INFO ] Computed 60 invariants in 3 ms
Computed 60 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15384854926732708877.kers
Total runtime 4 ms.
[2026-05-25 21:31:53] [INFO ] [Real]Absence check using 40 positive place invariants in 10 ms returned sat
[2026-05-25 21:31:53] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 32 ms returned sat
[2026-05-25 21:31:53] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 21:31:53] [INFO ] [Nat]Absence check using 40 positive place invariants in 9 ms returned sat
[2026-05-25 21:31:53] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 34 ms returned sat
[2026-05-25 21:31:54] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 21:31:54] [INFO ] After 250ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 21:31:54] [INFO ] After 398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 558 ms.
RANDOM walk for 9770 steps (467 resets) in 37 ms. (257 steps per ms) remains 0/1 properties
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 357 transition count 303
Applied a total of 1 rules in 17 ms. Remains 357 /357 variables (removed 0) and now considering 303/303 (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-5627037653080856461.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8021518193428241273.kers'
[2026-05-25 21:31:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5627037653080856461.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8021518193428241273.kers]
Culling duplicate invariants (modulo rational): removing 27 columns.
Culled 27 columns in 0 ms.
// Phase 1: matrix 303 rows 330 cols 1251 entries
Finished phase 1 with 168 SingleSign rule and 129 generalized
[2026-05-25 21:31:54] [INFO ] Computed 60 invariants in 4 ms
Computed 60 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-8021518193428241273.kers
Total runtime 5 ms.
[2026-05-25 21:31:54] [INFO ] [Real]Absence check using 40 positive place invariants in 13 ms returned sat
[2026-05-25 21:31:54] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 35 ms returned sat
[2026-05-25 21:31:54] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 21:31:54] [INFO ] [Nat]Absence check using 40 positive place invariants in 13 ms returned sat
[2026-05-25 21:31:54] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 36 ms returned sat
[2026-05-25 21:31:54] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 21:31:54] [INFO ] After 314ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 21:31:54] [INFO ] After 485ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-25 21:31:54] [INFO ] Flatten gal took : 9 ms
[2026-05-25 21:31:54] [INFO ] Flatten gal took : 9 ms
[2026-05-25 21:31:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13855661931851509739.gal : 3 ms
[2026-05-25 21:31:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11504803423298349156.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/ReachabilityCardinality13855661931851509739.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11504803423298349156.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 ...330
Loading property file /tmp/ReachabilityCardinality11504803423298349156.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 8
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :8 after 56
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :56 after 80
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :80 after 152
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :152 after 868
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :868 after 1508
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1508 after 5544
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5544 after 89778
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :89778 after 229608
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :229608 after 314248
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.84298e+06 after 1.99605e+09
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.99605e+09 after 2.66614e+09
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.78396e+09 after 2.8039e+09
Detected timeout of ITS tools.
[2026-05-25 21:32:09] [INFO ] Flatten gal took : 12 ms
[2026-05-25 21:32:09] [INFO ] Applying decomposition
[2026-05-25 21:32:09] [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/graph13023831092756291833.txt' '-o' '/tmp/graph13023831092756291833.bin' '-w' '/tmp/graph13023831092756291833.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13023831092756291833.bin' '-l' '-1' '-v' '-w' '/tmp/graph13023831092756291833.weights' '-q' '0' '-e' '0.001'
[2026-05-25 21:32:10] [INFO ] Decomposing Gal with order
[2026-05-25 21:32:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 21:32:10] [INFO ] Removed a total of 38 redundant transitions.
[2026-05-25 21:32:10] [INFO ] Flatten gal took : 19 ms
[2026-05-25 21:32:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 2 ms.
[2026-05-25 21:32:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11599141860125839221.gal : 4 ms
[2026-05-25 21:32:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5255064797444208706.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/ReachabilityCardinality11599141860125839221.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5255064797444208706.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 ...308
Loading property file /tmp/ReachabilityCardinality5255064797444208706.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 386
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :386 after 4132
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :4132 after 34360
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :50736 after 1.37795e+09
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.37795e+09 after 2.39693e+09
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.39693e+09 after 3.58574e+09
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3.58574e+09 after 5.28405e+09
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5.28405e+09 after 8.341e+09
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30860 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 21:32:25] [INFO ] Flatten gal took : 14 ms
[2026-05-25 21:32:25] [INFO ] Applying decomposition
[2026-05-25 21:32:25] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3993515251194415709.txt' '-o' '/tmp/graph3993515251194415709.bin' '-w' '/tmp/graph3993515251194415709.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3993515251194415709.bin' '-l' '-1' '-v' '-w' '/tmp/graph3993515251194415709.weights' '-q' '0' '-e' '0.001'
[2026-05-25 21:32:25] [INFO ] Decomposing Gal with order
[2026-05-25 21:32:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 21:32:25] [INFO ] Removed a total of 8 redundant transitions.
[2026-05-25 21:32:25] [INFO ] Flatten gal took : 33 ms
[2026-05-25 21:32:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 8 ms.
[2026-05-25 21:32:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5295288959408079784.gal : 5 ms
[2026-05-25 21:32:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9236188670870186241.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/ReachabilityCardinality5295288959408079784.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9236188670870186241.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/ReachabilityCardinality9236188670870186241.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 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 130
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :130 after 35652
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :35652 after 305876
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :305876 after 1.86394e+10
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.86394e+10 after 3.10007e+10
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3.10007e+10 after 4.64524e+10
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.64524e+10 after 7.42653e+10
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3.07021e+14 after 3.26712e+14
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7.79604e+14 after 7.80251e+14
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,1.12944e+15,9.03379,188648,20055,11699,473757,24818,301,302837,553,208116,0
Total reachable state count : 1129441025919308

Verifying 1 reachability properties.
Reachability property DES-PT-60b-CTLFireability-2024-03 is true.
FORMULA DES-PT-60b-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

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-60b-CTLFireability-2024-03,9.12498e+08,9.07268,188864,443,899,473757,24818,307,302837,557,208116,0
[2026-05-25 21:32:34] [INFO ] Flatten gal took : 15 ms
[2026-05-25 21:32:34] [INFO ] Flatten gal took : 14 ms
[2026-05-25 21:32:34] [INFO ] Time to serialize gal into /tmp/CTLFireability9656864880483925742.gal : 3 ms
[2026-05-25 21:32:34] [INFO ] Time to serialize properties into /tmp/CTLFireability4044427018301063300.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/CTLFireability9656864880483925742.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4044427018301063300.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 0 CTL formulae.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 486/486 places, 432/432 transitions.
Graph (complete) has 1155 edges and 486 vertex of which 480 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 479 transition count 415
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 466 transition count 414
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 465 transition count 414
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 29 place count 465 transition count 404
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 49 place count 455 transition count 404
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 56 place count 448 transition count 397
Iterating global reduction 3 with 7 rules applied. Total rules applied 63 place count 448 transition count 397
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 66 place count 448 transition count 394
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 68 place count 447 transition count 393
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 72 place count 443 transition count 389
Iterating global reduction 5 with 4 rules applied. Total rules applied 76 place count 443 transition count 389
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 79 place count 443 transition count 386
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 79 place count 443 transition count 385
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 81 place count 442 transition count 385
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 6 with 140 rules applied. Total rules applied 221 place count 372 transition count 315
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 223 place count 370 transition count 313
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 224 place count 369 transition count 313
Applied a total of 224 rules in 76 ms. Remains 369 /486 variables (removed 117) and now considering 313/432 (removed 119) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3184704340427936598.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16827918121217455642.kers'
[2026-05-25 21:33:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3184704340427936598.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16827918121217455642.kers]
Culling duplicate invariants (modulo rational): removing 24 columns.
Culled 24 columns in 0 ms.
// Phase 1: matrix 313 rows 345 cols 1190 entries
Finished phase 1 with 239 SingleSign rule and 72 generalized
[2026-05-25 21:33:04] [INFO ] Computed 58 invariants in 3 ms
Computed 58 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16827918121217455642.kers
Total runtime 4 ms.
[2026-05-25 21:33:05] [INFO ] Implicit Places using invariants in 485 ms returned []
[2026-05-25 21:33:05] [INFO ] Invariant cache hit.
[2026-05-25 21:33:06] [INFO ] Implicit Places using invariants and state equation in 920 ms returned []
Implicit Place search using SMT with State Equation took 1410 ms to find 0 implicit places.
[2026-05-25 21:33:06] [INFO ] Redundant transitions in 3 ms returned []
Running 310 sub problems to find dead transitions.
[2026-05-25 21:33:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 10/47 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (OVERLAPS) 2/368 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (OVERLAPS) 313/681 variables, 368/426 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/681 variables, 3/429 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 681/682 variables, and 429 constraints, problems are : Problem set: 0 solved, 310 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 368/369 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 10/47 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (OVERLAPS) 2/368 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (OVERLAPS) 313/681 variables, 368/429 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/681 variables, 310/739 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 681/682 variables, and 739 constraints, problems are : Problem set: 0 solved, 310 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 368/369 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60177ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 60179ms
Starting structural reductions in SI_CTL mode, iteration 1 : 369/486 places, 313/432 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61675 ms. Remains : 369/486 places, 313/432 transitions.
[2026-05-25 21:34:06] [INFO ] Flatten gal took : 9 ms
[2026-05-25 21:34:06] [INFO ] Flatten gal took : 9 ms
[2026-05-25 21:34:06] [INFO ] Input system was already deterministic with 313 transitions.
[2026-05-25 21:34:06] [INFO ] Flatten gal took : 9 ms
[2026-05-25 21:34:06] [INFO ] Flatten gal took : 10 ms
[2026-05-25 21:34:06] [INFO ] Time to serialize gal into /tmp/CTLFireability16503548360188393583.gal : 2 ms
[2026-05-25 21:34:06] [INFO ] Time to serialize properties into /tmp/CTLFireability6542587833701554911.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/CTLFireability16503548360188393583.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6542587833701554911.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 21:34:36] [INFO ] Flatten gal took : 16 ms
[2026-05-25 21:34:36] [INFO ] Applying decomposition
[2026-05-25 21:34:36] [INFO ] Flatten gal took : 15 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/graph15078120827549780851.txt' '-o' '/tmp/graph15078120827549780851.bin' '-w' '/tmp/graph15078120827549780851.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15078120827549780851.bin' '-l' '-1' '-v' '-w' '/tmp/graph15078120827549780851.weights' '-q' '0' '-e' '0.001'
[2026-05-25 21:34:36] [INFO ] Decomposing Gal with order
[2026-05-25 21:34:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 21:34:36] [INFO ] Removed a total of 57 redundant transitions.
[2026-05-25 21:34:36] [INFO ] Flatten gal took : 35 ms
[2026-05-25 21:34:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 5 ms.
[2026-05-25 21:34:36] [INFO ] Time to serialize gal into /tmp/CTLFireability7151376303253610189.gal : 5 ms
[2026-05-25 21:34:36] [INFO ] Time to serialize properties into /tmp/CTLFireability10411257295385672271.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/CTLFireability7151376303253610189.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10411257295385672271.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.47601e+15,11.4602,202656,31146,10483,473526,33631,380,391022,561,277336,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 432/432 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 478 transition count 424
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 478 transition count 424
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 478 transition count 422
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 473 transition count 417
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 473 transition count 417
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 32 place count 473 transition count 413
Applied a total of 32 rules in 42 ms. Remains 473 /486 variables (removed 13) and now considering 413/432 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3105845357819120448.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4394963192581920704.kers'
[2026-05-25 21:35:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3105845357819120448.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4394963192581920704.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 413 rows 473 cols 1477 entries
Finished phase 1 with 191 SingleSign rule and 220 generalized
[2026-05-25 21:35:06] [INFO ] Computed 62 invariants in 8 ms
Computed 62 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-4394963192581920704.kers
Total runtime 10 ms.
[2026-05-25 21:35:07] [INFO ] Implicit Places using invariants in 520 ms returned []
[2026-05-25 21:35:07] [INFO ] Invariant cache hit.
[2026-05-25 21:35:10] [INFO ] Implicit Places using invariants and state equation in 3336 ms returned []
Implicit Place search using SMT with State Equation took 3862 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2026-05-25 21:35:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 412 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (OVERLAPS) 413/886 variables, 473/535 constraints. Problems are: Problem set: 0 solved, 412 unsolved
SMT process timed out in 30172ms, After SMT, problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 30174ms
Starting structural reductions in LTL mode, iteration 1 : 473/486 places, 413/432 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34080 ms. Remains : 473/486 places, 413/432 transitions.
[2026-05-25 21:35:40] [INFO ] Flatten gal took : 10 ms
[2026-05-25 21:35:40] [INFO ] Flatten gal took : 10 ms
[2026-05-25 21:35:40] [INFO ] Input system was already deterministic with 413 transitions.
[2026-05-25 21:35:40] [INFO ] Flatten gal took : 10 ms
[2026-05-25 21:35:40] [INFO ] Flatten gal took : 10 ms
[2026-05-25 21:35:41] [INFO ] Time to serialize gal into /tmp/CTLFireability5387504792401574439.gal : 4 ms
[2026-05-25 21:35:41] [INFO ] Time to serialize properties into /tmp/CTLFireability2388744977633353655.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/CTLFireability5387504792401574439.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2388744977633353655.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 21:36:11] [INFO ] Flatten gal took : 9 ms
[2026-05-25 21:36:11] [INFO ] Applying decomposition
[2026-05-25 21:36: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/graph4470036790975067322.txt' '-o' '/tmp/graph4470036790975067322.bin' '-w' '/tmp/graph4470036790975067322.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4470036790975067322.bin' '-l' '-1' '-v' '-w' '/tmp/graph4470036790975067322.weights' '-q' '0' '-e' '0.001'
[2026-05-25 21:36:11] [INFO ] Decomposing Gal with order
[2026-05-25 21:36:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 21:36:11] [INFO ] Removed a total of 10 redundant transitions.
[2026-05-25 21:36:11] [INFO ] Flatten gal took : 20 ms
[2026-05-25 21:36:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2026-05-25 21:36:11] [INFO ] Time to serialize gal into /tmp/CTLFireability8118158251941121966.gal : 4 ms
[2026-05-25 21:36:11] [INFO ] Time to serialize properties into /tmp/CTLFireability5893307588507538604.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/CTLFireability8118158251941121966.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5893307588507538604.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 432/432 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 480 transition count 426
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 480 transition count 426
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 480 transition count 424
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 477 transition count 421
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 477 transition count 421
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 477 transition count 419
Applied a total of 22 rules in 57 ms. Remains 477 /486 variables (removed 9) and now considering 419/432 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1280471373429728519.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10629742731274606081.kers'
[2026-05-25 21:36:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1280471373429728519.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10629742731274606081.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 419 rows 477 cols 1493 entries
Finished phase 1 with 193 SingleSign rule and 222 generalized
[2026-05-25 21:36:41] [INFO ] Computed 62 invariants in 8 ms
Computed 62 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-10629742731274606081.kers
Total runtime 9 ms.
[2026-05-25 21:36:41] [INFO ] Implicit Places using invariants in 664 ms returned []
[2026-05-25 21:36:42] [INFO ] Invariant cache hit.
[2026-05-25 21:36:44] [INFO ] Implicit Places using invariants and state equation in 2288 ms returned []
Implicit Place search using SMT with State Equation took 2973 ms to find 0 implicit places.
Running 418 sub problems to find dead transitions.
[2026-05-25 21:36:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/476 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (OVERLAPS) 1/477 variables, 34/54 constraints. Problems are: Problem set: 0 solved, 418 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 5 (OVERLAPS) 419/896 variables, 477/539 constraints. Problems are: Problem set: 0 solved, 418 unsolved
SMT process timed out in 30170ms, After SMT, problems are : Problem set: 0 solved, 418 unsolved
Search for dead transitions found 0 dead transitions in 30171ms
Starting structural reductions in LTL mode, iteration 1 : 477/486 places, 419/432 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33203 ms. Remains : 477/486 places, 419/432 transitions.
[2026-05-25 21:37:14] [INFO ] Flatten gal took : 15 ms
[2026-05-25 21:37:14] [INFO ] Flatten gal took : 16 ms
[2026-05-25 21:37:14] [INFO ] Input system was already deterministic with 419 transitions.
[2026-05-25 21:37:14] [INFO ] Flatten gal took : 16 ms
[2026-05-25 21:37:14] [INFO ] Flatten gal took : 16 ms
[2026-05-25 21:37:14] [INFO ] Time to serialize gal into /tmp/CTLFireability5604679221156716488.gal : 3 ms
[2026-05-25 21:37:14] [INFO ] Time to serialize properties into /tmp/CTLFireability5844240746136645419.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/CTLFireability5604679221156716488.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5844240746136645419.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 21:37:44] [INFO ] Flatten gal took : 10 ms
[2026-05-25 21:37:44] [INFO ] Applying decomposition
[2026-05-25 21:37:44] [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/graph16616130963203471816.txt' '-o' '/tmp/graph16616130963203471816.bin' '-w' '/tmp/graph16616130963203471816.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16616130963203471816.bin' '-l' '-1' '-v' '-w' '/tmp/graph16616130963203471816.weights' '-q' '0' '-e' '0.001'
[2026-05-25 21:37:44] [INFO ] Decomposing Gal with order
[2026-05-25 21:37:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 21:37:44] [INFO ] Removed a total of 12 redundant transitions.
[2026-05-25 21:37:44] [INFO ] Flatten gal took : 36 ms
[2026-05-25 21:37:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 8 ms.
[2026-05-25 21:37:44] [INFO ] Time to serialize gal into /tmp/CTLFireability13349981370417130557.gal : 4 ms
[2026-05-25 21:37:44] [INFO ] Time to serialize properties into /tmp/CTLFireability11150699378472226393.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/CTLFireability13349981370417130557.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11150699378472226393.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.52902e+21,10.4287,212384,16872,8921,479242,48366,680,423158,551,337229,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 432/432 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 478 transition count 424
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 478 transition count 424
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 478 transition count 422
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 473 transition count 417
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 473 transition count 417
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 32 place count 473 transition count 413
Applied a total of 32 rules in 34 ms. Remains 473 /486 variables (removed 13) and now considering 413/432 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17015265520427732885.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6156416486753015337.kers'
[2026-05-25 21:38:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17015265520427732885.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6156416486753015337.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 413 rows 473 cols 1477 entries
Finished phase 1 with 191 SingleSign rule and 220 generalized
[2026-05-25 21:38:14] [INFO ] Computed 62 invariants in 8 ms
Computed 62 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-6156416486753015337.kers
Total runtime 10 ms.
[2026-05-25 21:38:15] [INFO ] Implicit Places using invariants in 679 ms returned []
[2026-05-25 21:38:15] [INFO ] Invariant cache hit.
[2026-05-25 21:38:18] [INFO ] Implicit Places using invariants and state equation in 3372 ms returned []
Implicit Place search using SMT with State Equation took 4053 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2026-05-25 21:38:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 412 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (OVERLAPS) 413/886 variables, 473/535 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 886/886 variables, and 545 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 10/102 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 473/886 variables, and 115 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/473 constraints, PredecessorRefiner: 0/412 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60129ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 60131ms
Starting structural reductions in LTL mode, iteration 1 : 473/486 places, 413/432 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64225 ms. Remains : 473/486 places, 413/432 transitions.
[2026-05-25 21:39:19] [INFO ] Flatten gal took : 15 ms
[2026-05-25 21:39:19] [INFO ] Flatten gal took : 16 ms
[2026-05-25 21:39:19] [INFO ] Input system was already deterministic with 413 transitions.
[2026-05-25 21:39:19] [INFO ] Flatten gal took : 16 ms
[2026-05-25 21:39:19] [INFO ] Flatten gal took : 16 ms
[2026-05-25 21:39:19] [INFO ] Time to serialize gal into /tmp/CTLFireability18134174400030653213.gal : 3 ms
[2026-05-25 21:39:19] [INFO ] Time to serialize properties into /tmp/CTLFireability5142186698024709259.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/CTLFireability18134174400030653213.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5142186698024709259.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 21:39:49] [INFO ] Flatten gal took : 17 ms
[2026-05-25 21:39:49] [INFO ] Applying decomposition
[2026-05-25 21:39:49] [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/graph3305583273534536174.txt' '-o' '/tmp/graph3305583273534536174.bin' '-w' '/tmp/graph3305583273534536174.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3305583273534536174.bin' '-l' '-1' '-v' '-w' '/tmp/graph3305583273534536174.weights' '-q' '0' '-e' '0.001'
[2026-05-25 21:39:49] [INFO ] Decomposing Gal with order
[2026-05-25 21:39:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 21:39:49] [INFO ] Removed a total of 13 redundant transitions.
[2026-05-25 21:39:49] [INFO ] Flatten gal took : 30 ms
[2026-05-25 21:39:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2026-05-25 21:39:49] [INFO ] Time to serialize gal into /tmp/CTLFireability5913951634249247774.gal : 4 ms
[2026-05-25 21:39:49] [INFO ] Time to serialize properties into /tmp/CTLFireability6510637688941743661.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/CTLFireability5913951634249247774.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6510637688941743661.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.09421e+21,15.6565,293064,17147,8024,641884,49410,670,543371,550,712782,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 486/486 places, 432/432 transitions.
Graph (complete) has 1155 edges and 486 vertex of which 480 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 479 transition count 414
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 465 transition count 414
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 29 place count 465 transition count 403
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 51 place count 454 transition count 403
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 58 place count 447 transition count 396
Iterating global reduction 2 with 7 rules applied. Total rules applied 65 place count 447 transition count 396
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 2 with 3 rules applied. Total rules applied 68 place count 447 transition count 393
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 70 place count 446 transition count 392
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 74 place count 442 transition count 388
Iterating global reduction 4 with 4 rules applied. Total rules applied 78 place count 442 transition count 388
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 81 place count 442 transition count 385
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 81 place count 442 transition count 383
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 85 place count 440 transition count 383
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 5 with 134 rules applied. Total rules applied 219 place count 373 transition count 316
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 221 place count 371 transition count 314
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 222 place count 370 transition count 314
Applied a total of 222 rules in 91 ms. Remains 370 /486 variables (removed 116) and now considering 314/432 (removed 118) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10227639859189265875.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9460208510400130353.kers'
[2026-05-25 21:40:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10227639859189265875.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9460208510400130353.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 314 rows 364 cols 1371 entries
Finished phase 1 with 156 SingleSign rule and 156 generalized
[2026-05-25 21:40:19] [INFO ] Computed 58 invariants in 4 ms
Computed 58 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-9460208510400130353.kers
Total runtime 5 ms.
[2026-05-25 21:40:19] [INFO ] Implicit Places using invariants in 363 ms returned []
[2026-05-25 21:40:19] [INFO ] Invariant cache hit.
[2026-05-25 21:40:20] [INFO ] Implicit Places using invariants and state equation in 762 ms returned []
Implicit Place search using SMT with State Equation took 1137 ms to find 0 implicit places.
[2026-05-25 21:40:20] [INFO ] Redundant transitions in 1 ms returned []
Running 311 sub problems to find dead transitions.
[2026-05-25 21:40:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/367 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 311 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/368 variables, 22/41 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (OVERLAPS) 1/369 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (OVERLAPS) 314/683 variables, 369/427 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/683 variables, 5/432 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 683/684 variables, and 436 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 369/370 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/367 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/367 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (OVERLAPS) 1/368 variables, 22/46 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (OVERLAPS) 1/369 variables, 14/66 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 11 (OVERLAPS) 314/683 variables, 369/436 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/683 variables, 311/747 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 683/684 variables, and 747 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 369/370 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60129ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 60131ms
Starting structural reductions in SI_CTL mode, iteration 1 : 370/486 places, 314/432 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61368 ms. Remains : 370/486 places, 314/432 transitions.
[2026-05-25 21:41:20] [INFO ] Flatten gal took : 9 ms
[2026-05-25 21:41:20] [INFO ] Flatten gal took : 9 ms
[2026-05-25 21:41:20] [INFO ] Input system was already deterministic with 314 transitions.
[2026-05-25 21:41:20] [INFO ] Flatten gal took : 10 ms
[2026-05-25 21:41:20] [INFO ] Flatten gal took : 11 ms
[2026-05-25 21:41:20] [INFO ] Time to serialize gal into /tmp/CTLFireability10492818189813932953.gal : 2 ms
[2026-05-25 21:41:20] [INFO ] Time to serialize properties into /tmp/CTLFireability12842658087431416040.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/CTLFireability10492818189813932953.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12842658087431416040.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 21:41:51] [INFO ] Flatten gal took : 10 ms
[2026-05-25 21:41:51] [INFO ] Applying decomposition
[2026-05-25 21:41:51] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5366118814812425498.txt' '-o' '/tmp/graph5366118814812425498.bin' '-w' '/tmp/graph5366118814812425498.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5366118814812425498.bin' '-l' '-1' '-v' '-w' '/tmp/graph5366118814812425498.weights' '-q' '0' '-e' '0.001'
[2026-05-25 21:41:51] [INFO ] Decomposing Gal with order
[2026-05-25 21:41:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 21:41:51] [INFO ] Removed a total of 10 redundant transitions.
[2026-05-25 21:41:51] [INFO ] Flatten gal took : 17 ms
[2026-05-25 21:41:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2026-05-25 21:41:51] [INFO ] Time to serialize gal into /tmp/CTLFireability4869879352284786424.gal : 4 ms
[2026-05-25 21:41:51] [INFO ] Time to serialize properties into /tmp/CTLFireability3809701296684414813.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/CTLFireability4869879352284786424.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3809701296684414813.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.95276e+15,7.32101,161132,8226,13879,365059,39840,387,208844,552,382433,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 432/432 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 479 transition count 425
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 479 transition count 425
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 479 transition count 424
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 475 transition count 420
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 475 transition count 420
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 26 place count 475 transition count 417
Applied a total of 26 rules in 35 ms. Remains 475 /486 variables (removed 11) and now considering 417/432 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15795848257047760120.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3443170992927936856.kers'
[2026-05-25 21:42:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15795848257047760120.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3443170992927936856.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 417 rows 475 cols 1487 entries
Finished phase 1 with 194 SingleSign rule and 219 generalized
[2026-05-25 21:42:21] [INFO ] Computed 62 invariants in 4 ms
Computed 62 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-3443170992927936856.kers
Total runtime 7 ms.
[2026-05-25 21:42:21] [INFO ] Implicit Places using invariants in 436 ms returned []
[2026-05-25 21:42:21] [INFO ] Invariant cache hit.
[2026-05-25 21:42:24] [INFO ] Implicit Places using invariants and state equation in 3354 ms returned []
Implicit Place search using SMT with State Equation took 3793 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2026-05-25 21:42:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (OVERLAPS) 1/475 variables, 35/56 constraints. Problems are: Problem set: 0 solved, 416 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 5 (OVERLAPS) 417/892 variables, 475/537 constraints. Problems are: Problem set: 0 solved, 416 unsolved
SMT process timed out in 30116ms, After SMT, problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 30118ms
Starting structural reductions in LTL mode, iteration 1 : 475/486 places, 417/432 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33948 ms. Remains : 475/486 places, 417/432 transitions.
[2026-05-25 21:42:55] [INFO ] Flatten gal took : 9 ms
[2026-05-25 21:42:55] [INFO ] Flatten gal took : 11 ms
[2026-05-25 21:42:55] [INFO ] Input system was already deterministic with 417 transitions.
[2026-05-25 21:42:55] [INFO ] Flatten gal took : 10 ms
[2026-05-25 21:42:55] [INFO ] Flatten gal took : 9 ms
[2026-05-25 21:42:55] [INFO ] Time to serialize gal into /tmp/CTLFireability3663660169419267329.gal : 2 ms
[2026-05-25 21:42:55] [INFO ] Time to serialize properties into /tmp/CTLFireability6641833510383724639.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/CTLFireability3663660169419267329.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6641833510383724639.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 21:43:25] [INFO ] Flatten gal took : 9 ms
[2026-05-25 21:43:25] [INFO ] Applying decomposition
[2026-05-25 21:43:25] [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/graph17150033303646454392.txt' '-o' '/tmp/graph17150033303646454392.bin' '-w' '/tmp/graph17150033303646454392.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17150033303646454392.bin' '-l' '-1' '-v' '-w' '/tmp/graph17150033303646454392.weights' '-q' '0' '-e' '0.001'
[2026-05-25 21:43:25] [INFO ] Decomposing Gal with order
[2026-05-25 21:43:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 21:43:25] [INFO ] Removed a total of 14 redundant transitions.
[2026-05-25 21:43:25] [INFO ] Flatten gal took : 29 ms
[2026-05-25 21:43:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2026-05-25 21:43:25] [INFO ] Time to serialize gal into /tmp/CTLFireability14301222952283419806.gal : 5 ms
[2026-05-25 21:43:25] [INFO ] Time to serialize properties into /tmp/CTLFireability8497166703538156921.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/CTLFireability14301222952283419806.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8497166703538156921.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.40685e+21,11.433,226412,14665,8524,497180,47409,650,350110,545,559766,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 432/432 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 478 transition count 424
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 478 transition count 424
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 478 transition count 422
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 473 transition count 417
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 473 transition count 417
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 32 place count 473 transition count 413
Applied a total of 32 rules in 34 ms. Remains 473 /486 variables (removed 13) and now considering 413/432 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7558500277904004546.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3089331144275890430.kers'
[2026-05-25 21:43:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7558500277904004546.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3089331144275890430.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 413 rows 473 cols 1477 entries
Finished phase 1 with 191 SingleSign rule and 220 generalized
[2026-05-25 21:43:55] [INFO ] Computed 62 invariants in 4 ms
Computed 62 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-3089331144275890430.kers
Total runtime 8 ms.
[2026-05-25 21:43:55] [INFO ] Implicit Places using invariants in 409 ms returned []
[2026-05-25 21:43:55] [INFO ] Invariant cache hit.
[2026-05-25 21:43:59] [INFO ] Implicit Places using invariants and state equation in 3725 ms returned []
Implicit Place search using SMT with State Equation took 4137 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2026-05-25 21:43:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 412 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (OVERLAPS) 413/886 variables, 473/535 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 886/886 variables, and 546 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 11/73 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 15/88 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 5/93 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 8/101 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 473/886 variables, and 103 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/473 constraints, PredecessorRefiner: 0/412 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60139ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 60140ms
Starting structural reductions in LTL mode, iteration 1 : 473/486 places, 413/432 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64313 ms. Remains : 473/486 places, 413/432 transitions.
[2026-05-25 21:44:59] [INFO ] Flatten gal took : 9 ms
[2026-05-25 21:44:59] [INFO ] Flatten gal took : 9 ms
[2026-05-25 21:44:59] [INFO ] Input system was already deterministic with 413 transitions.
[2026-05-25 21:44:59] [INFO ] Flatten gal took : 9 ms
[2026-05-25 21:44:59] [INFO ] Flatten gal took : 10 ms
[2026-05-25 21:44:59] [INFO ] Time to serialize gal into /tmp/CTLFireability7596088843524483269.gal : 2 ms
[2026-05-25 21:44:59] [INFO ] Time to serialize properties into /tmp/CTLFireability15816084434161445986.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/CTLFireability7596088843524483269.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15816084434161445986.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 21:45:29] [INFO ] Flatten gal took : 9 ms
[2026-05-25 21:45:29] [INFO ] Applying decomposition
[2026-05-25 21:45:29] [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/graph13237637027100159584.txt' '-o' '/tmp/graph13237637027100159584.bin' '-w' '/tmp/graph13237637027100159584.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13237637027100159584.bin' '-l' '-1' '-v' '-w' '/tmp/graph13237637027100159584.weights' '-q' '0' '-e' '0.001'
[2026-05-25 21:45:29] [INFO ] Decomposing Gal with order
[2026-05-25 21:45:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 21:45:29] [INFO ] Removed a total of 12 redundant transitions.
[2026-05-25 21:45:29] [INFO ] Flatten gal took : 17 ms
[2026-05-25 21:45:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2026-05-25 21:45:29] [INFO ] Time to serialize gal into /tmp/CTLFireability7280414015293952837.gal : 4 ms
[2026-05-25 21:45:29] [INFO ] Time to serialize properties into /tmp/CTLFireability13093914987804838296.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/CTLFireability7280414015293952837.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13093914987804838296.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 : 486/486 places, 432/432 transitions.
Graph (complete) has 1155 edges and 486 vertex of which 480 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 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 479 transition count 413
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 464 transition count 413
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 464 transition count 402
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 453 transition count 402
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 60 place count 446 transition count 395
Iterating global reduction 2 with 7 rules applied. Total rules applied 67 place count 446 transition count 395
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 2 with 3 rules applied. Total rules applied 70 place count 446 transition count 392
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 72 place count 445 transition count 391
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 76 place count 441 transition count 387
Iterating global reduction 4 with 4 rules applied. Total rules applied 80 place count 441 transition count 387
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 83 place count 441 transition count 384
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 83 place count 441 transition count 382
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 87 place count 439 transition count 382
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 5 with 138 rules applied. Total rules applied 225 place count 370 transition count 313
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 227 place count 368 transition count 311
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 228 place count 367 transition count 311
Applied a total of 228 rules in 75 ms. Remains 367 /486 variables (removed 119) and now considering 311/432 (removed 121) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15720218997410788042.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-167554773026225528.kers'
[2026-05-25 21:46:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15720218997410788042.kers, --Pflows, --basisKERS=/tmp/petrispot-output-167554773026225528.kers]
Culling duplicate invariants (modulo rational): removing 24 columns.
Culled 24 columns in 1 ms.
// Phase 1: matrix 311 rows 343 cols 1192 entries
Finished phase 1 with 230 SingleSign rule and 79 generalized
[2026-05-25 21:46:00] [INFO ] Computed 58 invariants in 6 ms
Computed 58 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-167554773026225528.kers
Total runtime 8 ms.
[2026-05-25 21:46:00] [INFO ] Implicit Places using invariants in 589 ms returned []
[2026-05-25 21:46:00] [INFO ] Invariant cache hit.
[2026-05-25 21:46:01] [INFO ] Implicit Places using invariants and state equation in 802 ms returned []
Implicit Place search using SMT with State Equation took 1400 ms to find 0 implicit places.
[2026-05-25 21:46:01] [INFO ] Redundant transitions in 2 ms returned []
Running 307 sub problems to find dead transitions.
[2026-05-25 21:46:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (OVERLAPS) 1/364 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (OVERLAPS) 2/366 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 311/677 variables, 366/424 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 677/678 variables, and 424 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 366/367 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (OVERLAPS) 1/364 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (OVERLAPS) 2/366 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 311/677 variables, 366/424 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/677 variables, 307/731 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 677/678 variables, and 731 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 366/367 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60132ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 60133ms
Starting structural reductions in SI_CTL mode, iteration 1 : 367/486 places, 311/432 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61618 ms. Remains : 367/486 places, 311/432 transitions.
[2026-05-25 21:47:01] [INFO ] Flatten gal took : 8 ms
[2026-05-25 21:47:01] [INFO ] Flatten gal took : 9 ms
[2026-05-25 21:47:01] [INFO ] Input system was already deterministic with 311 transitions.
[2026-05-25 21:47:01] [INFO ] Flatten gal took : 9 ms
RANDOM walk for 1486 steps (44 resets) in 8 ms. (165 steps per ms) remains 0/1 properties
FORMULA DES-PT-60b-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-25 21:47:01] [INFO ] Flatten gal took : 9 ms
[2026-05-25 21:47:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6110755761141004305.gal : 2 ms
[2026-05-25 21:47:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12568186612356474836.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/ReachabilityCardinality6110755761141004305.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12568186612356474836.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
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)
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 432/432 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 478 transition count 424
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 478 transition count 424
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 478 transition count 422
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 473 transition count 417
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 473 transition count 417
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 32 place count 473 transition count 413
Applied a total of 32 rules in 39 ms. Remains 473 /486 variables (removed 13) and now considering 413/432 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15364830492526575432.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6475204002528773636.kers'
[2026-05-25 21:47:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15364830492526575432.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6475204002528773636.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 413 rows 473 cols 1477 entries
Finished phase 1 with 191 SingleSign rule and 220 generalized
[2026-05-25 21:47:01] [INFO ] Computed 62 invariants in 4 ms
Computed 62 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-6475204002528773636.kers
Total runtime 5 ms.
[2026-05-25 21:47:02] [INFO ] Implicit Places using invariants in 451 ms returned []
[2026-05-25 21:47:02] [INFO ] Invariant cache hit.
[2026-05-25 21:47:05] [INFO ] Implicit Places using invariants and state equation in 3284 ms returned []
Implicit Place search using SMT with State Equation took 3778 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2026-05-25 21:47:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 412 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (OVERLAPS) 413/886 variables, 473/535 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 886/886 variables, and 536 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 14/97 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 8/105 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 473/886 variables, and 105 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/473 constraints, PredecessorRefiner: 0/412 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60177ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 60179ms
Starting structural reductions in LTL mode, iteration 1 : 473/486 places, 413/432 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63998 ms. Remains : 473/486 places, 413/432 transitions.
[2026-05-25 21:48:05] [INFO ] Flatten gal took : 14 ms
[2026-05-25 21:48:05] [INFO ] Flatten gal took : 21 ms
[2026-05-25 21:48:05] [INFO ] Input system was already deterministic with 413 transitions.
[2026-05-25 21:48:05] [INFO ] Flatten gal took : 15 ms
[2026-05-25 21:48:05] [INFO ] Flatten gal took : 16 ms
[2026-05-25 21:48:05] [INFO ] Time to serialize gal into /tmp/CTLFireability5815539320939983235.gal : 3 ms
[2026-05-25 21:48:05] [INFO ] Time to serialize properties into /tmp/CTLFireability10153766515124801759.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/CTLFireability5815539320939983235.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10153766515124801759.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 21:48:35] [INFO ] Flatten gal took : 10 ms
[2026-05-25 21:48:35] [INFO ] Applying decomposition
[2026-05-25 21:48:35] [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/graph11032792004192957952.txt' '-o' '/tmp/graph11032792004192957952.bin' '-w' '/tmp/graph11032792004192957952.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11032792004192957952.bin' '-l' '-1' '-v' '-w' '/tmp/graph11032792004192957952.weights' '-q' '0' '-e' '0.001'
[2026-05-25 21:48:36] [INFO ] Decomposing Gal with order
[2026-05-25 21:48:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 21:48:36] [INFO ] Removed a total of 11 redundant transitions.
[2026-05-25 21:48:36] [INFO ] Flatten gal took : 16 ms
[2026-05-25 21:48:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2026-05-25 21:48:36] [INFO ] Time to serialize gal into /tmp/CTLFireability12232127590128762241.gal : 4 ms
[2026-05-25 21:48:36] [INFO ] Time to serialize properties into /tmp/CTLFireability4444352089648856954.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/CTLFireability12232127590128762241.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4444352089648856954.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 : 486/486 places, 432/432 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 482 transition count 428
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 482 transition count 428
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 482 transition count 427
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 13 place count 478 transition count 423
Iterating global reduction 1 with 4 rules applied. Total rules applied 17 place count 478 transition count 423
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 21 place count 478 transition count 419
Applied a total of 21 rules in 49 ms. Remains 478 /486 variables (removed 8) and now considering 419/432 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17969275512740711504.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5907135330654514652.kers'
[2026-05-25 21:49:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17969275512740711504.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5907135330654514652.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 419 rows 478 cols 1493 entries
Finished phase 1 with 195 SingleSign rule and 221 generalized
[2026-05-25 21:49:06] [INFO ] Computed 62 invariants in 5 ms
Computed 62 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-5907135330654514652.kers
Total runtime 6 ms.
[2026-05-25 21:49:06] [INFO ] Implicit Places using invariants in 579 ms returned []
[2026-05-25 21:49:06] [INFO ] Invariant cache hit.
[2026-05-25 21:49:08] [INFO ] Implicit Places using invariants and state equation in 1566 ms returned []
Implicit Place search using SMT with State Equation took 2157 ms to find 0 implicit places.
Running 418 sub problems to find dead transitions.
[2026-05-25 21:49:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (OVERLAPS) 1/478 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 418 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/478 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 5 (OVERLAPS) 419/897 variables, 478/540 constraints. Problems are: Problem set: 0 solved, 418 unsolved
SMT process timed out in 30365ms, After SMT, problems are : Problem set: 0 solved, 418 unsolved
Search for dead transitions found 0 dead transitions in 30366ms
Starting structural reductions in LTL mode, iteration 1 : 478/486 places, 419/432 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32575 ms. Remains : 478/486 places, 419/432 transitions.
[2026-05-25 21:49:38] [INFO ] Flatten gal took : 14 ms
[2026-05-25 21:49:38] [INFO ] Flatten gal took : 14 ms
[2026-05-25 21:49:38] [INFO ] Input system was already deterministic with 419 transitions.
[2026-05-25 21:49:38] [INFO ] Flatten gal took : 14 ms
[2026-05-25 21:49:38] [INFO ] Flatten gal took : 14 ms
[2026-05-25 21:49:38] [INFO ] Time to serialize gal into /tmp/CTLFireability7048014623382452213.gal : 3 ms
[2026-05-25 21:49:38] [INFO ] Time to serialize properties into /tmp/CTLFireability10558523600436671319.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/CTLFireability7048014623382452213.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10558523600436671319.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 21:50:08] [INFO ] Flatten gal took : 9 ms
[2026-05-25 21:50:08] [INFO ] Applying decomposition
[2026-05-25 21:50:08] [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/graph17325548803455529028.txt' '-o' '/tmp/graph17325548803455529028.bin' '-w' '/tmp/graph17325548803455529028.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17325548803455529028.bin' '-l' '-1' '-v' '-w' '/tmp/graph17325548803455529028.weights' '-q' '0' '-e' '0.001'
[2026-05-25 21:50:08] [INFO ] Decomposing Gal with order
[2026-05-25 21:50:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 21:50:08] [INFO ] Removed a total of 12 redundant transitions.
[2026-05-25 21:50:08] [INFO ] Flatten gal took : 17 ms
[2026-05-25 21:50:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2026-05-25 21:50:08] [INFO ] Time to serialize gal into /tmp/CTLFireability8227669677883829149.gal : 20 ms
[2026-05-25 21:50:08] [INFO ] Time to serialize properties into /tmp/CTLFireability13290155753465751302.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/CTLFireability8227669677883829149.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13290155753465751302.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.88158e+21,11.8893,244368,17091,8200,548048,45758,634,495804,508,386457,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 432/432 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 478 transition count 424
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 478 transition count 424
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 478 transition count 422
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 473 transition count 417
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 473 transition count 417
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 32 place count 473 transition count 413
Applied a total of 32 rules in 36 ms. Remains 473 /486 variables (removed 13) and now considering 413/432 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5417752569687003041.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5515233575296186204.kers'
[2026-05-25 21:50:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5417752569687003041.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5515233575296186204.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 413 rows 473 cols 1477 entries
Finished phase 1 with 191 SingleSign rule and 220 generalized
[2026-05-25 21:50:39] [INFO ] Computed 62 invariants in 5 ms
Computed 62 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-5515233575296186204.kers
Total runtime 7 ms.
[2026-05-25 21:50:39] [INFO ] Implicit Places using invariants in 560 ms returned []
[2026-05-25 21:50:39] [INFO ] Invariant cache hit.
[2026-05-25 21:50:43] [INFO ] Implicit Places using invariants and state equation in 3653 ms returned []
Implicit Place search using SMT with State Equation took 4226 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2026-05-25 21:50:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 412 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (OVERLAPS) 413/886 variables, 473/535 constraints. Problems are: Problem set: 0 solved, 412 unsolved
SMT process timed out in 30337ms, After SMT, problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 30339ms
Starting structural reductions in LTL mode, iteration 1 : 473/486 places, 413/432 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34605 ms. Remains : 473/486 places, 413/432 transitions.
[2026-05-25 21:51:13] [INFO ] Flatten gal took : 13 ms
[2026-05-25 21:51:13] [INFO ] Flatten gal took : 14 ms
[2026-05-25 21:51:13] [INFO ] Input system was already deterministic with 413 transitions.
[2026-05-25 21:51:13] [INFO ] Flatten gal took : 15 ms
[2026-05-25 21:51:13] [INFO ] Flatten gal took : 14 ms
[2026-05-25 21:51:13] [INFO ] Time to serialize gal into /tmp/CTLFireability3477350497673931110.gal : 3 ms
[2026-05-25 21:51:13] [INFO ] Time to serialize properties into /tmp/CTLFireability8162832806413315652.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/CTLFireability3477350497673931110.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8162832806413315652.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 21:51:43] [INFO ] Flatten gal took : 8 ms
[2026-05-25 21:51:43] [INFO ] Applying decomposition
[2026-05-25 21:51:43] [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/graph5294684431347250349.txt' '-o' '/tmp/graph5294684431347250349.bin' '-w' '/tmp/graph5294684431347250349.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5294684431347250349.bin' '-l' '-1' '-v' '-w' '/tmp/graph5294684431347250349.weights' '-q' '0' '-e' '0.001'
[2026-05-25 21:51:43] [INFO ] Decomposing Gal with order
[2026-05-25 21:51:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 21:51:43] [INFO ] Removed a total of 11 redundant transitions.
[2026-05-25 21:51:43] [INFO ] Flatten gal took : 19 ms
[2026-05-25 21:51:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2026-05-25 21:51:43] [INFO ] Time to serialize gal into /tmp/CTLFireability17341801643689446130.gal : 4 ms
[2026-05-25 21:51:43] [INFO ] Time to serialize properties into /tmp/CTLFireability17035279621802080625.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/CTLFireability17341801643689446130.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17035279621802080625.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 486/486 places, 432/432 transitions.
Graph (complete) has 1155 edges and 486 vertex of which 480 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 479 transition count 414
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 465 transition count 414
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 465 transition count 404
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 49 place count 455 transition count 404
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 55 place count 449 transition count 398
Iterating global reduction 2 with 6 rules applied. Total rules applied 61 place count 449 transition count 398
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 2 with 3 rules applied. Total rules applied 64 place count 449 transition count 395
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 66 place count 448 transition count 394
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 69 place count 445 transition count 391
Iterating global reduction 4 with 3 rules applied. Total rules applied 72 place count 445 transition count 391
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 74 place count 445 transition count 389
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 74 place count 445 transition count 388
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 76 place count 444 transition count 388
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 5 with 140 rules applied. Total rules applied 216 place count 374 transition count 318
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 218 place count 372 transition count 316
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 219 place count 371 transition count 316
Applied a total of 219 rules in 81 ms. Remains 371 /486 variables (removed 115) and now considering 316/432 (removed 116) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8196173138855683841.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1607874270861839124.kers'
[2026-05-25 21:52:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8196173138855683841.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1607874270861839124.kers]
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 1 ms.
// Phase 1: matrix 316 rows 345 cols 1195 entries
Finished phase 1 with 239 SingleSign rule and 74 generalized
[2026-05-25 21:52:14] [INFO ] Computed 58 invariants in 5 ms
Computed 58 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-1607874270861839124.kers
Total runtime 8 ms.
[2026-05-25 21:52:14] [INFO ] Implicit Places using invariants in 390 ms returned []
[2026-05-25 21:52:14] [INFO ] Invariant cache hit.
[2026-05-25 21:52:15] [INFO ] Implicit Places using invariants and state equation in 850 ms returned []
Implicit Place search using SMT with State Equation took 1248 ms to find 0 implicit places.
[2026-05-25 21:52:15] [INFO ] Redundant transitions in 3 ms returned []
Running 313 sub problems to find dead transitions.
[2026-05-25 21:52:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/368 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/368 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/368 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (OVERLAPS) 1/369 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 1/370 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 313 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 316/686 variables, 370/428 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/686 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 686/687 variables, and 429 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 370/371 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/368 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/368 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/368 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/368 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (OVERLAPS) 1/369 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (OVERLAPS) 1/370 variables, 11/59 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (OVERLAPS) 316/686 variables, 370/429 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/686 variables, 313/742 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 686/687 variables, and 742 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 370/371 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60175ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 60176ms
Starting structural reductions in SI_CTL mode, iteration 1 : 371/486 places, 316/432 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61516 ms. Remains : 371/486 places, 316/432 transitions.
[2026-05-25 21:53:15] [INFO ] Flatten gal took : 9 ms
[2026-05-25 21:53:15] [INFO ] Flatten gal took : 8 ms
[2026-05-25 21:53:15] [INFO ] Input system was already deterministic with 316 transitions.
[2026-05-25 21:53:15] [INFO ] Flatten gal took : 9 ms
[2026-05-25 21:53:15] [INFO ] Flatten gal took : 8 ms
[2026-05-25 21:53:15] [INFO ] Time to serialize gal into /tmp/CTLFireability9881541435854427720.gal : 3 ms
[2026-05-25 21:53:15] [INFO ] Time to serialize properties into /tmp/CTLFireability17097524565928109596.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/CTLFireability9881541435854427720.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17097524565928109596.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 21:53:45] [INFO ] Flatten gal took : 13 ms
[2026-05-25 21:53:45] [INFO ] Applying decomposition
[2026-05-25 21:53:45] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8452152408047935399.txt' '-o' '/tmp/graph8452152408047935399.bin' '-w' '/tmp/graph8452152408047935399.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8452152408047935399.bin' '-l' '-1' '-v' '-w' '/tmp/graph8452152408047935399.weights' '-q' '0' '-e' '0.001'
[2026-05-25 21:53:45] [INFO ] Decomposing Gal with order
[2026-05-25 21:53:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 21:53:45] [INFO ] Removed a total of 11 redundant transitions.
[2026-05-25 21:53:45] [INFO ] Flatten gal took : 21 ms
[2026-05-25 21:53:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2026-05-25 21:53:45] [INFO ] Time to serialize gal into /tmp/CTLFireability13720333163149862647.gal : 4 ms
[2026-05-25 21:53:45] [INFO ] Time to serialize properties into /tmp/CTLFireability14099801376518600584.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/CTLFireability13720333163149862647.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14099801376518600584.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.2763e+15,5.17992,107848,8139,13929,229641,28463,339,175827,557,247357,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 21:54:15] [INFO ] Flatten gal took : 11 ms
[2026-05-25 21:54:15] [INFO ] Flatten gal took : 13 ms
[2026-05-25 21:54:15] [INFO ] Applying decomposition
[2026-05-25 21:54:15] [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/graph3792794283339466308.txt' '-o' '/tmp/graph3792794283339466308.bin' '-w' '/tmp/graph3792794283339466308.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3792794283339466308.bin' '-l' '-1' '-v' '-w' '/tmp/graph3792794283339466308.weights' '-q' '0' '-e' '0.001'
[2026-05-25 21:54:15] [INFO ] Decomposing Gal with order
[2026-05-25 21:54:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 21:54:15] [INFO ] Removed a total of 20 redundant transitions.
[2026-05-25 21:54:15] [INFO ] Flatten gal took : 26 ms
[2026-05-25 21:54:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 4 ms.
[2026-05-25 21:54:15] [INFO ] Time to serialize gal into /tmp/CTLFireability6202288109215815509.gal : 6 ms
[2026-05-25 21:54:15] [INFO ] Time to serialize properties into /tmp/CTLFireability1055899953279932960.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/CTLFireability6202288109215815509.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1055899953279932960.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 12 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.68506e+21,17.5471,308080,16845,8524,730007,47747,726,432379,549,524543,0


Converting to forward existential form...Done !
original formula: E(!(E(!(((u35.p20==1)&&(u35.p370==1))) U EF(!(((u33.p143==1)&&(u33.p363==1)))))) U (!(EF(AX(((u33.p152==1)&&(u33.p363==1))))) * EF(EG(((i...193
=> equivalent forward existential formula: [FwdG(FwdU((FwdU(Init,!(E(!(((u35.p20==1)&&(u35.p370==1))) U E(TRUE U !(((u33.p143==1)&&(u33.p363==1))))))) * !(...262
Reverse transition relation is NOT exact ! Due to transitions t0, t57, t59, t125, t320, t390, t391, u33.t80, u9.t265, u9.t266, u9.t267, u9.t268, u9.t269, u...1332

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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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-60b"
export BK_EXAMINATION="CTLFireability"
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-60b, examination is CTLFireability"
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-177946993800450"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-60b.tgz
mv DES-PT-60b execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;