About the Execution of LTSMin+red for DoubleExponent-PT-100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1892.403 | 916499.00 | 968506.00 | 2443.80 | ??????F????????? | normal |
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.r488-tall-171631133000575.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 ltsminxred
Input is DoubleExponent-PT-100, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631133000575
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.8M 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 DoubleExponent-PT-100-ReachabilityFireability-2024-00
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-2024-01
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-2024-02
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-2024-03
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-2024-04
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-2023-05
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-2023-06
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-2024-07
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-2024-08
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-2023-09
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-2024-10
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-2024-11
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-2024-12
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-2024-13
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-2024-14
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717197630179
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:20:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 23:20:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:20:31] [INFO ] Load time of PNML (sax parser for PT used): 228 ms
[2024-05-31 23:20:31] [INFO ] Transformed 5304 places.
[2024-05-31 23:20:31] [INFO ] Transformed 4998 transitions.
[2024-05-31 23:20:31] [INFO ] Parsed PT model containing 5304 places and 4998 transitions and 14094 arcs in 399 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1335 resets) in 1591 ms. (25 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (108 resets) in 113 ms. (35 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (121 resets) in 87 ms. (45 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (107 resets) in 77 ms. (51 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (112 resets) in 42 ms. (93 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (113 resets) in 74 ms. (53 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (115 resets) in 105 ms. (37 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (120 resets) in 75 ms. (52 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (118 resets) in 61 ms. (64 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (113 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (117 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (109 resets) in 28 ms. (137 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (111 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (116 resets) in 52 ms. (75 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (109 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (119 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (111 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 61688 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 16
Probabilistic random walk after 61688 steps, saw 30849 distinct states, run finished after 3007 ms. (steps per millisecond=20 ) properties seen :0
// Phase 1: matrix 4998 rows 5304 cols
[2024-05-31 23:20:37] [INFO ] Invariants computation overflowed in 256 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 652/906 variables, 254/254 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/906 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2348/3254 variables, 997/1251 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3254 variables, 0/1251 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 3364/6618 variables, 1725/2976 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6618 variables, 0/2976 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 2483/9101 variables, 1502/4478 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 9101/10302 variables, and 4478 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5053 ms.
Refiners :[State Equation: 4478/5304 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 652/906 variables, 254/254 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/906 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 2348/3254 variables, 997/1251 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3254 variables, 16/1267 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3254 variables, 0/1267 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 3364/6618 variables, 1725/2992 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6618 variables, 0/2992 constraints. Problems are: Problem set: 0 solved, 16 unsolved
SMT process timed out in 10493ms, After SMT, problems are : Problem set: 0 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 254 out of 5304 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5304/5304 places, 4998/4998 transitions.
Graph (complete) has 9096 edges and 5304 vertex of which 5298 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.13 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 960 transitions
Trivial Post-agglo rules discarded 960 transitions
Performed 960 trivial Post agglomeration. Transition count delta: 960
Iterating post reduction 0 with 963 rules applied. Total rules applied 964 place count 5297 transition count 4036
Reduce places removed 960 places and 0 transitions.
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Iterating post reduction 1 with 1038 rules applied. Total rules applied 2002 place count 4337 transition count 3958
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 2 with 78 rules applied. Total rules applied 2080 place count 4259 transition count 3958
Performed 215 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 215 Pre rules applied. Total rules applied 2080 place count 4259 transition count 3743
Deduced a syphon composed of 215 places in 187 ms
Reduce places removed 215 places and 0 transitions.
Iterating global reduction 3 with 430 rules applied. Total rules applied 2510 place count 4044 transition count 3743
Performed 768 Post agglomeration using F-continuation condition.Transition count delta: 768
Deduced a syphon composed of 768 places in 82 ms
Reduce places removed 768 places and 0 transitions.
Iterating global reduction 3 with 1536 rules applied. Total rules applied 4046 place count 3276 transition count 2975
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 149 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4248 place count 3175 transition count 2975
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 66 places in 61 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 4380 place count 3109 transition count 2975
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 4386 place count 3109 transition count 2969
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 4392 place count 3103 transition count 2969
Free-agglomeration rule (complex) applied 411 times.
Iterating global reduction 4 with 411 rules applied. Total rules applied 4803 place count 3103 transition count 2558
Reduce places removed 411 places and 0 transitions.
Iterating post reduction 4 with 411 rules applied. Total rules applied 5214 place count 2692 transition count 2558
Partial Free-agglomeration rule applied 400 times.
Drop transitions (Partial Free agglomeration) removed 400 transitions
Iterating global reduction 5 with 400 rules applied. Total rules applied 5614 place count 2692 transition count 2558
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 5615 place count 2692 transition count 2558
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 5616 place count 2691 transition count 2557
Applied a total of 5616 rules in 2640 ms. Remains 2691 /5304 variables (removed 2613) and now considering 2557/4998 (removed 2441) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2650 ms. Remains : 2691/5304 places, 2557/4998 transitions.
RANDOM walk for 40000 steps (3515 resets) in 535 ms. (74 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (230 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (258 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (256 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (264 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (255 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (254 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (250 resets) in 42 ms. (93 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (261 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (246 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (249 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (254 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (249 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (259 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (268 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (257 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (258 resets) in 22 ms. (173 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 86074 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 16
Probabilistic random walk after 86074 steps, saw 43059 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
// Phase 1: matrix 2557 rows 2691 cols
[2024-05-31 23:20:53] [INFO ] Invariants computation overflowed in 53 ms
[2024-05-31 23:20:53] [INFO ] State equation strengthened by 326 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 849/1103 variables, 254/254 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1103 variables, 23/277 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1103 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 2658/3761 variables, 1296/1573 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3761 variables, 153/1726 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3761 variables, 0/1726 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem DoubleExponent-PT-100-ReachabilityFireability-2023-06 is UNSAT
FORMULA DoubleExponent-PT-100-ReachabilityFireability-2023-06 FALSE TECHNIQUES SMT_REFINEMENT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5185/5248 variables, and 2813 constraints, problems are : Problem set: 1 solved, 15 unsolved in 45021 ms.
Refiners :[State Equation: 2637/2691 constraints, ReadFeed: 176/326 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 763/989 variables, 226/226 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/989 variables, 22/248 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/989 variables, 0/248 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 2585/3574 variables, 1210/1458 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3574 variables, 144/1602 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3574 variables, 13/1615 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-05-31 23:21:43] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 17 ms to minimize.
[2024-05-31 23:21:43] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/3574 variables, 2/1617 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3574 variables, 0/1617 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5163/5248 variables, and 2797 constraints, problems are : Problem set: 1 solved, 15 unsolved in 45020 ms.
Refiners :[State Equation: 2616/2691 constraints, ReadFeed: 166/326 constraints, PredecessorRefiner: 13/16 constraints, Known Traps: 2/2 constraints]
After SMT, in 90177ms problems are : Problem set: 1 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 226 out of 2691 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2691/2691 places, 2557/2557 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 2691 transition count 2551
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 14 place count 2685 transition count 2549
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 2683 transition count 2549
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 16 place count 2683 transition count 2548
Deduced a syphon composed of 1 places in 45 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 2682 transition count 2548
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 49 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 46 place count 2668 transition count 2534
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 44 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 56 place count 2663 transition count 2534
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 3 with 13 rules applied. Total rules applied 69 place count 2663 transition count 2521
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 82 place count 2650 transition count 2521
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 87 place count 2650 transition count 2521
Applied a total of 87 rules in 707 ms. Remains 2650 /2691 variables (removed 41) and now considering 2521/2557 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 707 ms. Remains : 2650/2691 places, 2521/2557 transitions.
RANDOM walk for 40000 steps (3520 resets) in 339 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (255 resets) in 25 ms. (153 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (284 resets) in 28 ms. (137 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (256 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (255 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (253 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (242 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (263 resets) in 36 ms. (108 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (257 resets) in 25 ms. (153 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (262 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (262 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (238 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (260 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (256 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (250 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (262 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 88979 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :0 out of 15
Probabilistic random walk after 88979 steps, saw 44502 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
// Phase 1: matrix 2521 rows 2650 cols
[2024-05-31 23:22:27] [INFO ] Invariants computation overflowed in 65 ms
[2024-05-31 23:22:27] [INFO ] State equation strengthened by 339 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 772/998 variables, 226/226 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/998 variables, 22/248 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/998 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 2578/3576 variables, 1217/1465 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3576 variables, 156/1621 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3576 variables, 0/1621 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5096/5171 variables, and 2763 constraints, problems are : Problem set: 0 solved, 15 unsolved in 75031 ms.
Refiners :[State Equation: 2585/2650 constraints, ReadFeed: 178/339 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 772/998 variables, 226/226 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/998 variables, 22/248 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/998 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 2578/3576 variables, 1217/1465 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3576 variables, 156/1621 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3576 variables, 13/1634 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-31 23:24:11] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 4 ms to minimize.
[2024-05-31 23:24:11] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 2 ms to minimize.
[2024-05-31 23:24:11] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 2 ms to minimize.
[2024-05-31 23:24:11] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/3576 variables, 4/1638 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3576 variables, 0/1638 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 1520/5096 variables, 1142/2780 constraints. Problems are: Problem set: 0 solved, 15 unsolved
SMT process timed out in 150187ms, After SMT, problems are : Problem set: 0 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 226 out of 2650 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2650/2650 places, 2521/2521 transitions.
Applied a total of 0 rules in 112 ms. Remains 2650 /2650 variables (removed 0) and now considering 2521/2521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 2650/2650 places, 2521/2521 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2650/2650 places, 2521/2521 transitions.
Applied a total of 0 rules in 104 ms. Remains 2650 /2650 variables (removed 0) and now considering 2521/2521 (removed 0) transitions.
// Phase 1: matrix 2521 rows 2650 cols
[2024-05-31 23:24:58] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-31 23:24:59] [INFO ] Implicit Places using invariants in 1631 ms returned []
// Phase 1: matrix 2521 rows 2650 cols
[2024-05-31 23:24:59] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-31 23:25:01] [INFO ] State equation strengthened by 339 read => feed constraints.
[2024-05-31 23:25:34] [INFO ] Performed 175/2650 implicitness test of which 9 returned IMPLICIT in 33 seconds.
[2024-05-31 23:26:04] [INFO ] Performed 441/2650 implicitness test of which 27 returned IMPLICIT in 63 seconds.
[2024-05-31 23:26:35] [INFO ] Performed 615/2650 implicitness test of which 38 returned IMPLICIT in 94 seconds.
[2024-05-31 23:27:08] [INFO ] Performed 853/2650 implicitness test of which 55 returned IMPLICIT in 127 seconds.
[2024-05-31 23:27:38] [INFO ] Performed 975/2650 implicitness test of which 64 returned IMPLICIT in 157 seconds.
[2024-05-31 23:27:39] [INFO ] Implicit Places using invariants and state equation in 160096 ms returned [26, 49, 56, 80, 86, 107, 139, 169, 175, 196, 198, 202, 225, 231, 255, 260, 264, 282, 288, 309, 317, 340, 348, 372, 377, 398, 404, 460, 467, 487, 495, 520, 526, 549, 555, 587, 608, 615, 642, 649, 672, 678, 700, 708, 731, 736, 760, 767, 790, 792, 796, 819, 826, 848, 853, 857, 876, 882, 903, 910, 935, 941, 963, 968]
[2024-05-31 23:27:39] [INFO ] Actually due to overlaps returned [555, 175, 853, 26, 467, 857, 139, 169, 198, 460, 549, 792, 848, 264]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 161742 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2636/2650 places, 2521/2521 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2636 transition count 2519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 2634 transition count 2519
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 2634 transition count 2519
Applied a total of 10 rules in 333 ms. Remains 2634 /2636 variables (removed 2) and now considering 2519/2521 (removed 2) transitions.
// Phase 1: matrix 2519 rows 2634 cols
[2024-05-31 23:27:40] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-31 23:27:41] [INFO ] Implicit Places using invariants in 1712 ms returned []
// Phase 1: matrix 2519 rows 2634 cols
[2024-05-31 23:27:41] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-31 23:27:43] [INFO ] State equation strengthened by 339 read => feed constraints.
[2024-05-31 23:28:38] [INFO ] Performed 55/2634 implicitness test of which 2 returned IMPLICIT in 54 seconds.
[2024-05-31 23:29:08] [INFO ] Performed 76/2634 implicitness test of which 2 returned IMPLICIT in 84 seconds.
[2024-05-31 23:29:38] [INFO ] Performed 260/2634 implicitness test of which 11 returned IMPLICIT in 114 seconds.
[2024-05-31 23:30:08] [INFO ] Performed 508/2634 implicitness test of which 23 returned IMPLICIT in 145 seconds.
[2024-05-31 23:30:21] [INFO ] Implicit Places with SMT raised an exceptionSMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... after 160102 ms
[2024-05-31 23:30:21] [INFO ] Actually due to overlaps returned [197, 55, 486, 192, 48, 478]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 161816 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2628/2650 places, 2519/2521 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 2628 transition count 2516
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 2625 transition count 2516
Applied a total of 6 rules in 215 ms. Remains 2625 /2628 variables (removed 3) and now considering 2516/2519 (removed 3) transitions.
// Phase 1: matrix 2516 rows 2625 cols
[2024-05-31 23:30:22] [INFO ] Invariants computation overflowed in 49 ms
[2024-05-31 23:30:23] [INFO ] Implicit Places using invariants in 1479 ms returned []
// Phase 1: matrix 2516 rows 2625 cols
[2024-05-31 23:30:23] [INFO ] Invariants computation overflowed in 53 ms
[2024-05-31 23:30:25] [INFO ] State equation strengthened by 339 read => feed constraints.
[2024-05-31 23:31:04] [INFO ] Performed 5/2625 implicitness test of which 0 returned IMPLICIT in 39 seconds.
[2024-05-31 23:32:11] [INFO ] Performed 6/2625 implicitness test of which 0 returned IMPLICIT in 106 seconds.
[2024-05-31 23:32:46] [INFO ] Performed 147/2625 implicitness test of which 3 returned IMPLICIT in 141 seconds.
[2024-05-31 23:33:03] [INFO ] Implicit Places using invariants and state equation in 160116 ms returned [76, 82, 103]
[2024-05-31 23:33:03] [INFO ] Actually due to overlaps returned [82, 76]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 161601 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 2623/2650 places, 2516/2521 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2623 transition count 2515
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2622 transition count 2515
Applied a total of 2 rules in 227 ms. Remains 2622 /2623 variables (removed 1) and now considering 2515/2516 (removed 1) transitions.
// Phase 1: matrix 2515 rows 2622 cols
[2024-05-31 23:33:04] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-31 23:33:05] [INFO ] Implicit Places using invariants in 1563 ms returned []
// Phase 1: matrix 2515 rows 2622 cols
[2024-05-31 23:33:05] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-31 23:33:06] [INFO ] State equation strengthened by 339 read => feed constraints.
[2024-05-31 23:33:46] [INFO ] Performed 5/2622 implicitness test of which 0 returned IMPLICIT in 39 seconds.
[2024-05-31 23:35:45] [INFO ] Performed 6/2622 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2024-05-31 23:35:45] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2024-05-31 23:35:45] [INFO ] Implicit Places using invariants and state equation in 160098 ms returned []
Implicit Place search using SMT with State Equation took 161662 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 2622/2650 places, 2515/2521 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 647701 ms. Remains : 2622/2650 places, 2515/2521 transitions.
[2024-05-31 23:35:45] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 13 ms.
[2024-05-31 23:35:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2622 places, 2515 transitions and 14927 arcs took 17 ms.
[2024-05-31 23:35:46] [INFO ] Flatten gal took : 287 ms
Total runtime 914855 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : DoubleExponent-PT-100-ReachabilityFireability-2024-00
Could not compute solution for formula : DoubleExponent-PT-100-ReachabilityFireability-2024-01
Could not compute solution for formula : DoubleExponent-PT-100-ReachabilityFireability-2024-02
Could not compute solution for formula : DoubleExponent-PT-100-ReachabilityFireability-2024-03
Could not compute solution for formula : DoubleExponent-PT-100-ReachabilityFireability-2024-04
Could not compute solution for formula : DoubleExponent-PT-100-ReachabilityFireability-2023-05
Could not compute solution for formula : DoubleExponent-PT-100-ReachabilityFireability-2024-07
Could not compute solution for formula : DoubleExponent-PT-100-ReachabilityFireability-2024-08
Could not compute solution for formula : DoubleExponent-PT-100-ReachabilityFireability-2023-09
Could not compute solution for formula : DoubleExponent-PT-100-ReachabilityFireability-2024-10
Could not compute solution for formula : DoubleExponent-PT-100-ReachabilityFireability-2024-11
Could not compute solution for formula : DoubleExponent-PT-100-ReachabilityFireability-2024-12
Could not compute solution for formula : DoubleExponent-PT-100-ReachabilityFireability-2024-13
Could not compute solution for formula : DoubleExponent-PT-100-ReachabilityFireability-2024-14
Could not compute solution for formula : DoubleExponent-PT-100-ReachabilityFireability-2023-15
BK_STOP 1717198546678
--------------------
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
mcc2024
rfs formula name DoubleExponent-PT-100-ReachabilityFireability-2024-00
rfs formula type EF
rfs formula formula --invariant=/tmp/598/inv_0_
rfs formula name DoubleExponent-PT-100-ReachabilityFireability-2024-01
rfs formula type AG
rfs formula formula --invariant=/tmp/598/inv_1_
rfs formula name DoubleExponent-PT-100-ReachabilityFireability-2024-02
rfs formula type EF
rfs formula formula --invariant=/tmp/598/inv_2_
rfs formula name DoubleExponent-PT-100-ReachabilityFireability-2024-03
rfs formula type EF
rfs formula formula --invariant=/tmp/598/inv_3_
rfs formula name DoubleExponent-PT-100-ReachabilityFireability-2024-04
rfs formula type EF
rfs formula formula --invariant=/tmp/598/inv_4_
rfs formula name DoubleExponent-PT-100-ReachabilityFireability-2023-05
rfs formula type EF
rfs formula formula --invariant=/tmp/598/inv_5_
rfs formula name DoubleExponent-PT-100-ReachabilityFireability-2024-07
rfs formula type EF
rfs formula formula --invariant=/tmp/598/inv_6_
rfs formula name DoubleExponent-PT-100-ReachabilityFireability-2024-08
rfs formula type EF
rfs formula formula --invariant=/tmp/598/inv_7_
rfs formula name DoubleExponent-PT-100-ReachabilityFireability-2023-09
rfs formula type EF
rfs formula formula --invariant=/tmp/598/inv_8_
rfs formula name DoubleExponent-PT-100-ReachabilityFireability-2024-10
rfs formula type EF
rfs formula formula --invariant=/tmp/598/inv_9_
rfs formula name DoubleExponent-PT-100-ReachabilityFireability-2024-11
rfs formula type EF
rfs formula formula --invariant=/tmp/598/inv_10_
rfs formula name DoubleExponent-PT-100-ReachabilityFireability-2024-12
rfs formula type AG
rfs formula formula --invariant=/tmp/598/inv_11_
rfs formula name DoubleExponent-PT-100-ReachabilityFireability-2024-13
rfs formula type EF
rfs formula formula --invariant=/tmp/598/inv_12_
rfs formula name DoubleExponent-PT-100-ReachabilityFireability-2024-14
rfs formula type EF
rfs formula formula --invariant=/tmp/598/inv_13_
rfs formula name DoubleExponent-PT-100-ReachabilityFireability-2023-15
rfs formula type EF
rfs formula formula --invariant=/tmp/598/inv_14_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
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="DoubleExponent-PT-100"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DoubleExponent-PT-100, 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 r488-tall-171631133000575"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-100.tgz
mv DoubleExponent-PT-100 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 '
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 ;