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

About the Execution of 2025-gold for DBSingleClientW-PT-d0m08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
750.031 81743.00 117908.00 444.10 0 0 0 0 0 0 0 1 0 0 0 0 0 0 5 5 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r095-smll-177946996300015.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 gold2025
Input is DBSingleClientW-PT-d0m08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r095-smll-177946996300015
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 7.7K Mar 6 18:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 6 18:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 6 18:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 6 18:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 15 08:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 15 08:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 08:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 6 18:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Mar 6 18:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Mar 6 18:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Mar 6 18:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 119K 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 DBSingleClientW-PT-d0m08-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779525120197

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-23 08:32:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 08:32:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 08:32:02] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2026-05-23 08:32:02] [INFO ] Transformed 553 places.
[2026-05-23 08:32:02] [INFO ] Transformed 150 transitions.
[2026-05-23 08:32:02] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 294 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
// Phase 1: matrix 150 rows 109 cols
[2026-05-23 08:32:02] [INFO ] Computed 6 invariants in 19 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[413, 8, 8]
RANDOM walk for 10000 steps (2293 resets) in 72 ms. (136 steps per ms)
BEST_FIRST walk for 30001 steps (2980 resets) in 90 ms. (329 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0] Max Struct:[413, 8, 8]
[2026-05-23 08:32:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:32:03] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2026-05-23 08:32:03] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:32:03] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2026-05-23 08:32:03] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned sat
[2026-05-23 08:32:03] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2026-05-23 08:32:03] [INFO ] State equation strengthened by 74 read => feed constraints.
[2026-05-23 08:32:03] [INFO ] [Real]Added 74 Read/Feed constraints in 40 ms returned sat
[2026-05-23 08:32:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:32:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2026-05-23 08:32:03] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2026-05-23 08:32:03] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2026-05-23 08:32:03] [INFO ] [Nat]Added 74 Read/Feed constraints in 29 ms returned sat
[2026-05-23 08:32:04] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 56 ms.
[2026-05-23 08:32:04] [INFO ] Added : 10 causal constraints over 2 iterations in 148 ms. Result :sat
Minimization took 261 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:32:04] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-23 08:32:04] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2026-05-23 08:32:04] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2026-05-23 08:32:04] [INFO ] [Real]Added 74 Read/Feed constraints in 35 ms returned sat
[2026-05-23 08:32:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:32:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2026-05-23 08:32:04] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2026-05-23 08:32:04] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2026-05-23 08:32:04] [INFO ] [Nat]Added 74 Read/Feed constraints in 26 ms returned sat
[2026-05-23 08:32:04] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 32 ms.
[2026-05-23 08:32:04] [INFO ] Added : 9 causal constraints over 3 iterations in 127 ms. Result :sat
Minimization took 168 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0] Max Struct:[1, 8, 8]
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[8, 8]
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 150/150 transitions.
Graph (complete) has 332 edges and 109 vertex of which 101 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 101 transition count 137
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 36 place count 79 transition count 99
Iterating global reduction 1 with 22 rules applied. Total rules applied 58 place count 79 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 79 transition count 98
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 69 place count 69 transition count 88
Iterating global reduction 2 with 10 rules applied. Total rules applied 79 place count 69 transition count 88
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 81 place count 67 transition count 84
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 67 transition count 84
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 85 place count 65 transition count 81
Iterating global reduction 2 with 2 rules applied. Total rules applied 87 place count 65 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 64 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 64 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 91 place count 64 transition count 78
Applied a total of 91 rules in 147 ms. Remains 64 /109 variables (removed 45) and now considering 78/150 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 64/109 places, 78/150 transitions.
// Phase 1: matrix 78 rows 64 cols
[2026-05-23 08:32:05] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[8, 8]
RANDOM walk for 1000000 steps (229381 resets) in 2009 ms. (497 steps per ms)
BEST_FIRST walk for 2000000 steps (202276 resets) in 1189 ms. (1680 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1] Max Struct:[8, 8]
[2026-05-23 08:32:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:32:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:32:08] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2026-05-23 08:32:08] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-23 08:32:08] [INFO ] [Real]Added 25 Read/Feed constraints in 9 ms returned sat
[2026-05-23 08:32:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:32:08] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:32:08] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2026-05-23 08:32:08] [INFO ] [Nat]Added 25 Read/Feed constraints in 6 ms returned sat
[2026-05-23 08:32:08] [INFO ] Computed and/alt/rep : 21/46/21 causal constraints (skipped 56 transitions) in 11 ms.
[2026-05-23 08:32:08] [INFO ] Added : 11 causal constraints over 3 iterations in 53 ms. Result :sat
Minimization took 78 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:32:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:32:09] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2026-05-23 08:32:09] [INFO ] [Real]Added 25 Read/Feed constraints in 9 ms returned sat
[2026-05-23 08:32:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:32:09] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 5 ms returned sat
[2026-05-23 08:32:09] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2026-05-23 08:32:09] [INFO ] [Nat]Added 25 Read/Feed constraints in 9 ms returned sat
[2026-05-23 08:32:09] [INFO ] Computed and/alt/rep : 21/46/21 causal constraints (skipped 56 transitions) in 23 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:32:09] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 15 ms to minimize.
[2026-05-23 08:32:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2026-05-23 08:32:09] [INFO ] Added : 14 causal constraints over 3 iterations in 257 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1] Max Struct:[8, 8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1] Max Struct:[8, 8]
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 78/78 transitions.
Applied a total of 0 rules in 14 ms. Remains 64 /64 variables (removed 0) and now considering 78/78 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 64/64 places, 78/78 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 78/78 transitions.
Applied a total of 0 rules in 13 ms. Remains 64 /64 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2026-05-23 08:32:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:32:09] [INFO ] Implicit Places using invariants in 228 ms returned []
[2026-05-23 08:32:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:32:09] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-23 08:32:10] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 08:32:10] [INFO ] Redundant transitions in 2 ms returned []
Running 77 sub problems to find dead transitions.
[2026-05-23 08:32:10] [INFO ] Invariant cache hit.
[2026-05-23 08:32:10] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 78/142 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 0/142 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 91 constraints, problems are : Problem set: 0 solved, 77 unsolved in 3488 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 78/142 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 77/168 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 0/142 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 168 constraints, problems are : Problem set: 0 solved, 77 unsolved in 7109 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10821ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 10833ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11329 ms. Remains : 64/64 places, 78/78 transitions.
[2026-05-23 08:32:20] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1] Max Struct:[8, 8]
RANDOM walk for 1000000 steps (228979 resets) in 1075 ms. (929 steps per ms)
BEST_FIRST walk for 2000001 steps (203407 resets) in 1060 ms. (1885 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1] Max Struct:[8, 8]
[2026-05-23 08:32:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:32:23] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:32:23] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2026-05-23 08:32:23] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-23 08:32:23] [INFO ] [Real]Added 25 Read/Feed constraints in 6 ms returned sat
[2026-05-23 08:32:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:32:23] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:32:23] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2026-05-23 08:32:23] [INFO ] [Nat]Added 25 Read/Feed constraints in 8 ms returned sat
[2026-05-23 08:32:23] [INFO ] Computed and/alt/rep : 21/46/21 causal constraints (skipped 56 transitions) in 11 ms.
[2026-05-23 08:32:23] [INFO ] Added : 11 causal constraints over 3 iterations in 60 ms. Result :sat
Minimization took 128 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:32:23] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:32:23] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2026-05-23 08:32:23] [INFO ] [Real]Added 25 Read/Feed constraints in 9 ms returned sat
[2026-05-23 08:32:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:32:23] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:32:23] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2026-05-23 08:32:23] [INFO ] [Nat]Added 25 Read/Feed constraints in 6 ms returned sat
[2026-05-23 08:32:23] [INFO ] Computed and/alt/rep : 21/46/21 causal constraints (skipped 56 transitions) in 8 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:32:23] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 9 ms to minimize.
[2026-05-23 08:32:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2026-05-23 08:32:23] [INFO ] Added : 14 causal constraints over 3 iterations in 181 ms. Result :sat
Minimization took 107 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1] Max Struct:[8, 8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1] Max Struct:[8, 8]
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 78/78 transitions.
Applied a total of 0 rules in 12 ms. Remains 64 /64 variables (removed 0) and now considering 78/78 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 64/64 places, 78/78 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 78/78 transitions.
Applied a total of 0 rules in 10 ms. Remains 64 /64 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2026-05-23 08:32:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:32:24] [INFO ] Implicit Places using invariants in 145 ms returned []
[2026-05-23 08:32:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:32:24] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-23 08:32:24] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 08:32:24] [INFO ] Redundant transitions in 3 ms returned []
Running 77 sub problems to find dead transitions.
[2026-05-23 08:32:24] [INFO ] Invariant cache hit.
[2026-05-23 08:32:24] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 78/142 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 0/142 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 91 constraints, problems are : Problem set: 0 solved, 77 unsolved in 3424 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 78/142 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 77/168 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 0/142 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 168 constraints, problems are : Problem set: 0 solved, 77 unsolved in 7757 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11287ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 11290ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11720 ms. Remains : 64/64 places, 78/78 transitions.
RANDOM walk for 40000 steps (9159 resets) in 1069 ms. (37 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (4085 resets) in 307 ms. (129 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3991 resets) in 210 ms. (189 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (4090 resets) in 137 ms. (289 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4065 resets) in 129 ms. (307 steps per ms) remains 4/4 properties
[2026-05-23 08:32:36] [INFO ] Flatten gal took : 110 ms
[2026-05-23 08:32:36] [INFO ] Flatten gal took : 46 ms
[2026-05-23 08:32:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4336528737982051945.gal : 20 ms
[2026-05-23 08:32:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5151232586751684000.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4336528737982051945.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5151232586751684000.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5151232586751684000.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :7 after 26
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :26 after 126
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :126 after 346
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :346 after 684
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :684 after 4791
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :4791 after 11592
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :11592 after 31763
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :31763 after 140166
Invariant property MIN1 does not hold.
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :140166 after 432745
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :432745 after 562304
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :562304 after 970540
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :970540 after 3.14981e+06
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,8.12404e+06,1.92745,45876,2,8207,19,174658,9,0,339,172978,0
Total reachable state count : 8124040

Verifying 4 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0

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,0,1.92835,45876,1,0,19,174658,9,0,340,172978,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,1.01036e+06,1.93071,45876,2,5290,19,174658,9,0,341,172978,0
Reachability property MAX1 does not hold.
No reachable states exhibit your property : MAX1

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,0,1.93267,45876,1,0,19,174658,9,0,341,172978,0
Invariant property MIN1 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
MIN1,3810,1.93339,45876,2,913,19,174658,10,0,343,172978,0
Interrupted probabilistic random walk after 794264 steps, run timeout after 3001 ms. (steps per millisecond=264 ) properties seen :2 out of 4
Probabilistic random walk after 794264 steps, saw 302448 distinct states, run finished after 3007 ms. (steps per millisecond=264 ) properties seen :2
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 1] Max Struct:[8, 8]
Starting property specific reduction for DBSingleClientW-PT-d0m08-UpperBounds-14
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:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
[2026-05-23 08:32:39] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (2247 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10000 steps (1020 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[8]
[2026-05-23 08:32:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:32:39] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:32:39] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2026-05-23 08:32:39] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-23 08:32:39] [INFO ] [Real]Added 25 Read/Feed constraints in 7 ms returned sat
[2026-05-23 08:32:39] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:32:39] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:32:39] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2026-05-23 08:32:39] [INFO ] [Nat]Added 25 Read/Feed constraints in 6 ms returned sat
[2026-05-23 08:32:39] [INFO ] Computed and/alt/rep : 21/46/21 causal constraints (skipped 56 transitions) in 10 ms.
[2026-05-23 08:32:39] [INFO ] Added : 11 causal constraints over 3 iterations in 51 ms. Result :sat
Minimization took 90 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[8]
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 63 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 77
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 62 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 62 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 61 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 61 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 60 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 60 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 59 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 59 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 13 place count 59 transition count 69
Applied a total of 13 rules in 31 ms. Remains 59 /64 variables (removed 5) and now considering 69/78 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 59/64 places, 69/78 transitions.
// Phase 1: matrix 69 rows 59 cols
[2026-05-23 08:32:39] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 1000000 steps (228935 resets) in 1005 ms. (994 steps per ms)
BEST_FIRST walk for 1000001 steps (101662 resets) in 834 ms. (1197 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[8]
[2026-05-23 08:32:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:32:41] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:32:41] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2026-05-23 08:32:41] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 08:32:41] [INFO ] [Real]Added 22 Read/Feed constraints in 11 ms returned sat
[2026-05-23 08:32:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:32:41] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:32:41] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2026-05-23 08:32:41] [INFO ] [Nat]Added 22 Read/Feed constraints in 9 ms returned sat
[2026-05-23 08:32:41] [INFO ] Computed and/alt/rep : 19/39/19 causal constraints (skipped 49 transitions) in 13 ms.
[2026-05-23 08:32:41] [INFO ] Added : 10 causal constraints over 3 iterations in 61 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[8]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 69/69 transitions.
Applied a total of 0 rules in 10 ms. Remains 59 /59 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 59/59 places, 69/69 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 69/69 transitions.
Applied a total of 0 rules in 8 ms. Remains 59 /59 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2026-05-23 08:32:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:32:42] [INFO ] Implicit Places using invariants in 112 ms returned []
[2026-05-23 08:32:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:32:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 08:32:42] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 08:32:42] [INFO ] Redundant transitions in 2 ms returned []
Running 68 sub problems to find dead transitions.
[2026-05-23 08:32:42] [INFO ] Invariant cache hit.
[2026-05-23 08:32:42] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/128 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 22/83 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 83 constraints, problems are : Problem set: 0 solved, 68 unsolved in 2796 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/128 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 22/83 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 68/151 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 151 constraints, problems are : Problem set: 0 solved, 68 unsolved in 8102 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10991ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 10993ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11398 ms. Remains : 59/59 places, 69/69 transitions.
[2026-05-23 08:32:53] [INFO ] Flatten gal took : 14 ms
[2026-05-23 08:32:53] [INFO ] Flatten gal took : 12 ms
[2026-05-23 08:32:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16387171808194519144.gal : 5 ms
[2026-05-23 08:32:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10103061217861286724.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16387171808194519144.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10103061217861286724.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality10103061217861286724.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 22
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :22 after 48
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :48 after 126
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :126 after 262
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :262 after 516
RANDOM walk for 40000 steps (9199 resets) in 220 ms. (180 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :516 after 2502
BEST_FIRST walk for 40004 steps (4072 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (4094 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2502 after 9744
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :9744 after 45952
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :45952 after 141908
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :141908 after 522355
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :522355 after 1.26153e+06
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.09003e+06,1.77292,40744,2,9061,17,145455,8,0,309,147574,0
Total reachable state count : 3090034

Verifying 2 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0

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,0,1.7738,40744,1,0,17,145455,8,0,310,147574,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,377970,1.77653,40744,2,5540,17,145455,8,0,311,147574,0
Interrupted probabilistic random walk after 2547611 steps, run timeout after 3001 ms. (steps per millisecond=848 ) properties seen :1 out of 2
Probabilistic random walk after 2547611 steps, saw 979461 distinct states, run finished after 3001 ms. (steps per millisecond=848 ) properties seen :1
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[8]
Ending property specific reduction for DBSingleClientW-PT-d0m08-UpperBounds-14 in 17160 ms.
Starting property specific reduction for DBSingleClientW-PT-d0m08-UpperBounds-15
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:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
// Phase 1: matrix 78 rows 64 cols
[2026-05-23 08:32:56] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (2281 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10000 steps (1020 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[8]
[2026-05-23 08:32:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:32:56] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:32:56] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2026-05-23 08:32:56] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-23 08:32:56] [INFO ] [Real]Added 25 Read/Feed constraints in 5 ms returned sat
[2026-05-23 08:32:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:32:56] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:32:56] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2026-05-23 08:32:56] [INFO ] [Nat]Added 25 Read/Feed constraints in 8 ms returned sat
[2026-05-23 08:32:56] [INFO ] Computed and/alt/rep : 21/46/21 causal constraints (skipped 56 transitions) in 13 ms.
[2026-05-23 08:32:56] [INFO ] Added : 7 causal constraints over 2 iterations in 55 ms. Result :sat
Minimization took 97 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[8]
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 63 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 62 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 62 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 62 transition count 72
Applied a total of 6 rules in 21 ms. Remains 62 /64 variables (removed 2) and now considering 72/78 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 62/64 places, 72/78 transitions.
// Phase 1: matrix 72 rows 62 cols
[2026-05-23 08:32:56] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 1000000 steps (228958 resets) in 1275 ms. (783 steps per ms)
BEST_FIRST walk for 1000001 steps (101239 resets) in 488 ms. (2044 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[8]
[2026-05-23 08:32:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:32:58] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:32:58] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2026-05-23 08:32:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 08:32:58] [INFO ] [Real]Added 22 Read/Feed constraints in 5 ms returned sat
[2026-05-23 08:32:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:32:58] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:32:58] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2026-05-23 08:32:58] [INFO ] [Nat]Added 22 Read/Feed constraints in 6 ms returned sat
[2026-05-23 08:32:58] [INFO ] Computed and/alt/rep : 20/42/20 causal constraints (skipped 51 transitions) in 10 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:32:59] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 7 ms to minimize.
[2026-05-23 08:32:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2026-05-23 08:32:59] [INFO ] Added : 14 causal constraints over 4 iterations in 176 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[8]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 72/72 transitions.
Applied a total of 0 rules in 9 ms. Remains 62 /62 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 62/62 places, 72/72 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 72/72 transitions.
Applied a total of 0 rules in 7 ms. Remains 62 /62 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2026-05-23 08:32:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:32:59] [INFO ] Implicit Places using invariants in 126 ms returned []
[2026-05-23 08:32:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:32:59] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 08:32:59] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 08:32:59] [INFO ] Redundant transitions in 3 ms returned []
Running 71 sub problems to find dead transitions.
[2026-05-23 08:32:59] [INFO ] Invariant cache hit.
[2026-05-23 08:32:59] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/134 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 22/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 86 constraints, problems are : Problem set: 0 solved, 71 unsolved in 3270 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/134 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 22/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 71/157 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 157 constraints, problems are : Problem set: 0 solved, 71 unsolved in 6373 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9693ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 9695ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10119 ms. Remains : 62/62 places, 72/72 transitions.
[2026-05-23 08:33:09] [INFO ] Flatten gal took : 30 ms
RANDOM walk for 40000 steps (9152 resets) in 90 ms. (439 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (4054 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
[2026-05-23 08:33:09] [INFO ] Flatten gal took : 24 ms
[2026-05-23 08:33:09] [INFO ] Invariant cache hit.
[2026-05-23 08:33:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 08:33:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12851634593277624501.gal : 5 ms
[2026-05-23 08:33:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18263929739505095416.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12851634593277624501.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18263929739505095416.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality18263929739505095416.prop.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 22
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :22 after 56
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :56 after 126
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :126 after 280
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :280 after 582
At refinement iteration 3 (OVERLAPS) 57/60 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :582 after 2754
At refinement iteration 6 (OVERLAPS) 36/96 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/102 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2754 after 7608
At refinement iteration 12 (OVERLAPS) 32/134 variables, 30/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/134 variables, 17/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :7608 after 17010
[2026-05-23 08:33:09] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 10 ms to minimize.
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 134/134 variables, and 87 constraints, problems are : Problem set: 1 solved, 0 unsolved in 233 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 240ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[8]
Ending property specific reduction for DBSingleClientW-PT-d0m08-UpperBounds-15 in 13077 ms.
[2026-05-23 08:33:09] [INFO ] Flatten gal took : 10 ms
[2026-05-23 08:33:09] [INFO ] Applying decomposition
[2026-05-23 08:33:09] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5001637745723839657.txt' '-o' '/tmp/graph5001637745723839657.bin' '-w' '/tmp/graph5001637745723839657.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5001637745723839657.bin' '-l' '-1' '-v' '-w' '/tmp/graph5001637745723839657.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:33:09] [INFO ] Decomposing Gal with order
[2026-05-23 08:33:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:33:09] [INFO ] Removed a total of 82 redundant transitions.
[2026-05-23 08:33:09] [INFO ] Flatten gal took : 89 ms
[2026-05-23 08:33:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 20 ms.
[2026-05-23 08:33:09] [INFO ] Time to serialize gal into /tmp/UpperBounds10430250424356326064.gal : 9 ms
[2026-05-23 08:33:09] [INFO ] Time to serialize properties into /tmp/UpperBounds1919095541836980010.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds10430250424356326064.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1919095541836980010.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds1919095541836980010.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,8.12404e+06,11.292,220632,2621,440,201390,12753,296,1.84076e+06,50,122448,0
Total reachable state count : 8124040

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 5
Bounds property DBSingleClientW-PT-d0m08-UpperBounds-14 :0 <= i3.u12.l353 <= 5
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-14 5 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
DBSingleClientW-PT-d0m08-UpperBounds-14,0,11.7581,220632,1,0,201390,12753,384,1.84076e+06,66,122448,2407
Min sum of variable value : 0
Maximum sum along a path : 5
Bounds property DBSingleClientW-PT-d0m08-UpperBounds-15 :0 <= i3.u6.l505 <= 5
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-15 5 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
DBSingleClientW-PT-d0m08-UpperBounds-15,0,11.8072,220632,1,0,201390,12753,403,1.84076e+06,75,122448,3095
Total runtime 79475 ms.

BK_STOP 1779525201940

--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="DBSingleClientW-PT-d0m08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
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 gold2025"
echo " Input is DBSingleClientW-PT-d0m08, 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 r095-smll-177946996300015"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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