Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r092-tall-171624189300461.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is DBSingleClientW-PT-d0m07, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189300461
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 12:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 12:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 12:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 12:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 119K May 18 16:42 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

here is the order used to build the result vector(from text file)
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716317827948

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-21 18:57:09] [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]
[2024-05-21 18:57:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 18:57:09] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-05-21 18:57:09] [INFO ] Transformed 553 places.
[2024-05-21 18:57:09] [INFO ] Transformed 150 transitions.
[2024-05-21 18:57:09] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 444 places in 1 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-14 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
[2024-05-21 18:57:09] [INFO ] Computed 6 invariants in 47 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[6, 6, 3]
RANDOM walk for 10000 steps (2283 resets) in 54 ms. (181 steps per ms)
BEST_FIRST walk for 30001 steps (2985 resets) in 102 ms. (291 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1] Max Struct:[6, 6, 3]
[2024-05-21 18:57:09] [INFO ] Invariant cache hit.
[2024-05-21 18:57:09] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-05-21 18:57:09] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 17 ms returned unsat
[2024-05-21 18:57:09] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-21 18:57:09] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned unsat
[2024-05-21 18:57:09] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-21 18:57:10] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 15 ms returned sat
[2024-05-21 18:57:10] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-05-21 18:57:10] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-21 18:57:10] [INFO ] [Real]Added 74 Read/Feed constraints in 37 ms returned sat
[2024-05-21 18:57:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 18:57:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-05-21 18:57:10] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned sat
[2024-05-21 18:57:10] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-05-21 18:57:10] [INFO ] [Nat]Added 74 Read/Feed constraints in 14 ms returned sat
[2024-05-21 18:57:10] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 25 ms.
[2024-05-21 18:57:10] [INFO ] Added : 2 causal constraints over 1 iterations in 74 ms. Result :sat
Minimization took 186 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1] Max Struct:[1, 1, 3]
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[3]
Support contains 1 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.1 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 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 38 place count 77 transition count 95
Iterating global reduction 1 with 24 rules applied. Total rules applied 62 place count 77 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 77 transition count 94
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 75 place count 65 transition count 82
Iterating global reduction 2 with 12 rules applied. Total rules applied 87 place count 65 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 89 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 91 place count 63 transition count 77
Iterating global reduction 3 with 2 rules applied. Total rules applied 93 place count 63 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 63 transition count 76
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 95 place count 62 transition count 74
Iterating global reduction 4 with 1 rules applied. Total rules applied 96 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 97 place count 61 transition count 73
Iterating global reduction 4 with 1 rules applied. Total rules applied 98 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 99 place count 60 transition count 72
Iterating global reduction 4 with 1 rules applied. Total rules applied 100 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 102 place count 60 transition count 70
Applied a total of 102 rules in 56 ms. Remains 60 /109 variables (removed 49) and now considering 70/150 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 60/109 places, 70/150 transitions.
// Phase 1: matrix 70 rows 60 cols
[2024-05-21 18:57:10] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[3]
RANDOM walk for 1000000 steps (228980 resets) in 803 ms. (1243 steps per ms)
BEST_FIRST walk for 1000001 steps (100979 resets) in 348 ms. (2865 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[3]
[2024-05-21 18:57:11] [INFO ] Invariant cache hit.
[2024-05-21 18:57:11] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 18:57:11] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-21 18:57:11] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 18:57:11] [INFO ] [Real]Added 20 Read/Feed constraints in 3 ms returned sat
[2024-05-21 18:57:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 18:57:12] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 18:57:12] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-21 18:57:12] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2024-05-21 18:57:12] [INFO ] Computed and/alt/rep : 19/42/19 causal constraints (skipped 50 transitions) in 7 ms.
[2024-05-21 18:57:12] [INFO ] Added : 2 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[3]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 7 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 60/60 places, 70/70 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-05-21 18:57:12] [INFO ] Invariant cache hit.
[2024-05-21 18:57:12] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 18:57:12] [INFO ] Invariant cache hit.
[2024-05-21 18:57:12] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 18:57:12] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-05-21 18:57:12] [INFO ] Redundant transitions in 1 ms returned []
Running 69 sub problems to find dead transitions.
[2024-05-21 18:57:12] [INFO ] Invariant cache hit.
[2024-05-21 18:57:12] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 82 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1063 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 69/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 151 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1734 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
After SMT, in 2909ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 2921ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3102 ms. Remains : 60/60 places, 70/70 transitions.
[2024-05-21 18:57:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[3]
RANDOM walk for 1000000 steps (229391 resets) in 618 ms. (1615 steps per ms)
BEST_FIRST walk for 1000000 steps (101531 resets) in 298 ms. (3344 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[3]
[2024-05-21 18:57:16] [INFO ] Invariant cache hit.
[2024-05-21 18:57:16] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 18:57:16] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-21 18:57:16] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 18:57:16] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2024-05-21 18:57:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 18:57:16] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 18:57:16] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-21 18:57:16] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2024-05-21 18:57:16] [INFO ] Computed and/alt/rep : 19/42/19 causal constraints (skipped 50 transitions) in 9 ms.
[2024-05-21 18:57:16] [INFO ] Added : 2 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[3]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 6 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 60/60 places, 70/70 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-05-21 18:57:16] [INFO ] Invariant cache hit.
[2024-05-21 18:57:16] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 18:57:16] [INFO ] Invariant cache hit.
[2024-05-21 18:57:16] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 18:57:16] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-05-21 18:57:16] [INFO ] Redundant transitions in 1 ms returned []
Running 69 sub problems to find dead transitions.
[2024-05-21 18:57:16] [INFO ] Invariant cache hit.
[2024-05-21 18:57:16] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 82 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1005 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 69/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 151 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1668 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
After SMT, in 2742ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 2744ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2900 ms. Remains : 60/60 places, 70/70 transitions.
RANDOM walk for 40000 steps (9135 resets) in 655 ms. (60 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4012 resets) in 215 ms. (185 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (3915 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
[2024-05-21 18:57:19] [INFO ] Flatten gal took : 49 ms
[2024-05-21 18:57:19] [INFO ] Flatten gal took : 22 ms
[2024-05-21 18:57:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9211079834087293227.gal : 6 ms
[2024-05-21 18:57:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13804357945568942082.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/ReachabilityCardinality9211079834087293227.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13804357945568942082.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/ReachabilityCardinality13804357945568942082.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 126
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :126 after 280
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :280 after 508
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :508 after 4137
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :4137 after 7718
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :7718 after 32018
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :32018 after 68968
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :68968 after 235760
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :235760 after 652148
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,1.04184e+06,0.817505,28396,2,7347,17,96612,8,0,314,98878,0
Total reachable state count : 1041844

Verifying 2 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,39,0.819196,28656,2,90,17,96612,8,0,316,98878,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,39,0.820309,28656,2,90,17,96612,8,0,316,98878,0
Finished probabilistic random walk after 575763 steps, run visited all 2 properties in 1641 ms. (steps per millisecond=350 )
Probabilistic random walk after 575763 steps, saw 220401 distinct states, run finished after 1645 ms. (steps per millisecond=350 ) properties seen :2
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-15 3 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 12116 ms.

BK_STOP 1716317841328

--------------------
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-d0m07"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is DBSingleClientW-PT-d0m07, 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 r092-tall-171624189300461"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d0m07.tgz
mv DBSingleClientW-PT-d0m07 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;