MCC'2026- Execution of r034-tall-177946841800149

About the Execution of ITS-Tools for BridgeAndVehicles-COL-V80P50N20

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16201.088	3600000.00	3389936.00	228738.40	1 1 1 1 80 80 1 1 ? 80 80 80 80 1 1 1	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r034-tall-177946841800149.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 BridgeAndVehicles-COL-V80P50N20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946841800149
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 8.8K Mar 5 08:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Mar 5 08:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Mar 5 08:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 5 08:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Mar 15 07:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 15 07:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 5 08:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Mar 5 08:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 5 08:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Mar 5 08:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 15 07:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 45K 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 positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779526139940

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V80P50N20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202604301425
[2026-05-23 08:49:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 08:49:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 08:49:01] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2026-05-23 08:49:01] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-23 08:49:01] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 549 ms
[2026-05-23 08:49:01] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 198 PT places and 551698.0 transition bindings in 32 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduction of identical properties reduced properties to check from 16 to 9
[2026-05-23 08:49:01] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2026-05-23 08:49:01] [INFO ] Skeletonized 9 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15898604328822650645.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6381457850652083789.kers'
[2026-05-23 08:49:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15898604328822650645.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6381457850652083789.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 10 rows 12 cols 28 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-23 08:49:01] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-6381457850652083789.kers
Total runtime 9 ms.
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 80, 80] Max Struct:[1, 1, 80, 80, 1, 50, 80, 80, 80]
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-12 80 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-11 80 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-10 80 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2026-05-23 08:49:01] [INFO ] Invariant cache hit.
[2026-05-23 08:49:02] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2026-05-23 08:49:02] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2026-05-23 08:49:02] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-23 08:49:02] [INFO ] Added : 2 causal constraints over 1 iterations in 23 ms. Result :sat
Minimization took 10 ms.
[2026-05-23 08:49:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 08:49:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-23 08:49:02] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2026-05-23 08:49:02] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-23 08:49:02] [INFO ] Added : 2 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 5 ms.
[2026-05-23 08:49:02] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-23 08:49:02] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2026-05-23 08:49:02] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-23 08:49:02] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2026-05-23 08:49:02] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-23 08:49:02] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2026-05-23 08:49:02] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-23 08:49:02] [INFO ] Added : 2 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 4 ms.
[2026-05-23 08:49:02] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-23 08:49:02] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2026-05-23 08:49:02] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-23 08:49:02] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 4 ms.
[2026-05-23 08:49:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 08:49:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-23 08:49:02] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2026-05-23 08:49:02] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-23 08:49:02] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2026-05-23 08:49:02] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-23 08:49:02] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-23 08:49:02] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-23 08:49:02] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 5 ms.
[2026-05-23 08:49:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 08:49:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-23 08:49:02] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-23 08:49:02] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-23 08:49:02] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2026-05-23 08:49:02] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-23 08:49:02] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-23 08:49:02] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-23 08:49:02] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2026-05-23 08:49:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 08:49:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-23 08:49:02] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-23 08:49:02] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-23 08:49:02] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 80, 80, 1, 50, 80]
Arc [1:1*[(MOD (ADD $cA 1) 81)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 81) 81) 81)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 21)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2026-05-23 08:49:02] [INFO ] Unfolded HLPN to a Petri net with 198 places and 3728 transitions 28830 arcs in 148 ms.
[2026-05-23 08:49:02] [INFO ] Unfolded 6 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 80, 80, 1, 50, 80]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 80, 80, 1, 50, 80]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10343534182603149907.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13226864363260833433.kers'
[2026-05-23 08:49:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10343534182603149907.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13226864363260833433.kers]
Normalized transition count is 410 out of 3728 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 410 rows 198 cols 2110 entries
Finished phase 1 with 31 SingleSign rule and 160 generalized
[2026-05-23 08:49:02] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-13226864363260833433.kers
Total runtime 6 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 80, 80, 1, 50, 80]
RANDOM walk for 10000 steps (14 resets) in 344 ms. (28 steps per ms)
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-04 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-09 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-05 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20000 steps (10 resets) in 107 ms. (185 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20] Max Struct:[50]
[2026-05-23 08:49:03] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8607205029804461696.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-253185069668696394.kers'
[2026-05-23 08:49:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8607205029804461696.kers, --Pflows, --basisKERS=/tmp/petrispot-output-253185069668696394.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 410 rows 198 cols 2110 entries
Finished phase 1 with 31 SingleSign rule and 160 generalized
[2026-05-23 08:49:03] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-253185069668696394.kers
Total runtime 4 ms.
[2026-05-23 08:49:03] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-23 08:49:03] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2026-05-23 08:49:03] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 08:49:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-23 08:49:03] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2026-05-23 08:49:03] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 08:49:03] [INFO ] [Nat]Added 42 Read/Feed constraints in 91 ms returned sat
[2026-05-23 08:49:04] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 227 transitions) in 158 ms.
[2026-05-23 08:49:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1867 ms
[2026-05-23 08:49:06] [INFO ] Added : 4 causal constraints over 4 iterations in 2410 ms. Result :sat
Minimization took 217 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20] Max Struct:[50]
Support contains 1 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 3728/3728 transitions.
Graph (complete) has 1962 edges and 198 vertex of which 196 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 195 transition count 3727
Applied a total of 3 rules in 714 ms. Remains 195 /198 variables (removed 3) and now considering 3727/3728 (removed 1) transitions.
Running 3724 sub problems to find dead transitions.
[2026-05-23 08:49:07] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6282878058680370680.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2572156627754300298.kers'
[2026-05-23 08:49:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6282878058680370680.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2572156627754300298.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 409 rows 194 cols 1865 entries
Finished phase 1 with 190 SingleSign rule and 0 generalized
[2026-05-23 08:49:07] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2572156627754300298.kers
Total runtime 2 ms.
[2026-05-23 08:49:07] [INFO ] State equation strengthened by 42 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3724 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 195/604 variables, and 5 constraints, problems are : Problem set: 0 solved, 3724 unsolved in 20088 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/195 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3724/201 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3724 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3724 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 195/604 variables, and 6 constraints, problems are : Problem set: 0 solved, 3724 unsolved in 20068 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/195 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3523/201 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43687ms problems are : Problem set: 0 solved, 3724 unsolved
Search for dead transitions found 0 dead transitions in 43726ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44477 ms. Remains : 195/198 places, 3727/3728 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10841322706100100381.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1030416435337780133.kers'
[2026-05-23 08:49:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10841322706100100381.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1030416435337780133.kers]
Normalized transition count is 409 out of 3727 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 409 rows 194 cols 1865 entries
Finished phase 1 with 190 SingleSign rule and 0 generalized
[2026-05-23 08:49:51] [INFO ] Computed 5 invariants in 3 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1030416435337780133.kers
Total runtime 7 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[20] Max Struct:[50]
RANDOM walk for 1000000 steps (1686 resets) in 13689 ms. (73 steps per ms)
BEST_FIRST walk for 982848 steps (625 resets) in 5001 ms. (196 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20] Max Struct:[50]
[2026-05-23 08:50:09] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10839705157682615716.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-615987646722243681.kers'
[2026-05-23 08:50:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10839705157682615716.kers, --Pflows, --basisKERS=/tmp/petrispot-output-615987646722243681.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 409 rows 194 cols 1865 entries
Finished phase 1 with 190 SingleSign rule and 0 generalized
[2026-05-23 08:50:09] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-615987646722243681.kers
Total runtime 3 ms.
[2026-05-23 08:50:09] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2026-05-23 08:50:09] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2026-05-23 08:50:09] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 08:50:09] [INFO ] [Real]Added 42 Read/Feed constraints in 27 ms returned sat
[2026-05-23 08:50:09] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 08:50:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-23 08:50:10] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2026-05-23 08:50:10] [INFO ] [Nat]Added 42 Read/Feed constraints in 55 ms returned sat
[2026-05-23 08:50:10] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 226 transitions) in 130 ms.
[2026-05-23 08:50:10] [INFO ] Added : 22 causal constraints over 20 iterations in 839 ms. Result :sat
Minimization took 369 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20] Max Struct:[50]
Support contains 1 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 3727/3727 transitions.
Applied a total of 0 rules in 481 ms. Remains 195 /195 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 481 ms. Remains : 195/195 places, 3727/3727 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 3727/3727 transitions.
Applied a total of 0 rules in 433 ms. Remains 195 /195 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
[2026-05-23 08:50:13] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2026-05-23 08:50:13] [INFO ] Invariant cache hit.
[2026-05-23 08:50:13] [INFO ] Implicit Places using invariants in 676 ms returned []
[2026-05-23 08:50:13] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2026-05-23 08:50:13] [INFO ] Invariant cache hit.
[2026-05-23 08:50:13] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 08:50:16] [INFO ] Implicit Places using invariants and state equation in 2931 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3628 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 193/195 places, 3727/3727 transitions.
Applied a total of 0 rules in 418 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4480 ms. Remains : 193/195 places, 3727/3727 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13531465673628092096.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8716982439968512539.kers'
[2026-05-23 08:50:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13531465673628092096.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8716982439968512539.kers]
Normalized transition count is 409 out of 3727 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 409 rows 192 cols 1543 entries
Finished phase 1 with 188 SingleSign rule and 0 generalized
[2026-05-23 08:50:17] [INFO ] Computed 5 invariants in 4 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-8716982439968512539.kers
Total runtime 7 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[20] Max Struct:[50]
RANDOM walk for 1000000 steps (1686 resets) in 13145 ms. (76 steps per ms)
BEST_FIRST walk for 1000001 steps (636 resets) in 4893 ms. (204 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20] Max Struct:[50]
[2026-05-23 08:50:35] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3740507326025866097.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5696962935597393114.kers'
[2026-05-23 08:50:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3740507326025866097.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5696962935597393114.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 409 rows 192 cols 1543 entries
Finished phase 1 with 188 SingleSign rule and 0 generalized
[2026-05-23 08:50:35] [INFO ] Computed 5 invariants in 5 ms
Computed 5 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-5696962935597393114.kers
Total runtime 6 ms.
[2026-05-23 08:50:35] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-23 08:50:35] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2026-05-23 08:50:35] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 08:50:35] [INFO ] [Real]Added 42 Read/Feed constraints in 56 ms returned sat
[2026-05-23 08:50:35] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 08:50:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-23 08:50:35] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2026-05-23 08:50:35] [INFO ] [Nat]Added 42 Read/Feed constraints in 69 ms returned sat
[2026-05-23 08:50:35] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 226 transitions) in 126 ms.
[2026-05-23 08:50:36] [INFO ] Added : 5 causal constraints over 4 iterations in 625 ms. Result :sat
Minimization took 226 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20] Max Struct:[50]
Support contains 1 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 3727/3727 transitions.
Applied a total of 0 rules in 469 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 471 ms. Remains : 193/193 places, 3727/3727 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 3727/3727 transitions.
Applied a total of 0 rules in 478 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
[2026-05-23 08:50:37] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2026-05-23 08:50:37] [INFO ] Invariant cache hit.
[2026-05-23 08:50:38] [INFO ] Implicit Places using invariants in 631 ms returned []
[2026-05-23 08:50:38] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2026-05-23 08:50:38] [INFO ] Invariant cache hit.
[2026-05-23 08:50:38] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 08:50:39] [INFO ] Implicit Places using invariants and state equation in 1426 ms returned []
Implicit Place search using SMT with State Equation took 2059 ms to find 0 implicit places.
[2026-05-23 08:50:39] [INFO ] Redundant transitions in 219 ms returned []
Running 3724 sub problems to find dead transitions.
[2026-05-23 08:50:39] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2026-05-23 08:50:39] [INFO ] Invariant cache hit.
[2026-05-23 08:50:39] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3724 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 193/602 variables, and 6 constraints, problems are : Problem set: 0 solved, 3724 unsolved in 30088 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/193 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3724/201 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3724 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3724 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3724 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 193/602 variables, and 6 constraints, problems are : Problem set: 0 solved, 3724 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/193 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3523/201 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63274ms problems are : Problem set: 0 solved, 3724 unsolved
Search for dead transitions found 0 dead transitions in 63283ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66054 ms. Remains : 193/193 places, 3727/3727 transitions.
RANDOM walk for 40000 steps (64 resets) in 1312 ms. (30 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (24 resets) in 414 ms. (96 steps per ms) remains 2/2 properties
[2026-05-23 08:51:43] [INFO ] Flatten gal took : 408 ms
BEST_FIRST walk for 40004 steps (24 resets) in 334 ms. (119 steps per ms) remains 2/2 properties
[2026-05-23 08:51:43] [INFO ] Flatten gal took : 170 ms
[2026-05-23 08:51:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8907217830917487402.gal : 105 ms
[2026-05-23 08:51:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3749403656279038653.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8907217830917487402.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3749403656279038653.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 ...328
Loading property file /tmp/ReachabilityCardinality3749403656279038653.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 18
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :18 after 36
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :36 after 70
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :70 after 136
Interrupted probabilistic random walk after 143224 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 2
Probabilistic random walk after 143224 steps, saw 42008 distinct states, run finished after 3004 ms. (steps per millisecond=47 ) properties seen :0
[2026-05-23 08:51:46] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2026-05-23 08:51:46] [INFO ] Invariant cache hit.
[2026-05-23 08:51:46] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 207/290 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/294 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/294 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 145/439 variables, 26/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 21/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/439 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/439 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 162/601 variables, 81/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/601 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/601 variables, 21/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/601 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/602 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/602 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :136 after 292
At refinement iteration 22 (OVERLAPS) 0/602 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 602/602 variables, and 242 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1632 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 193/193 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 207/290 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/294 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/294 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/294 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 145/439 variables, 26/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/439 variables, 21/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/439 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/439 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 162/601 variables, 81/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/601 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/601 variables, 21/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/601 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/602 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/602 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/602 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 602/602 variables, and 244 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3337 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 193/193 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4983ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 281 ms.
Support contains 1 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 3727/3727 transitions.
Applied a total of 0 rules in 430 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 431 ms. Remains : 193/193 places, 3727/3727 transitions.
RANDOM walk for 40000 steps (64 resets) in 901 ms. (44 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (24 resets) in 338 ms. (118 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (24 resets) in 290 ms. (137 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :292 after 572
Interrupted probabilistic random walk after 144362 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 2
Probabilistic random walk after 144362 steps, saw 42346 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
[2026-05-23 08:51:56] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2026-05-23 08:51:56] [INFO ] Invariant cache hit.
[2026-05-23 08:51:56] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 207/290 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/294 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/294 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 145/439 variables, 26/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 21/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/439 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/439 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 162/601 variables, 81/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/601 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/601 variables, 21/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/601 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/602 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/602 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/602 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 602/602 variables, and 242 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1518 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 193/193 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 207/290 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/294 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/294 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/294 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 145/439 variables, 26/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/439 variables, 21/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/439 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/439 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 162/601 variables, 81/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/601 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/601 variables, 21/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/601 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/602 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/602 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/602 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 602/602 variables, and 244 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3257 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 193/193 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4785ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 309 ms.
Support contains 1 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 3727/3727 transitions.
Applied a total of 0 rules in 434 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 434 ms. Remains : 193/193 places, 3727/3727 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 3727/3727 transitions.
Applied a total of 0 rules in 425 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
[2026-05-23 08:52:02] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2026-05-23 08:52:02] [INFO ] Invariant cache hit.
[2026-05-23 08:52:02] [INFO ] Implicit Places using invariants in 601 ms returned []
[2026-05-23 08:52:02] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2026-05-23 08:52:02] [INFO ] Invariant cache hit.
[2026-05-23 08:52:02] [INFO ] State equation strengthened by 42 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :572 after 1048
[2026-05-23 08:52:03] [INFO ] Implicit Places using invariants and state equation in 1388 ms returned []
Implicit Place search using SMT with State Equation took 1992 ms to find 0 implicit places.
[2026-05-23 08:52:04] [INFO ] Redundant transitions in 136 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2559 ms. Remains : 193/193 places, 3727/3727 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 3318 transitions
Reduce isomorphic transitions removed 3318 transitions.
Iterating post reduction 0 with 3318 rules applied. Total rules applied 3318 place count 193 transition count 409
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 1 with 4 rules applied. Total rules applied 3322 place count 191 transition count 407
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3324 place count 191 transition count 405
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3326 place count 189 transition count 405
Applied a total of 3326 rules in 24 ms. Remains 189 /193 variables (removed 4) and now considering 405/3727 (removed 3322) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17649974966206695171.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1869333093116473877.kers'
[2026-05-23 08:52:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17649974966206695171.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1869333093116473877.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 405 rows 188 cols 1531 entries
Finished phase 1 with 184 SingleSign rule and 0 generalized
[2026-05-23 08:52:04] [INFO ] Computed 5 invariants in 5 ms
Computed 5 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-1869333093116473877.kers
Total runtime 6 ms.
[2026-05-23 08:52:04] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-23 08:52:04] [INFO ] After 449ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-23 08:52:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-23 08:52:04] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2026-05-23 08:52:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 08:52:04] [INFO ] After 113ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-23 08:52:05] [INFO ] After 248ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-23 08:52:05] [INFO ] After 592ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-23 08:52:05] [INFO ] Flatten gal took : 17 ms
[2026-05-23 08:52:05] [INFO ] Flatten gal took : 15 ms
[2026-05-23 08:52:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6776630087276494709.gal : 8 ms
[2026-05-23 08:52:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9631624137393237441.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6776630087276494709.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9631624137393237441.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 ...328
Loading property file /tmp/ReachabilityCardinality9631624137393237441.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 20
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :20 after 30
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :30 after 56
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :56 after 110
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :110 after 240
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :240 after 5956
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :5956 after 6682
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :6682 after 7461
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :7461 after 35853
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :35853 after 39285
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :39285 after 85297
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :544480 after 704397
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,2.36631e+10,12.9268,336296,2,17370,21,941244,8,0,1171,603434,0
Total reachable state count : 23663100800

Verifying 2 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,272240,12.9308,336296,2,8171,21,941244,8,0,1173,603434,0
Invariant property MIN0 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
MIN0,272240,12.9334,336296,2,8171,21,941244,8,0,1174,603434,0
Over-approximation ignoring read arcs solved 0 properties in 14102 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-23 08:52:18] [INFO ] Flatten gal took : 83 ms
[2026-05-23 08:52:18] [INFO ] Applying decomposition
[2026-05-23 08:52:18] [INFO ] Flatten gal took : 82 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/graph13384869230758262596.txt' '-o' '/tmp/graph13384869230758262596.bin' '-w' '/tmp/graph13384869230758262596.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13384869230758262596.bin' '-l' '-1' '-v' '-w' '/tmp/graph13384869230758262596.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:52:18] [INFO ] Decomposing Gal with order
[2026-05-23 08:52:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:52:20] [INFO ] Removed a total of 6953 redundant transitions.
[2026-05-23 08:52:20] [INFO ] Flatten gal took : 1289 ms
[2026-05-23 08:52:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 477 labels/synchronizations in 53 ms.
[2026-05-23 08:52:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9475287078680740286.gal : 4 ms
[2026-05-23 08:52:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10421237975443398863.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/ReachabilityCardinality9475287078680740286.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10421237975443398863.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/ReachabilityCardinality10421237975443398863.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 26
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :26 after 31
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :31 after 40
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :40 after 57
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :57 after 90
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :90 after 140
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :140 after 413
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :413 after 1572
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1572 after 52721
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :52721 after 149916
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :149916 after 372291
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :372291 after 779704
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :3.84819e+06 after 5.73118e+06
Detected timeout of ITS tools.
Starting property specific reduction for BridgeAndVehicles-COL-V80P50N20-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6663214320320686726.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14024811544545291851.kers'
[2026-05-23 08:53:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6663214320320686726.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14024811544545291851.kers]
Normalized transition count is 409 out of 3727 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 409 rows 192 cols 1543 entries
Finished phase 1 with 188 SingleSign rule and 0 generalized
[2026-05-23 08:53:10] [INFO ] Computed 5 invariants in 9 ms
Computed 5 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-14024811544545291851.kers
Total runtime 14 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (16 resets) in 131 ms. (75 steps per ms)
BEST_FIRST walk for 10001 steps (6 resets) in 46 ms. (212 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20] Max Struct:[50]
[2026-05-23 08:53:10] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11710327645238076324.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13168501839969749834.kers'
[2026-05-23 08:53:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11710327645238076324.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13168501839969749834.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 409 rows 192 cols 1543 entries
Finished phase 1 with 188 SingleSign rule and 0 generalized
[2026-05-23 08:53:10] [INFO ] Computed 5 invariants in 5 ms
Computed 5 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-13168501839969749834.kers
Total runtime 6 ms.
[2026-05-23 08:53:10] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-23 08:53:10] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2026-05-23 08:53:10] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 08:53:11] [INFO ] [Real]Added 42 Read/Feed constraints in 58 ms returned sat
[2026-05-23 08:53:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 08:53:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-23 08:53:11] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2026-05-23 08:53:11] [INFO ] [Nat]Added 42 Read/Feed constraints in 66 ms returned sat
[2026-05-23 08:53:11] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 226 transitions) in 55 ms.
[2026-05-23 08:53:11] [INFO ] Added : 5 causal constraints over 4 iterations in 541 ms. Result :sat
Minimization took 222 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20] Max Struct:[50]
Support contains 1 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 3727/3727 transitions.
Applied a total of 0 rules in 443 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 444 ms. Remains : 193/193 places, 3727/3727 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3233651640851845240.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14886986505028116318.kers'
[2026-05-23 08:53:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3233651640851845240.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14886986505028116318.kers]
Normalized transition count is 409 out of 3727 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 409 rows 192 cols 1543 entries
Finished phase 1 with 188 SingleSign rule and 0 generalized
[2026-05-23 08:53:12] [INFO ] Computed 5 invariants in 8 ms
Computed 5 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-14886986505028116318.kers
Total runtime 14 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[20] Max Struct:[50]
RANDOM walk for 1000000 steps (1686 resets) in 12676 ms. (78 steps per ms)
BEST_FIRST walk for 1000000 steps (636 resets) in 4748 ms. (210 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20] Max Struct:[50]
[2026-05-23 08:53:29] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8897514876953351364.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7670552875420257350.kers'
[2026-05-23 08:53:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8897514876953351364.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7670552875420257350.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 409 rows 192 cols 1543 entries
Finished phase 1 with 188 SingleSign rule and 0 generalized
[2026-05-23 08:53:29] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7670552875420257350.kers
Total runtime 2 ms.
[2026-05-23 08:53:29] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-23 08:53:30] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2026-05-23 08:53:30] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 08:53:30] [INFO ] [Real]Added 42 Read/Feed constraints in 53 ms returned sat
[2026-05-23 08:53:30] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 08:53:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 08:53:30] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2026-05-23 08:53:30] [INFO ] [Nat]Added 42 Read/Feed constraints in 66 ms returned sat
[2026-05-23 08:53:30] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 226 transitions) in 52 ms.
[2026-05-23 08:53:30] [INFO ] Added : 5 causal constraints over 4 iterations in 544 ms. Result :sat
Minimization took 230 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20] Max Struct:[50]
Support contains 1 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 3727/3727 transitions.
Applied a total of 0 rules in 444 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 444 ms. Remains : 193/193 places, 3727/3727 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 3727/3727 transitions.
Applied a total of 0 rules in 431 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
[2026-05-23 08:53:32] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2026-05-23 08:53:32] [INFO ] Invariant cache hit.
[2026-05-23 08:53:32] [INFO ] Implicit Places using invariants in 636 ms returned []
[2026-05-23 08:53:32] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2026-05-23 08:53:32] [INFO ] Invariant cache hit.
[2026-05-23 08:53:32] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 08:53:34] [INFO ] Implicit Places using invariants and state equation in 1404 ms returned []
Implicit Place search using SMT with State Equation took 2043 ms to find 0 implicit places.
[2026-05-23 08:53:34] [INFO ] Redundant transitions in 246 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2730 ms. Remains : 193/193 places, 3727/3727 transitions.
[2026-05-23 08:53:34] [INFO ] Flatten gal took : 148 ms
RANDOM walk for 40000 steps (64 resets) in 1262 ms. (31 steps per ms) remains 2/2 properties
[2026-05-23 08:53:34] [INFO ] Flatten gal took : 181 ms
[2026-05-23 08:53:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9792441951810302103.gal : 49 ms
[2026-05-23 08:53:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9527104556540524941.prop : 20 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9792441951810302103.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9527104556540524941.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 ...328
BEST_FIRST walk for 40003 steps (24 resets) in 443 ms. (90 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (24 resets) in 395 ms. (101 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality9527104556540524941.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 18
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :18 after 36
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :36 after 70
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :70 after 136
Interrupted probabilistic random walk after 147049 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 2
Probabilistic random walk after 147049 steps, saw 43011 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
[2026-05-23 08:53:37] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2026-05-23 08:53:37] [INFO ] Invariant cache hit.
[2026-05-23 08:53:37] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 207/290 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/294 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/294 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 145/439 variables, 26/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 21/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/439 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/439 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :136 after 292
At refinement iteration 16 (OVERLAPS) 162/601 variables, 81/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/601 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/601 variables, 21/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/601 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/602 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/602 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/602 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 602/602 variables, and 242 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1681 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 193/193 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 207/290 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/294 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/294 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/294 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 145/439 variables, 26/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/439 variables, 21/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/439 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/439 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 162/601 variables, 81/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/601 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/601 variables, 21/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/601 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/602 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/602 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/602 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 602/602 variables, and 244 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3304 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 193/193 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5009ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 329 ms.
Support contains 1 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 3727/3727 transitions.
Applied a total of 0 rules in 433 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 435 ms. Remains : 193/193 places, 3727/3727 transitions.
RANDOM walk for 40000 steps (64 resets) in 776 ms. (51 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (24 resets) in 321 ms. (124 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (24 resets) in 279 ms. (142 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :292 after 572
Interrupted probabilistic random walk after 150137 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 2
Probabilistic random walk after 150137 steps, saw 43851 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
[2026-05-23 08:53:47] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2026-05-23 08:53:47] [INFO ] Invariant cache hit.
[2026-05-23 08:53:47] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 207/290 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/294 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/294 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 145/439 variables, 26/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 21/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/439 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/439 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 162/601 variables, 81/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/601 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/601 variables, 21/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/601 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/602 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/602 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/602 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 602/602 variables, and 242 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1490 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 193/193 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 207/290 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/294 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/294 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/294 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 145/439 variables, 26/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/439 variables, 21/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/439 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/439 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 162/601 variables, 81/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/601 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/601 variables, 21/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/601 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/602 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/602 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/602 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 602/602 variables, and 244 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3282 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 193/193 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4781ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 402 ms.
Support contains 1 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 3727/3727 transitions.
Applied a total of 0 rules in 440 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 441 ms. Remains : 193/193 places, 3727/3727 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 3727/3727 transitions.
Applied a total of 0 rules in 453 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
[2026-05-23 08:53:53] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2026-05-23 08:53:53] [INFO ] Invariant cache hit.
[2026-05-23 08:53:53] [INFO ] Implicit Places using invariants in 612 ms returned []
[2026-05-23 08:53:53] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2026-05-23 08:53:53] [INFO ] Invariant cache hit.
[2026-05-23 08:53:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 08:53:55] [INFO ] Implicit Places using invariants and state equation in 1494 ms returned []
Implicit Place search using SMT with State Equation took 2108 ms to find 0 implicit places.
[2026-05-23 08:53:55] [INFO ] Redundant transitions in 138 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2710 ms. Remains : 193/193 places, 3727/3727 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 3318 transitions
Reduce isomorphic transitions removed 3318 transitions.
Iterating post reduction 0 with 3318 rules applied. Total rules applied 3318 place count 193 transition count 409
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 1 with 4 rules applied. Total rules applied 3322 place count 191 transition count 407
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3324 place count 191 transition count 405
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3326 place count 189 transition count 405
Applied a total of 3326 rules in 24 ms. Remains 189 /193 variables (removed 4) and now considering 405/3727 (removed 3322) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18221669330468515479.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13234159747759102305.kers'
[2026-05-23 08:53:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18221669330468515479.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13234159747759102305.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 405 rows 188 cols 1531 entries
Finished phase 1 with 184 SingleSign rule and 0 generalized
[2026-05-23 08:53:55] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13234159747759102305.kers
Total runtime 3 ms.
[2026-05-23 08:53:55] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :572 after 1048
[2026-05-23 08:53:56] [INFO ] After 435ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-23 08:53:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 08:53:56] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2026-05-23 08:53:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 08:53:56] [INFO ] After 115ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-23 08:53:56] [INFO ] After 257ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-23 08:53:56] [INFO ] After 600ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-23 08:53:56] [INFO ] Flatten gal took : 11 ms
[2026-05-23 08:53:56] [INFO ] Flatten gal took : 14 ms
[2026-05-23 08:53:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality172079070404012601.gal : 2 ms
[2026-05-23 08:53:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11737600142563280073.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/ReachabilityCardinality172079070404012601.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11737600142563280073.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 ...328
Loading property file /tmp/ReachabilityCardinality11737600142563280073.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 20
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :20 after 30
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :30 after 56
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :56 after 110
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :110 after 240
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :240 after 5956
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :5956 after 6682
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :6682 after 7461
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :7461 after 35853
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :35853 after 39285
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :39285 after 85297
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :544480 after 704397
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,2.36631e+10,12.7315,335816,2,17370,21,941244,8,0,1171,603434,0
Total reachable state count : 23663100800

Verifying 2 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,272240,12.7355,335816,2,8171,21,941244,8,0,1173,603434,0
Invariant property MIN0 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
MIN0,272240,12.7381,335816,2,8171,21,941244,8,0,1174,603434,0
Over-approximation ignoring read arcs solved 0 properties in 13886 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-23 08:54:09] [INFO ] Flatten gal took : 55 ms
[2026-05-23 08:54:09] [INFO ] Applying decomposition
[2026-05-23 08:54:09] [INFO ] Flatten gal took : 55 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/graph5571526948384306433.txt' '-o' '/tmp/graph5571526948384306433.bin' '-w' '/tmp/graph5571526948384306433.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5571526948384306433.bin' '-l' '-1' '-v' '-w' '/tmp/graph5571526948384306433.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:54:09] [INFO ] Decomposing Gal with order
[2026-05-23 08:54:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:54:10] [INFO ] Removed a total of 6953 redundant transitions.
[2026-05-23 08:54:10] [INFO ] Flatten gal took : 891 ms
[2026-05-23 08:54:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 477 labels/synchronizations in 49 ms.
[2026-05-23 08:54:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16721487620395526449.gal : 2 ms
[2026-05-23 08:54:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14376344019037831005.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/ReachabilityCardinality16721487620395526449.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14376344019037831005.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/ReachabilityCardinality14376344019037831005.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 22
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :22 after 47
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :47 after 92
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :92 after 177
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :177 after 342
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :342 after 592
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :592 after 1088
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1088 after 11526
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :11526 after 71121
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :71121 after 110237
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :110237 after 232219
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :232219 after 478902
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :921422 after 1.55223e+06
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :4.05456e+07 after 5.02416e+07
Detected timeout of ITS tools.
Ending property specific reduction for BridgeAndVehicles-COL-V80P50N20-UpperBounds-08 in 110479 ms.
[2026-05-23 08:55:01] [INFO ] Flatten gal took : 63 ms
[2026-05-23 08:55:01] [INFO ] Applying decomposition
[2026-05-23 08:55:01] [INFO ] Flatten gal took : 54 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/graph17195433756907599112.txt' '-o' '/tmp/graph17195433756907599112.bin' '-w' '/tmp/graph17195433756907599112.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17195433756907599112.bin' '-l' '-1' '-v' '-w' '/tmp/graph17195433756907599112.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:55:01] [INFO ] Decomposing Gal with order
[2026-05-23 08:55:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:55:02] [INFO ] Removed a total of 6953 redundant transitions.
[2026-05-23 08:55:02] [INFO ] Flatten gal took : 801 ms
[2026-05-23 08:55:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 477 labels/synchronizations in 34 ms.
[2026-05-23 08:55:02] [INFO ] Time to serialize gal into /tmp/UpperBounds9481096131069557698.gal : 2 ms
[2026-05-23 08:55:02] [INFO ] Time to serialize properties into /tmp/UpperBounds6947157038994203165.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/UpperBounds9481096131069557698.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6947157038994203165.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 ...283
Loading property file /tmp/UpperBounds6947157038994203165.prop.
Detected timeout of ITS tools.
[2026-05-23 09:17:02] [INFO ] Applying decomposition
[2026-05-23 09:17:02] [INFO ] Flatten gal took : 53 ms
[2026-05-23 09:17:02] [INFO ] Decomposing Gal with order
[2026-05-23 09:17:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:17:03] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to CAPACITE in partition [CONTROLEUR_0, CHOIX_0, VIDANGE_0],[CONTROLEUR_1, CHOIX_1, VIDANGE_1],[COMPTEUR_0],[COMPTEUR_1],[COMPTEUR_2],[COMPTEUR_3],[COMPTEUR_4],[COMPTEUR_5],[COMPTEUR_6],[COMPTEUR_7],[COMPTEUR_8],[COMPTEUR_9],[COMPTEUR_10],[COMPTEUR_11],[COMPTEUR_12],[COMPTEUR_13],[COMPTEUR_14],[COMPTEUR_15],[COMPTEUR_16],[COMPTEUR_17],[COMPTEUR_18],[COMPTEUR_19],[COMPTEUR_20],[NB_ATTENTE_A_0],[NB_ATTENTE_A_1],[NB_ATTENTE_A_2],[NB_ATTENTE_A_3],[NB_ATTENTE_A_4],[NB_ATTENTE_A_5],[NB_ATTENTE_A_6],[NB_ATTENTE_A_7],[NB_ATTENTE_A_8],[NB_ATTENTE_A_9],[NB_ATTENTE_A_10],[NB_ATTENTE_A_11],[NB_ATTENTE_A_12],[NB_ATTENTE_A_13],[NB_ATTENTE_A_14],[NB_ATTENTE_A_15],[NB_ATTENTE_A_16],[NB_ATTENTE_A_17],[NB_ATTENTE_A_18],[NB_ATTENTE_A_19],[NB_ATTENTE_A_20],[NB_ATTENTE_A_21],[NB_ATTENTE_A_22],[NB_ATTENTE_A_23],[NB_ATTENTE_A_24],[NB_ATTENTE_A_25],[NB_ATTENTE_A_26],[NB_ATTENTE_A_27],[NB_ATTENTE_A_28],[NB_ATTENTE_A_29],[NB_ATTENTE_A_30],[NB_ATTENTE_A_31],[NB_ATTENTE_A_32],[NB_ATTENTE_A_33],[NB_ATTENTE_A_34],[NB_ATTENTE_A_35],[NB_ATTENTE_A_36],[NB_ATTENTE_A_37],[NB_ATTENTE_A_38],[NB_ATTENTE_A_39],[NB_ATTENTE_A_40],[NB_ATTENTE_A_41],[NB_ATTENTE_A_42],[NB_ATTENTE_A_43],[NB_ATTENTE_A_44],[NB_ATTENTE_A_45],[NB_ATTENTE_A_46],[NB_ATTENTE_A_47],[NB_ATTENTE_A_48],[NB_ATTENTE_A_49],[NB_ATTENTE_A_50],[NB_ATTENTE_A_51],[NB_ATTENTE_A_52],[NB_ATTENTE_A_53],[NB_ATTENTE_A_54],[NB_ATTENTE_A_55],[NB_ATTENTE_A_56],[NB_ATTENTE_A_57],[NB_ATTENTE_A_58],[NB_ATTENTE_A_59],[NB_ATTENTE_A_60],[NB_ATTENTE_A_61],[NB_ATTENTE_A_62],[NB_ATTENTE_A_63],[NB_ATTENTE_A_64],[NB_ATTENTE_A_65],[NB_ATTENTE_A_66],[NB_ATTENTE_A_67],[NB_ATTENTE_A_68],[NB_ATTENTE_A_69],[NB_ATTENTE_A_70],[NB_ATTENTE_A_71],[NB_ATTENTE_A_72],[NB_ATTENTE_A_73],[NB_ATTENTE_A_74],[NB_ATTENTE_A_75],[NB_ATTENTE_A_76],[NB_ATTENTE_A_77],[NB_ATTENTE_A_78],[NB_ATTENTE_A_79],[NB_ATTENTE_A_80],[NB_ATTENTE_B_0],[NB_ATTENTE_B_1],[NB_ATTENTE_B_2],[NB_ATTENTE_B_3],[NB_ATTENTE_B_4],[NB_ATTENTE_B_5],[NB_ATTENTE_B_6],[NB_ATTENTE_B_7],[NB_ATTENTE_B_8],[NB_ATTENTE_B_9],[NB_ATTENTE_B_10],[NB_ATTENTE_B_11],[NB_ATTENTE_B_12],[NB_ATTENTE_B_13],[NB_ATTENTE_B_14],[NB_ATTENTE_B_15],[NB_ATTENTE_B_16],[NB_ATTENTE_B_17],[NB_ATTENTE_B_18],[NB_ATTENTE_B_19],[NB_ATTENTE_B_20],[NB_ATTENTE_B_21],[NB_ATTENTE_B_22],[NB_ATTENTE_B_23],[NB_ATTENTE_B_24],[NB_ATTENTE_B_25],[NB_ATTENTE_B_26],[NB_ATTENTE_B_27],[NB_ATTENTE_B_28],[NB_ATTENTE_B_29],[NB_ATTENTE_B_30],[NB_ATTENTE_B_31],[NB_ATTENTE_B_32],[NB_ATTENTE_B_33],[NB_ATTENTE_B_34],[NB_ATTENTE_B_35],[NB_ATTENTE_B_36],[NB_ATTENTE_B_37],[NB_ATTENTE_B_38],[NB_ATTENTE_B_39],[NB_ATTENTE_B_40],[NB_ATTENTE_B_41],[NB_ATTENTE_B_42],[NB_ATTENTE_B_43],[NB_ATTENTE_B_44],[NB_ATTENTE_B_45],[NB_ATTENTE_B_46],[NB_ATTENTE_B_47],[NB_ATTENTE_B_48],[NB_ATTENTE_B_49],[NB_ATTENTE_B_50],[NB_ATTENTE_B_51],[NB_ATTENTE_B_52],[NB_ATTENTE_B_53],[NB_ATTENTE_B_54],[NB_ATTENTE_B_55],[NB_ATTENTE_B_56],[NB_ATTENTE_B_57],[NB_ATTENTE_B_58],[NB_ATTENTE_B_59],[NB_ATTENTE_B_60],[NB_ATTENTE_B_61],[NB_ATTENTE_B_62],[NB_ATTENTE_B_63],[NB_ATTENTE_B_64],[NB_ATTENTE_B_65],[NB_ATTENTE_B_66],[NB_ATTENTE_B_67],[NB_ATTENTE_B_68],[NB_ATTENTE_B_69],[NB_ATTENTE_B_70],[NB_ATTENTE_B_71],[NB_ATTENTE_B_72],[NB_ATTENTE_B_73],[NB_ATTENTE_B_74],[NB_ATTENTE_B_75],[NB_ATTENTE_B_76],[NB_ATTENTE_B_77],[NB_ATTENTE_B_78],[NB_ATTENTE_B_79],[NB_ATTENTE_B_80],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:834)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-23 09:17:03] [INFO ] Flatten gal took : 54 ms
[2026-05-23 09:17:03] [INFO ] Time to serialize gal into /tmp/UpperBounds18087426949476838734.gal : 18 ms
[2026-05-23 09:17:03] [INFO ] Time to serialize properties into /tmp/UpperBounds14388657121214209214.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/UpperBounds18087426949476838734.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14388657121214209214.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 ...306
Loading property file /tmp/UpperBounds14388657121214209214.prop.
Detected timeout of ITS tools.
[2026-05-23 09:39:11] [INFO ] Flatten gal took : 647 ms
[2026-05-23 09:39:16] [INFO ] Input system was already deterministic with 3727 transitions.
[2026-05-23 09:39:16] [INFO ] Transformed 193 places.
[2026-05-23 09:39:16] [INFO ] Transformed 3727 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-23 09:39:17] [INFO ] Time to serialize gal into /tmp/UpperBounds17315499350181658953.gal : 19 ms
[2026-05-23 09:39:17] [INFO ] Time to serialize properties into /tmp/UpperBounds15282336777953100860.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/UpperBounds17315499350181658953.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15282336777953100860.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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 ...351
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds15282336777953100860.prop.

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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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 UpperBounds -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="BridgeAndVehicles-COL-V80P50N20"
export BK_EXAMINATION="UpperBounds"
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 BridgeAndVehicles-COL-V80P50N20, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r034-tall-177946841800149"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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