Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r194-csrt-159033390400727.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is ResAllocation-PT-R020C002, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-csrt-159033390400727
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 3.3K May 14 00:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 14 00:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 17:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 17:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 12 20:53 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 12 20:53 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 14 10:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 14 10:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 14 10:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 13 13:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 13 13:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 13 07:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 07:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:53 equiv_col
-rw-r--r-- 1 mcc users 9 May 12 20:53 instance
-rw-r--r-- 1 mcc users 6 May 12 20:53 iscolored
-rw-r--r-- 1 mcc users 85K May 12 20:53 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 ResAllocation-PT-R020C002-ReachabilityFireability-00
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-01
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-02
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-03
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-04
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-05
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-06
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-07
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-08
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-09
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-10
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-11
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-12
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-13
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-14
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591238974769

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 02:49:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 02:49:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 02:49:37] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2020-06-04 02:49:37] [INFO ] Transformed 80 places.
[2020-06-04 02:49:37] [INFO ] Transformed 42 transitions.
[2020-06-04 02:49:37] [INFO ] Parsed PT model containing 80 places and 42 transitions in 136 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 86 resets, run finished after 91 ms. (steps per millisecond=109 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0]
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0]
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 1, 0, 1, 0, 0, 0, 1]
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 42 rows 80 cols
[2020-06-04 02:49:37] [INFO ] Computed 40 place invariants in 5 ms
[2020-06-04 02:49:37] [INFO ] [Real]Absence check using 40 positive place invariants in 25 ms returned unsat
[2020-06-04 02:49:37] [INFO ] [Real]Absence check using 40 positive place invariants in 6 ms returned unsat
[2020-06-04 02:49:37] [INFO ] [Real]Absence check using 40 positive place invariants in 14 ms returned sat
[2020-06-04 02:49:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:49:37] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2020-06-04 02:49:37] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2020-06-04 02:49:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2020-06-04 02:49:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:49:37] [INFO ] [Nat]Absence check using 40 positive place invariants in 28 ms returned sat
[2020-06-04 02:49:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:49:37] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2020-06-04 02:49:37] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints in 7 ms.
[2020-06-04 02:49:37] [INFO ] Added : 30 causal constraints over 6 iterations in 58 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2020-06-04 02:49:38] [INFO ] [Real]Absence check using 40 positive place invariants in 12 ms returned sat
[2020-06-04 02:49:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:49:38] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2020-06-04 02:49:38] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints in 3 ms.
[2020-06-04 02:49:38] [INFO ] Added : 34 causal constraints over 7 iterations in 51 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2020-06-04 02:49:38] [INFO ] [Real]Absence check using 40 positive place invariants in 12 ms returned sat
[2020-06-04 02:49:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:49:38] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2020-06-04 02:49:38] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints in 5 ms.
[2020-06-04 02:49:38] [INFO ] Added : 19 causal constraints over 4 iterations in 35 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2020-06-04 02:49:38] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned unsat
[2020-06-04 02:49:38] [INFO ] [Real]Absence check using 40 positive place invariants in 7 ms returned unsat
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 8400 steps, including 98 resets, run finished after 23 ms. (steps per millisecond=365 ) properties seen :[0, 0, 1] could not realise parikh vector
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 7700 steps, including 144 resets, run finished after 17 ms. (steps per millisecond=452 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 8700 steps, including 136 resets, run finished after 17 ms. (steps per millisecond=511 ) properties seen :[0, 0] could not realise parikh vector
Support contains 23 out of 80 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 80/80 places, 42/42 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 79 transition count 41
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 79 transition count 40
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 76 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 75 transition count 39
Applied a total of 8 rules in 39 ms. Remains 75 /80 variables (removed 5) and now considering 39/42 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 75/80 places, 39/42 transitions.
Incomplete random walk after 1000000 steps, including 9474 resets, run finished after 1406 ms. (steps per millisecond=711 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2188 resets, run finished after 942 ms. (steps per millisecond=1061 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1941 resets, run finished after 820 ms. (steps per millisecond=1219 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 30473058 steps, run timeout after 30001 ms. (steps per millisecond=1015 ) properties seen :[0, 0]
Probabilistic random walk after 30473058 steps, saw 4683091 distinct states, run finished after 30001 ms. (steps per millisecond=1015 ) properties seen :[0, 0]
// Phase 1: matrix 39 rows 75 cols
[2020-06-04 02:50:11] [INFO ] Computed 38 place invariants in 2 ms
[2020-06-04 02:50:11] [INFO ] [Real]Absence check using 38 positive place invariants in 13 ms returned sat
[2020-06-04 02:50:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:50:11] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2020-06-04 02:50:11] [INFO ] Deduced a trap composed of 4 places in 23 ms
[2020-06-04 02:50:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2020-06-04 02:50:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:50:11] [INFO ] [Nat]Absence check using 38 positive place invariants in 24 ms returned sat
[2020-06-04 02:50:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:50:11] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2020-06-04 02:50:11] [INFO ] Deduced a trap composed of 4 places in 20 ms
[2020-06-04 02:50:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2020-06-04 02:50:11] [INFO ] Computed and/alt/rep : 37/37/37 causal constraints in 6 ms.
[2020-06-04 02:50:12] [INFO ] Added : 29 causal constraints over 6 iterations in 50 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2020-06-04 02:50:12] [INFO ] [Real]Absence check using 38 positive place invariants in 11 ms returned sat
[2020-06-04 02:50:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:50:12] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2020-06-04 02:50:12] [INFO ] Deduced a trap composed of 4 places in 16 ms
[2020-06-04 02:50:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2020-06-04 02:50:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:50:12] [INFO ] [Nat]Absence check using 38 positive place invariants in 11 ms returned sat
[2020-06-04 02:50:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:50:12] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2020-06-04 02:50:12] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2020-06-04 02:50:12] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2020-06-04 02:50:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 42 ms
[2020-06-04 02:50:12] [INFO ] Computed and/alt/rep : 37/37/37 causal constraints in 3 ms.
[2020-06-04 02:50:12] [INFO ] Added : 33 causal constraints over 7 iterations in 55 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
Incomplete Parikh walk after 8600 steps, including 150 resets, run finished after 17 ms. (steps per millisecond=505 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 7100 steps, including 145 resets, run finished after 12 ms. (steps per millisecond=591 ) properties seen :[0, 0] could not realise parikh vector
Support contains 23 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 39/39 transitions.
Applied a total of 0 rules in 7 ms. Remains 75 /75 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 39/39 transitions.
Starting structural reductions, iteration 0 : 75/75 places, 39/39 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 75 cols
[2020-06-04 02:50:12] [INFO ] Computed 38 place invariants in 2 ms
[2020-06-04 02:50:12] [INFO ] Implicit Places using invariants in 66 ms returned [40, 42, 46, 48, 50, 52, 56, 58, 60, 62, 64, 66, 68, 70, 74]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 69 ms to find 15 implicit places.
[2020-06-04 02:50:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 39 rows 60 cols
[2020-06-04 02:50:12] [INFO ] Computed 23 place invariants in 1 ms
[2020-06-04 02:50:12] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Starting structural reductions, iteration 1 : 60/75 places, 39/39 transitions.
Applied a total of 0 rules in 5 ms. Remains 60 /60 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2020-06-04 02:50:12] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 39 rows 60 cols
[2020-06-04 02:50:12] [INFO ] Computed 23 place invariants in 1 ms
[2020-06-04 02:50:12] [INFO ] Dead Transitions using invariants and state equation in 68 ms returned []
Finished structural reductions, in 2 iterations. Remains : 60/75 places, 39/39 transitions.
Incomplete random walk after 1000000 steps, including 9473 resets, run finished after 930 ms. (steps per millisecond=1075 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2189 resets, run finished after 714 ms. (steps per millisecond=1400 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1948 resets, run finished after 554 ms. (steps per millisecond=1805 ) properties seen :[0, 0]
Probably explored full state space saw : 5238920 states, properties seen :[0, 0]
Probabilistic random walk after 34250188 steps, saw 5238920 distinct states, run finished after 26197 ms. (steps per millisecond=1307 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 33535900 steps, run timeout after 30176 ms. (steps per millisecond=1111 ) properties seen :[0, 0]
Exhaustive walk after 33535900 steps, saw 5142611 distinct states, run finished after 30177 ms. (steps per millisecond=1111 ) properties seen :[0, 0]
// Phase 1: matrix 39 rows 60 cols
[2020-06-04 02:51:11] [INFO ] Computed 23 place invariants in 0 ms
[2020-06-04 02:51:11] [INFO ] [Real]Absence check using 23 positive place invariants in 23 ms returned sat
[2020-06-04 02:51:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:11] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2020-06-04 02:51:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:11] [INFO ] [Nat]Absence check using 23 positive place invariants in 8 ms returned sat
[2020-06-04 02:51:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:11] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2020-06-04 02:51:11] [INFO ] Deduced a trap composed of 4 places in 11 ms
[2020-06-04 02:51:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2020-06-04 02:51:11] [INFO ] Computed and/alt/rep : 37/37/37 causal constraints in 2 ms.
[2020-06-04 02:51:11] [INFO ] Added : 29 causal constraints over 6 iterations in 44 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2020-06-04 02:51:11] [INFO ] [Real]Absence check using 23 positive place invariants in 6 ms returned sat
[2020-06-04 02:51:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:11] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2020-06-04 02:51:11] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2020-06-04 02:51:11] [INFO ] Deduced a trap composed of 4 places in 8 ms
[2020-06-04 02:51:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 37 ms
[2020-06-04 02:51:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:11] [INFO ] [Nat]Absence check using 23 positive place invariants in 8 ms returned sat
[2020-06-04 02:51:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:11] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2020-06-04 02:51:11] [INFO ] Deduced a trap composed of 4 places in 15 ms
[2020-06-04 02:51:11] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2020-06-04 02:51:11] [INFO ] Deduced a trap composed of 4 places in 9 ms
[2020-06-04 02:51:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 46 ms
[2020-06-04 02:51:11] [INFO ] Computed and/alt/rep : 37/37/37 causal constraints in 2 ms.
[2020-06-04 02:51:11] [INFO ] Added : 33 causal constraints over 7 iterations in 42 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
Incomplete Parikh walk after 11000 steps, including 155 resets, run finished after 17 ms. (steps per millisecond=647 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 10500 steps, including 154 resets, run finished after 14 ms. (steps per millisecond=750 ) properties seen :[0, 0] could not realise parikh vector
Support contains 23 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 39/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 39/39 transitions.
Starting structural reductions, iteration 0 : 60/60 places, 39/39 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 60 cols
[2020-06-04 02:51:11] [INFO ] Computed 23 place invariants in 1 ms
[2020-06-04 02:51:11] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 39 rows 60 cols
[2020-06-04 02:51:11] [INFO ] Computed 23 place invariants in 4 ms
[2020-06-04 02:51:11] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2020-06-04 02:51:11] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 39 rows 60 cols
[2020-06-04 02:51:11] [INFO ] Computed 23 place invariants in 0 ms
[2020-06-04 02:51:11] [INFO ] Dead Transitions using invariants and state equation in 98 ms returned []
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 39/39 transitions.
Incomplete random walk after 100000 steps, including 948 resets, run finished after 114 ms. (steps per millisecond=877 ) properties seen :[0, 0]
// Phase 1: matrix 39 rows 60 cols
[2020-06-04 02:51:12] [INFO ] Computed 23 place invariants in 1 ms
[2020-06-04 02:51:12] [INFO ] [Real]Absence check using 23 positive place invariants in 9 ms returned sat
[2020-06-04 02:51:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:12] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2020-06-04 02:51:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:12] [INFO ] [Nat]Absence check using 23 positive place invariants in 13 ms returned sat
[2020-06-04 02:51:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:12] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2020-06-04 02:51:12] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2020-06-04 02:51:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 17 ms
[2020-06-04 02:51:12] [INFO ] Computed and/alt/rep : 37/37/37 causal constraints in 2 ms.
[2020-06-04 02:51:12] [INFO ] Added : 29 causal constraints over 6 iterations in 50 ms. Result :sat
[2020-06-04 02:51:12] [INFO ] [Real]Absence check using 23 positive place invariants in 9 ms returned sat
[2020-06-04 02:51:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:12] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2020-06-04 02:51:12] [INFO ] Deduced a trap composed of 4 places in 17 ms
[2020-06-04 02:51:12] [INFO ] Deduced a trap composed of 4 places in 15 ms
[2020-06-04 02:51:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 43 ms
[2020-06-04 02:51:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:12] [INFO ] [Nat]Absence check using 23 positive place invariants in 8 ms returned sat
[2020-06-04 02:51:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:12] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2020-06-04 02:51:12] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-06-04 02:51:12] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2020-06-04 02:51:12] [INFO ] Deduced a trap composed of 4 places in 8 ms
[2020-06-04 02:51:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 56 ms
[2020-06-04 02:51:12] [INFO ] Computed and/alt/rep : 37/37/37 causal constraints in 2 ms.
[2020-06-04 02:51:12] [INFO ] Added : 33 causal constraints over 7 iterations in 31 ms. Result :sat
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 60 cols
[2020-06-04 02:51:12] [INFO ] Computed 23 place invariants in 1 ms
[2020-06-04 02:51:12] [INFO ] [Real]Absence check using 23 positive place invariants in 11 ms returned sat
[2020-06-04 02:51:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:12] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2020-06-04 02:51:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:12] [INFO ] [Nat]Absence check using 23 positive place invariants in 14 ms returned sat
[2020-06-04 02:51:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:12] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2020-06-04 02:51:12] [INFO ] Deduced a trap composed of 4 places in 11 ms
[2020-06-04 02:51:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 18 ms
[2020-06-04 02:51:12] [INFO ] Computed and/alt/rep : 37/37/37 causal constraints in 2 ms.
[2020-06-04 02:51:12] [INFO ] Added : 29 causal constraints over 6 iterations in 39 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2020-06-04 02:51:12] [INFO ] [Real]Absence check using 23 positive place invariants in 6 ms returned sat
[2020-06-04 02:51:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:12] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2020-06-04 02:51:12] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2020-06-04 02:51:12] [INFO ] Deduced a trap composed of 4 places in 8 ms
[2020-06-04 02:51:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 30 ms
[2020-06-04 02:51:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:12] [INFO ] [Nat]Absence check using 23 positive place invariants in 7 ms returned sat
[2020-06-04 02:51:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:12] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2020-06-04 02:51:12] [INFO ] Deduced a trap composed of 4 places in 20 ms
[2020-06-04 02:51:12] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2020-06-04 02:51:12] [INFO ] Deduced a trap composed of 4 places in 10 ms
[2020-06-04 02:51:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 62 ms
[2020-06-04 02:51:12] [INFO ] Computed and/alt/rep : 37/37/37 causal constraints in 2 ms.
[2020-06-04 02:51:12] [INFO ] Added : 33 causal constraints over 7 iterations in 31 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2020-06-04 02:51:12] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2020-06-04 02:51:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
[2020-06-04 02:51:13] [INFO ] Flatten gal took : 36 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ResAllocation-PT-R020C002 @ 3570 seconds

FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3568
rslt: Output for ReachabilityFireability @ ResAllocation-PT-R020C002

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 02:51:13 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1784
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p30) AND (1 <= p33) AND (1 <= p37) AND (((1 <= p6) AND (1 <= p9)) OR ((1 <= p18) AND (1 <= p21))))))",
"processed_size": 114,
"rewrites": 1
},
"result":
{
"edges": 1673,
"markings": 705,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3568
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p22) AND (1 <= p25) AND (1 <= p7) AND (1 <= p42) AND (1 <= p43) AND (((1 <= p35) AND (1 <= p58) AND (1 <= p59)) OR ((1 <= p17) AND (1 <= p48) AND (1 <= p49))) AND ((p1 <= 0) OR (p38 <= 0) OR (p39 <= 0) OR ((1 <= p24) AND (1 <= p27))))))",
"processed_size": 253,
"rewrites": 1
},
"result":
{
"edges": 3471,
"markings": 1500,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 74,
"problems": 8
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 19844,
"runtime": 2.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 158,
"conflict_clusters": 20,
"places": 60,
"places_significant": 37,
"singleton_clusters": 0,
"transitions": 39
},
"result":
{
"preliminary_value": "no no ",
"value": "no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 99/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 60
lola: finding significant places
lola: 60 places, 39 transitions, 37 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: E (F (((1 <= p22) AND (1 <= p25) AND (1 <= p7) AND (1 <= p42) AND (1 <= p43) AND (((1 <= p35) AND (1 <= p58) AND (1 <= p59)) OR ((1 <= p17) AND (1 <= p48) AND (1 <= p49))) AND ((p1 <= 0) OR (p38 <= 0) OR (p39 <= 0) OR ((1 <= p24) AND (1 <= p27)))))) : E (F (((1 <= p30) AND (1 <= p33) AND (1 <= p37) AND (((1 <= p6) AND (1 <= p9)) OR ((1 <= p18) AND (1 <= p21))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p30) AND (1 <= p33) AND (1 <= p37) AND (((1 <= p6) AND (1 <= p9)) OR ((1 <= p18) AND (1 <= p21))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p30) AND (1 <= p33) AND (1 <= p37) AND (((1 <= p6) AND (1 <= p9)) OR ((1 <= p18) AND (1 <= p21))))))
lola: processed formula length: 114
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p30) AND (1 <= p33) AND (1 <= p37) AND (((1 <= p6) AND (1 <= p9)) OR ((1 <= p18) AND (1 <= p21))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 705 markings, 1673 edges
lola: ========================================
lola: subprocess 1 will run for 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p22) AND (1 <= p25) AND (1 <= p7) AND (1 <= p42) AND (1 <= p43) AND (((1 <= p35) AND (1 <= p58) AND (1 <= p59)) OR ((1 <= p17) AND (1 <= p48) AND (1 <= p49))) AND ((p1 <= 0) OR (p38 <= 0) OR (p39 <= 0) OR ((1 <= p24) AND (1 <= p27))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p22) AND (1 <= p25) AND (1 <= p7) AND (1 <= p42) AND (1 <= p43) AND (((1 <= p35) AND (1 <= p58) AND (1 <= p59)) OR ((1 <= p17) AND (1 <= p48) AND (1 <= p49))) AND ((p1 <= 0) OR (p38 <= 0) OR (p39 <= 0) OR ((1 <= p24) AND (1 <= p27))))))
lola: processed formula length: 253
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p22) AND (1 <= p25) AND (1 <= p7) AND (1 <= p42) AND (1 <= p43) AND (((1 <= p35) AND (1 <= p58) AND (1 <= p59)) OR ((1 <= p17) AND (1 <= p48) AND (1 <= p49))) AND ((p1 <= 0) OR (p38 <= 0) OR (p39 <= 0) OR ((1 <= p24) AND (1 <= p27))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 74 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1500 markings, 3471 edges
lola: RESULT
lola:
SUMMARY: no no
lola:
preliminary result: no no
lola: ========================================
lola: memory consumption: 19844 KB
lola: time consumption: 2 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished

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

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="ResAllocation-PT-R020C002"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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-4028"
echo " Executing tool itslola"
echo " Input is ResAllocation-PT-R020C002, 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 r194-csrt-159033390400727"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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