Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620398500583.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BusinessProcesses-PT-17, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398500583
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 11 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 16:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 16:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 161K 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716308056286

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 16:14:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 16:14:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 16:14:17] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2024-05-21 16:14:17] [INFO ] Transformed 650 places.
[2024-05-21 16:14:17] [INFO ] Transformed 580 transitions.
[2024-05-21 16:14:17] [INFO ] Found NUPN structural information;
[2024-05-21 16:14:17] [INFO ] Parsed PT model containing 650 places and 580 transitions and 1709 arcs in 249 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 13 ms
Reduce places removed 4 places and 4 transitions.
RANDOM walk for 40000 steps (259 resets) in 2122 ms. (18 steps per ms) remains 10/15 properties
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (57 resets) in 392 ms. (101 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (45 resets) in 279 ms. (142 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (43 resets) in 173 ms. (229 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (48 resets) in 841 ms. (47 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (45 resets) in 132 ms. (300 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (46 resets) in 228 ms. (174 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (48 resets) in 349 ms. (114 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (45 resets) in 156 ms. (254 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (45 resets) in 133 ms. (298 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (47 resets) in 93 ms. (425 steps per ms) remains 10/10 properties
// Phase 1: matrix 576 rows 646 cols
[2024-05-21 16:14:19] [INFO ] Computed 108 invariants in 37 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 391/541 variables, 62/212 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/541 variables, 391/603 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/541 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 105/646 variables, 46/649 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 105/754 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem BusinessProcesses-PT-17-ReachabilityFireability-2024-04 is UNSAT
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 576/1222 variables, 646/1400 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1222 variables, 0/1400 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/1222 variables, 0/1400 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1222/1222 variables, and 1400 constraints, problems are : Problem set: 1 solved, 9 unsolved in 2850 ms.
Refiners :[Domain max(s): 646/646 constraints, Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 646/646 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 149/149 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem BusinessProcesses-PT-17-ReachabilityFireability-2024-01 is UNSAT
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-17-ReachabilityFireability-2024-12 is UNSAT
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 391/540 variables, 62/211 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 391/602 constraints. Problems are: Problem set: 3 solved, 7 unsolved
[2024-05-21 16:14:23] [INFO ] Deduced a trap composed of 14 places in 305 ms of which 40 ms to minimize.
[2024-05-21 16:14:23] [INFO ] Deduced a trap composed of 31 places in 221 ms of which 4 ms to minimize.
[2024-05-21 16:14:23] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 4 ms to minimize.
[2024-05-21 16:14:24] [INFO ] Deduced a trap composed of 129 places in 197 ms of which 3 ms to minimize.
[2024-05-21 16:14:24] [INFO ] Deduced a trap composed of 19 places in 218 ms of which 3 ms to minimize.
[2024-05-21 16:14:24] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:14:24] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 4 ms to minimize.
[2024-05-21 16:14:24] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 2 ms to minimize.
[2024-05-21 16:14:24] [INFO ] Deduced a trap composed of 50 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:14:25] [INFO ] Deduced a trap composed of 114 places in 156 ms of which 3 ms to minimize.
[2024-05-21 16:14:25] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:14:25] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:14:25] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:14:25] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:14:25] [INFO ] Deduced a trap composed of 140 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:14:25] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-05-21 16:14:25] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-21 16:14:26] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 2 ms to minimize.
[2024-05-21 16:14:26] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2024-05-21 16:14:26] [INFO ] Deduced a trap composed of 132 places in 132 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 20/622 constraints. Problems are: Problem set: 3 solved, 7 unsolved
[2024-05-21 16:14:26] [INFO ] Deduced a trap composed of 133 places in 259 ms of which 2 ms to minimize.
[2024-05-21 16:14:26] [INFO ] Deduced a trap composed of 140 places in 172 ms of which 3 ms to minimize.
[2024-05-21 16:14:26] [INFO ] Deduced a trap composed of 129 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:14:27] [INFO ] Deduced a trap composed of 136 places in 191 ms of which 5 ms to minimize.
[2024-05-21 16:14:27] [INFO ] Deduced a trap composed of 178 places in 184 ms of which 2 ms to minimize.
[2024-05-21 16:14:27] [INFO ] Deduced a trap composed of 140 places in 192 ms of which 8 ms to minimize.
[2024-05-21 16:14:27] [INFO ] Deduced a trap composed of 145 places in 199 ms of which 7 ms to minimize.
SMT process timed out in 8109ms, After SMT, problems are : Problem set: 3 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 85 out of 646 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 646/646 places, 576/576 transitions.
Graph (complete) has 1312 edges and 646 vertex of which 642 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 642 transition count 506
Reduce places removed 69 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 75 rules applied. Total rules applied 145 place count 573 transition count 500
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 151 place count 567 transition count 500
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 114 Pre rules applied. Total rules applied 151 place count 567 transition count 386
Deduced a syphon composed of 114 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 241 rules applied. Total rules applied 392 place count 440 transition count 386
Discarding 69 places :
Symmetric choice reduction at 3 with 69 rule applications. Total rules 461 place count 371 transition count 317
Iterating global reduction 3 with 69 rules applied. Total rules applied 530 place count 371 transition count 317
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 530 place count 371 transition count 313
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 540 place count 365 transition count 313
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 167 rules applied. Total rules applied 707 place count 280 transition count 231
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 708 place count 280 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 709 place count 279 transition count 230
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 711 place count 279 transition count 230
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 712 place count 278 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 713 place count 277 transition count 229
Applied a total of 713 rules in 199 ms. Remains 277 /646 variables (removed 369) and now considering 229/576 (removed 347) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 218 ms. Remains : 277/646 places, 229/576 transitions.
RANDOM walk for 40000 steps (807 resets) in 981 ms. (40 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (153 resets) in 277 ms. (143 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (155 resets) in 182 ms. (218 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (156 resets) in 160 ms. (248 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (155 resets) in 132 ms. (300 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (173 resets) in 138 ms. (287 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (152 resets) in 130 ms. (305 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (157 resets) in 64 ms. (615 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 1083915 steps, run timeout after 3001 ms. (steps per millisecond=361 ) properties seen :6 out of 7
Probabilistic random walk after 1083915 steps, saw 170401 distinct states, run finished after 3004 ms. (steps per millisecond=360 ) properties seen :6
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 229 rows 277 cols
[2024-05-21 16:14:31] [INFO ] Computed 86 invariants in 13 ms
[2024-05-21 16:14:31] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/193 variables, 50/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:14:32] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:14:32] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 2 ms to minimize.
[2024-05-21 16:14:32] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:14:32] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 2 ms to minimize.
[2024-05-21 16:14:32] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:14:32] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 2 ms to minimize.
[2024-05-21 16:14:32] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:14:32] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 4 ms to minimize.
[2024-05-21 16:14:32] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
[2024-05-21 16:14:32] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-05-21 16:14:32] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:14:32] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/200 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 65/265 variables, 25/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/268 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/268 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 228/496 variables, 268/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/496 variables, 3/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/496 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 10/506 variables, 9/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/506 variables, 3/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/506 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/506 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 378 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1068 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 277/277 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/193 variables, 50/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:14:33] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 3 ms to minimize.
[2024-05-21 16:14:33] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:14:33] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 1 ms to minimize.
[2024-05-21 16:14:33] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:14:33] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2024-05-21 16:14:33] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 2 ms to minimize.
[2024-05-21 16:14:33] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/200 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 65/265 variables, 25/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:14:33] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 2 ms to minimize.
[2024-05-21 16:14:33] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2024-05-21 16:14:33] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 2 ms to minimize.
[2024-05-21 16:14:33] [INFO ] Deduced a trap composed of 67 places in 75 ms of which 1 ms to minimize.
[2024-05-21 16:14:33] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-05-21 16:14:34] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 1 ms to minimize.
[2024-05-21 16:14:34] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:14:34] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:14:34] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 1 ms to minimize.
[2024-05-21 16:14:34] [INFO ] Deduced a trap composed of 70 places in 79 ms of which 2 ms to minimize.
[2024-05-21 16:14:34] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 2 ms to minimize.
[2024-05-21 16:14:34] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:14:34] [INFO ] Deduced a trap composed of 67 places in 75 ms of which 1 ms to minimize.
[2024-05-21 16:14:34] [INFO ] Deduced a trap composed of 67 places in 81 ms of which 3 ms to minimize.
[2024-05-21 16:14:34] [INFO ] Deduced a trap composed of 69 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:14:34] [INFO ] Deduced a trap composed of 68 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:14:35] [INFO ] Deduced a trap composed of 70 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:14:35] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 3 ms to minimize.
[2024-05-21 16:14:35] [INFO ] Deduced a trap composed of 69 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:14:35] [INFO ] Deduced a trap composed of 68 places in 109 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:14:35] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:14:35] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 1 ms to minimize.
[2024-05-21 16:14:35] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 1 ms to minimize.
[2024-05-21 16:14:35] [INFO ] Deduced a trap composed of 68 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:14:35] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 1 ms to minimize.
[2024-05-21 16:14:36] [INFO ] Deduced a trap composed of 64 places in 103 ms of which 1 ms to minimize.
[2024-05-21 16:14:36] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 1 ms to minimize.
[2024-05-21 16:14:36] [INFO ] Deduced a trap composed of 69 places in 83 ms of which 1 ms to minimize.
[2024-05-21 16:14:36] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 1 ms to minimize.
[2024-05-21 16:14:36] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 1 ms to minimize.
[2024-05-21 16:14:36] [INFO ] Deduced a trap composed of 67 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:14:36] [INFO ] Deduced a trap composed of 69 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:14:36] [INFO ] Deduced a trap composed of 73 places in 83 ms of which 2 ms to minimize.
[2024-05-21 16:14:36] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 2 ms to minimize.
[2024-05-21 16:14:36] [INFO ] Deduced a trap composed of 68 places in 63 ms of which 1 ms to minimize.
[2024-05-21 16:14:36] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-05-21 16:14:36] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 1 ms to minimize.
[2024-05-21 16:14:37] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-05-21 16:14:37] [INFO ] Deduced a trap composed of 66 places in 54 ms of which 1 ms to minimize.
[2024-05-21 16:14:37] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:14:37] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-05-21 16:14:37] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:14:37] [INFO ] Deduced a trap composed of 68 places in 63 ms of which 2 ms to minimize.
[2024-05-21 16:14:37] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 1 ms to minimize.
[2024-05-21 16:14:37] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-21 16:14:37] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:14:37] [INFO ] Deduced a trap composed of 78 places in 66 ms of which 2 ms to minimize.
[2024-05-21 16:14:37] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 1 ms to minimize.
[2024-05-21 16:14:37] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
[2024-05-21 16:14:37] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 1 ms to minimize.
[2024-05-21 16:14:38] [INFO ] Deduced a trap composed of 67 places in 70 ms of which 1 ms to minimize.
[2024-05-21 16:14:38] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 2 ms to minimize.
[2024-05-21 16:14:38] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 1 ms to minimize.
[2024-05-21 16:14:38] [INFO ] Deduced a trap composed of 65 places in 109 ms of which 1 ms to minimize.
[2024-05-21 16:14:38] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:14:38] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 2 ms to minimize.
[2024-05-21 16:14:38] [INFO ] Deduced a trap composed of 67 places in 70 ms of which 1 ms to minimize.
[2024-05-21 16:14:38] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:14:38] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:14:38] [INFO ] Deduced a trap composed of 68 places in 89 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:14:38] [INFO ] Deduced a trap composed of 69 places in 67 ms of which 2 ms to minimize.
[2024-05-21 16:14:39] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/265 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/268 variables, 3/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/268 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 228/496 variables, 268/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/496 variables, 3/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/496 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/496 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 10/506 variables, 9/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/506 variables, 3/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/506 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/506 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 506/506 variables, and 448 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6296 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 277/277 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 81/81 constraints]
After SMT, in 7419ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 4 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 229/229 transitions.
Graph (trivial) has 75 edges and 277 vertex of which 5 / 277 are part of one of the 1 SCC in 6 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 273 transition count 205
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 255 transition count 205
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 37 place count 255 transition count 180
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 57 rules applied. Total rules applied 94 place count 223 transition count 180
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 104 place count 213 transition count 170
Iterating global reduction 2 with 10 rules applied. Total rules applied 114 place count 213 transition count 170
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 178 place count 181 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 180 place count 180 transition count 149
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 183 place count 180 transition count 146
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 186 place count 177 transition count 146
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 187 place count 177 transition count 146
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 189 place count 175 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 190 place count 174 transition count 144
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 191 place count 174 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 192 place count 173 transition count 143
Applied a total of 192 rules in 89 ms. Remains 173 /277 variables (removed 104) and now considering 143/229 (removed 86) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 173/277 places, 143/229 transitions.
RANDOM walk for 40000 steps (2777 resets) in 460 ms. (86 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1068 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 173 steps, run visited all 1 properties in 4 ms. (steps per millisecond=43 )
Probabilistic random walk after 173 steps, saw 113 distinct states, run finished after 20 ms. (steps per millisecond=8 ) properties seen :1
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 21986 ms.
ITS solved all properties within timeout

BK_STOP 1716308079704

--------------------
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 ReachabilityFireability -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="BusinessProcesses-PT-17"
export BK_EXAMINATION="ReachabilityFireability"
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 BusinessProcesses-PT-17, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620398500583"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-17.tgz
mv BusinessProcesses-PT-17 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;