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-177946841800229.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-PT-V50P20N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946841800229
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 23K Mar 5 08:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 147K Mar 5 08:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 161K Mar 5 08:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 635K Mar 5 08:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.9K Mar 15 07:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Mar 15 07:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 120K Mar 15 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 366K Mar 15 07:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 57K Mar 5 08:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 343K Mar 5 08:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 349K Mar 5 08:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.4M Mar 5 08:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Mar 15 07:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.2K Mar 15 07:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1.1M 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-PT-V50P20N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779544932163

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P20N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-23 14:02:13] [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 14:02:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 14:02:13] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2026-05-23 14:02:13] [INFO ] Transformed 128 places.
[2026-05-23 14:02:13] [INFO ] Transformed 1328 transitions.
[2026-05-23 14:02:13] [INFO ] Parsed PT model containing 128 places and 1328 transitions and 10010 arcs in 247 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 12
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 20, 1, 50] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 20, 1, 50] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5198320139351178925.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16468677044848926885.kers'
[2026-05-23 14:02:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5198320139351178925.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16468677044848926885.kers]
Normalized transition count is 250 out of 1328 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 250 rows 128 cols 1290 entries
Finished phase 1 with 21 SingleSign rule and 100 generalized
[2026-05-23 14:02:13] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16468677044848926885.kers
Total runtime 4 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 20, 1, 50] Max Struct:[20, 2, 50, 50, 50, 20, 1, 20, 1, 50]
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-15 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-11 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (22 resets) in 178 ms. (55 steps per ms)
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-13 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-05 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-03 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-08 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-06 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (25 resets) in 119 ms. (250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 1, 10] Max Struct:[20, 2, 20]
[2026-05-23 14:02:14] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10718344134823204517.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5295124497827226159.kers'
[2026-05-23 14:02:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10718344134823204517.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5295124497827226159.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 250 rows 128 cols 1290 entries
Finished phase 1 with 21 SingleSign rule and 100 generalized
[2026-05-23 14:02:14] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5295124497827226159.kers
Total runtime 3 ms.
[2026-05-23 14:02:14] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-23 14:02:14] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2026-05-23 14:02:14] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 14:02:14] [INFO ] [Real]Added 22 Read/Feed constraints in 21 ms returned sat
[2026-05-23 14:02:14] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 14:02:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-23 14:02:14] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2026-05-23 14:02:14] [INFO ] [Nat]Added 22 Read/Feed constraints in 22 ms returned sat
[2026-05-23 14:02:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 328 ms
[2026-05-23 14:02:15] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 87 ms.
[2026-05-23 14:02:15] [INFO ] Added : 10 causal constraints over 2 iterations in 210 ms. Result :sat
Minimization took 120 ms.
[2026-05-23 14:02:15] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2026-05-23 14:02:15] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2026-05-23 14:02:15] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2026-05-23 14:02:15] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 14:02:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-23 14:02:15] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2026-05-23 14:02:15] [INFO ] [Nat]Added 22 Read/Feed constraints in 18 ms returned sat
[2026-05-23 14:02:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2026-05-23 14:02:15] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 43 ms.
[2026-05-23 14:02:15] [INFO ] Added : 12 causal constraints over 10 iterations in 235 ms. Result :sat
Minimization took 101 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 1, 10] Max Struct:[20, 1, 20]
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[20, 20]
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Graph (complete) has 1222 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 216 ms. Remains 126 /128 variables (removed 2) and now considering 1328/1328 (removed 0) transitions.
Running 1325 sub problems to find dead transitions.
[2026-05-23 14:02:16] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13641251272125786920.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3725665309753613249.kers'
[2026-05-23 14:02:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13641251272125786920.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3725665309753613249.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 250 rows 126 cols 1288 entries
Finished phase 1 with 121 SingleSign rule and 0 generalized
[2026-05-23 14:02:16] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-3725665309753613249.kers
Total runtime 4 ms.
[2026-05-23 14:02:16] [INFO ] State equation strengthened by 22 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1325 unsolved
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD717 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 2/7 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/376 variables, and 7 constraints, problems are : Problem set: 100 solved, 1225 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/126 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1325/1124 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 2/7 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/7 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 3 (OVERLAPS) 250/376 variables, 126/133 constraints. Problems are: Problem set: 102 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 22/155 constraints. Problems are: Problem set: 102 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/376 variables, and 1277 constraints, problems are : Problem set: 102 solved, 1223 unsolved in 21454 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 126/126 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1223/1124 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43916ms problems are : Problem set: 102 solved, 1223 unsolved
Search for dead transitions found 102 dead transitions in 43947ms
Found 102 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 102 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 126/128 places, 1226/1328 transitions.
Applied a total of 0 rules in 70 ms. Remains 126 /126 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44298 ms. Remains : 126/128 places, 1226/1328 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15735493293760820458.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5886683527057241030.kers'
[2026-05-23 14:03:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15735493293760820458.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5886683527057241030.kers]
Normalized transition count is 246 out of 1226 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 246 rows 126 cols 1276 entries
Finished phase 1 with 118 SingleSign rule and 1 generalized
[2026-05-23 14:03:00] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-5886683527057241030.kers
Total runtime 5 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[10, 10] Max Struct:[20, 20]
RANDOM walk for 1000000 steps (2273 resets) in 4528 ms. (220 steps per ms)
BEST_FIRST walk for 2000001 steps (1680 resets) in 3296 ms. (606 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10] Max Struct:[20, 20]
[2026-05-23 14:03:08] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16024805559468684650.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13298008707638811676.kers'
[2026-05-23 14:03:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16024805559468684650.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13298008707638811676.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 246 rows 126 cols 1276 entries
Finished phase 1 with 118 SingleSign rule and 1 generalized
[2026-05-23 14:03:08] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-13298008707638811676.kers
Total runtime 6 ms.
[2026-05-23 14:03:08] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-23 14:03:08] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2026-05-23 14:03:08] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 14:03:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-23 14:03:08] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2026-05-23 14:03:08] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 14:03:08] [INFO ] [Nat]Added 20 Read/Feed constraints in 20 ms returned sat
[2026-05-23 14:03:08] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 135 transitions) in 29 ms.
[2026-05-23 14:03:08] [INFO ] Added : 10 causal constraints over 2 iterations in 153 ms. Result :sat
Minimization took 135 ms.
[2026-05-23 14:03:09] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-23 14:03:09] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2026-05-23 14:03:09] [INFO ] [Real]Added 20 Read/Feed constraints in 13 ms returned sat
[2026-05-23 14:03:09] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 14:03:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-23 14:03:09] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2026-05-23 14:03:09] [INFO ] [Nat]Added 20 Read/Feed constraints in 17 ms returned sat
[2026-05-23 14:03:09] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 135 transitions) in 28 ms.
[2026-05-23 14:03:09] [INFO ] Added : 12 causal constraints over 10 iterations in 261 ms. Result :sat
Minimization took 102 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10] Max Struct:[20, 20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[20, 20]
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 1226/1226 transitions.
Applied a total of 0 rules in 55 ms. Remains 126 /126 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 126/126 places, 1226/1226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 1226/1226 transitions.
Applied a total of 0 rules in 57 ms. Remains 126 /126 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
[2026-05-23 14:03:10] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 14:03:10] [INFO ] Invariant cache hit.
[2026-05-23 14:03:10] [INFO ] Implicit Places using invariants in 286 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 293 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 124/126 places, 1226/1226 transitions.
Applied a total of 0 rules in 53 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 404 ms. Remains : 124/126 places, 1226/1226 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16233546671696944664.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10487762134335413614.kers'
[2026-05-23 14:03:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16233546671696944664.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10487762134335413614.kers]
Normalized transition count is 246 out of 1226 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 246 rows 124 cols 1076 entries
Finished phase 1 with 119 SingleSign rule and 0 generalized
[2026-05-23 14:03:10] [INFO ] Computed 5 invariants in 3 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-10487762134335413614.kers
Total runtime 6 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[10, 10] Max Struct:[20, 20]
RANDOM walk for 1000000 steps (2273 resets) in 3999 ms. (250 steps per ms)
BEST_FIRST walk for 2000001 steps (1681 resets) in 2907 ms. (687 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10] Max Struct:[20, 20]
[2026-05-23 14:03:17] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2576584518522613649.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4608705394106183741.kers'
[2026-05-23 14:03:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2576584518522613649.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4608705394106183741.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 246 rows 124 cols 1076 entries
Finished phase 1 with 119 SingleSign rule and 0 generalized
[2026-05-23 14:03:17] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4608705394106183741.kers
Total runtime 3 ms.
[2026-05-23 14:03:17] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-23 14:03:17] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2026-05-23 14:03:17] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 14:03:17] [INFO ] [Real]Added 20 Read/Feed constraints in 12 ms returned sat
[2026-05-23 14:03:17] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 14:03:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 14:03:17] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2026-05-23 14:03:17] [INFO ] [Nat]Added 20 Read/Feed constraints in 16 ms returned sat
[2026-05-23 14:03:17] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 135 transitions) in 19 ms.
[2026-05-23 14:03:17] [INFO ] Added : 10 causal constraints over 2 iterations in 132 ms. Result :sat
Minimization took 142 ms.
[2026-05-23 14:03:18] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-23 14:03:18] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2026-05-23 14:03:18] [INFO ] [Real]Added 20 Read/Feed constraints in 9 ms returned sat
[2026-05-23 14:03:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 14:03:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 14:03:18] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2026-05-23 14:03:18] [INFO ] [Nat]Added 20 Read/Feed constraints in 16 ms returned sat
[2026-05-23 14:03:18] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 135 transitions) in 19 ms.
[2026-05-23 14:03:18] [INFO ] Added : 6 causal constraints over 6 iterations in 314 ms. Result :sat
Minimization took 161 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10] Max Struct:[20, 20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[20, 20]
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Applied a total of 0 rules in 59 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 124/124 places, 1226/1226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Applied a total of 0 rules in 49 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
[2026-05-23 14:03:19] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 14:03:19] [INFO ] Invariant cache hit.
[2026-05-23 14:03:19] [INFO ] Implicit Places using invariants in 230 ms returned []
[2026-05-23 14:03:19] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 14:03:19] [INFO ] Invariant cache hit.
[2026-05-23 14:03:19] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 14:03:20] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 777 ms to find 0 implicit places.
[2026-05-23 14:03:20] [INFO ] Redundant transitions in 59 ms returned []
Running 1223 sub problems to find dead transitions.
[2026-05-23 14:03:20] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 14:03:20] [INFO ] Invariant cache hit.
[2026-05-23 14:03:20] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/370 variables, and 6 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1222 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1372 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 31045 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1222 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62997ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 63001ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63896 ms. Remains : 124/124 places, 1226/1226 transitions.
RANDOM walk for 40000 steps (88 resets) in 751 ms. (53 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (32 resets) in 256 ms. (155 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (32 resets) in 315 ms. (126 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (32 resets) in 183 ms. (217 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (32 resets) in 167 ms. (238 steps per ms) remains 4/4 properties
[2026-05-23 14:04:23] [INFO ] Flatten gal took : 232 ms
[2026-05-23 14:04:23] [INFO ] Flatten gal took : 144 ms
[2026-05-23 14:04:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12274124111580787268.gal : 59 ms
[2026-05-23 14:04:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2546925553543530375.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/ReachabilityCardinality12274124111580787268.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2546925553543530375.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality2546925553543530375.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :6 after 16
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :16 after 34
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :34 after 68
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :68 after 205
Interrupted probabilistic random walk after 312153 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :0 out of 4
Probabilistic random walk after 312153 steps, saw 85517 distinct states, run finished after 3011 ms. (steps per millisecond=103 ) properties seen :0
[2026-05-23 14:04:26] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 14:04:26] [INFO ] Invariant cache hit.
[2026-05-23 14:04:26] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 250/355 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/357 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 13/370 variables, 13/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/370 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/370 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 150 constraints, problems are : Problem set: 0 solved, 4 unsolved in 558 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 250/355 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/357 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/357 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 13/370 variables, 13/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/370 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/370 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 154 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3095 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3668ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1106 ms.
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Applied a total of 0 rules in 47 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 124/124 places, 1226/1226 transitions.
RANDOM walk for 40001 steps (88 resets) in 357 ms. (111 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (32 resets) in 181 ms. (219 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (32 resets) in 175 ms. (227 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (31 resets) in 158 ms. (251 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (31 resets) in 157 ms. (253 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :205 after 2550
Interrupted probabilistic random walk after 331088 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 4
Probabilistic random walk after 331088 steps, saw 90871 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
[2026-05-23 14:04:34] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 14:04:34] [INFO ] Invariant cache hit.
[2026-05-23 14:04:34] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 250/355 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/357 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 13/370 variables, 13/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/370 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/370 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 150 constraints, problems are : Problem set: 0 solved, 4 unsolved in 610 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 250/355 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/357 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/357 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 13/370 variables, 13/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/370 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/370 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 154 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3109 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3727ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1037 ms.
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Applied a total of 0 rules in 45 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 124/124 places, 1226/1226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Applied a total of 0 rules in 46 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
[2026-05-23 14:04:39] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 14:04:39] [INFO ] Invariant cache hit.
[2026-05-23 14:04:39] [INFO ] Implicit Places using invariants in 216 ms returned []
[2026-05-23 14:04:39] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 14:04:39] [INFO ] Invariant cache hit.
[2026-05-23 14:04:39] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 14:04:40] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
[2026-05-23 14:04:40] [INFO ] Redundant transitions in 55 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 856 ms. Remains : 124/124 places, 1226/1226 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 980 transitions
Reduce isomorphic transitions removed 980 transitions.
Iterating post reduction 0 with 980 rules applied. Total rules applied 980 place count 124 transition count 246
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 984 place count 122 transition count 244
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 986 place count 122 transition count 242
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 988 place count 120 transition count 242
Applied a total of 988 rules in 49 ms. Remains 120 /124 variables (removed 4) and now considering 242/1226 (removed 984) transitions.
Running SMT prover for 4 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1943275401826978236.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6644701051156939783.kers'
[2026-05-23 14:04:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1943275401826978236.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6644701051156939783.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 242 rows 120 cols 1064 entries
Finished phase 1 with 115 SingleSign rule and 0 generalized
[2026-05-23 14:04:40] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6644701051156939783.kers
Total runtime 1 ms.
[2026-05-23 14:04:40] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned sat
[2026-05-23 14:04:40] [INFO ] After 272ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2026-05-23 14:04:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 14:04:40] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2026-05-23 14:04:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 14:04:41] [INFO ] After 93ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2026-05-23 14:04:41] [INFO ] After 218ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2026-05-23 14:04:41] [INFO ] After 546ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2026-05-23 14:04:41] [INFO ] Flatten gal took : 21 ms
[2026-05-23 14:04:41] [INFO ] Flatten gal took : 20 ms
[2026-05-23 14:04:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7855342079843903690.gal : 8 ms
[2026-05-23 14:04:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5618619060241911887.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/ReachabilityCardinality7855342079843903690.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5618619060241911887.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/ReachabilityCardinality5618619060241911887.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 12
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :12 after 20
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :20 after 60
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :60 after 140
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :140 after 280
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :280 after 840
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :840 after 3993
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3993 after 51980
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :51980 after 191833
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :191833 after 1.07134e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.07134e+06 after 1.13791e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.13791e+06 after 1.23372e+06
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.23372e+06 after 1.51709e+06
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.51709e+06 after 3.90828e+06
Detected timeout of ITS tools.
[2026-05-23 14:04:56] [INFO ] Flatten gal took : 27 ms
[2026-05-23 14:04:56] [INFO ] Applying decomposition
[2026-05-23 14:04:56] [INFO ] Flatten gal took : 12 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/graph3545905430493499590.txt' '-o' '/tmp/graph3545905430493499590.bin' '-w' '/tmp/graph3545905430493499590.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3545905430493499590.bin' '-l' '-1' '-v' '-w' '/tmp/graph3545905430493499590.weights' '-q' '0' '-e' '0.001'
[2026-05-23 14:04:56] [INFO ] Decomposing Gal with order
[2026-05-23 14:04:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 14:04:56] [INFO ] Removed a total of 288 redundant transitions.
[2026-05-23 14:04:56] [INFO ] Flatten gal took : 100 ms
[2026-05-23 14:04:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 293 labels/synchronizations in 14 ms.
[2026-05-23 14:04:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality374522531060532225.gal : 3 ms
[2026-05-23 14:04:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16942269373656902381.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/ReachabilityCardinality374522531060532225.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16942269373656902381.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality16942269373656902381.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 12
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 21
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :21 after 38
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :38 after 44
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :44 after 44
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :44 after 44
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :44 after 44
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :44 after 800
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :800 after 1976
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2550 after 12899
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1976 after 10580
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :12899 after 13039
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :10580 after 29696
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :13039 after 13372
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :13372 after 13993
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :29696 after 110259
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :13993 after 15103
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :110259 after 237196
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 31413 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-23 14:05:11] [INFO ] Flatten gal took : 47 ms
[2026-05-23 14:05:11] [INFO ] Applying decomposition
[2026-05-23 14:05:11] [INFO ] Flatten gal took : 44 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/graph5634112914149392631.txt' '-o' '/tmp/graph5634112914149392631.bin' '-w' '/tmp/graph5634112914149392631.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5634112914149392631.bin' '-l' '-1' '-v' '-w' '/tmp/graph5634112914149392631.weights' '-q' '0' '-e' '0.001'
[2026-05-23 14:05:12] [INFO ] Decomposing Gal with order
[2026-05-23 14:05:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 14:05:12] [INFO ] Removed a total of 3132 redundant transitions.
[2026-05-23 14:05:12] [INFO ] Flatten gal took : 180 ms
[2026-05-23 14:05:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 434 labels/synchronizations in 22 ms.
[2026-05-23 14:05:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10902932573923522162.gal : 3 ms
[2026-05-23 14:05:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7502770883743121022.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/ReachabilityCardinality10902932573923522162.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7502770883743121022.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/ReachabilityCardinality7502770883743121022.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 24
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :24 after 49
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :49 after 94
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :94 after 179
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :179 after 344
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :344 after 545
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :545 after 17952
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :17952 after 44048
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :44048 after 128325
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :2.33039e+06 after 3.47554e+06
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1.19922e+07 after 1.52139e+07
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :9.86102e+07 after 1.00895e+08
Detected timeout of ITS tools.
Starting property specific reduction for BridgeAndVehicles-PT-V50P20N10-UpperBounds-00
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:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10377982717138544421.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11999839603918321427.kers'
[2026-05-23 14:06:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10377982717138544421.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11999839603918321427.kers]
Normalized transition count is 246 out of 1226 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 246 rows 124 cols 1076 entries
Finished phase 1 with 119 SingleSign rule and 0 generalized
[2026-05-23 14:06:02] [INFO ] Computed 5 invariants in 4 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-11999839603918321427.kers
Total runtime 5 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (22 resets) in 48 ms. (204 steps per ms)
BEST_FIRST walk for 10001 steps (8 resets) in 17 ms. (555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2026-05-23 14:06:02] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14383995447892142181.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12808315389415416693.kers'
[2026-05-23 14:06:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14383995447892142181.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12808315389415416693.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 246 rows 124 cols 1076 entries
Finished phase 1 with 119 SingleSign rule and 0 generalized
[2026-05-23 14:06:02] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12808315389415416693.kers
Total runtime 2 ms.
[2026-05-23 14:06:02] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2026-05-23 14:06:02] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2026-05-23 14:06:02] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 14:06:02] [INFO ] [Real]Added 20 Read/Feed constraints in 12 ms returned sat
[2026-05-23 14:06:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 14:06:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 14:06:02] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2026-05-23 14:06:02] [INFO ] [Nat]Added 20 Read/Feed constraints in 15 ms returned sat
[2026-05-23 14:06:02] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 135 transitions) in 20 ms.
[2026-05-23 14:06:02] [INFO ] Added : 10 causal constraints over 2 iterations in 140 ms. Result :sat
Minimization took 141 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 123 transition count 1225
Applied a total of 2 rules in 63 ms. Remains 123 /124 variables (removed 1) and now considering 1225/1226 (removed 1) transitions.
Running 1222 sub problems to find dead transitions.
[2026-05-23 14:06:03] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12479705228785376384.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2981712270856945668.kers'
[2026-05-23 14:06:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12479705228785376384.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2981712270856945668.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 245 rows 122 cols 923 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-23 14:06:03] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-2981712270856945668.kers
Total runtime 5 ms.
[2026-05-23 14:06:03] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1221 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1370 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 21280 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1221 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43000ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 43004ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43071 ms. Remains : 123/124 places, 1225/1226 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3967773994041563091.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15137267105644900281.kers'
[2026-05-23 14:06:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3967773994041563091.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15137267105644900281.kers]
Normalized transition count is 245 out of 1225 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 245 rows 122 cols 923 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-23 14:06:46] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15137267105644900281.kers
Total runtime 4 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[20]
RANDOM walk for 1000000 steps (2623 resets) in 4181 ms. (239 steps per ms)
BEST_FIRST walk for 1000001 steps (1086 resets) in 1674 ms. (597 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2026-05-23 14:06:52] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12436133371089719727.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11446470345899560885.kers'
[2026-05-23 14:06:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12436133371089719727.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11446470345899560885.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 245 rows 122 cols 923 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-23 14:06:52] [INFO ] Computed 5 invariants in 3 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-11446470345899560885.kers
Total runtime 5 ms.
[2026-05-23 14:06:52] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 14:06:52] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2026-05-23 14:06:52] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 14:06:52] [INFO ] [Real]Added 20 Read/Feed constraints in 13 ms returned sat
[2026-05-23 14:06:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 14:06:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 14:06:52] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2026-05-23 14:06:52] [INFO ] [Nat]Added 20 Read/Feed constraints in 23 ms returned sat
[2026-05-23 14:06:52] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 17 ms.
[2026-05-23 14:06:52] [INFO ] Added : 10 causal constraints over 2 iterations in 136 ms. Result :sat
Minimization took 123 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 52 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 46 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2026-05-23 14:06:53] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 14:06:53] [INFO ] Invariant cache hit.
[2026-05-23 14:06:53] [INFO ] Implicit Places using invariants in 235 ms returned []
[2026-05-23 14:06:53] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 14:06:53] [INFO ] Invariant cache hit.
[2026-05-23 14:06:53] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 14:06:53] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 868 ms to find 0 implicit places.
[2026-05-23 14:06:53] [INFO ] Redundant transitions in 20 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 945 ms. Remains : 123/123 places, 1225/1225 transitions.
[2026-05-23 14:06:54] [INFO ] Flatten gal took : 36 ms
[2026-05-23 14:06:54] [INFO ] Flatten gal took : 40 ms
[2026-05-23 14:06:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6205668930227090455.gal : 14 ms
[2026-05-23 14:06:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12514514769202489607.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/ReachabilityCardinality6205668930227090455.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12514514769202489607.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (104 resets) in 423 ms. (94 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (41 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40008 steps (40 resets) in 141 ms. (281 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality12514514769202489607.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 14
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :14 after 36
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :36 after 100
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :100 after 233
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :233 after 566
Interrupted probabilistic random walk after 385528 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :0 out of 2
Probabilistic random walk after 385528 steps, saw 106799 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
[2026-05-23 14:06:57] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 14:06:57] [INFO ] Invariant cache hit.
[2026-05-23 14:06:57] [INFO ] State equation strengthened by 20 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) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/182 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 84/266 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 101/367 variables, 51/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/367 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/368 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 648 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 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) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/182 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 256
At refinement iteration 12 (OVERLAPS) 84/266 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :566 after 1014
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 101/367 variables, 51/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 10/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/367 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/368 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 152 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1798 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2457ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 158 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 48 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 123/123 places, 1225/1225 transitions.
RANDOM walk for 40000 steps (104 resets) in 317 ms. (125 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (43 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (41 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 384928 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :0 out of 2
Probabilistic random walk after 384928 steps, saw 106654 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
[2026-05-23 14:07:03] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 14:07:03] [INFO ] Invariant cache hit.
[2026-05-23 14:07:03] [INFO ] State equation strengthened by 20 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) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/182 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 84/266 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 101/367 variables, 51/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/367 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/368 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 651 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 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) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/182 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 84/266 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :1014 after 4275
At refinement iteration 17 (OVERLAPS) 101/367 variables, 51/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 10/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/367 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/368 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 152 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1762 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2422ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 154 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 54 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 50 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2026-05-23 14:07:05] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 14:07:05] [INFO ] Invariant cache hit.
[2026-05-23 14:07:05] [INFO ] Implicit Places using invariants in 225 ms returned []
[2026-05-23 14:07:05] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 14:07:05] [INFO ] Invariant cache hit.
[2026-05-23 14:07:06] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 14:07:06] [INFO ] Implicit Places using invariants and state equation in 618 ms returned []
Implicit Place search using SMT with State Equation took 845 ms to find 0 implicit places.
[2026-05-23 14:07:06] [INFO ] Redundant transitions in 19 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 921 ms. Remains : 123/123 places, 1225/1225 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 980 transitions
Reduce isomorphic transitions removed 980 transitions.
Iterating post reduction 0 with 980 rules applied. Total rules applied 980 place count 123 transition count 245
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 984 place count 121 transition count 243
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 986 place count 121 transition count 241
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 988 place count 119 transition count 241
Applied a total of 988 rules in 13 ms. Remains 119 /123 variables (removed 4) and now considering 241/1225 (removed 984) 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-9586707902321628995.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7459424188125841731.kers'
[2026-05-23 14:07:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9586707902321628995.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7459424188125841731.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 241 rows 118 cols 911 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-23 14:07:06] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7459424188125841731.kers
Total runtime 1 ms.
[2026-05-23 14:07:06] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 14:07:06] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-23 14:07:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 14:07:06] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2026-05-23 14:07:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 14:07:07] [INFO ] After 68ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-23 14:07:07] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-23 14:07:07] [INFO ] After 311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-23 14:07:07] [INFO ] Flatten gal took : 11 ms
[2026-05-23 14:07:07] [INFO ] Flatten gal took : 14 ms
[2026-05-23 14:07:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10976796596534814288.gal : 2 ms
[2026-05-23 14:07:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10162732664390172816.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/ReachabilityCardinality10976796596534814288.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10162732664390172816.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality10162732664390172816.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 190
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :190 after 196
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :196 after 215
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :215 after 416
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :416 after 614
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :614 after 2722
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2722 after 3846
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3846 after 7125
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :51358 after 108016
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,9.15214e+08,2.98162,85904,2,21551,19,220600,8,0,721,215448,0
Total reachable state count : 915214160

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,50854,2.98748,85904,2,3732,19,220600,8,0,723,215448,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,50854,2.98936,85904,2,3732,19,220600,8,0,723,215448,0
Over-approximation ignoring read arcs solved 0 properties in 3534 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-23 14:07:10] [INFO ] Flatten gal took : 22 ms
[2026-05-23 14:07:10] [INFO ] Applying decomposition
[2026-05-23 14:07:10] [INFO ] Flatten gal took : 23 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/graph9902539456189184090.txt' '-o' '/tmp/graph9902539456189184090.bin' '-w' '/tmp/graph9902539456189184090.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9902539456189184090.bin' '-l' '-1' '-v' '-w' '/tmp/graph9902539456189184090.weights' '-q' '0' '-e' '0.001'
[2026-05-23 14:07:10] [INFO ] Decomposing Gal with order
[2026-05-23 14:07:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 14:07:10] [INFO ] Removed a total of 2577 redundant transitions.
[2026-05-23 14:07:10] [INFO ] Flatten gal took : 143 ms
[2026-05-23 14:07:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 337 labels/synchronizations in 14 ms.
[2026-05-23 14:07:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1581948552171911823.gal : 2 ms
[2026-05-23 14:07:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2054575094448242354.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/ReachabilityCardinality1581948552171911823.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2054575094448242354.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality2054575094448242354.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :16 after 21
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :21 after 30
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :30 after 47
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :47 after 80
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :80 after 429
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :429 after 8103
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :8103 after 33603
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :33603 after 71191
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :71191 after 120612
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :229001 after 386923
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4.2369e+06 after 5.6491e+06
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2.8182e+07 after 3.13236e+07
Detected timeout of ITS tools.
Ending property specific reduction for BridgeAndVehicles-PT-V50P20N10-UpperBounds-00 in 118171 ms.
Starting property specific reduction for BridgeAndVehicles-PT-V50P20N10-UpperBounds-09
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:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16084916591299677140.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17184731344286440195.kers'
[2026-05-23 14:08:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16084916591299677140.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17184731344286440195.kers]
Normalized transition count is 246 out of 1226 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 246 rows 124 cols 1076 entries
Finished phase 1 with 119 SingleSign rule and 0 generalized
[2026-05-23 14:08:00] [INFO ] Computed 5 invariants in 6 ms
Computed 5 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-17184731344286440195.kers
Total runtime 10 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (22 resets) in 45 ms. (217 steps per ms)
BEST_FIRST walk for 10001 steps (8 resets) in 16 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2026-05-23 14:08:00] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13814653524196862269.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6604354392503226352.kers'
[2026-05-23 14:08:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13814653524196862269.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6604354392503226352.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 246 rows 124 cols 1076 entries
Finished phase 1 with 119 SingleSign rule and 0 generalized
[2026-05-23 14:08:00] [INFO ] Computed 5 invariants in 3 ms
Computed 5 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6604354392503226352.kers
Total runtime 4 ms.
[2026-05-23 14:08:00] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 14:08:00] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2026-05-23 14:08:00] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 14:08:00] [INFO ] [Real]Added 20 Read/Feed constraints in 24 ms returned sat
[2026-05-23 14:08:00] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 14:08:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-23 14:08:00] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2026-05-23 14:08:00] [INFO ] [Nat]Added 20 Read/Feed constraints in 15 ms returned sat
[2026-05-23 14:08:01] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 135 transitions) in 25 ms.
[2026-05-23 14:08:01] [INFO ] Added : 6 causal constraints over 6 iterations in 320 ms. Result :sat
Minimization took 172 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 123 transition count 1225
Applied a total of 2 rules in 60 ms. Remains 123 /124 variables (removed 1) and now considering 1225/1226 (removed 1) transitions.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 123/124 places, 1225/1226 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2198318489473229568.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3118740440184381213.kers'
[2026-05-23 14:08:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2198318489473229568.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3118740440184381213.kers]
Normalized transition count is 245 out of 1225 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 245 rows 122 cols 923 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-23 14:08:01] [INFO ] Computed 5 invariants in 6 ms
Computed 5 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-3118740440184381213.kers
Total runtime 8 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[20]
RANDOM walk for 1000000 steps (2622 resets) in 4544 ms. (220 steps per ms)
BEST_FIRST walk for 1000001 steps (1029 resets) in 1736 ms. (575 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2026-05-23 14:08:08] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16094492617173887482.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17395483503694757319.kers'
[2026-05-23 14:08:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16094492617173887482.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17395483503694757319.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 245 rows 122 cols 923 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-23 14:08:08] [INFO ] Computed 5 invariants in 4 ms
Computed 5 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-17395483503694757319.kers
Total runtime 5 ms.
[2026-05-23 14:08:08] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 14:08:08] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2026-05-23 14:08:08] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 14:08:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 14:08:08] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2026-05-23 14:08:08] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 14:08:08] [INFO ] [Nat]Added 20 Read/Feed constraints in 17 ms returned sat
[2026-05-23 14:08:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2026-05-23 14:08:08] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 23 ms.
[2026-05-23 14:08:08] [INFO ] Added : 12 causal constraints over 10 iterations in 199 ms. Result :sat
Minimization took 93 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 59 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 49 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2026-05-23 14:08:09] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 14:08:09] [INFO ] Invariant cache hit.
[2026-05-23 14:08:09] [INFO ] Implicit Places using invariants in 235 ms returned []
[2026-05-23 14:08:09] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 14:08:09] [INFO ] Invariant cache hit.
[2026-05-23 14:08:09] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 14:08:09] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 849 ms to find 0 implicit places.
[2026-05-23 14:08:09] [INFO ] Redundant transitions in 18 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 923 ms. Remains : 123/123 places, 1225/1225 transitions.
[2026-05-23 14:08:10] [INFO ] Flatten gal took : 67 ms
RANDOM walk for 40000 steps (104 resets) in 350 ms. (113 steps per ms) remains 2/2 properties
[2026-05-23 14:08:10] [INFO ] Flatten gal took : 67 ms
BEST_FIRST walk for 40004 steps (40 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
[2026-05-23 14:08:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6336331682696100345.gal : 9 ms
[2026-05-23 14:08:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11528515284934740646.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/ReachabilityCardinality6336331682696100345.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11528515284934740646.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40003 steps (40 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality11528515284934740646.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 30
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :30 after 72
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :72 after 159
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :159 after 467
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :467 after 1223
Interrupted probabilistic random walk after 371866 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 2
Probabilistic random walk after 371866 steps, saw 105680 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
[2026-05-23 14:08:13] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 14:08:13] [INFO ] Invariant cache hit.
[2026-05-23 14:08:13] [INFO ] State equation strengthened by 20 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) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/182 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 84/266 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 101/367 variables, 51/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/367 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 10/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/368 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/368 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/368 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 149 constraints, problems are : Problem set: 0 solved, 2 unsolved in 473 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 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) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :6324 after 6392
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/182 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 84/266 variables, 16/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 10/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 101/367 variables, 51/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 10/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/368 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/368 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/368 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 151 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1630 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2113ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 94 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 80 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 123/123 places, 1225/1225 transitions.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :6392 after 6828
RANDOM walk for 40000 steps (104 resets) in 435 ms. (91 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (40 resets) in 131 ms. (303 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (40 resets) in 158 ms. (251 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :6828 after 7656
Interrupted probabilistic random walk after 389169 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :0 out of 2
Probabilistic random walk after 389169 steps, saw 110213 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
[2026-05-23 14:08:18] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 14:08:18] [INFO ] Invariant cache hit.
[2026-05-23 14:08:18] [INFO ] State equation strengthened by 20 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) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/182 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 84/266 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 101/367 variables, 51/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/367 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 10/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/368 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/368 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/368 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 149 constraints, problems are : Problem set: 0 solved, 2 unsolved in 479 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 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) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/182 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 84/266 variables, 16/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 10/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 101/367 variables, 51/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 10/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/368 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/368 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/368 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 151 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1675 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2164ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 107 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 46 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 45 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2026-05-23 14:08:21] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 14:08:21] [INFO ] Invariant cache hit.
[2026-05-23 14:08:21] [INFO ] Implicit Places using invariants in 232 ms returned []
[2026-05-23 14:08:21] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 14:08:21] [INFO ] Invariant cache hit.
[2026-05-23 14:08:21] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 14:08:21] [INFO ] Implicit Places using invariants and state equation in 622 ms returned []
Implicit Place search using SMT with State Equation took 857 ms to find 0 implicit places.
[2026-05-23 14:08:21] [INFO ] Redundant transitions in 18 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 925 ms. Remains : 123/123 places, 1225/1225 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 980 transitions
Reduce isomorphic transitions removed 980 transitions.
Iterating post reduction 0 with 980 rules applied. Total rules applied 980 place count 123 transition count 245
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 984 place count 121 transition count 243
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 986 place count 121 transition count 241
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 988 place count 119 transition count 241
Applied a total of 988 rules in 10 ms. Remains 119 /123 variables (removed 4) and now considering 241/1225 (removed 984) 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-9900424452338613395.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2398655162507211702.kers'
[2026-05-23 14:08:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9900424452338613395.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2398655162507211702.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 241 rows 118 cols 911 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-23 14:08:21] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2398655162507211702.kers
Total runtime 2 ms.
[2026-05-23 14:08:22] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2026-05-23 14:08:22] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-23 14:08:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 14:08:22] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2026-05-23 14:08:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 14:08:22] [INFO ] After 42ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-23 14:08:22] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-23 14:08:22] [INFO ] After 324ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-23 14:08:22] [INFO ] Flatten gal took : 7 ms
[2026-05-23 14:08:22] [INFO ] Flatten gal took : 6 ms
[2026-05-23 14:08:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1418982698529693107.gal : 1 ms
[2026-05-23 14:08:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2918061792991957661.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/ReachabilityCardinality1418982698529693107.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2918061792991957661.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/ReachabilityCardinality2918061792991957661.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 138
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :138 after 488
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :488 after 969
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :969 after 14279
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :14279 after 25475
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.80321e+07 after 1.86932e+07
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3.78245e+08,0.456618,18720,2,3845,19,74573,6,0,719,34203,0
Total reachable state count : 378245374

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,50854,0.457991,18856,2,1447,19,74573,7,0,722,34203,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,50854,0.458799,18900,2,1447,19,74573,8,0,723,34203,0
Over-approximation ignoring read arcs solved 0 properties in 984 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-23 14:08:23] [INFO ] Flatten gal took : 23 ms
[2026-05-23 14:08:23] [INFO ] Applying decomposition
[2026-05-23 14:08:23] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7780045138299433333.txt' '-o' '/tmp/graph7780045138299433333.bin' '-w' '/tmp/graph7780045138299433333.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7780045138299433333.bin' '-l' '-1' '-v' '-w' '/tmp/graph7780045138299433333.weights' '-q' '0' '-e' '0.001'
[2026-05-23 14:08:23] [INFO ] Decomposing Gal with order
[2026-05-23 14:08:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 14:08:23] [INFO ] Removed a total of 2633 redundant transitions.
[2026-05-23 14:08:23] [INFO ] Flatten gal took : 138 ms
[2026-05-23 14:08:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 335 labels/synchronizations in 14 ms.
[2026-05-23 14:08:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4083035253785024355.gal : 2 ms
[2026-05-23 14:08:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8886278675718395984.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/ReachabilityCardinality4083035253785024355.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8886278675718395984.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality8886278675718395984.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 34
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :34 after 59
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :59 after 104
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :104 after 189
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :189 after 354
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :354 after 648
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :648 after 7312
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :7312 after 13401
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :13401 after 43496
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :43496 after 112531
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :219506 after 389494
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5.5126e+06 after 7.01793e+06
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :3.66841e+07 after 4.01732e+07
Detected timeout of ITS tools.
Ending property specific reduction for BridgeAndVehicles-PT-V50P20N10-UpperBounds-09 in 72755 ms.
[2026-05-23 14:09:13] [INFO ] Flatten gal took : 19 ms
[2026-05-23 14:09:13] [INFO ] Applying decomposition
[2026-05-23 14:09:13] [INFO ] Flatten gal took : 20 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/graph367261706515685546.txt' '-o' '/tmp/graph367261706515685546.bin' '-w' '/tmp/graph367261706515685546.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph367261706515685546.bin' '-l' '-1' '-v' '-w' '/tmp/graph367261706515685546.weights' '-q' '0' '-e' '0.001'
[2026-05-23 14:09:13] [INFO ] Decomposing Gal with order
[2026-05-23 14:09:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 14:09:13] [INFO ] Removed a total of 3004 redundant transitions.
[2026-05-23 14:09:13] [INFO ] Flatten gal took : 106 ms
[2026-05-23 14:09:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 445 labels/synchronizations in 15 ms.
[2026-05-23 14:09:13] [INFO ] Time to serialize gal into /tmp/UpperBounds13323596594375841884.gal : 2 ms
[2026-05-23 14:09:13] [INFO ] Time to serialize properties into /tmp/UpperBounds5014021510502569350.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/UpperBounds13323596594375841884.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5014021510502569350.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 ...284
Loading property file /tmp/UpperBounds5014021510502569350.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.47634e+08,531.416,2505780,1130,9420,1.26256e+06,2.58169e+06,161,1.69732e+07,420,2.15931e+07,0
Total reachable state count : 347634372

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 10
Bounds property BridgeAndVehicles-PT-V50P20N10-UpperBounds-00 :0 <= i1.u1.SUR_PONT_A <= 10
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-14 10 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-00 10 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BridgeAndVehicles-PT-V50P20N10-UpperBounds-00,0,533.089,2505780,1,0,1.26256e+06,2.58169e+06,206,1.69732e+07,489,2.15931e+07,382
Min sum of variable value : 0
Maximum sum along a path : 10
Bounds property BridgeAndVehicles-PT-V50P20N10-UpperBounds-09 :0 <= i1.u1.SUR_PONT_B <= 10
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-09 10 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BridgeAndVehicles-PT-V50P20N10-UpperBounds-09,0,533.177,2505780,1,0,1.26256e+06,2.58169e+06,216,1.69732e+07,503,2.15931e+07,505
Total runtime 954391 ms.

BK_STOP 1779545887783

--------------------
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-PT-V50P20N10"
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-PT-V50P20N10, 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-177946841800229"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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