Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r069-smll-174854075700001.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is DBSingleClientW-PT-d0m04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-smll-174854075700001
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 119K May 29 14:32 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-d0m04-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748601516239

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-30 10:38:38] [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]
[2025-05-30 10:38:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 10:38:39] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2025-05-30 10:38:39] [INFO ] Transformed 553 places.
[2025-05-30 10:38:39] [INFO ] Transformed 150 transitions.
[2025-05-30 10:38:39] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 445 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 ms.
Deduced a syphon composed of 444 places in 3 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-15 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
[2025-05-30 10:38:39] [INFO ] Computed 6 invariants in 43 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[4, 2, 4]
RANDOM walk for 10000 steps (2273 resets) in 86 ms. (114 steps per ms)
BEST_FIRST walk for 30003 steps (2971 resets) in 125 ms. (238 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 2] Max Struct:[4, 2, 4]
[2025-05-30 10:38:39] [INFO ] Invariant cache hit.
[2025-05-30 10:38:40] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2025-05-30 10:38:40] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 7 ms returned sat
[2025-05-30 10:38:40] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2025-05-30 10:38:40] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-05-30 10:38:40] [INFO ] [Real]Added 74 Read/Feed constraints in 29 ms returned sat
[2025-05-30 10:38:40] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:38:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2025-05-30 10:38:40] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2025-05-30 10:38:40] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2025-05-30 10:38:40] [INFO ] [Nat]Added 74 Read/Feed constraints in 36 ms returned sat
[2025-05-30 10:38:40] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 57 ms.
[2025-05-30 10:38:41] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 28 ms to minimize.
[2025-05-30 10:38:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2025-05-30 10:38:41] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 3 ms to minimize.
[2025-05-30 10:38:41] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 2 ms to minimize.
[2025-05-30 10:38:41] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 2 ms to minimize.
[2025-05-30 10:38:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 464 ms
[2025-05-30 10:38:41] [INFO ] Added : 14 causal constraints over 6 iterations in 955 ms. Result :sat
Minimization took 269 ms.
[2025-05-30 10:38:42] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2025-05-30 10:38:42] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned sat
[2025-05-30 10:38:42] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2025-05-30 10:38:42] [INFO ] [Real]Added 74 Read/Feed constraints in 38 ms returned sat
[2025-05-30 10:38:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:38:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-05-30 10:38:42] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2025-05-30 10:38:42] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2025-05-30 10:38:42] [INFO ] [Nat]Added 74 Read/Feed constraints in 21 ms returned sat
[2025-05-30 10:38:42] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 3 ms to minimize.
[2025-05-30 10:38:42] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 2 ms to minimize.
[2025-05-30 10:38:42] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 2 ms to minimize.
[2025-05-30 10:38:43] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 3 ms to minimize.
[2025-05-30 10:38:43] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
[2025-05-30 10:38:43] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
[2025-05-30 10:38:43] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2025-05-30 10:38:43] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2025-05-30 10:38:43] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
[2025-05-30 10:38:43] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 2 ms to minimize.
[2025-05-30 10:38:43] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 3 ms to minimize.
[2025-05-30 10:38:44] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 3 ms to minimize.
[2025-05-30 10:38:44] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 2 ms to minimize.
[2025-05-30 10:38:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 1648 ms
[2025-05-30 10:38:44] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-05-30 10:38:44] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2025-05-30 10:38:44] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2025-05-30 10:38:44] [INFO ] [Real]Added 74 Read/Feed constraints in 14 ms returned sat
[2025-05-30 10:38:44] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:38:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-05-30 10:38:44] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2025-05-30 10:38:44] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2025-05-30 10:38:44] [INFO ] [Nat]Added 74 Read/Feed constraints in 15 ms returned sat
[2025-05-30 10:38:44] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 25 ms.
[2025-05-30 10:38:44] [INFO ] Added : 1 causal constraints over 1 iterations in 63 ms. Result :sat
Minimization took 115 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 2] Max Struct:[4, 1, 4]
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 2] Max Struct:[4, 4]
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 102 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 102 transition count 144
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 30 place count 79 transition count 97
Iterating global reduction 1 with 23 rules applied. Total rules applied 53 place count 79 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 79 transition count 96
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 65 place count 68 transition count 85
Iterating global reduction 2 with 11 rules applied. Total rules applied 76 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 78 place count 68 transition count 83
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 80 place count 66 transition count 79
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 66 transition count 79
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 84 place count 64 transition count 76
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 87 place count 63 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 63 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 90 place count 63 transition count 73
Applied a total of 90 rules in 84 ms. Remains 63 /109 variables (removed 46) and now considering 73/150 (removed 77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 63/109 places, 73/150 transitions.
// Phase 1: matrix 73 rows 63 cols
[2025-05-30 10:38:44] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 2] Max Struct:[4, 4]
RANDOM walk for 1000000 steps (229192 resets) in 1119 ms. (892 steps per ms)
BEST_FIRST walk for 2000001 steps (204070 resets) in 1187 ms. (1683 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 2] Max Struct:[4, 4]
[2025-05-30 10:38:47] [INFO ] Invariant cache hit.
[2025-05-30 10:38:47] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:38:47] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2025-05-30 10:38:47] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-05-30 10:38:47] [INFO ] [Real]Added 23 Read/Feed constraints in 4 ms returned sat
[2025-05-30 10:38:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:38:47] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:38:47] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-05-30 10:38:47] [INFO ] [Nat]Added 23 Read/Feed constraints in 4 ms returned sat
[2025-05-30 10:38:47] [INFO ] Computed and/alt/rep : 20/42/20 causal constraints (skipped 52 transitions) in 9 ms.
[2025-05-30 10:38:47] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 2 ms to minimize.
[2025-05-30 10:38:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2025-05-30 10:38:47] [INFO ] Added : 7 causal constraints over 3 iterations in 111 ms. Result :sat
Minimization took 40 ms.
[2025-05-30 10:38:47] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-30 10:38:47] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2025-05-30 10:38:47] [INFO ] [Real]Added 23 Read/Feed constraints in 6 ms returned sat
[2025-05-30 10:38:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:38:47] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:38:47] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2025-05-30 10:38:47] [INFO ] [Nat]Added 23 Read/Feed constraints in 9 ms returned sat
[2025-05-30 10:38:47] [INFO ] Computed and/alt/rep : 20/42/20 causal constraints (skipped 52 transitions) in 11 ms.
[2025-05-30 10:38:47] [INFO ] Added : 1 causal constraints over 1 iterations in 29 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 2] Max Struct:[4, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 2] Max Struct:[4, 4]
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 10 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 63/63 places, 73/73 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 9 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2025-05-30 10:38:47] [INFO ] Invariant cache hit.
[2025-05-30 10:38:47] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-05-30 10:38:47] [INFO ] Invariant cache hit.
[2025-05-30 10:38:48] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-05-30 10:38:48] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2025-05-30 10:38:48] [INFO ] Redundant transitions in 2 ms returned []
Running 72 sub problems to find dead transitions.
[2025-05-30 10:38:48] [INFO ] Invariant cache hit.
[2025-05-30 10:38:48] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/135 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 23/87 constraints. Problems are: Problem set: 0 solved, 72 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 1/136 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (OVERLAPS) 0/136 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 88 constraints, problems are : Problem set: 0 solved, 72 unsolved in 3333 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/135 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 23/87 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 68/155 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 1/136 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/136 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (OVERLAPS) 0/136 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 160 constraints, problems are : Problem set: 0 solved, 72 unsolved in 4348 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 7915ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 7941ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8240 ms. Remains : 63/63 places, 73/73 transitions.
RANDOM walk for 40000 steps (9139 resets) in 1187 ms. (33 steps per ms) remains 4/4 properties
[2025-05-30 10:38:58] [INFO ] Flatten gal took : 46 ms
[2025-05-30 10:38:58] [INFO ] Flatten gal took : 21 ms
BEST_FIRST walk for 40003 steps (4070 resets) in 621 ms. (64 steps per ms) remains 4/4 properties
[2025-05-30 10:38:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3312348052900971579.gal : 13 ms
BEST_FIRST walk for 40002 steps (4075 resets) in 429 ms. (93 steps per ms) remains 4/4 properties
[2025-05-30 10:38:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8301594095288189683.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3312348052900971579.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8301594095288189683.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality8301594095288189683.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 22
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :22 after 48
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :48 after 89
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :89 after 134
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :134 after 362
BEST_FIRST walk for 40003 steps (4091 resets) in 280 ms. (142 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :362 after 959
Invariant property MIN0 does not hold.
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :2232 after 2829
BEST_FIRST walk for 40000 steps (4105 resets) in 254 ms. (156 steps per ms) remains 4/4 properties
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :2829 after 4456
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,5520,0.127782,6432,2,1556,16,11076,9,0,327,7714,0
Total reachable state count : 5520

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,0.129786,6692,1,0,16,11076,9,0,328,7714,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,42,0.130273,6692,2,98,16,11076,10,0,330,7714,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,0.130481,6692,1,0,16,11076,10,0,330,7714,0
Invariant property MIN1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,0,0.130685,6692,1,0,16,11076,10,0,330,7714,0
Probably explored full state space saw : 5494 states, properties seen :1
Probabilistic random walk after 13376 steps, saw 5494 distinct states, run finished after 248 ms. (steps per millisecond=53 ) properties seen :1
Explored full state space saw : 5520 states, properties seen :0
Exhaustive walk after 13402 steps, saw 5520 distinct states, run finished after 156 ms. (steps per millisecond=85 ) properties seen :0
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-13 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[0] Max Struct:[4]
Starting property specific reduction for DBSingleClientW-PT-d0m04-UpperBounds-03
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:[4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[4]
[2025-05-30 10:38:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 10000 steps (2299 resets) in 8 ms. (1111 steps per ms)
BEST_FIRST walk for 10001 steps (1096 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2025-05-30 10:38:59] [INFO ] Invariant cache hit.
[2025-05-30 10:38:59] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:38:59] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-05-30 10:38:59] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-05-30 10:38:59] [INFO ] [Real]Added 23 Read/Feed constraints in 4 ms returned sat
[2025-05-30 10:38:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:38:59] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-30 10:38:59] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2025-05-30 10:38:59] [INFO ] [Nat]Added 23 Read/Feed constraints in 7 ms returned sat
[2025-05-30 10:38:59] [INFO ] Computed and/alt/rep : 20/42/20 causal constraints (skipped 52 transitions) in 19 ms.
[2025-05-30 10:38:59] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2025-05-30 10:38:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2025-05-30 10:38:59] [INFO ] Added : 7 causal constraints over 3 iterations in 192 ms. Result :sat
Minimization took 67 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 73/73 transitions.
Graph (complete) has 186 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 72
Applied a total of 2 rules in 12 ms. Remains 62 /63 variables (removed 1) and now considering 72/73 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 62/63 places, 72/73 transitions.
// Phase 1: matrix 72 rows 62 cols
[2025-05-30 10:38:59] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 1000000 steps (229020 resets) in 1054 ms. (947 steps per ms)
BEST_FIRST walk for 1000001 steps (102200 resets) in 385 ms. (2590 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2025-05-30 10:39:01] [INFO ] Invariant cache hit.
[2025-05-30 10:39:01] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-30 10:39:01] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-05-30 10:39:01] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-05-30 10:39:01] [INFO ] [Real]Added 22 Read/Feed constraints in 5 ms returned sat
[2025-05-30 10:39:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:39:01] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-30 10:39:01] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-05-30 10:39:01] [INFO ] [Nat]Added 22 Read/Feed constraints in 4 ms returned sat
[2025-05-30 10:39:01] [INFO ] Computed and/alt/rep : 20/42/20 causal constraints (skipped 51 transitions) in 9 ms.
[2025-05-30 10:39:01] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 2 ms to minimize.
[2025-05-30 10:39:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2025-05-30 10:39:01] [INFO ] Added : 8 causal constraints over 2 iterations in 100 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[4]
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 8 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 8 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.
[2025-05-30 10:39:01] [INFO ] Invariant cache hit.
[2025-05-30 10:39:01] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-05-30 10:39:01] [INFO ] Invariant cache hit.
[2025-05-30 10:39:01] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-05-30 10:39:01] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2025-05-30 10:39:01] [INFO ] Redundant transitions in 1 ms returned []
Running 71 sub problems to find dead transitions.
[2025-05-30 10:39:01] [INFO ] Invariant cache hit.
[2025-05-30 10:39:01] [INFO ] State equation strengthened by 22 read => feed constraints.
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
All remaining problems are real, not stopping.
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 2106 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]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
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 3401 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]
After SMT, in 5619ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 5621ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5864 ms. Remains : 62/62 places, 72/72 transitions.
[2025-05-30 10:39:07] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[4]
RANDOM walk for 1000000 steps (229303 resets) in 949 ms. (1052 steps per ms)
BEST_FIRST walk for 1000000 steps (101977 resets) in 395 ms. (2525 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[4]
[2025-05-30 10:39:08] [INFO ] Invariant cache hit.
[2025-05-30 10:39:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:39:08] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2025-05-30 10:39:08] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-05-30 10:39:09] [INFO ] [Real]Added 22 Read/Feed constraints in 7 ms returned sat
[2025-05-30 10:39:09] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:39:09] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:39:09] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2025-05-30 10:39:09] [INFO ] [Nat]Added 22 Read/Feed constraints in 8 ms returned sat
[2025-05-30 10:39:09] [INFO ] Computed and/alt/rep : 20/42/20 causal constraints (skipped 51 transitions) in 16 ms.
[2025-05-30 10:39:09] [INFO ] Added : 6 causal constraints over 2 iterations in 47 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[4]
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 9 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 9 ms. Remains 62 /62 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2025-05-30 10:39:09] [INFO ] Invariant cache hit.
[2025-05-30 10:39:09] [INFO ] Implicit Places using invariants in 112 ms returned []
[2025-05-30 10:39:09] [INFO ] Invariant cache hit.
[2025-05-30 10:39:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-05-30 10:39:09] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2025-05-30 10:39:09] [INFO ] Redundant transitions in 2 ms returned []
Running 71 sub problems to find dead transitions.
[2025-05-30 10:39:09] [INFO ] Invariant cache hit.
[2025-05-30 10:39:09] [INFO ] State equation strengthened by 22 read => feed constraints.
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
All remaining problems are real, not stopping.
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 2151 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]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
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 2808 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]
After SMT, in 5118ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 5120ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5447 ms. Remains : 62/62 places, 72/72 transitions.
[2025-05-30 10:39:14] [INFO ] Flatten gal took : 46 ms
RANDOM walk for 40000 steps (9206 resets) in 188 ms. (211 steps per ms) remains 2/2 properties
[2025-05-30 10:39:14] [INFO ] Flatten gal took : 33 ms
[2025-05-30 10:39:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16155868087881910642.gal : 8 ms
[2025-05-30 10:39:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9851211475418282129.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16155868087881910642.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9851211475418282129.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality9851211475418282129.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 56
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :56 after 114
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :114 after 184
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :184 after 471
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :471 after 1110
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1110 after 2079
BEST_FIRST walk for 40003 steps (3908 resets) in 253 ms. (157 steps per ms) remains 2/2 properties
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,4894,0.118799,6044,2,1356,13,8717,8,0,324,5969,0
Total reachable state count : 4894

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,0.120005,6044,1,0,13,8717,8,0,325,5969,0
Invariant property MIN0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.120915,6308,1,0,13,8717,8,0,325,5969,0
BEST_FIRST walk for 40003 steps (4026 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
Probably explored full state space saw : 4890 states, properties seen :0
Probabilistic random walk after 11753 steps, saw 4890 distinct states, run finished after 92 ms. (steps per millisecond=127 ) properties seen :0
Explored full state space saw : 4894 states, properties seen :0
Exhaustive walk after 11757 steps, saw 4894 distinct states, run finished after 70 ms. (steps per millisecond=167 ) properties seen :0
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-03 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for DBSingleClientW-PT-d0m04-UpperBounds-03 in 15641 ms.
[2025-05-30 10:39:15] [INFO ] Flatten gal took : 24 ms
Total runtime 36189 ms.

BK_STOP 1748601555162

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-d0m04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is DBSingleClientW-PT-d0m04, 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 r069-smll-174854075700001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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