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.r091-tall-171624187700445.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 greatspnxred
Input is DBSingleClientW-PT-d0m05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624187700445
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 16K Apr 12 12:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 184K Apr 12 12:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 12 12:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 12:49 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-d0m05-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d0m05-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d0m05-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d0m05-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d0m05-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d0m05-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d0m05-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d0m05-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d0m05-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d0m05-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d0m05-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d0m05-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d0m05-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d0m05-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d0m05-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d0m05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716285048029

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 09:50:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 09:50:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 09:50:49] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-05-21 09:50:49] [INFO ] Transformed 553 places.
[2024-05-21 09:50:49] [INFO ] Transformed 150 transitions.
[2024-05-21 09:50:49] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m05-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0] Max Struct:[+inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0] Max Struct:[+inf, +inf]
// Phase 1: matrix 150 rows 109 cols
[2024-05-21 09:50:49] [INFO ] Computed 6 invariants in 30 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[6, 5]
RANDOM walk for 10000 steps (2311 resets) in 38 ms. (256 steps per ms)
BEST_FIRST walk for 20001 steps (2059 resets) in 41 ms. (476 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[6, 5]
[2024-05-21 09:50:49] [INFO ] Invariant cache hit.
[2024-05-21 09:50:49] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-05-21 09:50:49] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 7 ms returned sat
[2024-05-21 09:50:49] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2024-05-21 09:50:49] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-21 09:50:50] [INFO ] [Real]Added 74 Read/Feed constraints in 23 ms returned sat
[2024-05-21 09:50:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:50:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-21 09:50:50] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-21 09:50:50] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-21 09:50:50] [INFO ] [Nat]Added 74 Read/Feed constraints in 10 ms returned sat
[2024-05-21 09:50:50] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 7 ms to minimize.
[2024-05-21 09:50:50] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 2 ms to minimize.
[2024-05-21 09:50:50] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 1 ms to minimize.
[2024-05-21 09:50:50] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 2 ms to minimize.
[2024-05-21 09:50:50] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-05-21 09:50:50] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-21 09:50:51] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 6 ms to minimize.
[2024-05-21 09:50:51] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 2 ms to minimize.
[2024-05-21 09:50:51] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-21 09:50:51] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
[2024-05-21 09:50:51] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1177 ms
[2024-05-21 09:50:51] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 16 ms.
[2024-05-21 09:50:51] [INFO ] Added : 13 causal constraints over 3 iterations in 66 ms. Result :sat
Minimization took 82 ms.
[2024-05-21 09:50:51] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-21 09:50:51] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-21 09:50:51] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-21 09:50:51] [INFO ] [Real]Added 74 Read/Feed constraints in 8 ms returned sat
[2024-05-21 09:50:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:50:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-21 09:50:51] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-21 09:50:51] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-21 09:50:51] [INFO ] [Nat]Added 74 Read/Feed constraints in 9 ms returned sat
[2024-05-21 09:50:51] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 2 ms to minimize.
[2024-05-21 09:50:51] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 2 ms to minimize.
[2024-05-21 09:50:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 126 ms
[2024-05-21 09:50:51] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 18 ms.
[2024-05-21 09:50:51] [INFO ] Added : 8 causal constraints over 2 iterations in 61 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[6, 5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[6, 5]
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 150/150 transitions.
Graph (complete) has 332 edges and 109 vertex of which 101 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 101 transition count 137
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 36 place count 79 transition count 97
Iterating global reduction 1 with 22 rules applied. Total rules applied 58 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 59 place count 79 transition count 96
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 71 place count 67 transition count 84
Iterating global reduction 2 with 12 rules applied. Total rules applied 83 place count 67 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 84 place count 67 transition count 83
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 87 place count 64 transition count 77
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 64 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 91 place count 64 transition count 76
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 93 place count 62 transition count 73
Iterating global reduction 4 with 2 rules applied. Total rules applied 95 place count 62 transition count 73
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 97 place count 60 transition count 71
Iterating global reduction 4 with 2 rules applied. Total rules applied 99 place count 60 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 101 place count 60 transition count 69
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 102 place count 59 transition count 68
Iterating global reduction 5 with 1 rules applied. Total rules applied 103 place count 59 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 105 place count 59 transition count 66
Applied a total of 105 rules in 46 ms. Remains 59 /109 variables (removed 50) and now considering 66/150 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 59/109 places, 66/150 transitions.
// Phase 1: matrix 66 rows 59 cols
[2024-05-21 09:50:52] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[6, 5]
RANDOM walk for 1000000 steps (229023 resets) in 685 ms. (1457 steps per ms)
BEST_FIRST walk for 2000001 steps (203954 resets) in 701 ms. (2849 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[6, 5]
[2024-05-21 09:50:53] [INFO ] Invariant cache hit.
[2024-05-21 09:50:53] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 09:50:53] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-21 09:50:53] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 09:50:53] [INFO ] [Real]Added 20 Read/Feed constraints in 3 ms returned sat
[2024-05-21 09:50:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:50:53] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 09:50:53] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-21 09:50:53] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2024-05-21 09:50:53] [INFO ] Computed and/alt/rep : 19/37/19 causal constraints (skipped 46 transitions) in 6 ms.
[2024-05-21 09:50:53] [INFO ] Added : 9 causal constraints over 3 iterations in 32 ms. Result :sat
Minimization took 18 ms.
[2024-05-21 09:50:53] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 09:50:53] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-21 09:50:53] [INFO ] [Real]Added 20 Read/Feed constraints in 3 ms returned sat
[2024-05-21 09:50:53] [INFO ] Computed and/alt/rep : 19/37/19 causal constraints (skipped 46 transitions) in 6 ms.
[2024-05-21 09:50:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:50:53] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 09:50:53] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-21 09:50:53] [INFO ] [Nat]Added 20 Read/Feed constraints in 11 ms returned sat
[2024-05-21 09:50:53] [INFO ] Computed and/alt/rep : 19/37/19 causal constraints (skipped 46 transitions) in 5 ms.
[2024-05-21 09:50:53] [INFO ] Added : 10 causal constraints over 4 iterations in 32 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[6, 5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[6, 5]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 66/66 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 59/59 places, 66/66 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 66/66 transitions.
Applied a total of 0 rules in 4 ms. Remains 59 /59 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2024-05-21 09:50:53] [INFO ] Invariant cache hit.
[2024-05-21 09:50:53] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 09:50:53] [INFO ] Invariant cache hit.
[2024-05-21 09:50:53] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 09:50:54] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2024-05-21 09:50:54] [INFO ] Redundant transitions in 0 ms returned []
Running 65 sub problems to find dead transitions.
[2024-05-21 09:50:54] [INFO ] Invariant cache hit.
[2024-05-21 09:50:54] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 66/125 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/125 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 81 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1045 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 66/125 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 65/146 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 146 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1688 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 2817ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 2827ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3015 ms. Remains : 59/59 places, 66/66 transitions.
RANDOM walk for 40000 steps (9225 resets) in 945 ms. (42 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (3981 resets) in 121 ms. (327 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4117 resets) in 105 ms. (377 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (4011 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (4021 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
Probably explored full state space saw : 20798 states, properties seen :2
Probabilistic random walk after 51071 steps, saw 20798 distinct states, run finished after 269 ms. (steps per millisecond=189 ) properties seen :2
Explored full state space saw : 20822 states, properties seen :0
Exhaustive walk after 51100 steps, saw 20822 distinct states, run finished after 191 ms. (steps per millisecond=267 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0] Max Struct:[6, 5]
Starting property specific reduction for DBSingleClientW-PT-d0m05-UpperBounds-01
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:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
[2024-05-21 09:50:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (2289 resets) in 20 ms. (476 steps per ms)
BEST_FIRST walk for 10000 steps (1014 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-21 09:50:57] [INFO ] Invariant cache hit.
[2024-05-21 09:50:57] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 09:50:57] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-21 09:50:57] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 09:50:57] [INFO ] [Real]Added 20 Read/Feed constraints in 3 ms returned sat
[2024-05-21 09:50:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:50:57] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 09:50:57] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-21 09:50:57] [INFO ] [Nat]Added 20 Read/Feed constraints in 4 ms returned sat
[2024-05-21 09:50:58] [INFO ] Computed and/alt/rep : 19/37/19 causal constraints (skipped 46 transitions) in 12 ms.
[2024-05-21 09:50:58] [INFO ] Added : 9 causal constraints over 3 iterations in 34 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 66/66 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 58 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 58 transition count 65
Applied a total of 2 rules in 5 ms. Remains 58 /59 variables (removed 1) and now considering 65/66 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 58/59 places, 65/66 transitions.
// Phase 1: matrix 65 rows 58 cols
[2024-05-21 09:50:58] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 1000000 steps (229066 resets) in 577 ms. (1730 steps per ms)
BEST_FIRST walk for 1000001 steps (101891 resets) in 302 ms. (3300 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-21 09:50:58] [INFO ] Invariant cache hit.
[2024-05-21 09:50:58] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 09:50:58] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-21 09:50:58] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-21 09:50:58] [INFO ] [Real]Added 19 Read/Feed constraints in 2 ms returned sat
[2024-05-21 09:50:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:50:59] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 09:50:59] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-21 09:50:59] [INFO ] [Nat]Added 19 Read/Feed constraints in 2 ms returned sat
[2024-05-21 09:50:59] [INFO ] Computed and/alt/rep : 19/37/19 causal constraints (skipped 45 transitions) in 5 ms.
[2024-05-21 09:50:59] [INFO ] Added : 9 causal constraints over 3 iterations in 22 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 65/65 transitions.
Applied a total of 0 rules in 4 ms. Remains 58 /58 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 58/58 places, 65/65 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 65/65 transitions.
Applied a total of 0 rules in 4 ms. Remains 58 /58 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-21 09:50:59] [INFO ] Invariant cache hit.
[2024-05-21 09:50:59] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 09:50:59] [INFO ] Invariant cache hit.
[2024-05-21 09:50:59] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-21 09:50:59] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-05-21 09:50:59] [INFO ] Redundant transitions in 0 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-21 09:50:59] [INFO ] Invariant cache hit.
[2024-05-21 09:50:59] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 65/123 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 19/79 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/123 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 79 constraints, problems are : Problem set: 0 solved, 64 unsolved in 868 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 65/123 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 19/79 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 64/143 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/123 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 143 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1489 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 2414ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 2415ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2554 ms. Remains : 58/58 places, 65/65 transitions.
RANDOM walk for 40000 steps (9182 resets) in 108 ms. (366 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4074 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4090 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
Probably explored full state space saw : 19828 states, properties seen :1
Probabilistic random walk after 48443 steps, saw 19828 distinct states, run finished after 70 ms. (steps per millisecond=692 ) properties seen :1
Explored full state space saw : 19856 states, properties seen :0
Exhaustive walk after 48476 steps, saw 19856 distinct states, run finished after 29 ms. (steps per millisecond=1671 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[6]
Ending property specific reduction for DBSingleClientW-PT-d0m05-UpperBounds-01 in 4032 ms.
Starting property specific reduction for DBSingleClientW-PT-d0m05-UpperBounds-02
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:[5]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[5]
// Phase 1: matrix 66 rows 59 cols
[2024-05-21 09:51:01] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5]
RANDOM walk for 10000 steps (2293 resets) in 7 ms. (1250 steps per ms)
BEST_FIRST walk for 10001 steps (1013 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[5]
[2024-05-21 09:51:01] [INFO ] Invariant cache hit.
[2024-05-21 09:51:01] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 29 ms returned sat
[2024-05-21 09:51:02] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-05-21 09:51:02] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 09:51:02] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2024-05-21 09:51:02] [INFO ] Computed and/alt/rep : 19/37/19 causal constraints (skipped 46 transitions) in 5 ms.
[2024-05-21 09:51:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:51:02] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 09:51:02] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-21 09:51:02] [INFO ] [Nat]Added 20 Read/Feed constraints in 4 ms returned sat
[2024-05-21 09:51:02] [INFO ] Computed and/alt/rep : 19/37/19 causal constraints (skipped 46 transitions) in 5 ms.
[2024-05-21 09:51:02] [INFO ] Added : 10 causal constraints over 4 iterations in 27 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[5]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 66/66 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 58 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 58 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 58 transition count 64
Applied a total of 3 rules in 7 ms. Remains 58 /59 variables (removed 1) and now considering 64/66 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 58/59 places, 64/66 transitions.
// Phase 1: matrix 64 rows 58 cols
[2024-05-21 09:51:02] [INFO ] Computed 2 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5]
RANDOM walk for 1000000 steps (229261 resets) in 552 ms. (1808 steps per ms)
BEST_FIRST walk for 1000000 steps (101645 resets) in 295 ms. (3378 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[5]
[2024-05-21 09:51:03] [INFO ] Invariant cache hit.
[2024-05-21 09:51:03] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 09:51:03] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-21 09:51:03] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 09:51:03] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2024-05-21 09:51:03] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 45 transitions) in 4 ms.
[2024-05-21 09:51:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:51:03] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 09:51:03] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-21 09:51:03] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2024-05-21 09:51:03] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 45 transitions) in 5 ms.
[2024-05-21 09:51:03] [INFO ] Added : 7 causal constraints over 2 iterations in 22 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[5]
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 64/64 transitions.
Applied a total of 0 rules in 5 ms. Remains 58 /58 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 58/58 places, 64/64 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-21 09:51:03] [INFO ] Invariant cache hit.
[2024-05-21 09:51:03] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-21 09:51:03] [INFO ] Invariant cache hit.
[2024-05-21 09:51:03] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 09:51:03] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2024-05-21 09:51:03] [INFO ] Redundant transitions in 2 ms returned []
Running 63 sub problems to find dead transitions.
[2024-05-21 09:51:03] [INFO ] Invariant cache hit.
[2024-05-21 09:51:03] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 80 constraints, problems are : Problem set: 0 solved, 63 unsolved in 893 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 63/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 143 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1460 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
After SMT, in 2409ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 2412ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2543 ms. Remains : 58/58 places, 64/64 transitions.
RANDOM walk for 40000 steps (9147 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4064 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (3982 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
Probably explored full state space saw : 20630 states, properties seen :1
Probabilistic random walk after 50699 steps, saw 20630 distinct states, run finished after 60 ms. (steps per millisecond=844 ) properties seen :1
Explored full state space saw : 20654 states, properties seen :0
Exhaustive walk after 50728 steps, saw 20654 distinct states, run finished after 30 ms. (steps per millisecond=1690 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[5]
Ending property specific reduction for DBSingleClientW-PT-d0m05-UpperBounds-02 in 4137 ms.
[2024-05-21 09:51:06] [INFO ] Flatten gal took : 30 ms
[2024-05-21 09:51:06] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-21 09:51:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 59 places, 66 transitions and 260 arcs took 3 ms.
Total runtime 17168 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DBSingleClientW-PT-d0m05

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 59
TRANSITIONS: 66
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.002s, Sys 0.000s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 676
MODEL NAME: /home/mcc/execution/412/model
59 places, 66 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DBSingleClientW-PT-d0m05-UpperBounds-01 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d0m05-UpperBounds-02 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716285067123

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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-d0m05"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is DBSingleClientW-PT-d0m05, 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 r091-tall-171624187700445"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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