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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 6.1K Mar 6 18:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 6 18:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 6 18:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Mar 6 18:26 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.2K Mar 15 08:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 15 08:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 6 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Mar 6 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Mar 6 18:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 6 18:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:57 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 79K 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-10b-CTLCardinality-2024-00
FORMULA_NAME DES-PT-10b-CTLCardinality-2024-01
FORMULA_NAME DES-PT-10b-CTLCardinality-2024-02
FORMULA_NAME DES-PT-10b-CTLCardinality-2024-03
FORMULA_NAME DES-PT-10b-CTLCardinality-2024-04
FORMULA_NAME DES-PT-10b-CTLCardinality-2024-05
FORMULA_NAME DES-PT-10b-CTLCardinality-2024-06
FORMULA_NAME DES-PT-10b-CTLCardinality-2024-07
FORMULA_NAME DES-PT-10b-CTLCardinality-2024-08
FORMULA_NAME DES-PT-10b-CTLCardinality-2024-09
FORMULA_NAME DES-PT-10b-CTLCardinality-2024-10
FORMULA_NAME DES-PT-10b-CTLCardinality-2024-11
FORMULA_NAME DES-PT-10b-CTLCardinality-2024-12
FORMULA_NAME DES-PT-10b-CTLCardinality-2024-13
FORMULA_NAME DES-PT-10b-CTLCardinality-2024-14
FORMULA_NAME DES-PT-10b-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779672703934

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-10b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-25 01:31:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 01:31:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 01:31:46] [INFO ] Load time of PNML (sax parser for PT used): 199 ms
[2026-05-25 01:31:46] [INFO ] Transformed 320 places.
[2026-05-25 01:31:46] [INFO ] Transformed 271 transitions.
[2026-05-25 01:31:46] [INFO ] Found NUPN structural information;
[2026-05-25 01:31:46] [INFO ] Parsed PT model containing 320 places and 271 transitions and 827 arcs in 444 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 29 ms.
Initial state reduction rules removed 1 formulas.
FORMULA DES-PT-10b-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 92 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 271/271 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 319 transition count 271
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 15 place count 305 transition count 257
Iterating global reduction 1 with 14 rules applied. Total rules applied 29 place count 305 transition count 257
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 37 place count 297 transition count 249
Iterating global reduction 1 with 8 rules applied. Total rules applied 45 place count 297 transition count 249
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 50 place count 297 transition count 244
Applied a total of 50 rules in 184 ms. Remains 297 /320 variables (removed 23) and now considering 244/271 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4664433295856463784.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18236134943643208310.kers'
[2026-05-25 01:31:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4664433295856463784.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18236134943643208310.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 244 rows 297 cols 758 entries
Finished phase 1 with 149 SingleSign rule and 84 generalized
[2026-05-25 01:31:47] [INFO ] Computed 64 invariants in 2 ms
Computed 64 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-18236134943643208310.kers
Total runtime 4 ms.
[2026-05-25 01:31:48] [INFO ] Implicit Places using invariants in 817 ms returned []
[2026-05-25 01:31:48] [INFO ] Invariant cache hit.
[2026-05-25 01:31:48] [INFO ] Implicit Places using invariants and state equation in 867 ms returned []
Implicit Place search using SMT with State Equation took 1756 ms to find 0 implicit places.
Running 243 sub problems to find dead transitions.
[2026-05-25 01:31:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (OVERLAPS) 3/297 variables, 37/55 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 9/64 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (OVERLAPS) 244/541 variables, 297/362 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 17/379 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 9/388 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 541/541 variables, and 396 constraints, problems are : Problem set: 0 solved, 243 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (OVERLAPS) 3/297 variables, 37/55 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 9/64 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 35/99 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 15/114 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 11/125 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 10 (OVERLAPS) 244/541 variables, 297/428 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 243/671 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 541/541 variables, and 671 constraints, problems are : Problem set: 0 solved, 243 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 67/67 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60202ms problems are : Problem set: 0 solved, 243 unsolved
Search for dead transitions found 0 dead transitions in 60228ms
Starting structural reductions in LTL mode, iteration 1 : 297/320 places, 244/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62240 ms. Remains : 297/320 places, 244/271 transitions.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 244/244 transitions.
Applied a total of 0 rules in 9 ms. Remains 297 /297 variables (removed 0) and now considering 244/244 (removed 0) transitions.
[2026-05-25 01:32:49] [INFO ] Invariant cache hit.
[2026-05-25 01:32:49] [INFO ] Implicit Places using invariants in 223 ms returned []
[2026-05-25 01:32:49] [INFO ] Invariant cache hit.
[2026-05-25 01:32:49] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 717 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 727 ms. Remains : 297/297 places, 244/244 transitions.
Support contains 92 out of 297 places after structural reductions.
[2026-05-25 01:32:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-25 01:32:50] [INFO ] Flatten gal took : 106 ms
[2026-05-25 01:32:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DES-PT-10b-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 01:32:50] [INFO ] Flatten gal took : 46 ms
[2026-05-25 01:32:50] [INFO ] Input system was already deterministic with 244 transitions.
Support contains 52 out of 297 places (down from 92) after GAL structural reductions.
RANDOM walk for 40000 steps (342 resets) in 1769 ms. (22 steps per ms) remains 4/34 properties
BEST_FIRST walk for 40003 steps (51 resets) in 205 ms. (194 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (52 resets) in 136 ms. (292 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (46 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (50 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
[2026-05-25 01:32:51] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 29/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 171/205 variables, 35/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 90/295 variables, 26/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/296 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 244/540 variables, 296/360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/541 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/541 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 361 constraints, problems are : Problem set: 0 solved, 4 unsolved in 485 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 29/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 171/205 variables, 35/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 90/295 variables, 26/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/296 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 244/540 variables, 296/360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 4/364 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/541 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/541 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/541 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/541 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 541/541 variables, and 368 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2550 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3044ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 5710 ms.
Support contains 5 out of 297 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 297/297 places, 244/244 transitions.
Graph (complete) has 575 edges and 297 vertex of which 291 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 291 transition count 220
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 39 place count 273 transition count 220
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 39 place count 273 transition count 210
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 59 place count 263 transition count 210
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 67 place count 255 transition count 202
Iterating global reduction 2 with 8 rules applied. Total rules applied 75 place count 255 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 255 transition count 201
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 82 place count 249 transition count 195
Iterating global reduction 3 with 6 rules applied. Total rules applied 88 place count 249 transition count 195
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 7 rules applied. Total rules applied 95 place count 249 transition count 188
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 97 place count 248 transition count 187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 97 place count 248 transition count 186
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 99 place count 247 transition count 186
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 251 place count 171 transition count 110
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 259 place count 167 transition count 119
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 260 place count 167 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 261 place count 166 transition count 118
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 262 place count 165 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 263 place count 164 transition count 117
Applied a total of 263 rules in 123 ms. Remains 164 /297 variables (removed 133) and now considering 117/244 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 164/297 places, 117/244 transitions.
RANDOM walk for 40000 steps (1833 resets) in 974 ms. (41 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (300 resets) in 124 ms. (320 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (280 resets) in 131 ms. (303 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (307 resets) in 134 ms. (296 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (310 resets) in 176 ms. (226 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 235833 steps, run visited all 4 properties in 1562 ms. (steps per millisecond=150 )
Probabilistic random walk after 235833 steps, saw 58381 distinct states, run finished after 1567 ms. (steps per millisecond=150 ) properties seen :4
[2026-05-25 01:33:02] [INFO ] Flatten gal took : 26 ms
[2026-05-25 01:33:02] [INFO ] Flatten gal took : 23 ms
[2026-05-25 01:33:02] [INFO ] Input system was already deterministic with 244 transitions.
Computed a total of 99 stabilizing places and 91 stable transitions
Graph (complete) has 575 edges and 297 vertex of which 287 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.8 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 297/297 places, 244/244 transitions.
Graph (complete) has 575 edges and 297 vertex of which 291 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.8 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 290 transition count 223
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 274 transition count 223
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 33 place count 274 transition count 212
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 55 place count 263 transition count 212
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 64 place count 254 transition count 203
Iterating global reduction 2 with 9 rules applied. Total rules applied 73 place count 254 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 254 transition count 202
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 81 place count 247 transition count 195
Iterating global reduction 3 with 7 rules applied. Total rules applied 88 place count 247 transition count 195
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 8 rules applied. Total rules applied 96 place count 247 transition count 187
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 98 place count 246 transition count 186
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 98 place count 246 transition count 184
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 102 place count 244 transition count 184
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 244 place count 173 transition count 113
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 246 place count 171 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 247 place count 170 transition count 111
Applied a total of 247 rules in 128 ms. Remains 170 /297 variables (removed 127) and now considering 111/244 (removed 133) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13000836975080877495.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6355339998781211143.kers'
[2026-05-25 01:33:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13000836975080877495.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6355339998781211143.kers]
Culling duplicate invariants (modulo rational): removing 27 columns.
Culled 27 columns in 0 ms.
// Phase 1: matrix 111 rows 143 cols 388 entries
Finished phase 1 with 85 SingleSign rule and 24 generalized
[2026-05-25 01:33:02] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6355339998781211143.kers
Total runtime 2 ms.
[2026-05-25 01:33:02] [INFO ] Implicit Places using invariants in 240 ms returned []
[2026-05-25 01:33:02] [INFO ] Invariant cache hit.
[2026-05-25 01:33:03] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
[2026-05-25 01:33:03] [INFO ] Redundant transitions in 3 ms returned []
Running 108 sub problems to find dead transitions.
[2026-05-25 01:33:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 3/170 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 111/281 variables, 170/231 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 0/281 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 234 constraints, problems are : Problem set: 0 solved, 108 unsolved in 10697 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/170 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 111/281 variables, 170/234 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 108/342 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 281/281 variables, and 344 constraints, problems are : Problem set: 0 solved, 108 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40733ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 40735ms
Starting structural reductions in SI_CTL mode, iteration 1 : 170/297 places, 111/244 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41495 ms. Remains : 170/297 places, 111/244 transitions.
[2026-05-25 01:33:43] [INFO ] Flatten gal took : 19 ms
[2026-05-25 01:33:43] [INFO ] Flatten gal took : 19 ms
[2026-05-25 01:33:44] [INFO ] Input system was already deterministic with 111 transitions.
[2026-05-25 01:33:44] [INFO ] Flatten gal took : 41 ms
[2026-05-25 01:33:44] [INFO ] Flatten gal took : 44 ms
[2026-05-25 01:33:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16113904520697887971.gal : 21 ms
RANDOM walk for 40000 steps (1262 resets) in 608 ms. (65 steps per ms) remains 1/1 properties
[2026-05-25 01:33:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12286207741182541755.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/ReachabilityCardinality16113904520697887971.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12286207741182541755.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

BEST_FIRST walk for 40003 steps (243 resets) in 193 ms. (206 steps per ms) remains 1/1 properties
/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/ReachabilityCardinality12286207741182541755.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12 after 60
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :60 after 184
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :184 after 856
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :856 after 5958
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :5958 after 16844
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.01197e+06 after 1.17059e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.17059e+06 after 1.38878e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.29221e+07 after 3.05004e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3.05004e+07 after 2.88995e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.88995e+08 after 2.53151e+09
Interrupted probabilistic random walk after 1311981 steps, run timeout after 3001 ms. (steps per millisecond=437 ) properties seen :0 out of 1
Probabilistic random walk after 1311981 steps, saw 178745 distinct states, run finished after 3005 ms. (steps per millisecond=436 ) properties seen :0
[2026-05-25 01:33:47] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
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) 21/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 79/101 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/138 variables, 32/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/152 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 99/251 variables, 152/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 22/273 variables, 13/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/273 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/273 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/274 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/274 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/274 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 7/281 variables, 4/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/281 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/281 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 231 constraints, problems are : Problem set: 0 solved, 1 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 170/170 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) 21/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 79/101 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/138 variables, 32/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/152 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 99/251 variables, 152/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 22/273 variables, 13/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/273 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/273 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/274 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/274 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/274 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 7/281 variables, 4/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/281 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/281 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/281 variables, and 232 constraints, problems are : Problem set: 0 solved, 1 unsolved in 243 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 435ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 113 ms.
Support contains 1 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 111/111 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 170 transition count 107
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 168 transition count 107
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 164 transition count 103
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 162 transition count 105
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 162 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 161 transition count 104
Applied a total of 20 rules in 28 ms. Remains 161 /170 variables (removed 9) and now considering 104/111 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 161/170 places, 104/111 transitions.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.53151e+09 after 2.8688e+09
RANDOM walk for 4000000 steps (191448 resets) in 13404 ms. (298 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (36513 resets) in 5699 ms. (701 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.8688e+09 after 8.02339e+09
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.70812e+10 after 2.96923e+10
Interrupted probabilistic random walk after 7065856 steps, run timeout after 15001 ms. (steps per millisecond=471 ) properties seen :0 out of 1
Probabilistic random walk after 7065856 steps, saw 971030 distinct states, run finished after 15001 ms. (steps per millisecond=471 ) 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-7182325221403938913.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2776567871064711230.kers'
[2026-05-25 01:34:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7182325221403938913.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2776567871064711230.kers]
Culling duplicate invariants (modulo rational): removing 29 columns.
Culled 29 columns in 0 ms.
// Phase 1: matrix 104 rows 132 cols 397 entries
Finished phase 1 with 76 SingleSign rule and 22 generalized
[2026-05-25 01:34:08] [INFO ] Computed 63 invariants in 0 ms
Computed 63 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2776567871064711230.kers
Total runtime 1 ms.
All remaining problems are real, not stopping.
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) 21/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/100 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/138 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/140 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 9/149 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 100/249 variables, 149/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/263 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/263 variables, 4/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/263 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/265 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/265 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/265 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/265 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 224 constraints, problems are : Problem set: 0 solved, 1 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 161/161 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) 21/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/100 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/138 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/140 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/149 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/149 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 100/249 variables, 149/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/249 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 14/263 variables, 10/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/263 variables, 4/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/263 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/265 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/265 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/265 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/265 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 226 constraints, problems are : Problem set: 0 solved, 1 unsolved in 304 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 560ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 107 ms.
Support contains 1 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 104/104 transitions.
Applied a total of 0 rules in 7 ms. Remains 161 /161 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 161/161 places, 104/104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 104/104 transitions.
Applied a total of 0 rules in 6 ms. Remains 161 /161 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2026-05-25 01:34:08] [INFO ] Invariant cache hit.
[2026-05-25 01:34:08] [INFO ] Implicit Places using invariants in 215 ms returned []
[2026-05-25 01:34:08] [INFO ] Invariant cache hit.
[2026-05-25 01:34:09] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2026-05-25 01:34:09] [INFO ] Redundant transitions in 2 ms returned []
Running 101 sub problems to find dead transitions.
[2026-05-25 01:34:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 10/49 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 3/161 variables, 14/63 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 104/265 variables, 161/224 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/265 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 228 constraints, problems are : Problem set: 0 solved, 101 unsolved in 6562 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 10/49 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 3/161 variables, 14/67 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 104/265 variables, 161/228 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 101/329 constraints. Problems are: Problem set: 0 solved, 101 unsolved
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :2.96923e+10 after 1.14519e+11
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 265/265 variables, and 330 constraints, problems are : Problem set: 0 solved, 101 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36597ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 36598ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37099 ms. Remains : 161/161 places, 104/104 transitions.
RANDOM walk for 400000 steps (19175 resets) in 3396 ms. (117 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2026-05-25 01:34:46] [INFO ] Invariant cache hit.
[2026-05-25 01:34:46] [INFO ] [Real]Absence check using 39 positive place invariants in 10 ms returned sat
[2026-05-25 01:34:46] [INFO ] [Real]Absence check using 39 positive and 24 generalized place invariants in 14 ms returned sat
[2026-05-25 01:34:46] [INFO ] After 86ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 01:34:46] [INFO ] After 110ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 01:34:46] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 01:34:47] [INFO ] [Nat]Absence check using 39 positive place invariants in 10 ms returned sat
[2026-05-25 01:34:47] [INFO ] [Nat]Absence check using 39 positive and 24 generalized place invariants in 14 ms returned sat
[2026-05-25 01:34:47] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 01:34:47] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 01:34:47] [INFO ] After 163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (191109 resets) in 11128 ms. (359 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (36563 resets) in 5109 ms. (782 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 6025711 steps, run timeout after 12001 ms. (steps per millisecond=502 ) properties seen :0 out of 1
Probabilistic random walk after 6025711 steps, saw 828494 distinct states, run finished after 12002 ms. (steps per millisecond=502 ) properties seen :0
[2026-05-25 01:35:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
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) 21/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/100 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/138 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/140 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 9/149 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 100/249 variables, 149/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/263 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/263 variables, 4/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/263 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/265 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/265 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/265 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/265 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 224 constraints, problems are : Problem set: 0 solved, 1 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 161/161 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) 21/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/100 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/138 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/140 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/149 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/149 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 100/249 variables, 149/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/249 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 14/263 variables, 10/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/263 variables, 4/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/263 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/265 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/265 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/265 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/265 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 226 constraints, problems are : Problem set: 0 solved, 1 unsolved in 386 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 557ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 174 ms.
Support contains 1 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 104/104 transitions.
Applied a total of 0 rules in 12 ms. Remains 161 /161 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 161/161 places, 104/104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 104/104 transitions.
Applied a total of 0 rules in 10 ms. Remains 161 /161 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2026-05-25 01:35:04] [INFO ] Invariant cache hit.
[2026-05-25 01:35:04] [INFO ] Implicit Places using invariants in 249 ms returned []
[2026-05-25 01:35:04] [INFO ] Invariant cache hit.
[2026-05-25 01:35:04] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 740 ms to find 0 implicit places.
[2026-05-25 01:35:04] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 760 ms. Remains : 161/161 places, 104/104 transitions.
RANDOM walk for 400000 steps (19216 resets) in 1502 ms. (266 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2026-05-25 01:35:05] [INFO ] Invariant cache hit.
[2026-05-25 01:35:05] [INFO ] [Real]Absence check using 39 positive place invariants in 9 ms returned sat
[2026-05-25 01:35:05] [INFO ] [Real]Absence check using 39 positive and 24 generalized place invariants in 13 ms returned sat
[2026-05-25 01:35:05] [INFO ] After 69ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 01:35:05] [INFO ] After 84ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 01:35:05] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 01:35:05] [INFO ] [Nat]Absence check using 39 positive place invariants in 10 ms returned sat
[2026-05-25 01:35:05] [INFO ] [Nat]Absence check using 39 positive and 24 generalized place invariants in 14 ms returned sat
[2026-05-25 01:35:05] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 01:35:05] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 01:35:05] [INFO ] After 155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 40000 steps (1896 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (358 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1251466 steps, run timeout after 3001 ms. (steps per millisecond=417 ) properties seen :0 out of 1
Probabilistic random walk after 1251466 steps, saw 173604 distinct states, run finished after 3001 ms. (steps per millisecond=417 ) properties seen :0
[2026-05-25 01:35:08] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
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) 21/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/100 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/138 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/140 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 9/149 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 100/249 variables, 149/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/263 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/263 variables, 4/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/263 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/265 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/265 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/265 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/265 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 224 constraints, problems are : Problem set: 0 solved, 1 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 161/161 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) 21/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/100 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/138 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/140 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/149 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/149 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 100/249 variables, 149/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/249 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 14/263 variables, 10/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/263 variables, 4/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/263 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/265 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/265 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/265 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/265 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 226 constraints, problems are : Problem set: 0 solved, 1 unsolved in 321 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 529ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 174 ms.
Support contains 1 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 104/104 transitions.
Applied a total of 0 rules in 13 ms. Remains 161 /161 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 161/161 places, 104/104 transitions.
RANDOM walk for 40000 steps (1926 resets) in 231 ms. (172 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (380 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1337357 steps, run timeout after 3001 ms. (steps per millisecond=445 ) properties seen :0 out of 1
Probabilistic random walk after 1337357 steps, saw 184225 distinct states, run finished after 3001 ms. (steps per millisecond=445 ) properties seen :0
[2026-05-25 01:35:12] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
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) 21/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/100 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/138 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/140 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 9/149 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 100/249 variables, 149/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/263 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/263 variables, 4/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/263 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/265 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/265 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/265 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/265 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 224 constraints, problems are : Problem set: 0 solved, 1 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 161/161 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) 21/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/100 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/138 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/140 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/149 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/149 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 100/249 variables, 149/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/249 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 14/263 variables, 10/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/263 variables, 4/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/263 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/265 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/265 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/265 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/265 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 226 constraints, problems are : Problem set: 0 solved, 1 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 458ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 119 ms.
Support contains 1 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 104/104 transitions.
Applied a total of 0 rules in 6 ms. Remains 161 /161 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 161/161 places, 104/104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 104/104 transitions.
Applied a total of 0 rules in 6 ms. Remains 161 /161 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2026-05-25 01:35:13] [INFO ] Invariant cache hit.
[2026-05-25 01:35:13] [INFO ] Implicit Places using invariants in 280 ms returned []
[2026-05-25 01:35:13] [INFO ] Invariant cache hit.
[2026-05-25 01:35:13] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 797 ms to find 0 implicit places.
[2026-05-25 01:35:13] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 816 ms. Remains : 161/161 places, 104/104 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 10 ms. Remains 161 /161 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Running SMT prover for 1 properties.
[2026-05-25 01:35:13] [INFO ] Invariant cache hit.
[2026-05-25 01:35:13] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 01:35:14] [INFO ] [Nat]Absence check using 39 positive place invariants in 16 ms returned sat
[2026-05-25 01:35:14] [INFO ] [Nat]Absence check using 39 positive and 24 generalized place invariants in 22 ms returned sat
[2026-05-25 01:35:14] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 01:35:14] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 01:35:14] [INFO ] After 271ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 353 ms.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 12 ms. Remains 161 /161 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Running SMT prover for 1 properties.
[2026-05-25 01:35:14] [INFO ] Invariant cache hit.
[2026-05-25 01:35:14] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 01:35:14] [INFO ] [Nat]Absence check using 39 positive place invariants in 17 ms returned sat
[2026-05-25 01:35:14] [INFO ] [Nat]Absence check using 39 positive and 24 generalized place invariants in 23 ms returned sat
[2026-05-25 01:35:14] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 01:35:14] [INFO ] After 150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 01:35:14] [INFO ] After 281ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-25 01:35:14] [INFO ] Flatten gal took : 33 ms
[2026-05-25 01:35:14] [INFO ] Flatten gal took : 15 ms
[2026-05-25 01:35:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11663273735969799506.gal : 8 ms
[2026-05-25 01:35:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15492299480306038889.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/ReachabilityCardinality11663273735969799506.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15492299480306038889.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/ReachabilityCardinality15492299480306038889.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 38
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :38 after 40
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :40 after 64
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :64 after 658
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :658 after 1148
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1148 after 13606
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :13606 after 164232
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :164232 after 226080
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :226080 after 1.9244e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.77546e+09 after 2.66409e+09
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.78051e+09 after 2.84093e+09
SDD proceeding with computation,1 properties remain. new max is 262144
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.6222e+10 after 2.62242e+10
SDD size :1.84651e+11 after 6.38494e+11
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :9.91794e+10 after 9.91909e+10
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.4334e+11 after 2.47605e+11
Detected timeout of ITS tools.
[2026-05-25 01:35:29] [INFO ] Flatten gal took : 10 ms
[2026-05-25 01:35:29] [INFO ] Applying decomposition
[2026-05-25 01:35: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/graph12495828901637899477.txt' '-o' '/tmp/graph12495828901637899477.bin' '-w' '/tmp/graph12495828901637899477.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12495828901637899477.bin' '-l' '-1' '-v' '-w' '/tmp/graph12495828901637899477.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:35:29] [INFO ] Decomposing Gal with order
[2026-05-25 01:35:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 01:35:29] [INFO ] Removed a total of 35 redundant transitions.
[2026-05-25 01:35:29] [INFO ] Flatten gal took : 86 ms
[2026-05-25 01:35:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 12 ms.
[2026-05-25 01:35:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3388436283348156479.gal : 6 ms
[2026-05-25 01:35:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12803775126753008082.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/ReachabilityCardinality3388436283348156479.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12803775126753008082.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/ReachabilityCardinality12803775126753008082.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 18
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :18 after 770
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :770 after 15848
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :50736 after 9.57707e+08
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :9.57707e+08 after 2.75749e+09
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :7.62737e+11 after 7.7147e+11
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.0285e+12,2.20706,70852,15249,668,214916,1407,299,122717,149,5171,0
Total reachable state count : 2028496046166

Verifying 1 reachability properties.
Invariant property DES-PT-10b-CTLCardinality-2024-00 does not hold.

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-10b-CTLCardinality-2024-00,4.25698e+10,2.22458,70852,1071,266,214916,1407,301,122717,152,5171,0
Over-approximation ignoring read arcs solved 0 properties in 18003 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 01:35:32] [INFO ] Flatten gal took : 12 ms
[2026-05-25 01:35:32] [INFO ] Applying decomposition
[2026-05-25 01:35:32] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph13688664548617477528.txt' '-o' '/tmp/graph13688664548617477528.bin' '-w' '/tmp/graph13688664548617477528.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13688664548617477528.bin' '-l' '-1' '-v' '-w' '/tmp/graph13688664548617477528.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:35:32] [INFO ] Decomposing Gal with order
[2026-05-25 01:35:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 01:35:32] [INFO ] Removed a total of 15 redundant transitions.
[2026-05-25 01:35:32] [INFO ] Flatten gal took : 18 ms
[2026-05-25 01:35:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 3 ms.
[2026-05-25 01:35:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14355295811639369517.gal : 5 ms
[2026-05-25 01:35:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12634901802195183120.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/ReachabilityCardinality14355295811639369517.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12634901802195183120.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 ...309
Loading property file /tmp/ReachabilityCardinality12634901802195183120.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 54
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :54 after 10604
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :305876 after 6.27478e+09
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :6.27478e+09 after 2.77249e+10
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :8.62375e+10 after 6.43296e+11
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.78053e+13,0.761477,20880,3801,491,47459,1249,347,32847,156,4763,0
Total reachable state count : 17805282557022

Verifying 1 reachability properties.
Invariant property DES-PT-10b-CTLCardinality-2024-00 does not hold.
FORMULA DES-PT-10b-CTLCardinality-2024-00 FALSE 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-10b-CTLCardinality-2024-00,3.59693e+11,0.765926,20916,943,193,47459,1249,349,32847,159,4763,0
[2026-05-25 01:35:33] [INFO ] Flatten gal took : 14 ms
[2026-05-25 01:35:33] [INFO ] Flatten gal took : 13 ms
[2026-05-25 01:35:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality17385543086897011911.gal : 3 ms
[2026-05-25 01:35:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality16633037791305539874.ctl : 4 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/CTLCardinality17385543086897011911.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16633037791305539874.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 : 297/297 places, 244/244 transitions.
Graph (complete) has 575 edges and 297 vertex of which 287 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 286 transition count 222
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 270 transition count 222
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 33 place count 270 transition count 212
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 53 place count 260 transition count 212
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 62 place count 251 transition count 203
Iterating global reduction 2 with 9 rules applied. Total rules applied 71 place count 251 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 251 transition count 202
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 78 place count 245 transition count 196
Iterating global reduction 3 with 6 rules applied. Total rules applied 84 place count 245 transition count 196
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 7 rules applied. Total rules applied 91 place count 245 transition count 189
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 93 place count 244 transition count 188
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 93 place count 244 transition count 186
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 97 place count 242 transition count 186
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 239 place count 171 transition count 115
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 241 place count 171 transition count 115
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 243 place count 169 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 244 place count 168 transition count 113
Applied a total of 244 rules in 108 ms. Remains 168 /297 variables (removed 129) and now considering 113/244 (removed 131) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10720376273984767920.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17808049336963816907.kers'
[2026-05-25 01:36:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10720376273984767920.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17808049336963816907.kers]
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 0 ms.
// Phase 1: matrix 113 rows 142 cols 402 entries
Finished phase 1 with 86 SingleSign rule and 24 generalized
[2026-05-25 01:36:03] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17808049336963816907.kers
Total runtime 1 ms.
[2026-05-25 01:36:03] [INFO ] Implicit Places using invariants in 226 ms returned []
[2026-05-25 01:36:03] [INFO ] Invariant cache hit.
[2026-05-25 01:36:04] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
[2026-05-25 01:36:04] [INFO ] Redundant transitions in 4 ms returned []
Running 110 sub problems to find dead transitions.
[2026-05-25 01:36:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 2/167 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 113/280 variables, 167/225 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 11 (OVERLAPS) 1/281 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/281 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 13 (OVERLAPS) 0/281 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/281 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 15 (OVERLAPS) 0/281 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 231 constraints, problems are : Problem set: 0 solved, 110 unsolved in 21017 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 2/167 variables, 12/63 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 113/280 variables, 167/230 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 110/340 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 1/281 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 110 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 281/281 variables, and 341 constraints, problems are : Problem set: 0 solved, 110 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51054ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 51055ms
Starting structural reductions in SI_CTL mode, iteration 1 : 168/297 places, 113/244 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51792 ms. Remains : 168/297 places, 113/244 transitions.
[2026-05-25 01:36:55] [INFO ] Flatten gal took : 7 ms
[2026-05-25 01:36:55] [INFO ] Flatten gal took : 6 ms
[2026-05-25 01:36:55] [INFO ] Input system was already deterministic with 113 transitions.
[2026-05-25 01:36:55] [INFO ] Flatten gal took : 6 ms
[2026-05-25 01:36:55] [INFO ] Flatten gal took : 7 ms
[2026-05-25 01:36:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality4819382653966106211.gal : 2 ms
[2026-05-25 01:36:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality8973673839237834962.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/CTLCardinality4819382653966106211.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8973673839237834962.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 01:37:25] [INFO ] Flatten gal took : 6 ms
[2026-05-25 01:37:25] [INFO ] Applying decomposition
[2026-05-25 01:37:25] [INFO ] Flatten gal took : 6 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/graph13640568972003248490.txt' '-o' '/tmp/graph13640568972003248490.bin' '-w' '/tmp/graph13640568972003248490.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13640568972003248490.bin' '-l' '-1' '-v' '-w' '/tmp/graph13640568972003248490.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:37:25] [INFO ] Decomposing Gal with order
[2026-05-25 01:37:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 01:37:25] [INFO ] Removed a total of 24 redundant transitions.
[2026-05-25 01:37:25] [INFO ] Flatten gal took : 17 ms
[2026-05-25 01:37:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 4 ms.
[2026-05-25 01:37:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality17693333559286322382.gal : 4 ms
[2026-05-25 01:37:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality9625076025859645928.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/CTLCardinality17693333559286322382.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9625076025859645928.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,3.93219e+13,0.487419,19580,3095,519,42481,1943,324,32397,156,7945,0


Converting to forward existential form...Done !
original formula: EG(((i1.u4.p94==1) + AG((i3.u1.p66==0))))
=> equivalent forward existential formula: [FwdG(Init,((i1.u4.p94==1) + !(E(TRUE U !((i3.u1.p66==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t71, t92, t95, t96, t99, t111, u14.t32, u51.t1, u51.t101, i0.t9, i0.u2.t13, i0.u2.t17, i0...376
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,0,18.224,368452,1,0,888603,9544,1850,982852,1177,41313,1096168
FORMULA DES-PT-10b-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 297/297 places, 244/244 transitions.
Graph (complete) has 575 edges and 297 vertex of which 287 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 286 transition count 223
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 271 transition count 223
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 271 transition count 212
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 260 transition count 212
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 62 place count 251 transition count 203
Iterating global reduction 2 with 9 rules applied. Total rules applied 71 place count 251 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 251 transition count 202
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 79 place count 244 transition count 195
Iterating global reduction 3 with 7 rules applied. Total rules applied 86 place count 244 transition count 195
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 8 rules applied. Total rules applied 94 place count 244 transition count 187
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 96 place count 243 transition count 186
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 96 place count 243 transition count 184
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 100 place count 241 transition count 184
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 238 place count 172 transition count 115
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 240 place count 170 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 241 place count 169 transition count 113
Applied a total of 241 rules in 44 ms. Remains 169 /297 variables (removed 128) and now considering 113/244 (removed 131) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12445642875733095073.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18340691612977369915.kers'
[2026-05-25 01:37:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12445642875733095073.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18340691612977369915.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 113 rows 163 cols 470 entries
Finished phase 1 with 54 SingleSign rule and 57 generalized
[2026-05-25 01:37:43] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18340691612977369915.kers
Total runtime 1 ms.
[2026-05-25 01:37:44] [INFO ] Implicit Places using invariants in 192 ms returned []
[2026-05-25 01:37:44] [INFO ] Invariant cache hit.
[2026-05-25 01:37:44] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
[2026-05-25 01:37:44] [INFO ] Redundant transitions in 4 ms returned []
Running 110 sub problems to find dead transitions.
[2026-05-25 01:37:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 110 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/167 variables, 22/41 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 1/168 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 113/281 variables, 168/226 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 11 (OVERLAPS) 1/282 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 4/233 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/282 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 14 (OVERLAPS) 0/282 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 233 constraints, problems are : Problem set: 0 solved, 110 unsolved in 14734 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 1/167 variables, 22/45 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 1/168 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (OVERLAPS) 113/281 variables, 168/232 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 110/342 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/281 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 13 (OVERLAPS) 1/282 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 110 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 282/282 variables, and 343 constraints, problems are : Problem set: 0 solved, 110 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44773ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 44774ms
Starting structural reductions in SI_CTL mode, iteration 1 : 169/297 places, 113/244 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45402 ms. Remains : 169/297 places, 113/244 transitions.
[2026-05-25 01:38:29] [INFO ] Flatten gal took : 6 ms
[2026-05-25 01:38:29] [INFO ] Flatten gal took : 10 ms
[2026-05-25 01:38:29] [INFO ] Input system was already deterministic with 113 transitions.
[2026-05-25 01:38:29] [INFO ] Flatten gal took : 6 ms
[2026-05-25 01:38:29] [INFO ] Flatten gal took : 6 ms
[2026-05-25 01:38:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality11764267995322387321.gal : 2 ms
[2026-05-25 01:38:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality15412196563865967044.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/CTLCardinality11764267995322387321.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15412196563865967044.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.49147e+13,25.4005,462380,2,455193,5,2.07487e+06,6,0,785,1.96241e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 01:38:59] [INFO ] Flatten gal took : 7 ms
[2026-05-25 01:38:59] [INFO ] Applying decomposition
[2026-05-25 01:38:59] [INFO ] Flatten gal took : 5 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/graph191658023809925262.txt' '-o' '/tmp/graph191658023809925262.bin' '-w' '/tmp/graph191658023809925262.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph191658023809925262.bin' '-l' '-1' '-v' '-w' '/tmp/graph191658023809925262.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:38:59] [INFO ] Decomposing Gal with order
[2026-05-25 01:38:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 01:38:59] [INFO ] Removed a total of 18 redundant transitions.
[2026-05-25 01:38:59] [INFO ] Flatten gal took : 13 ms
[2026-05-25 01:38:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 3 ms.
[2026-05-25 01:38:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality8425413399137824777.gal : 3 ms
[2026-05-25 01:38:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality5101791678026109924.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/CTLCardinality8425413399137824777.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5101791678026109924.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,2.49147e+13,1.9315,64876,10646,490,190752,1965,374,108113,153,7549,0


Converting to forward existential form...Done !
original formula: EF(EG((EG(((i10.u23.p206==0)||(u51.p312==1))) * (i0.u2.p85==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(EG(((i10.u23.p206==0)||(u51.p312==1))) * (i0.u2.p85==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t71, t93, t94, t97, t98, t101, u14.t32, u51.t60, u51.t103, i0.t7, i0.u2.t13, i0.u2.t17, i...387
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 297/297 places, 244/244 transitions.
Graph (complete) has 575 edges and 297 vertex of which 287 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 286 transition count 224
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 272 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 271 transition count 223
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 31 place count 271 transition count 213
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 51 place count 261 transition count 213
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 59 place count 253 transition count 205
Iterating global reduction 3 with 8 rules applied. Total rules applied 67 place count 253 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 68 place count 253 transition count 204
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 74 place count 247 transition count 198
Iterating global reduction 4 with 6 rules applied. Total rules applied 80 place count 247 transition count 198
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 7 rules applied. Total rules applied 87 place count 247 transition count 191
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 90 place count 246 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 91 place count 245 transition count 189
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 7 with 142 rules applied. Total rules applied 233 place count 174 transition count 118
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 235 place count 172 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 236 place count 171 transition count 116
Applied a total of 236 rules in 39 ms. Remains 171 /297 variables (removed 126) and now considering 116/244 (removed 128) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13667787571224789405.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12729608781386769556.kers'
[2026-05-25 01:39:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13667787571224789405.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12729608781386769556.kers]
Culling duplicate invariants (modulo rational): removing 24 columns.
Culled 24 columns in 0 ms.
// Phase 1: matrix 116 rows 147 cols 400 entries
Finished phase 1 with 105 SingleSign rule and 8 generalized
[2026-05-25 01:39:29] [INFO ] Computed 58 invariants in 0 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12729608781386769556.kers
Total runtime 1 ms.
[2026-05-25 01:39:29] [INFO ] Implicit Places using invariants in 215 ms returned []
[2026-05-25 01:39:29] [INFO ] Invariant cache hit.
[2026-05-25 01:39:30] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
[2026-05-25 01:39:30] [INFO ] Redundant transitions in 1 ms returned []
Running 113 sub problems to find dead transitions.
[2026-05-25 01:39:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 10/47 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 2/170 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 116/286 variables, 170/228 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 5/233 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 1/287 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/287 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/287 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 235 constraints, problems are : Problem set: 0 solved, 113 unsolved in 16095 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 10/47 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 2/170 variables, 11/64 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 116/286 variables, 170/234 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 113/347 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (OVERLAPS) 1/287 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/287 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 287/287 variables, and 348 constraints, problems are : Problem set: 0 solved, 113 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46127ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 46128ms
Starting structural reductions in SI_CTL mode, iteration 1 : 171/297 places, 116/244 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46781 ms. Remains : 171/297 places, 116/244 transitions.
[2026-05-25 01:40:16] [INFO ] Flatten gal took : 5 ms
[2026-05-25 01:40:16] [INFO ] Flatten gal took : 5 ms
[2026-05-25 01:40:16] [INFO ] Input system was already deterministic with 116 transitions.
[2026-05-25 01:40:16] [INFO ] Flatten gal took : 4 ms
[2026-05-25 01:40:16] [INFO ] Flatten gal took : 4 ms
[2026-05-25 01:40:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality6981793091615332371.gal : 1 ms
[2026-05-25 01:40:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality8470056684620658130.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/CTLCardinality6981793091615332371.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8470056684620658130.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 01:40:46] [INFO ] Flatten gal took : 5 ms
[2026-05-25 01:40:46] [INFO ] Applying decomposition
[2026-05-25 01:40:46] [INFO ] Flatten gal took : 5 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/graph5245756517530421455.txt' '-o' '/tmp/graph5245756517530421455.bin' '-w' '/tmp/graph5245756517530421455.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5245756517530421455.bin' '-l' '-1' '-v' '-w' '/tmp/graph5245756517530421455.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:40:46] [INFO ] Decomposing Gal with order
[2026-05-25 01:40:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 01:40:46] [INFO ] Removed a total of 15 redundant transitions.
[2026-05-25 01:40:46] [INFO ] Flatten gal took : 11 ms
[2026-05-25 01:40:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 3 ms.
[2026-05-25 01:40:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality11568119427872737436.gal : 3 ms
[2026-05-25 01:40:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality15544280395402962570.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/CTLCardinality11568119427872737436.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15544280395402962570.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,6.36528e+13,0.571915,17364,2058,474,35847,1381,379,30363,159,5491,0


Converting to forward existential form...Done !
original formula: EF(AG(((i1.u13.p159==0) + AF((i14.i0.u5.p98==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((i1.u13.p159==0) + !(EG(!((i14.i0.u5.p98==0)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t76, t97, t100, t101, t104, u15.t36, u52.t2, u52.t106, i0.t12, i0.u2.t17, i0.u2.t21, i0.u...403
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 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 244/244 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 295 transition count 244
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 287 transition count 236
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 287 transition count 236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 287 transition count 235
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 24 place count 282 transition count 230
Iterating global reduction 2 with 5 rules applied. Total rules applied 29 place count 282 transition count 230
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 33 place count 282 transition count 226
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 281 transition count 225
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 281 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 36 place count 281 transition count 224
Applied a total of 36 rules in 18 ms. Remains 281 /297 variables (removed 16) and now considering 224/244 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17179975425267262327.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2955000960260843436.kers'
[2026-05-25 01:41:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17179975425267262327.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2955000960260843436.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 224 rows 281 cols 707 entries
Finished phase 1 with 148 SingleSign rule and 71 generalized
[2026-05-25 01:41:16] [INFO ] Computed 62 invariants in 1 ms
Computed 62 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2955000960260843436.kers
Total runtime 2 ms.
[2026-05-25 01:41:16] [INFO ] Implicit Places using invariants in 244 ms returned []
[2026-05-25 01:41:16] [INFO ] Invariant cache hit.
[2026-05-25 01:41:17] [INFO ] Implicit Places using invariants and state equation in 511 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 772 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 280/297 places, 224/244 transitions.
Applied a total of 0 rules in 6 ms. Remains 280 /280 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 796 ms. Remains : 280/297 places, 224/244 transitions.
[2026-05-25 01:41:17] [INFO ] Flatten gal took : 7 ms
[2026-05-25 01:41:17] [INFO ] Flatten gal took : 6 ms
[2026-05-25 01:41:17] [INFO ] Input system was already deterministic with 224 transitions.
[2026-05-25 01:41:17] [INFO ] Flatten gal took : 6 ms
[2026-05-25 01:41:17] [INFO ] Flatten gal took : 7 ms
[2026-05-25 01:41:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality18371114724137753384.gal : 3 ms
[2026-05-25 01:41:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality16220185228620557370.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/CTLCardinality18371114724137753384.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16220185228620557370.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 01:41:47] [INFO ] Flatten gal took : 7 ms
[2026-05-25 01:41:47] [INFO ] Applying decomposition
[2026-05-25 01:41:47] [INFO ] Flatten gal took : 5 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/graph7546755947047089243.txt' '-o' '/tmp/graph7546755947047089243.bin' '-w' '/tmp/graph7546755947047089243.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7546755947047089243.bin' '-l' '-1' '-v' '-w' '/tmp/graph7546755947047089243.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:41:47] [INFO ] Decomposing Gal with order
[2026-05-25 01:41:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 01:41:47] [INFO ] Removed a total of 16 redundant transitions.
[2026-05-25 01:41:47] [INFO ] Flatten gal took : 17 ms
[2026-05-25 01:41:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2026-05-25 01:41:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality12220118995884605472.gal : 4 ms
[2026-05-25 01:41:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality15275334060122921348.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/CTLCardinality12220118995884605472.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15275334060122921348.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,5.56421e+19,3.15915,81828,4663,517,171685,4493,686,186671,184,14312,0


Converting to forward existential form...Done !
original formula: EG(((i12.u15.p99==1) + (E(EX(AF((u34.p169==1))) U E(E((i5.u29.p147==1) U (i5.u30.p148==1)) U EX(((i13.u78.p20==0)||(i12.u14.p96==1))))) *...207
=> equivalent forward existential formula: [FwdG(Init,((i12.u15.p99==1) + (E(EX(!(EG(!((u34.p169==1))))) U E(E((i5.u29.p147==1) U (i5.u30.p148==1)) U EX(((...262
Reverse transition relation is NOT exact ! Due to transitions t0, t59, t165, t184, t185, t217, u34.t77, i0.u12.t119, i1.u32.t80, i2.t126, i2.u7.t131, i2.u7...826
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 244/244 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 295 transition count 244
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 14 place count 283 transition count 232
Iterating global reduction 1 with 12 rules applied. Total rules applied 26 place count 283 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 27 place count 283 transition count 231
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 35 place count 275 transition count 223
Iterating global reduction 2 with 8 rules applied. Total rules applied 43 place count 275 transition count 223
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 50 place count 275 transition count 216
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 51 place count 274 transition count 215
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 274 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 53 place count 274 transition count 214
Applied a total of 53 rules in 19 ms. Remains 274 /297 variables (removed 23) and now considering 214/244 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8383504595024923082.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15471178054575369874.kers'
[2026-05-25 01:42:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8383504595024923082.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15471178054575369874.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 214 rows 274 cols 681 entries
Finished phase 1 with 141 SingleSign rule and 71 generalized
[2026-05-25 01:42:17] [INFO ] Computed 62 invariants in 2 ms
Computed 62 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15471178054575369874.kers
Total runtime 3 ms.
[2026-05-25 01:42:17] [INFO ] Implicit Places using invariants in 306 ms returned []
[2026-05-25 01:42:17] [INFO ] Invariant cache hit.
[2026-05-25 01:42:18] [INFO ] Implicit Places using invariants and state equation in 728 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1038 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 273/297 places, 214/244 transitions.
Applied a total of 0 rules in 7 ms. Remains 273 /273 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1064 ms. Remains : 273/297 places, 214/244 transitions.
[2026-05-25 01:42:18] [INFO ] Flatten gal took : 9 ms
[2026-05-25 01:42:18] [INFO ] Flatten gal took : 11 ms
[2026-05-25 01:42:18] [INFO ] Input system was already deterministic with 214 transitions.
[2026-05-25 01:42:18] [INFO ] Flatten gal took : 10 ms
[2026-05-25 01:42:18] [INFO ] Flatten gal took : 9 ms
[2026-05-25 01:42:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality8914188260317366796.gal : 3 ms
[2026-05-25 01:42:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality5601886585212637650.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/CTLCardinality8914188260317366796.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5601886585212637650.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 01:42:48] [INFO ] Flatten gal took : 7 ms
[2026-05-25 01:42:48] [INFO ] Applying decomposition
[2026-05-25 01:42:48] [INFO ] Flatten gal took : 5 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/graph12987809827479416390.txt' '-o' '/tmp/graph12987809827479416390.bin' '-w' '/tmp/graph12987809827479416390.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12987809827479416390.bin' '-l' '-1' '-v' '-w' '/tmp/graph12987809827479416390.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:42:48] [INFO ] Decomposing Gal with order
[2026-05-25 01:42:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 01:42:48] [INFO ] Removed a total of 11 redundant transitions.
[2026-05-25 01:42:48] [INFO ] Flatten gal took : 14 ms
[2026-05-25 01:42:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2026-05-25 01:42:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality8719710382059043380.gal : 4 ms
[2026-05-25 01:42:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality8022134109749803735.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/CTLCardinality8719710382059043380.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8022134109749803735.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 297/297 places, 244/244 transitions.
Graph (complete) has 575 edges and 297 vertex of which 291 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 290 transition count 223
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 274 transition count 223
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 33 place count 274 transition count 212
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 55 place count 263 transition count 212
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 63 place count 255 transition count 204
Iterating global reduction 2 with 8 rules applied. Total rules applied 71 place count 255 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 255 transition count 203
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 78 place count 249 transition count 197
Iterating global reduction 3 with 6 rules applied. Total rules applied 84 place count 249 transition count 197
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 7 rules applied. Total rules applied 91 place count 249 transition count 190
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 93 place count 248 transition count 189
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 93 place count 248 transition count 187
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 97 place count 246 transition count 187
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 239 place count 175 transition count 116
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 241 place count 173 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 242 place count 172 transition count 114
Applied a total of 242 rules in 37 ms. Remains 172 /297 variables (removed 125) and now considering 114/244 (removed 130) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13362463457518961097.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-228502928252911445.kers'
[2026-05-25 01:43:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13362463457518961097.kers, --Pflows, --basisKERS=/tmp/petrispot-output-228502928252911445.kers]
Culling duplicate invariants (modulo rational): removing 27 columns.
Culled 27 columns in 0 ms.
// Phase 1: matrix 114 rows 145 cols 396 entries
Finished phase 1 with 87 SingleSign rule and 24 generalized
[2026-05-25 01:43:18] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-228502928252911445.kers
Total runtime 2 ms.
[2026-05-25 01:43:19] [INFO ] Implicit Places using invariants in 302 ms returned []
[2026-05-25 01:43:19] [INFO ] Invariant cache hit.
[2026-05-25 01:43:19] [INFO ] Implicit Places using invariants and state equation in 371 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 675 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 171/297 places, 114/244 transitions.
Applied a total of 0 rules in 5 ms. Remains 171 /171 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 718 ms. Remains : 171/297 places, 114/244 transitions.
[2026-05-25 01:43:19] [INFO ] Flatten gal took : 4 ms
[2026-05-25 01:43:19] [INFO ] Flatten gal took : 4 ms
[2026-05-25 01:43:19] [INFO ] Input system was already deterministic with 114 transitions.
[2026-05-25 01:43:19] [INFO ] Flatten gal took : 4 ms
[2026-05-25 01:43:19] [INFO ] Flatten gal took : 4 ms
[2026-05-25 01:43:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality3169044590736354876.gal : 2 ms
[2026-05-25 01:43:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality5989706521344095314.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/CTLCardinality3169044590736354876.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5989706521344095314.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 01:43:49] [INFO ] Flatten gal took : 5 ms
[2026-05-25 01:43:49] [INFO ] Applying decomposition
[2026-05-25 01:43:49] [INFO ] Flatten gal took : 6 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/graph9319470097806757549.txt' '-o' '/tmp/graph9319470097806757549.bin' '-w' '/tmp/graph9319470097806757549.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9319470097806757549.bin' '-l' '-1' '-v' '-w' '/tmp/graph9319470097806757549.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:43:49] [INFO ] Decomposing Gal with order
[2026-05-25 01:43:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 01:43:49] [INFO ] Removed a total of 16 redundant transitions.
[2026-05-25 01:43:49] [INFO ] Flatten gal took : 15 ms
[2026-05-25 01:43:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 3 ms.
[2026-05-25 01:43:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality2190951966689606002.gal : 4 ms
[2026-05-25 01:43:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality9832647028635975626.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/CTLCardinality2190951966689606002.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9832647028635975626.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,2.91043e+13,4.298,89616,3666,510,203622,1192,339,143140,154,4658,0


Converting to forward existential form...Done !
original formula: EG(EF(((i0.u2.p39==0)&&(i2.u1.p65==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((i0.u2.p39==0)&&(i2.u1.p65==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t74, t95, t98, t99, t102, u51.t2, u51.t104, i0.t9, i0.u2.t16, i0.u2.t17, i0.u2.t18, i...407
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 244/244 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 295 transition count 244
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 14 place count 283 transition count 232
Iterating global reduction 1 with 12 rules applied. Total rules applied 26 place count 283 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 27 place count 283 transition count 231
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 35 place count 275 transition count 223
Iterating global reduction 2 with 8 rules applied. Total rules applied 43 place count 275 transition count 223
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 50 place count 275 transition count 216
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 51 place count 274 transition count 215
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 274 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 53 place count 274 transition count 214
Applied a total of 53 rules in 21 ms. Remains 274 /297 variables (removed 23) and now considering 214/244 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17000489976301489948.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3756363478203353874.kers'
[2026-05-25 01:44:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17000489976301489948.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3756363478203353874.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 214 rows 274 cols 681 entries
Finished phase 1 with 141 SingleSign rule and 71 generalized
[2026-05-25 01:44:19] [INFO ] Computed 62 invariants in 1 ms
Computed 62 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3756363478203353874.kers
Total runtime 2 ms.
[2026-05-25 01:44:20] [INFO ] Implicit Places using invariants in 361 ms returned []
[2026-05-25 01:44:20] [INFO ] Invariant cache hit.
[2026-05-25 01:44:20] [INFO ] Implicit Places using invariants and state equation in 731 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1099 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 273/297 places, 214/244 transitions.
Applied a total of 0 rules in 7 ms. Remains 273 /273 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1127 ms. Remains : 273/297 places, 214/244 transitions.
[2026-05-25 01:44:20] [INFO ] Flatten gal took : 7 ms
[2026-05-25 01:44:20] [INFO ] Flatten gal took : 16 ms
[2026-05-25 01:44:20] [INFO ] Input system was already deterministic with 214 transitions.
[2026-05-25 01:44:20] [INFO ] Flatten gal took : 7 ms
[2026-05-25 01:44:20] [INFO ] Flatten gal took : 7 ms
[2026-05-25 01:44:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality13149347687934372773.gal : 2 ms
[2026-05-25 01:44:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality1414539729783884933.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/CTLCardinality13149347687934372773.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1414539729783884933.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 01:44:51] [INFO ] Flatten gal took : 7 ms
[2026-05-25 01:44:51] [INFO ] Applying decomposition
[2026-05-25 01:44:51] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5071421675596512057.txt' '-o' '/tmp/graph5071421675596512057.bin' '-w' '/tmp/graph5071421675596512057.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5071421675596512057.bin' '-l' '-1' '-v' '-w' '/tmp/graph5071421675596512057.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:44:51] [INFO ] Decomposing Gal with order
[2026-05-25 01:44:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 01:44:51] [INFO ] Removed a total of 10 redundant transitions.
[2026-05-25 01:44:51] [INFO ] Flatten gal took : 20 ms
[2026-05-25 01:44:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 8 ms.
[2026-05-25 01:44:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality11721449658663023725.gal : 8 ms
[2026-05-25 01:44:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality13682086735929770792.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/CTLCardinality11721449658663023725.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13682086735929770792.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 : 297/297 places, 244/244 transitions.
Graph (complete) has 575 edges and 297 vertex of which 287 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 286 transition count 224
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 272 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 271 transition count 223
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 31 place count 271 transition count 212
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 53 place count 260 transition count 212
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 62 place count 251 transition count 203
Iterating global reduction 3 with 9 rules applied. Total rules applied 71 place count 251 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 251 transition count 202
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 79 place count 244 transition count 195
Iterating global reduction 4 with 7 rules applied. Total rules applied 86 place count 244 transition count 195
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 8 rules applied. Total rules applied 94 place count 244 transition count 187
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 96 place count 243 transition count 186
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 96 place count 243 transition count 184
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 100 place count 241 transition count 184
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 6 with 128 rules applied. Total rules applied 228 place count 177 transition count 120
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 230 place count 175 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 231 place count 174 transition count 118
Applied a total of 231 rules in 42 ms. Remains 174 /297 variables (removed 123) and now considering 118/244 (removed 126) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16394586543962084434.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14027599070253795375.kers'
[2026-05-25 01:45:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16394586543962084434.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14027599070253795375.kers]
Culling duplicate invariants (modulo rational): removing 17 columns.
Culled 17 columns in 0 ms.
// Phase 1: matrix 118 rows 157 cols 427 entries
Finished phase 1 with 94 SingleSign rule and 22 generalized
[2026-05-25 01:45:21] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14027599070253795375.kers
Total runtime 1 ms.
[2026-05-25 01:45:21] [INFO ] Implicit Places using invariants in 174 ms returned []
[2026-05-25 01:45:21] [INFO ] Invariant cache hit.
[2026-05-25 01:45:21] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2026-05-25 01:45:21] [INFO ] Redundant transitions in 1 ms returned []
Running 114 sub problems to find dead transitions.
[2026-05-25 01:45:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 2/172 variables, 10/42 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 114 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/174 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 118/292 variables, 174/232 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 5/237 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 5/242 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/292 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 13 (OVERLAPS) 0/292 variables, 2/246 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/292 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 15 (OVERLAPS) 0/292 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 246 constraints, problems are : Problem set: 0 solved, 114 unsolved in 18084 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 13/45 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 2/172 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 2/174 variables, 14/71 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (OVERLAPS) 118/292 variables, 174/246 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 114/360 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/292 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/292 variables, 2/363 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 292/292 variables, and 366 constraints, problems are : Problem set: 0 solved, 114 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 48104ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 48104ms
Starting structural reductions in SI_CTL mode, iteration 1 : 174/297 places, 118/244 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48640 ms. Remains : 174/297 places, 118/244 transitions.
[2026-05-25 01:46:09] [INFO ] Flatten gal took : 4 ms
[2026-05-25 01:46:09] [INFO ] Flatten gal took : 5 ms
[2026-05-25 01:46:09] [INFO ] Input system was already deterministic with 118 transitions.
[2026-05-25 01:46:09] [INFO ] Flatten gal took : 4 ms
[2026-05-25 01:46:09] [INFO ] Flatten gal took : 4 ms
[2026-05-25 01:46:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality13515134351859435016.gal : 2 ms
[2026-05-25 01:46:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality12614852765600084253.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/CTLCardinality13515134351859435016.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12614852765600084253.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 01:46:39] [INFO ] Flatten gal took : 4 ms
[2026-05-25 01:46:39] [INFO ] Applying decomposition
[2026-05-25 01:46:39] [INFO ] Flatten gal took : 4 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/graph12474536724567102462.txt' '-o' '/tmp/graph12474536724567102462.bin' '-w' '/tmp/graph12474536724567102462.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12474536724567102462.bin' '-l' '-1' '-v' '-w' '/tmp/graph12474536724567102462.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:46:39] [INFO ] Decomposing Gal with order
[2026-05-25 01:46:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 01:46:39] [INFO ] Removed a total of 14 redundant transitions.
[2026-05-25 01:46:39] [INFO ] Flatten gal took : 10 ms
[2026-05-25 01:46:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 3 ms.
[2026-05-25 01:46:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality13268567795982393215.gal : 2 ms
[2026-05-25 01:46:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality6398981524454341493.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/CTLCardinality13268567795982393215.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6398981524454341493.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,3.07158e+13,0.575727,16344,1822,449,32323,1409,393,27991,164,5873,0


Converting to forward existential form...Done !
original formula: AF(AG((((((i6.i1.u37.p258==0)||(i6.i3.u28.p217==1))||((u51.p318==0)||(i1.u14.p162==1)))&&((i2.u6.p109==0)||(i6.i2.u31.p259==1)))&&((i1.u9...184
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((((((i6.i1.u37.p258==0)||(i6.i3.u28.p217==1))||((u51.p318==0)||(i1.u14.p162==1)))&&((i...241
Reverse transition relation is NOT exact ! Due to transitions t0, t82, t86, t99, t108, t112, t113, t116, u15.t46, u51.t1, u51.t17, i0.t12, i0.u2.t27, i0.u2...404
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 244/244 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 295 transition count 244
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 14 place count 283 transition count 232
Iterating global reduction 1 with 12 rules applied. Total rules applied 26 place count 283 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 27 place count 283 transition count 231
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 35 place count 275 transition count 223
Iterating global reduction 2 with 8 rules applied. Total rules applied 43 place count 275 transition count 223
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 50 place count 275 transition count 216
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 51 place count 274 transition count 215
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 274 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 53 place count 274 transition count 214
Applied a total of 53 rules in 19 ms. Remains 274 /297 variables (removed 23) and now considering 214/244 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17199541383480658959.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1316521055292927440.kers'
[2026-05-25 01:47:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17199541383480658959.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1316521055292927440.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 214 rows 274 cols 681 entries
Finished phase 1 with 141 SingleSign rule and 71 generalized
[2026-05-25 01:47:10] [INFO ] Computed 62 invariants in 1 ms
Computed 62 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1316521055292927440.kers
Total runtime 2 ms.
[2026-05-25 01:47:10] [INFO ] Implicit Places using invariants in 321 ms returned []
[2026-05-25 01:47:10] [INFO ] Invariant cache hit.
[2026-05-25 01:47:10] [INFO ] Implicit Places using invariants and state equation in 564 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 899 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 273/297 places, 214/244 transitions.
Applied a total of 0 rules in 4 ms. Remains 273 /273 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 922 ms. Remains : 273/297 places, 214/244 transitions.
[2026-05-25 01:47:10] [INFO ] Flatten gal took : 4 ms
[2026-05-25 01:47:11] [INFO ] Flatten gal took : 4 ms
[2026-05-25 01:47:11] [INFO ] Input system was already deterministic with 214 transitions.
[2026-05-25 01:47:11] [INFO ] Flatten gal took : 4 ms
[2026-05-25 01:47:11] [INFO ] Flatten gal took : 5 ms
[2026-05-25 01:47:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality16107151998322273533.gal : 1 ms
[2026-05-25 01:47:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality2635071871239801611.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/CTLCardinality16107151998322273533.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2635071871239801611.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 01:47:41] [INFO ] Flatten gal took : 5 ms
[2026-05-25 01:47:41] [INFO ] Applying decomposition
[2026-05-25 01:47:41] [INFO ] Flatten gal took : 4 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/graph5811542567243298894.txt' '-o' '/tmp/graph5811542567243298894.bin' '-w' '/tmp/graph5811542567243298894.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5811542567243298894.bin' '-l' '-1' '-v' '-w' '/tmp/graph5811542567243298894.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:47:41] [INFO ] Decomposing Gal with order
[2026-05-25 01:47:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 01:47:41] [INFO ] Removed a total of 11 redundant transitions.
[2026-05-25 01:47:41] [INFO ] Flatten gal took : 17 ms
[2026-05-25 01:47:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 20 ms.
[2026-05-25 01:47:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality7153248271558295960.gal : 5 ms
[2026-05-25 01:47:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality3970077953835616043.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/CTLCardinality7153248271558295960.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3970077953835616043.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,2.22275e+19,5.43745,123896,5493,572,295979,4481,684,261628,186,12852,0


Converting to forward existential form...Done !
original formula: AF(AX(AX((AG((i5.u26.p161==1)) * EF(((i11.i1.u69.p310==0)&&(i10.i1.u56.p262==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(!(EX(!((!(E(TRUE U !((i5.u26.p161==1)))) * E(TRUE U ((i11.i1.u69.p310==0)&&(i10.i1.u56.p262=...178
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t56, t87, t158, t175, t176, t208, u27.t79, u29.t76, i2.u12.t109, i3.t119, i3.u5.t124...815
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 297/297 places, 244/244 transitions.
Graph (complete) has 575 edges and 297 vertex of which 287 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 286 transition count 222
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 270 transition count 222
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 33 place count 270 transition count 211
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 55 place count 259 transition count 211
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 64 place count 250 transition count 202
Iterating global reduction 2 with 9 rules applied. Total rules applied 73 place count 250 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 250 transition count 201
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 81 place count 243 transition count 194
Iterating global reduction 3 with 7 rules applied. Total rules applied 88 place count 243 transition count 194
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 8 rules applied. Total rules applied 96 place count 243 transition count 186
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 98 place count 242 transition count 185
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 98 place count 242 transition count 183
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 102 place count 240 transition count 183
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 5 with 136 rules applied. Total rules applied 238 place count 172 transition count 115
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 240 place count 170 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 241 place count 169 transition count 113
Applied a total of 241 rules in 51 ms. Remains 169 /297 variables (removed 128) and now considering 113/244 (removed 131) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4560850689895172349.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16837294208589295604.kers'
[2026-05-25 01:48:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4560850689895172349.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16837294208589295604.kers]
Culling duplicate invariants (modulo rational): removing 18 columns.
Culled 18 columns in 0 ms.
// Phase 1: matrix 113 rows 151 cols 407 entries
Finished phase 1 with 77 SingleSign rule and 34 generalized
[2026-05-25 01:48:11] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-16837294208589295604.kers
Total runtime 13 ms.
[2026-05-25 01:48:11] [INFO ] Implicit Places using invariants in 289 ms returned []
[2026-05-25 01:48:11] [INFO ] Invariant cache hit.
[2026-05-25 01:48:12] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 747 ms to find 0 implicit places.
[2026-05-25 01:48:12] [INFO ] Redundant transitions in 1 ms returned []
Running 108 sub problems to find dead transitions.
[2026-05-25 01:48:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 2/166 variables, 9/40 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 2/168 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 113/281 variables, 168/226 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 7/233 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 1/282 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 12 (OVERLAPS) 0/282 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 234 constraints, problems are : Problem set: 0 solved, 108 unsolved in 16437 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 2/166 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 2/168 variables, 18/65 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 113/281 variables, 168/233 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 108/341 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 12 (OVERLAPS) 1/282 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 282/282 variables, and 345 constraints, problems are : Problem set: 0 solved, 108 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46471ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 46471ms
Starting structural reductions in SI_CTL mode, iteration 1 : 169/297 places, 113/244 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47279 ms. Remains : 169/297 places, 113/244 transitions.
[2026-05-25 01:48:58] [INFO ] Flatten gal took : 5 ms
[2026-05-25 01:48:58] [INFO ] Flatten gal took : 6 ms
[2026-05-25 01:48:58] [INFO ] Input system was already deterministic with 113 transitions.
RANDOM walk for 95 steps (3 resets) in 4 ms. (19 steps per ms) remains 0/1 properties
FORMULA DES-PT-10b-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-25 01:48:58] [INFO ] Flatten gal took : 6 ms
[2026-05-25 01:48:58] [INFO ] Flatten gal took : 5 ms
[2026-05-25 01:48:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10052069040829191698.gal : 1 ms
[2026-05-25 01:48:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17264198091352918132.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/ReachabilityCardinality10052069040829191698.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17264198091352918132.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
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
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 244/244 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 295 transition count 244
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 286 transition count 235
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 286 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 286 transition count 234
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 26 place count 281 transition count 229
Iterating global reduction 2 with 5 rules applied. Total rules applied 31 place count 281 transition count 229
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 35 place count 281 transition count 225
Applied a total of 35 rules in 25 ms. Remains 281 /297 variables (removed 16) and now considering 225/244 (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-15545892741127812791.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11155956642200226317.kers'
[2026-05-25 01:48:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15545892741127812791.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11155956642200226317.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 225 rows 281 cols 709 entries
Finished phase 1 with 147 SingleSign rule and 72 generalized
[2026-05-25 01:48:58] [INFO ] Computed 62 invariants in 3 ms
Computed 62 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-11155956642200226317.kers
Total runtime 5 ms.
[2026-05-25 01:48:58] [INFO ] Implicit Places using invariants in 341 ms returned []
[2026-05-25 01:48:59] [INFO ] Invariant cache hit.
[2026-05-25 01:48:59] [INFO ] Implicit Places using invariants and state equation in 522 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 879 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 280/297 places, 225/244 transitions.
Applied a total of 0 rules in 3 ms. Remains 280 /280 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 907 ms. Remains : 280/297 places, 225/244 transitions.
[2026-05-25 01:48:59] [INFO ] Flatten gal took : 4 ms
[2026-05-25 01:48:59] [INFO ] Flatten gal took : 4 ms
[2026-05-25 01:48:59] [INFO ] Input system was already deterministic with 225 transitions.
[2026-05-25 01:48:59] [INFO ] Flatten gal took : 5 ms
[2026-05-25 01:48:59] [INFO ] Flatten gal took : 4 ms
[2026-05-25 01:48:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality11823076605030841302.gal : 1 ms
[2026-05-25 01:48:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality7753915091283096342.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/CTLCardinality11823076605030841302.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7753915091283096342.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 01:49:29] [INFO ] Flatten gal took : 4 ms
[2026-05-25 01:49:29] [INFO ] Applying decomposition
[2026-05-25 01:49:29] [INFO ] Flatten gal took : 4 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/graph8706197291535586706.txt' '-o' '/tmp/graph8706197291535586706.bin' '-w' '/tmp/graph8706197291535586706.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8706197291535586706.bin' '-l' '-1' '-v' '-w' '/tmp/graph8706197291535586706.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:49:29] [INFO ] Decomposing Gal with order
[2026-05-25 01:49:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 01:49:29] [INFO ] Removed a total of 17 redundant transitions.
[2026-05-25 01:49:29] [INFO ] Flatten gal took : 13 ms
[2026-05-25 01:49:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2026-05-25 01:49:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality6449865137887243757.gal : 3 ms
[2026-05-25 01:49:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality6476709490714109701.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/CTLCardinality6449865137887243757.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6476709490714109701.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,5.70294e+19,2.49086,66752,7645,561,140441,5665,670,156705,170,16720,0


Converting to forward existential form...Done !
original formula: E((A(A((i7.u69.p277==0) U (i8.u60.p269==1)) U !(((((i2.u13.p73==1)||(i6.u2.p3==1))&&((i3.u16.p98==0)||(i2.u9.p43==1))) + AF(((i9.i0.i1.u4...404
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(!((E(!(!(((((i2.u13.p73==1)||(i6.u2.p3==1))&&((i3.u16.p98==0)||(i2.u9.p43==1))) + !(EG(!(((i9....914
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t166, t185, t186, t218, u38.t76, i1.t127, i1.u7.t132, i1.u7.t133, i1.u8.t129, i1.u8....819
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 297/297 places, 244/244 transitions.
Graph (complete) has 575 edges and 297 vertex of which 287 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 286 transition count 222
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 270 transition count 222
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 33 place count 270 transition count 213
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 51 place count 261 transition count 213
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 60 place count 252 transition count 204
Iterating global reduction 2 with 9 rules applied. Total rules applied 69 place count 252 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 252 transition count 203
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 77 place count 245 transition count 196
Iterating global reduction 3 with 7 rules applied. Total rules applied 84 place count 245 transition count 196
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 8 rules applied. Total rules applied 92 place count 245 transition count 188
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 94 place count 244 transition count 187
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 94 place count 244 transition count 185
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 98 place count 242 transition count 185
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 232 place count 175 transition count 118
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 234 place count 173 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 235 place count 172 transition count 116
Applied a total of 235 rules in 31 ms. Remains 172 /297 variables (removed 125) and now considering 116/244 (removed 128) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15092217726145513217.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17776103482992148113.kers'
[2026-05-25 01:49:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15092217726145513217.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17776103482992148113.kers]
Culling duplicate invariants (modulo rational): removing 16 columns.
Culled 16 columns in 0 ms.
// Phase 1: matrix 116 rows 156 cols 419 entries
Finished phase 1 with 85 SingleSign rule and 29 generalized
[2026-05-25 01:49:59] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17776103482992148113.kers
Total runtime 2 ms.
[2026-05-25 01:49:59] [INFO ] Implicit Places using invariants in 170 ms returned []
[2026-05-25 01:49:59] [INFO ] Invariant cache hit.
[2026-05-25 01:50:00] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2026-05-25 01:50:00] [INFO ] Redundant transitions in 2 ms returned []
Running 111 sub problems to find dead transitions.
[2026-05-25 01:50:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 10/35 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (OVERLAPS) 2/169 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (OVERLAPS) 2/171 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 111 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 116/287 variables, 171/229 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (OVERLAPS) 1/288 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/288 variables, 6/238 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/288 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 13 (OVERLAPS) 0/288 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 238 constraints, problems are : Problem set: 0 solved, 111 unsolved in 12500 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 10/35 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 2/169 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 2/171 variables, 12/66 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 116/287 variables, 171/237 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 111/348 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/287 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/287 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 111 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 287/288 variables, and 350 constraints, problems are : Problem set: 0 solved, 111 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 171/172 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42530ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 42532ms
Starting structural reductions in SI_CTL mode, iteration 1 : 172/297 places, 116/244 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43095 ms. Remains : 172/297 places, 116/244 transitions.
[2026-05-25 01:50:42] [INFO ] Flatten gal took : 6 ms
[2026-05-25 01:50:42] [INFO ] Flatten gal took : 5 ms
[2026-05-25 01:50:42] [INFO ] Input system was already deterministic with 116 transitions.
[2026-05-25 01:50:42] [INFO ] Flatten gal took : 5 ms
[2026-05-25 01:50:42] [INFO ] Flatten gal took : 6 ms
[2026-05-25 01:50:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality12881932634210782533.gal : 2 ms
[2026-05-25 01:50:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality14051000621378380104.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/CTLCardinality12881932634210782533.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14051000621378380104.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 01:51:12] [INFO ] Flatten gal took : 3 ms
[2026-05-25 01:51:12] [INFO ] Applying decomposition
[2026-05-25 01:51:12] [INFO ] Flatten gal took : 3 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/graph16175066593082682979.txt' '-o' '/tmp/graph16175066593082682979.bin' '-w' '/tmp/graph16175066593082682979.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16175066593082682979.bin' '-l' '-1' '-v' '-w' '/tmp/graph16175066593082682979.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:51:12] [INFO ] Decomposing Gal with order
[2026-05-25 01:51:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 01:51:12] [INFO ] Removed a total of 8 redundant transitions.
[2026-05-25 01:51:12] [INFO ] Flatten gal took : 8 ms
[2026-05-25 01:51:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2026-05-25 01:51:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality16059619089293917386.gal : 2 ms
[2026-05-25 01:51:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality13654817024065396426.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/CTLCardinality16059619089293917386.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13654817024065396426.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.25441e+13,0.571433,17152,2659,641,36303,1462,323,28029,156,5556,0


Converting to forward existential form...Done !
original formula: (AF(AG((u48.p20!=1))) * EG((((i2.u6.p110==0)||((i6.i0.u23.p192==0)&&(i2.u9.p137==1))) + EF(((u13.p8==0)||(i8.u18.p203==1))))))
=> equivalent forward existential formula: ([FwdG(Init,!(!(E(TRUE U !((u48.p20!=1))))))] = FALSE * [(Init * !(EG((((i2.u6.p110==0)||((i6.i0.u23.p192==0)&&(...229
Reverse transition relation is NOT exact ! Due to transitions t2, t73, t75, t97, t100, t101, t104, u1.t17, u12.t38, u13.t77, u48.t3, u48.t106, i0.t14, i0.u...398
Detected timeout of ITS tools.
[2026-05-25 01:51:43] [INFO ] Flatten gal took : 6 ms
[2026-05-25 01:51:43] [INFO ] Flatten gal took : 5 ms
[2026-05-25 01:51:43] [INFO ] Applying decomposition
[2026-05-25 01:51:43] [INFO ] Flatten gal took : 5 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/graph16970088036043604293.txt' '-o' '/tmp/graph16970088036043604293.bin' '-w' '/tmp/graph16970088036043604293.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16970088036043604293.bin' '-l' '-1' '-v' '-w' '/tmp/graph16970088036043604293.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:51:43] [INFO ] Decomposing Gal with order
[2026-05-25 01:51:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 01:51:43] [INFO ] Removed a total of 23 redundant transitions.
[2026-05-25 01:51:43] [INFO ] Flatten gal took : 13 ms
[2026-05-25 01:51:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2026-05-25 01:51:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality4540242427859374713.gal : 4 ms
[2026-05-25 01:51:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality6389347110697181336.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/CTLCardinality4540242427859374713.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6389347110697181336.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 10 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.40992e+20,11.808,251112,9574,471,576726,2913,703,606143,166,12146,0


Converting to forward existential form...Done !
original formula: EF(EG((EG(((i9.i0.i1.u51.p206==0)||(i12.u84.p312==1))) * (i3.u12.p85==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(EG(((i9.i0.i1.u51.p206==0)||(i12.u84.p312==1))) * (i3.u12.p85==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t55, t94, t136, t179, t201, t202, i0.u39.t80, i1.t77, i2.t142, i2.u8.t138, i2.u8.t140, i2...914
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2026-05-25 02:03:55] [INFO ] Applying decomposition
[2026-05-25 02:03:55] [INFO ] Flatten gal took : 6 ms
[2026-05-25 02:03:55] [INFO ] Decomposing Gal with order
[2026-05-25 02:03:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 02:03:55] [INFO ] Removed a total of 51 redundant transitions.
[2026-05-25 02:03:55] [INFO ] Flatten gal took : 12 ms
[2026-05-25 02:03:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 202 labels/synchronizations in 11 ms.
[2026-05-25 02:03:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality1379455739536211204.gal : 4 ms
[2026-05-25 02:03:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality12474293370693750192.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/CTLCardinality1379455739536211204.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12474293370693750192.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.40992e+20,971.574,11343044,68188,309,1.56127e+07,1852,644,9.763e+07,139,12218,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 02:30:34] [INFO ] Flatten gal took : 13 ms
[2026-05-25 02:30:34] [INFO ] Input system was already deterministic with 244 transitions.
[2026-05-25 02:30:34] [INFO ] Transformed 297 places.
[2026-05-25 02:30:34] [INFO ] Transformed 244 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-25 02:30:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality1651943456467701244.gal : 2 ms
[2026-05-25 02:30:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality4757539632997751924.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/CTLCardinality1651943456467701244.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4757539632997751924.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-10b"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is DES-PT-10b, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r082-smll-177946993700369"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-10b.tgz
mv DES-PT-10b execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;