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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 18K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 12:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 12 12:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 12:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K 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-d0m06-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716285595104

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-d0m06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 09:59:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 09:59:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 09:59:56] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2024-05-21 09:59:56] [INFO ] Transformed 553 places.
[2024-05-21 09:59:56] [INFO ] Transformed 150 transitions.
[2024-05-21 09:59:56] [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 7 ms.
Deduced a syphon composed of 444 places in 1 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-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:59:56] [INFO ] Computed 6 invariants in 29 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[6, 341]
RANDOM walk for 10000 steps (2290 resets) in 47 ms. (208 steps per ms)
BEST_FIRST walk for 20000 steps (2013 resets) in 41 ms. (476 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 1] Max Struct:[6, 341]
[2024-05-21 09:59:56] [INFO ] Invariant cache hit.
[2024-05-21 09:59:56] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 09:59:56] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-21 09:59:56] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-05-21 09:59:56] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-21 09:59:56] [INFO ] [Real]Added 74 Read/Feed constraints in 17 ms returned sat
[2024-05-21 09:59:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:59:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-21 09:59:57] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-21 09:59:57] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-21 09:59:57] [INFO ] [Nat]Added 74 Read/Feed constraints in 9 ms returned sat
[2024-05-21 09:59:57] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 26 ms.
[2024-05-21 09:59:57] [INFO ] Added : 1 causal constraints over 1 iterations in 53 ms. Result :sat
Minimization took 57 ms.
[2024-05-21 09:59:57] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-21 09:59:57] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2, 1] Max Struct:[6, 1]
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[6]
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 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 92 place count 62 transition count 74
Iterating global reduction 3 with 3 rules applied. Total rules applied 95 place count 62 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 96 place count 62 transition count 73
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 98 place count 60 transition count 70
Iterating global reduction 4 with 2 rules applied. Total rules applied 100 place count 60 transition count 70
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 102 place count 58 transition count 68
Iterating global reduction 4 with 2 rules applied. Total rules applied 104 place count 58 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 106 place count 58 transition count 66
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 107 place count 57 transition count 65
Iterating global reduction 5 with 1 rules applied. Total rules applied 108 place count 57 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 110 place count 57 transition count 63
Applied a total of 110 rules in 54 ms. Remains 57 /109 variables (removed 52) and now considering 63/150 (removed 87) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 57/109 places, 63/150 transitions.
// Phase 1: matrix 63 rows 57 cols
[2024-05-21 09:59:57] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[6]
RANDOM walk for 1000000 steps (229155 resets) in 805 ms. (1240 steps per ms)
BEST_FIRST walk for 1000001 steps (101267 resets) in 352 ms. (2832 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[6]
[2024-05-21 09:59:58] [INFO ] Invariant cache hit.
[2024-05-21 09:59:58] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 09:59:58] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-21 09:59:58] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-21 09:59:58] [INFO ] [Real]Added 19 Read/Feed constraints in 2 ms returned sat
[2024-05-21 09:59:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:59:58] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 09:59:58] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-21 09:59:58] [INFO ] [Nat]Added 19 Read/Feed constraints in 5 ms returned sat
[2024-05-21 09:59:58] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 10 ms to minimize.
[2024-05-21 09:59:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-05-21 09:59:58] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 44 transitions) in 9 ms.
[2024-05-21 09:59:58] [INFO ] Added : 1 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[6]
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 11 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 57/57 places, 63/63 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 09:59:58] [INFO ] Invariant cache hit.
[2024-05-21 09:59:58] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 09:59:58] [INFO ] Invariant cache hit.
[2024-05-21 09:59:58] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-21 09:59:58] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2024-05-21 09:59:58] [INFO ] Redundant transitions in 0 ms returned []
Running 62 sub problems to find dead transitions.
[2024-05-21 09:59:58] [INFO ] Invariant cache hit.
[2024-05-21 09:59:58] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 63/120 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 19/78 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 0/120 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 78 constraints, problems are : Problem set: 0 solved, 62 unsolved in 932 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 63/120 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 19/78 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 62/140 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 0/120 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 140 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1414 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
After SMT, in 2427ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 2435ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2608 ms. Remains : 57/57 places, 63/63 transitions.
[2024-05-21 10:00:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[6]
RANDOM walk for 1000000 steps (229838 resets) in 596 ms. (1675 steps per ms)
BEST_FIRST walk for 1000000 steps (101486 resets) in 301 ms. (3311 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[6]
[2024-05-21 10:00:02] [INFO ] Invariant cache hit.
[2024-05-21 10:00:02] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 10:00:02] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-21 10:00:02] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-21 10:00:02] [INFO ] [Real]Added 19 Read/Feed constraints in 4 ms returned sat
[2024-05-21 10:00:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:00:02] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 10:00:02] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-21 10:00:02] [INFO ] [Nat]Added 19 Read/Feed constraints in 2 ms returned sat
[2024-05-21 10:00:02] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 2 ms to minimize.
[2024-05-21 10:00:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2024-05-21 10:00:02] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 44 transitions) in 6 ms.
[2024-05-21 10:00:02] [INFO ] Added : 1 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[6]
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 5 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 57/57 places, 63/63 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 10:00:02] [INFO ] Invariant cache hit.
[2024-05-21 10:00:02] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 10:00:02] [INFO ] Invariant cache hit.
[2024-05-21 10:00:02] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-21 10:00:02] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2024-05-21 10:00:02] [INFO ] Redundant transitions in 0 ms returned []
Running 62 sub problems to find dead transitions.
[2024-05-21 10:00:02] [INFO ] Invariant cache hit.
[2024-05-21 10:00:02] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 63/120 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 19/78 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 0/120 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 78 constraints, problems are : Problem set: 0 solved, 62 unsolved in 807 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 63/120 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 19/78 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 62/140 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 0/120 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 140 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1396 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
After SMT, in 2255ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 2256ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2401 ms. Remains : 57/57 places, 63/63 transitions.
RANDOM walk for 40000 steps (9236 resets) in 485 ms. (82 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (4097 resets) in 147 ms. (270 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (4051 resets) in 153 ms. (259 steps per ms) remains 2/2 properties
Probably explored full state space saw : 133243 states, properties seen :0
Probabilistic random walk after 332150 steps, saw 133243 distinct states, run finished after 922 ms. (steps per millisecond=360 ) properties seen :0
Explored full state space saw : 133286 states, properties seen :0
Exhaustive walk after 332203 steps, saw 133286 distinct states, run finished after 730 ms. (steps per millisecond=455 ) properties seen :0
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-08 4 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 10403 ms.
ITS solved all properties within timeout

BK_STOP 1716285606756

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

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